| Graph-Theoretic Solutions to Computational Geometry Problems (Invited Talk) / David Eppstein |
| Algorithms for Classes of Graphs with Bounded Expansion (Invited Talk) / Zdeněk Dvořák ; Daniel KrálÆ |
| A Graph Polynomial Arising from Community Structure (Extended Abstract) / Ilia Averbouch ; Johann A. Makowsky ; Peter Tittmann |
| Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs / Hajo Broersma ; Fedor V. Fomin ; Pim van 't Hof ; Daniël Paulusma |
| Maximum Series-Parallel Subgraph / Gruia C&acaron;linescu ; Cristina G. Fernandes ; Hemanshu Kaul |
| Low-Port Tree Representations / Shiri Chechik ; David Peleg |
| Fully Dynamic Representations of Interval Graphs / Christophe Crespelle |
| The Parameterized Complexity of Some Minimum Label Problems / Michael R. Fellows ; Jiong Guo ; Iyad A. Kanj |
| Exact and Parameterized Algorithms for Max Internal Spanning Tree / Henning Fernau ; Serge Gaspers ; Daniel Raible |
| An Exact Algorithm for Minimum Distortion Embedding / Daniel Lokshtanov ; Saket Saurabh |
| Sub-coloring and Hypo-coloring Interval Graphs / Rajiv Gandhi ; Bradford Greening Jr. ; Sriram Pemmaraju ; Rajiv Raman |
| Parameterized Complexity of Generalized Domination Problems / Petr A. Golovach ; Jan Kratochvíl ; Ondřej Suchý |
| Connected Feedback Vertex Set in Planar Graphs / Alexander Grigoriev ; René Sitters |
| Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract) / Stéphane Grumbach ; Zhilin Wu |
| On Module-Composed Graphs / Frank Gurski ; Egon Wanke |
| An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees / Torben Hagerup |
| The k-Disjoint Paths Problem on Chordal Graphs / Frank Kammer ; Torsten Tholey |
| Local Algorithms for Edge Colorings in UDGs / Lyad A. Kanj ; Andreas Wiese ; Fenghui Zhang |
| Directed Rank-Width and Displit Decomposition / Mamadou Moustapha Kanté ; Michaël Rao |
| An Algorithmic Study of Switch Graphs / Bastian Katz ; Ignaz Rutter ; Gerhard Woeginger |
| Hardness Results and Efficient Algorithms for Graph Powers / Van Bang Le ; Ngoc Tuy Nguyen |
| Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph / Zhentao Li ; Ignasi Sau |
| Infective Oriented Colourings / Gary MacGillivray ; André Raspaud ; Jacobus Swarts |
| Chordal Digraphs / Daniel Meister ; Jan Arne Telle |
| A New Intersection Model and Improved Algorithms for Tolerance Graphs / George B. Mertzios ; Shmuel Zaks |
| Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes / Yoshio Okamoto ; Ryuhei Uehara ; Takeaki Uno |
| Distance d-Domination Games / Stephan Kreutzer ; Sebastian Ordyniak |
| Cycles, Paths, Connectivity and Diameter in Distance Graphs / Lucia Draque Penso ; Dieter Rautenbach ; Jayme Luiz Szwarcfiter |
| Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) / Shimon Shrem ; Michal Stern ; Martin Charles Golumbic |
| Finding Induced Paths of Given Parity in Claw-Free Graphs / Marcin Kamiński |
| Author Index |
| Graph-Theoretic Solutions to Computational Geometry Problems (Invited Talk) / David Eppstein |
| Algorithms for Classes of Graphs with Bounded Expansion (Invited Talk) / Zdeněk Dvořák ; Daniel KrálÆ |
| A Graph Polynomial Arising from Community Structure (Extended Abstract) / Ilia Averbouch ; Johann A. Makowsky ; Peter Tittmann |
図書
