35. WG 2009: Montpellier, France

• David Eppstein:
  Graph-Theoretic Solutions to Computational Geometry Problems. 1-16
  
• Zdenek Dvorak, Daniel Král:
  Algorithms for Classes of Graphs with Bounded Expansion. 17-32
  
• Ilya Averbouch, Johann A. Makowsky, Peter Tittmann:
  A Graph Polynomial Arising from Community Structure (Extended Abstract). 33-43
  
• Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma:
  Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. 44-53
  
• Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul:
  Maximum Series-Parallel Subgraph. 54-65
  
• Shiri Chechik, David Peleg:
  Low-Port Tree Representations. 66-76
  
• Christophe Crespelle:
  Fully Dynamic Representations of Interval Graphs. 77-87
  
• Michael R. Fellows, Jiong Guo, Iyad A. Kanj:
  The Parameterized Complexity of Some Minimum Label Problems. 88-99
  
• Henning Fernau, Serge Gaspers, Daniel Raible:
  Exact and Parameterized Algorithms for Max Internal Spanning Tree. 100-111
  
• Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
  An Exact Algorithm for Minimum Distortion Embedding. 112-121
  
• Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman:
  Sub-coloring and Hypo-coloring Interval Graphs. 122-132
  
• Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý:
  Parameterized Complexity of Generalized Domination Problems. 133-142
  
• Alexander Grigoriev, René Sitters:
  Connected Feedback Vertex Set in Planar Graphs. 143-153
  
• Stéphane Grumbach, Zhilin Wu:
  Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract). 154-165
  
• Frank Gurski, Egon Wanke:
  On Module-Composed Graphs. 166-177
  
• Torben Hagerup:
  An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees. 178-189
  
• Frank Kammer, Torsten Tholey:
  The k-Disjoint Paths Problem on Chordal Graphs. 190-201
  
• Iyad A. Kanj, Andreas Wiese, Fenghui Zhang:
  Local Algorithms for Edge Colorings in UDGs. 202-213
  
• Mamadou Moustapha Kanté, Michaël Rao:
  Directed Rank-Width and Displit Decomposition. 214-225
  
• Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger:
  An Algorithmic Study of Switch Graphs. 226-237
  
• Van Bang Le, Nguyen Ngoc Tuy:
  Hardness Results and Efficient Algorithms for Graph Powers. 238-249
  
• Zhentao Li, Ignasi Sau:
  Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph. 250-261
  
• Gary MacGillivray, André Raspaud, Jacobus Swarts:
  Injective Oriented Colourings. 262-272
  
• Daniel Meister, Jan Arne Telle:
  Chordal Digraphs. 273-284
  
• George B. Mertzios, Ignasi Sau, Shmuel Zaks:
  A New Intersection Model and Improved Algorithms for Tolerance Graphs. 285-295
  
• Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno:
  Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. 296-307
  
• Stephan Kreutzer, Sebastian Ordyniak:
  Distance d-Domination Games. 308-319
  
• Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
  Cycles, Paths, Connectivity and Diameter in Distance Graphs. 320-328
  
• Shimon Shrem, Michal Stern, Martin Charles Golumbic:
  Smallest Odd Holes in Claw-Free Graphs (Extended Abstract). 329-340
  
• Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
  Finding Induced Paths of Given Parity in Claw-Free Graphs. 341-352
  

Last update Sun May 19 23:44:22 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page