Abstract is missing.
- Maximum Cardinality Search for Computing Minimal TriangulationsAnne Berry, Jean R. S. Blair, Pinar Heggernes. 1-12 [doi]
- DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching ProblemJacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger. 13-24 [doi]
- On the Minimum Size of a Contraction-Universal TreeOlivier Bodini. 25-34 [doi]
- Optimal Area Algorithm for Planar Polyline DrawingsNicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah. 35-46 [doi]
- Cycles in Generalized NetworksFranz-Josef Brandenburg. 47-56 [doi]
- New Graph Classes of Bounded Clique-WidthAndreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca. 57-67 [doi]
- More about SubcoloringsHajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger. 68-79 [doi]
- Search in Indecomposable GraphsAlain Cournier. 80-91 [doi]
- On the Complexity of (k, l)-Graph Sandwich ProblemsSimone Dantas, Celina M. Herrera de Figueiredo, Luerbio Faria. 92-101 [doi]
- Algorithms and Models for the On-Line Vertex-CoveringMarc Demange, Vangelis Th. Paschos. 102-113 [doi]
- Weighted Node Coloring: When Stable Sets Are ExpensiveMarc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos. 114-125 [doi]
- The Complexity of Restrictive H-ColoringJosep Díaz, Maria J. Serna, Dimitrios M. Thilikos. 126-137 [doi]
- A New 3-Color Criterion for Planar GraphsKrzysztof Diks, Lukasz Kowalik, Maciej Kurowski. 138-149 [doi]
- An Additive Stretched Routing Scheme for Chordal GraphsYon Dourisboure. 150-163 [doi]
- Complexity of Pattern Coloring of Cycle SystemsZdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác. 164-175 [doi]
- Safe Reduction Rules for Weighted TreewidthFrank van den Eijkhof, Hans L. Bodlaender. 176-185 [doi]
- Graph Separator Algorithms: A Refined AnalysisHenning Fernau. 186-197 [doi]
- Generalized H-Coloring and H-Covering of TreesJirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle. 198-210 [doi]
- The Complexity of Approximating the Oriented Diameter of Chordal GraphsFedor V. Fomin, Martín Matamala, Ivan Rapaport. 211-222 [doi]
- Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of FrequenciesDimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis. 223-234 [doi]
- Completely Independent Spanning Trees in Maximal Planar GraphsToru Hasunuma. 235-245 [doi]
- Facets of the Directed Acyclic Graph Layering PolytopePatrick Healy, Nikola S. Nikolov. 246-257 [doi]
- Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NPEdith Hemaspaandra, Jörg Rothe, Holger Spakowski. 258-269 [doi]
- Complexity of Some Infinite Games Played on Finite GraphsHajime Ishihara, Bakhadyr Khoussainov. 270-281 [doi]
- New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar GraphsTon Kloks, Chuan-Min Lee, Jiping Liu. 282-295 [doi]
- A Multi-scale Algorithm for the Linear Arrangement ProblemYehuda Koren, David Harel. 296-309 [doi]
- On the b-Chromatic Number of GraphsJan Kratochvíl, Zsolt Tuza, Margit Voigt. 310-320 [doi]
- Budgeted Maximum Graph CoverageSven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth. 321-332 [doi]
- Online Call Admission in Optical Networks with Larger DemandsSven Oliver Krumke, Diana Poensgen. 333-344 [doi]
- The Forest Wrapping Problem on Outerplanar GraphsIsabella Lari, Federica Ricca, Andrea Scozzari. 345-354 [doi]
- On the Recognition of P::4::-Comparability GraphsStavros D. Nikolopoulos, Leonidas Palios. 355-366 [doi]
- Bend-Minimum Orthogonal Drawings of Plane 3-GraphsMd. Saidur Rahman, Takao Nishizeki. 367-378 [doi]
- Cluster Graph Modification ProblemsRon Shamir, Roded Sharan, Dekel Tsur. 379-390 [doi]
- Two Counterexamples in Graph DrawingOndrej Sýkora, László A. Székely, Imrich Vrto. 391-398 [doi]
- Connected and Loosely Connected List HomomorphismsNarayan Vikas. 399-412 [doi]
- Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically OptimalRolf Wanka. 413-420 [doi]