Abstract is missing.
- Graph-Theoretic Solutions to Computational Geometry ProblemsDavid Eppstein. 1-16 [doi]
- Algorithms for Classes of Graphs with Bounded ExpansionZdenek Dvorak, Daniel Král. 17-32 [doi]
- A Graph Polynomial Arising from Community Structure (Extended Abstract)Ilya Averbouch, Johann A. Makowsky, Peter Tittmann. 33-43 [doi]
- Fast Exact Algorithms for Hamiltonicity in Claw-Free GraphsHajo Broersma, Fedor V. Fomin, Pim van t Hof, Daniël Paulusma. 44-53 [doi]
- Maximum Series-Parallel SubgraphGruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul. 54-65 [doi]
- Low-Port Tree RepresentationsShiri Chechik, David Peleg. 66-76 [doi]
- Fully Dynamic Representations of Interval GraphsChristophe Crespelle. 77-87 [doi]
- The Parameterized Complexity of Some Minimum Label ProblemsMichael R. Fellows, Jiong Guo, Iyad A. Kanj. 88-99 [doi]
- Exact and Parameterized Algorithms for Max Internal Spanning TreeHenning Fernau, Serge Gaspers, Daniel Raible. 100-111 [doi]
- An Exact Algorithm for Minimum Distortion EmbeddingFedor V. Fomin, Daniel Lokshtanov, Saket Saurabh. 112-121 [doi]
- Sub-coloring and Hypo-coloring Interval GraphsRajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman. 122-132 [doi]
- Parameterized Complexity of Generalized Domination ProblemsPetr A. Golovach, Jan KratochvÃl, Ondrej Suchý. 133-142 [doi]
- Connected Feedback Vertex Set in Planar GraphsAlexander Grigoriev, René Sitters. 143-153 [doi]
- Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract)Stéphane Grumbach, Zhilin Wu. 154-165 [doi]
- On Module-Composed GraphsFrank Gurski, Egon Wanke. 166-177 [doi]
- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning TreesTorben Hagerup. 178-189 [doi]
- The k-Disjoint Paths Problem on Chordal GraphsFrank Kammer, Torsten Tholey. 190-201 [doi]
- Local Algorithms for Edge Colorings in UDGsIyad A. Kanj, Andreas Wiese, Fenghui Zhang. 202-213 [doi]
- Directed Rank-Width and Displit DecompositionMamadou Moustapha Kanté, Michaël Rao. 214-225 [doi]
- An Algorithmic Study of Switch GraphsBastian Katz, Ignaz Rutter, Gerhard J. Woeginger. 226-237 [doi]
- Hardness Results and Efficient Algorithms for Graph PowersVan Bang Le, Nguyen Ngoc Tuy. 238-249 [doi]
- Graph Partitioning and Traffic Grooming with Bounded Degree Request GraphZhentao Li, Ignasi Sau. 250-261 [doi]
- Injective Oriented ColouringsGary MacGillivray, André Raspaud, Jacobus Swarts. 262-272 [doi]
- Chordal DigraphsDaniel Meister, Jan Arne Telle. 273-284 [doi]
- A New Intersection Model and Improved Algorithms for Tolerance GraphsGeorge B. Mertzios, Ignasi Sau, Shmuel Zaks. 285-295 [doi]
- Counting the Number of Matchings in Chordal and Chordal Bipartite Graph ClassesYoshio Okamoto, Ryuhei Uehara, Takeaki Uno. 296-307 [doi]
- Distance ::::d::::-Domination GamesStephan Kreutzer, Sebastian Ordyniak. 308-319 [doi]
- Cycles, Paths, Connectivity and Diameter in Distance GraphsLucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter. 320-328 [doi]
- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract)Shimon Shrem, Michal Stern, Martin Charles Golumbic. 329-340 [doi]
- Finding Induced Paths of Given Parity in Claw-Free GraphsPim van t Hof, Marcin Kaminski, Daniël Paulusma. 341-352 [doi]