Abstract is missing.
- Counting Graphs and Null Models of Complex Networks: Configuration Model and ExtensionsRemco van der Hofstad. 1-17 [doi]
- On Bubble Generators in Directed GraphsVicente Acuña, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri. 18-31 [doi]
- Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-HardAkanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad. 32-44 [doi]
- Hierarchical Partial PlanarityPatrizio Angelini, Michael A. Bekos. 45-58 [doi]
- On the Relationship Between k-Planar and k-Quasi-Planar GraphsPatrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter. 59-74 [doi]
- Extension Complexity of Stable Set Polytopes of Bipartite GraphsManuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia. 75-87 [doi]
- On the Number of Labeled Graphs of Bounded TreewidthJulien Baste, Marc Noy, Ignasi Sau. 88-99 [doi]
- Uniquely Restricted Matchings and Edge ColoringsJulien Baste, Dieter Rautenbach, Ignasi Sau. 100-112 [doi]
- Defective Coloring on Classes of Perfect GraphsRémy Belmonte, Michael Lampis, Valia Mitsou. 113-126 [doi]
- Token Sliding on Chordal GraphsMarthe Bonamy, Nicolas Bousquet. 127-139 [doi]
- Computing Maximum Cliques in B_2 -EPG GraphsNicolas Bousquet, Marc Heinrich. 140-152 [doi]
- Intersection Graphs of Rays and Grounded SegmentsJean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber. 153-166 [doi]
- On H-Topological Intersection GraphsSteven Chaplick, Martin Toepfer 0001, Jan Voborník, Peter Zeman. 167-179 [doi]
- The Hardness of Embedding Grids and WallsYijia Chen, Martin Grohe, Bingkai Lin. 180-192 [doi]
- Approximately Coloring Graphs Without Long Induced PathsMaria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong. 193-205 [doi]
- New and Simple Algorithms for Stable Flow ProblemsÁgnes Cseh, Jannik Matuschke. 206-219 [doi]
- Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph ClassesKonrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma. 220-233 [doi]
- Finding Cut-Vertices in the Square Roots of a GraphGuillaume Ducoffe . 234-248 [doi]
- The Minimum Shared Edges Problem on Grid-Like GraphsTill Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler. 249-262 [doi]
- Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free GraphsSerge Gaspers, Shenwei Huang. 263-274 [doi]
- Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma. 275-288 [doi]
- Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal GraphsPetr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi. 289-302 [doi]
- The Minimum Conflict-Free Row Split Problem RevisitedAdemir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu. 303-315 [doi]
- Drawing Planar Graphs with Few Geometric PrimitivesGregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz 0001. 316-329 [doi]
- Mixed Dominating Set: A Parameterized PerspectivePallavi Jain, M. Jayakrishnan, Fahad Panolan, Abhishek Sahu. 330-343 [doi]
- Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood DiversityDusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar. 344-357 [doi]
- Extending Partial Representations of Trapezoid GraphsTomasz Krawczyk, Bartosz Walczak. 358-371 [doi]
- On Low Rank-Width ColoringsO-joung Kwon, Michal Pilipczuk, Sebastian Siebertz. 372-385 [doi]
- On Strongly Chordal Graphs That Are Not Leaf PowersManuel Lafond. 386-398 [doi]
- New Results on Weighted Independent DominationVadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev. 399-411 [doi]
- The Parameterized Complexity of the Equidomination ProblemOliver Schaudt, Fabian Senger. 412-424 [doi]
- Homothetic Triangle Contact RepresentationsHendrik Schrezenmaier. 425-437 [doi]