Abstract is missing.
- Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)Reinhard Diestel, Sang-il Oum. 1-14 [doi]
- Distributedly Testing Cycle-FreenessHeger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu. 15-28 [doi]
- DMVP: Foremost Waypoint Coverage of Time-Varying GraphsEric Aaron, Danny Krizanc, Elliot Meyerson. 29-41 [doi]
- Linear Rank-Width of Distance-Hereditary GraphsIsolde Adler, Mamadou Moustapha Kanté, O.-joung Kwon. 42-55 [doi]
- Vertex Contact Graphs of Paths on a GridNieke Aerts, Stefan Felsner. 56-68 [doi]
- Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract)Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin. 69-80 [doi]
- Boxicity and Separation DimensionManu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad. 81-92 [doi]
- Maximal Induced Matchings in Triangle-Free GraphsManu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger. 93-104 [doi]
- Independent Set Reconfiguration in CographsPaul Bonsma. 105-116 [doi]
- Structural Parameterizations for BoxicityHenning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt. 117-128 [doi]
- k-free GraphsEglantine Camby, Oliver Schaudt. 129-138 [doi]
- Contact Representations of Planar Graphs: Extending a Partial Representation is HardSteven Chaplick, Paul Dorbec, Jan Kratochvíl, Mickaël Montassier, Juraj Stacho. 139-151 [doi]
- The Maximum Labeled Path ProblemBasile Couëtoux, Elie Nakache, Yann Vaxès. 152-163 [doi]
- Minimum Spanning Tree Verification Under UncertaintyThomas Erlebach, Michael Hoffmann 0002. 164-175 [doi]
- Towards the Hanani-Tutte Theorem for Clustered GraphsRadoslav Fulek. 176-188 [doi]
- On Set Expansion Problems and the Small Set Expansion ConjectureRajiv Gandhi, Guy Kortsarz. 189-200 [doi]
- Hadwiger Number of Graphs with Small ChordalityPetr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul. 201-213 [doi]
- 2) TimePetr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy Spinrad. 214-224 [doi]
- Induced Disjoint Paths in Circular-Arc Graphs in Linear TimePetr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen. 225-237 [doi]
- Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar GraphsQian-Ping Gu, Gengchun Xu. 238-249 [doi]
- Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler DigraphsGregory Gutin, Mark Jones, Bin Sheng, Magnus Wahlström. 250-262 [doi]
- Colored Modular and Split Decompositions of Graphs with Applications to TrigraphsMichel Habib, Antoine Mamcarz. 263-274 [doi]
- Edge Elimination in TSP InstancesStefan Hougardy, Rasmus T. Schroeder. 275-286 [doi]
- The Parameterized Complexity of the Rainbow Subgraph ProblemFalk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke. 287-298 [doi]
- Kernelizations for the Hybridization Number Problem on Multiple Nonbinary TreesLeo van Iersel, Steven Kelk. 299-311 [doi]
- Graph-TSP from Steiner CyclesSatoru Iwata, Alantha Newman, R. Ravi. 312-323 [doi]
- A Characterization of Mixed Unit Interval GraphsFelix Joos. 324-335 [doi]
- On the Number of Connected Sets in Bounded Degree GraphsKustaa Kangas, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen. 336-347 [doi]
- Parameterized Edge HamiltonicityMichael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno. 348-359 [doi]
- Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split GraphsVan Bang Le, Andrea Oversberg, Oliver Schaudt. 360-371 [doi]
- The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity ResultsThiago Braga Marcilon, Samuel Nascimento, Rudini M. Sampaio. 372-383 [doi]
- Parameterized Algorithms for Graph Partitioning ProblemsHadas Shachnai, Meirav Zehavi. 384-395 [doi]
- Between Treewidth and Clique-WidthSigve Hortemo Sæther, Jan Arne Telle. 396-407 [doi]
- A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free GraphsStéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic. 408-419 [doi]