28. WG 2002: Cesky Krumlov, Czech Republic

@proceedings{DBLP:conf/wg/2002,
  editor    = {Ludek Kucera},
  title     = {Graph-Theoretic Concepts in Computer Science, 28th International
               Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15,
               2002, Revised Papers},
  booktitle = {WG},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2573},
  year      = {2002},
  isbn      = {3-540-00331-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Anne Berry, Jean R. S. Blair, Pinar Heggernes:
  Maximum Cardinality Search for Computing Minimal Triangulations. 1-12
  Electronic Edition (Springer LINK) BibTeX
• Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger:
  DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem. 13-24
  Electronic Edition (Springer LINK) BibTeX
• Olivier Bodini:
  On the Minimum Size of a Contraction-Universal Tree. 25-34
  Electronic Edition (Springer LINK) BibTeX
• Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah:
  Optimal Area Algorithm for Planar Polyline Drawings. 35-46
  Electronic Edition (Springer LINK) BibTeX
• Franz-Josef Brandenburg:
  Cycles in Generalized Networks. 47-56
  Electronic Edition (Springer LINK) BibTeX
• Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca:
  New Graph Classes of Bounded Clique-Width. 57-67
  Electronic Edition (Springer LINK) BibTeX
• Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger:
  More about Subcolorings. 68-79
  Electronic Edition (Springer LINK) BibTeX
• Alain Cournier:
  Search in Indecomposable Graphs. 80-91
  Electronic Edition (Springer LINK) BibTeX
• Simone Dantas, Celina M. Herrera de Figueiredo, Luerbio Faria:
  On the Complexity of (k, l)-Graph Sandwich Problems. 92-101
  Electronic Edition (Springer LINK) BibTeX
• Marc Demange, Vangelis Th. Paschos:
  Algorithms and Models for the On-Line Vertex-Covering. 102-113
  Electronic Edition (Springer LINK) BibTeX
• Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos:
  Weighted Node Coloring: When Stable Sets Are Expensive. 114-125
  Electronic Edition (Springer LINK) BibTeX
• Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos:
  The Complexity of Restrictive H-Coloring. 126-137
  Electronic Edition (Springer LINK) BibTeX
• Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski:
  A New 3-Color Criterion for Planar Graphs. 138-149
  Electronic Edition (Springer LINK) BibTeX
• Yon Dourisboure:
  An Additive Stretched Routing Scheme for Chordal Graphs. 150-163
  Electronic Edition (Springer LINK) BibTeX
• Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác:
  Complexity of Pattern Coloring of Cycle Systems. 164-175
  Electronic Edition (Springer LINK) BibTeX
• Frank van den Eijkhof, Hans L. Bodlaender:
  Safe Reduction Rules for Weighted Treewidth. 176-185
  Electronic Edition (Springer LINK) BibTeX
• Henning Fernau:
  Graph Separator Algorithms: A Refined Analysis. 186-197
  Electronic Edition (Springer LINK) BibTeX
• Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle:
  Generalized H-Coloring and H-Covering of Trees. 198-210
  Electronic Edition (Springer LINK) BibTeX
• Fedor V. Fomin, Martín Matamala, Ivan Rapaport:
  The Complexity of Approximating the Oriented Diameter of Chordal Graphs. 211-222
  Electronic Edition (Springer LINK) BibTeX
• 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
  Electronic Edition (Springer LINK) BibTeX
• Toru Hasunuma:
  Completely Independent Spanning Trees in Maximal Planar Graphs. 235-245
  Electronic Edition (Springer LINK) BibTeX
• Patrick Healy, Nikola S. Nikolov:
  Facets of the Directed Acyclic Graph Layering Polytope. 246-257
  Electronic Edition (Springer LINK) BibTeX
• Edith Hemaspaandra, Jörg Rothe, Holger Spakowski:
  Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. 258-269
  Electronic Edition (Springer LINK) BibTeX
• Hajime Ishihara, Bakhadyr Khoussainov:
  Complexity of Some Infinite Games Played on Finite Graphs. 270-281
  Electronic Edition (Springer LINK) BibTeX
• 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
  Electronic Edition (Springer LINK) BibTeX
• Yehuda Koren, David Harel:
  A Multi-scale Algorithm for the Linear Arrangement Problem. 296-309
  Electronic Edition (Springer LINK) BibTeX
• Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
  On the b-Chromatic Number of Graphs. 310-320
  Electronic Edition (Springer LINK) BibTeX
• Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth:
  Budgeted Maximum Graph Coverage. 321-332
  Electronic Edition (Springer LINK) BibTeX
• Sven Oliver Krumke, Diana Poensgen:
  Online Call Admission in Optical Networks with Larger Demands. 333-344
  Electronic Edition (Springer LINK) BibTeX
• Isabella Lari, Federica Ricca, Andrea Scozzari:
  The Forest Wrapping Problem on Outerplanar Graphs. 345-354
  Electronic Edition (Springer LINK) BibTeX
• Stavros D. Nikolopoulos, Leonidas Palios:
  On the Recognition of P₄-Comparability Graphs. 355-366
  Electronic Edition (Springer LINK) BibTeX
• Md. Saidur Rahman, Takao Nishizeki:
  Bend-Minimum Orthogonal Drawings of Plane 3-Graphs. 367-378
  Electronic Edition (Springer LINK) BibTeX
• Ron Shamir, Roded Sharan, Dekel Tsur:
  Cluster Graph Modification Problems. 379-390
  Electronic Edition (Springer LINK) BibTeX
• Ondrej Sýkora, László A. Székely, Imrich Vrto:
  Two Counterexamples in Graph Drawing. 391-398
  Electronic Edition (Springer LINK) BibTeX
• Narayan Vikas:
  Connected and Loosely Connected List Homomorphisms. 399-412
  Electronic Edition (Springer LINK) BibTeX
• Rolf Wanka:
  Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. 413-420
  Electronic Edition (Springer LINK) BibTeX