35. WG 2009: Montpellier, France
Christophe Paul, Michel Habib (Eds.): Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers. 2010 Lecture Notes in Computer Science ISBN 978-3-642-11408-3- David Eppstein: Graph-Theoretic Solutions to Computational Geometry Problems. 1-16
- 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
- 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
- Stéphane Grumbach, Zhilin Wu: Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract). 154-165
- Torben Hagerup: An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees. 178-189
- Zhentao Li, Ignasi Sau: Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph. 250-261
- 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
- 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team