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