default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28. WG 2002: Cesky Krumlov, Czech Republic
- Ludek Kucera:
Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers. Lecture Notes in Computer Science 2573, Springer 2002, 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. H. de Figueiredo, Luérbio Faria:
On the Complexity of (k, l)-Graph Sandwich Problems. 92-101 - Marc Demange, Vangelis Th. Paschos:
Algorithms and Models for the On-Line Vertex-Covering. 102-113 - 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 - Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski:
A New 3-Color Criterion for Planar Graphs. 138-149 - Yon Dourisboure:
An Additive Stretched Routing Scheme for Chordal Graphs. 150-163 - Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác:
Complexity of Pattern Coloring of Cycle Systems. 164-175 - Frank van den Eijkhof, Hans L. Bodlaender:
Safe Reduction Rules for Weighted Treewidth. 176-185 - 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 - Patrick Healy, Nikola S. Nikolov:
Facets of the Directed Acyclic Graph Layering Polytope. 246-257 - 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 - Yehuda Koren, David Harel:
A Multi-scale Algorithm for the Linear Arrangement Problem. 296-309 - Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
On the b-Chromatic Number of Graphs. 310-320 - 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 - Stavros D. Nikolopoulos, Leonidas Palios:
On the Recognition of P4-Comparability Graphs. 355-366 - Md. Saidur Rahman, Takao Nishizeki:
Bend-Minimum Orthogonal Drawings of Plane 3-Graphs. 367-378 - Ron Shamir, Roded Sharan, Dekel Tsur:
Cluster Graph Modification Problems. 379-390 - Ondrej Sýkora, László A. Székely, Imrich Vrto:
Two Counterexamples in Graph Drawing. 391-398 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-05-08 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
