36. WG 2010: Zarós, Crete, Greece

Invited Talks

• Dimitris Achlioptas:
  Algorithmic Barriers from Phase Transitions in Graphs. 1
  
• Erik D. Demaine:
  Algorithmic Graph Minors and Bidimensionality. 2
  

Regular Talks

• Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen:
  Complexity Results for the Spanning Tree Congestion Problem. 3-14
  
• Marcin Kaminski:
  max-cut and Containment Relations in Graphs. 15-26
  
• Kyriaki Ioannidou, Stavros D. Nikolopoulos:
  The Longest Path Problem is Polynomial on Cocomparability Graphs. 27-38
  
• Petr A. Golovach, Dieter Kratsch, Jean-François Couturier:
  Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. 39-50
  
• Tamás Fleiner:
  On Stable Matchings and Flows. 51-62
  
• Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song:
  Narrowing Down the Gap on the Complexity of Coloring P_k-Free Graphs. 63-74
  
• Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof:
  Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. 75-87
  
• Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
  Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. 88-99
  
• Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller:
  Efficient Algorithms for Eulerian Extension. 100-111
  
• Ge Xia, Yong Zhang:
  On the Small Cycle Transversal of Planar Graphs. 112-122
  
• Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu:
  Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. 123-134
  
• Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth:
  Graphs that Admit Right Angle Crossing Drawings. 135-146
  
• Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
  Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs. 147-158
  
• Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle:
  On the Boolean-Width of a Graph: Structure and Applications. 159-170
  
• Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle:
  Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. 171-183
  
• Konrad Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries:
  Colouring Vertices of Triangle-Free Graphs. 184-195
  
• Geevarghese Philip, Venkatesh Raman, Yngve Villanger:
  A Quartic Kernel for Pathwidth-One Vertex Deletion. 196-207
  
• Jérémie Chalopin, Paola Flocchini, Bernard Mans, Nicola Santoro:
  Network Exploration by Silent and Oblivious Robots. 208-219
  
• Annabell Berger, Matthias Müller-Hannemann:
  Uniform Sampling of Digraphs with a Fixed Degree Sequence. 220-231
  
• René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
  Measuring Indifference: Unit Interval Vertex Deletion. 232-243
  
• Dániel Marx, Ildikó Schlotter:
  Parameterized Complexity of the Arc-Preserving Subsequence Problem. 244-255
  
• Steven Chaplick, Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato:
  From Path Graphs to Directed Path Graphs. 256-265
  
• Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas:
  Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. 266-278
  
• Robert Elsässer, Adrian Ogierman:
  Efficient Broadcasting in Random Power Law Networks. 279-291
  
• Padmini Mukkamala, János Pach, Deniz Sariöz:
  Graphs with Large Obstacle Numbers. 292-303
  
• Edyta Szymanska:
  The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree. 304-314
  
• Colin McDiarmid, Tobias Müller:
  The Number of Bits Needed to Represent a Unit Disk Graph. 315-323
  
• Jannik Matuschke, Britta Peis:
  Lattices and Maximum Flow Algorithms in Planar Graphs. 324-335
  

Last update Tue May 21 18:13:42 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page