28. WG 2002: Cesky Krumlov, Czech Republic
Ludek Kucera (Ed.): Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers. Springer 2002 Lecture Notes in Computer Science ISBN 3-540-00331-2- Anne Berry, Jean R. S. Blair, Pinar Heggernes: Maximum Cardinality Search for Computing Minimal Triangulations. 1-12
- Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger: DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem. 13-24
- Olivier Bodini: On the Minimum Size of a Contraction-Universal Tree. 25-34
- Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah: Optimal Area Algorithm for Planar Polyline Drawings. 35-46
- Franz-Josef Brandenburg: Cycles in Generalized Networks. 47-56
- Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca: New Graph Classes of Bounded Clique-Width. 57-67
- Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More about Subcolorings. 68-79
- Alain Cournier: Search in Indecomposable Graphs. 80-91
- Simone Dantas, Celina M. Herrera de Figueiredo, Luerbio Faria: On the Complexity of (k, l)-Graph Sandwich Problems. 92-101
- Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos: Weighted Node Coloring: When Stable Sets Are Expensive. 114-125
- Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos: The Complexity of Restrictive H-Coloring. 126-137
- Yon Dourisboure: An Additive Stretched Routing Scheme for Chordal Graphs. 150-163
- Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác: Complexity of Pattern Coloring of Cycle Systems. 164-175
- Henning Fernau: Graph Separator Algorithms: A Refined Analysis. 186-197
- Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle: Generalized H-Coloring and H-Covering of Trees. 198-210
- Fedor V. Fomin, Martín Matamala, Ivan Rapaport: The Complexity of Approximating the Oriented Diameter of Chordal Graphs. 211-222
- Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis: Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies. 223-234
- Toru Hasunuma: Completely Independent Spanning Trees in Maximal Planar Graphs. 235-245
- Edith Hemaspaandra, Jörg Rothe, Holger Spakowski: Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. 258-269
- Hajime Ishihara, Bakhadyr Khoussainov: Complexity of Some Infinite Games Played on Finite Graphs. 270-281
- Ton Kloks, Chuan-Min Lee, Jiping Liu: New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs. 282-295
- Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth: Budgeted Maximum Graph Coverage. 321-332
- Sven Oliver Krumke, Diana Poensgen: Online Call Admission in Optical Networks with Larger Demands. 333-344
- Isabella Lari, Federica Ricca, Andrea Scozzari: The Forest Wrapping Problem on Outerplanar Graphs. 345-354
- Narayan Vikas: Connected and Loosely Connected List Homomorphisms. 399-412
- Rolf Wanka: Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. 413-420
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