Abstract is missing.
- Treewidth: Characterizations, Applications, and ComputationsHans L. Bodlaender. 1-14 [doi]
- Locally Injective Graph Homomorphism: Lists Guarantee DichotomyJirí Fiala, Jan Kratochvíl. 15-26 [doi]
- Generalised Dualities and Finite Maximal AntichainsJan Foniok, Jaroslav Nesetril, Claude Tardif. 27-36 [doi]
- Chordal Deletion Is Fixed-Parameter TractableDániel Marx. 37-48 [doi]
- A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph SeparatorsChristian Knauer, Andreas Spillner. 49-57 [doi]
- Divide-and-ColorJoachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith. 58-67 [doi]
- Listing Chordal Graphs and Interval GraphsMasashi Kiyomi, Shuji Kijima, Takeaki Uno. 68-77 [doi]
- A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in GraphsSerge Gaspers, Mathieu Liedloff. 78-89 [doi]
- Improved Edge-Coloring with Three ColorsLukasz Kowalik. 90-101 [doi]
- Vertex Coloring of Comparability+::::k::::e and -::::k::::e GraphsYasuhiko Takenaga, Kenichi Higashide. 102-112 [doi]
- Convex Drawings of Graphs with Non-convex BoundarySeok-Hee Hong, Hiroshi Nagamochi. 113-124 [doi]
- How to Sell a Graph: Guidelines for Graph RetailersAlexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz. 125-136 [doi]
- Strip Graphs: Recognition and SchedulingMagnús M. Halldórsson, Ragnar K. Karlsson. 137-146 [doi]
- Approximating the Traffic Grooming Problem in Tree and Star NetworksMichele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks. 147-158 [doi]
- Bounded Arboricity to Determine the Local Structure of Sparse GraphsGaurav Goel, Jens Gustedt. 159-167 [doi]
- An Implicit Representation of Chordal Comparabilty Graphs in Linear-TimeAndrew R. Curtis, Clemente Izurieta, Benson Joeris, Scott Lundberg, Ross M. McConnell. 168-178 [doi]
- Partitioned Probe Comparability GraphsDavid B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng. 179-190 [doi]
- Computing Graph Polynomials on Graphs of Bounded Clique-WidthJohann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin. 191-204 [doi]
- Generation of Graphs with Bounded BranchwidthChristophe Paul, Andrzej Proskurowski, Jan Arne Telle. 205-216 [doi]
- Minimal Proper Interval CompletionsIvan Rapaport, Karol Suchan, Ioan Todinca. 217-228 [doi]
- Monotony Properties of Connected Visible Graph SearchingPierre Fraigniaud, Nicolas Nisse. 229-240 [doi]
- Finding Intersection Models of Weakly Chordal GraphsMartin Charles Golumbic, Marina Lipshteyn, Michal Stern. 241-255 [doi]
- A Fully Dynamic Algorithm for the Recognition of ::::P::::::4::-Sparse GraphsStavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos. 256-268 [doi]
- Clique Graph Recognition Is NP-CompleteLiliana Alcón, Luerbio Faria, Celina M. Herrera de Figueiredo, Marisa Gutierrez. 269-277 [doi]
- Homogeneity vs. Adjacency: Generalising Some Graph Decomposition AlgorithmsBinh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier. 278-288 [doi]
- Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc GraphsHaim Kaplan, Yahav Nussbaum. 289-300 [doi]
- Graph Labelings Derived from Models in Distributed ComputingJérémie Chalopin, Daniël Paulusma. 301-312 [doi]
- Flexible MatchingsMiklós Bartha, Miklós Krész. 313-324 [doi]
- Simultaneous Graph Embeddings with Fixed EdgesElisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz. 325-335 [doi]
- Approximation Algorithms for Restricted Cycle Covers Based on Cycle DecompositionsBodo Manthey. 336-347 [doi]
- Circular-Perfect Concave-Round GraphsSylvain Coulonges. 348-355 [doi]