Fourth international workshop on Algebraic, Topological and Complexity Aspects of Graph Covers in Eugene, January 26-28
Fourth international workshop on Algebraic, Topological and Complexity Aspects of Graph Covers will convene in Eugene at the end of January. The previous three workshops in the series were held in Finse, Norway, Auckland, New Zealand, and Kralova Studna, Slovakia.
The workshop's main focus is on graph coverings and their applications in different areas of theoretical computer science such as models of computation, computational complexity, and algebraic graph theory. Invited talks by internationally renown researchers from New Zealand, Japan, USA, and Slovakia, as well as other presentations and discussions will take place in the CIS colloquium room, 220 Deschutes Thursday through Saturday, January 26-28.
Current schedule of talks and events:
Thursday January 26, 2012
09:00 Registration and coffee break
10:20 Opening
10:30 Invited talk: R. Nedela (Banska Bystrica): Flows and graph coverings
11:30 G. McGillivray (Victoria): Efficient total dominating sets in Cayley graphs and covers of the reflexive complete graph
14:30 J. Kratochvil (Prague): Complexity of Graph Covers - An Ongoing Story Part III
15:30 Invited talk: M. Conder (Auckland): A new approach to finding covers of arc-transitive graphs
Friday January 27, 2012
10:00 Invited talk: S. Negami (Yokohama): Around Planar Cover Conjecture
11:00 P. Hlineny (Brno): How Not to Characterize Planar-emulable Graphs
14:00 J. Fiala (Prague): Progress report on the computational complexity of regular covers
15:00 Invited talk: E. Luks (Eugene): Some sequential and parallel complexity results related to graph canonization
Saturday January 28, 2012
09:30 J. Ma (Auckland): Classifying symmetric abelian covering graphs
10:30 P. Klavik (Prague): Complexity of Planar Surjective Covering
11:30 S. Chaplick (Toronto): Locally Constrained Homomorphism with Bounded Parameters
The workshop will be highlighted by a talk given by Marston Conder, University of Auckland on January 26, entitled, "A new approach to finding covers of arc-transitive graphs".