Abstract is missing.
- Minimal Roman Dominating Functions: Extensions and EnumerationFaisal N. Abu-Khzam, Henning Fernau, Kevin Mann. 1-15 [doi]
- Disjoint Compatibility via Graph ClassesOswin Aichholzer, Julia Obmann, Pavel Paták, Daniel Perz, Josef Tkadlec, Birgit Vogtenhuber. 16-28 [doi]
- Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract)Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman 0001. 29-42 [doi]
- Twin-Width and Transductions of Proper k-Mixed-Thin GraphsJakub Balabán, Petr Hlinený, Jan Jedelský. 43-55 [doi]
- Token Sliding on Graphs of Girth FiveValentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz. 56-69 [doi]
- Recognition of Linear and Star Variants of Leaf Powers is in PBenjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle. 70-83 [doi]
- Problems Hard for Treewidth but Easy for Stable GonalityHans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen. 84-97 [doi]
- Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge CutsCornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna. 98-113 [doi]
- An Algorithmic Framework for Locally Constrained HomomorphismsLaurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma. 114-128 [doi]
- s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal GraphsDibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai. 129-143 [doi]
- Polychromatic Colorings of Unions of Geometric HypergraphsVera Chekan, Torsten Ueckerdt. 144-157 [doi]
- Kernelization for Feedback Vertex Set via Elimination Distance to a ForestDavid Dekker, Bart M. P. Jansen. 158-172 [doi]
- Finding k-Secluded Trees FasterHuib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon. 173-186 [doi]
- On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracyGabriel L. Duarte, Uéverton S. Souza. 187-200 [doi]
- On the Lossy Kernelization for Connected Treedepth Deletion SetEduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan 0001. 201-214 [doi]
- Generalized k-Center: Distinguishing Doubling and Highway DimensionAndreas Emil Feldmann, Tung Anh Vu. 215-229 [doi]
- Extending Partial Representations of Circular-Arc GraphsJirí Fiala 0001, Ignaz Rutter, Peter Stumpf, Peter Zeman 0001. 230-243 [doi]
- Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority GatesMathew C. Francis, Atrayee Majumder, Rogers Mathew. 244-256 [doi]
- Parameterized Complexity of Weighted Multicut in TreesEsther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale. 257-270 [doi]
- The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar GraphsIna Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen G. Kobourov, Myroslav Kryven, Alexander Wolff 0001, Johannes Zink. 271-286 [doi]
- Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite GraphsHugo Jacob, Marcin Pilipczuk. 287-299 [doi]
- On Anti-stochastic Properties of Unlabeled GraphsSergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii 0001. 300-312 [doi]
- Computing List Homomorphisms in Geometric Intersection GraphsSándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski. 313-327 [doi]
- On Fully Diverse Sets of Geometric Objects and GraphsFabian Klute, Marc J. van Kreveld. 328-341 [doi]
- Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal MatchingsYasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa. 342-355 [doi]
- The Complexity of Contracting Bipartite Graphs into Small CyclesR. Krithika 0001, Roohani Sharma, Prafullkumar Tale. 356-369 [doi]
- Algorithmic Aspects of Small Quasi-KernelsHélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette. 370-382 [doi]
- Parameterized Complexity of Graph Planarity with Restricted Cyclic OrdersGiuseppe Liotta, Ignaz Rutter, Alessandra Tappini. 383-397 [doi]
- Induced Disjoint Paths and Connected Subgraphs for H-Free GraphsBarnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen. 398-411 [doi]
- Classifying Subset Feedback Vertex Set for H-Free GraphsGiacomo Paesani, Daniël Paulusma, Pawel Rzazewski. 412-424 [doi]
- Linearizing Partial Search OrdersRobert Scheffler 0001. 425-438 [doi]
- Minimum Weight Euclidean (1+ε )-SpannersCsaba D. Tóth. 439-452 [doi]