Abstract is missing.
- Subexponential Algorithms for Variants of Homomorphism Problem in String GraphsKarolina Okrasa, Pawel Rzazewski. 1-13 [doi]
- The 4-Steiner Root ProblemGuillaume Ducoffe . 14-26 [doi]
- Hamiltonicity Below Dirac's ConditionBart M. P. Jansen, László Kozma 0002, Jesper Nederlof. 27-39 [doi]
- Maximum Independent Sets in Subcubic Graphs: New ResultsArarat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot. 40-52 [doi]
- Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite GraphsMeike Hatzel, Roman Rabinovich, Sebastian Wiederrecht. 53-65 [doi]
- Local Approximation of the Maximum Cut in Regular GraphsÉtienne Bamas, Louis Esperet. 66-78 [doi]
- Fixed-Parameter Tractability of Counting Small Minimum (S, T)-CutsPierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik. 79-92 [doi]
- Fast Breadth-First Search in Still Less SpaceTorben Hagerup. 93-105 [doi]
- A Turing Kernelization Dichotomy for Structural Parameterizations of ℱ -Minor-Free DeletionHuib Donkers, Bart M. P. Jansen. 106-119 [doi]
- Flip Distances Between Graph OrientationsOswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber. 120-134 [doi]
- Graph FunctionalityBogdan Alecu, Aistis Atminas, Vadim V. Lozin. 135-147 [doi]
- On Happy Colorings, Cuts, and Structural ParameterizationsIvan Bliznets, Danil Sagunov. 148-161 [doi]
- Shortest Reconfiguration of MatchingsNicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler. 162-174 [doi]
- Travelling on Graphs with Small Highway DimensionYann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann. 175-189 [doi]
- The Power of Cut-Based Parameters for Computing Edge Disjoint PathsRobert Ganian, Sebastian Ordyniak. 190-204 [doi]
- Geometric Representations of Dichotomous Ordinal DataPatrizio Angelini, Michael A. Bekos, Martin Gronemann, Antonios Symvonis. 205-217 [doi]
- Linear MIM-Width of TreesSvein Høgemo, Jan Arne Telle, Erlend Raa Vågset. 218-231 [doi]
- Approximating Minimum Dominating Set on String GraphsDibyayan Chakraborty, Sandip Das 0001, Joydeep Mukherjee. 232-243 [doi]
- Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and HardnessMeghana Nasre, Prajakta Nimbhorkar, Nada Pulath. 244-257 [doi]
- Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -GraphsTherese C. Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw. 258-270 [doi]
- A Polynomial-Time Algorithm for the Independent Set Problem in P_10, C_4, C_6 -Free GraphsEdin Husic, Martin Milanic. 271-284 [doi]
- Independent Set Reconfiguration Parameterized by Modular-WidthRémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi. 285-297 [doi]
- Counting Independent Sets in Graphs with Bounded Bipartite PathwidthMartin E. Dyer, Catherine S. Greenhill, Haiko Müller. 298-310 [doi]
- Intersection Graphs of Non-crossing PathsSteven Chaplick. 311-324 [doi]
- Reconfiguring Hamiltonian Cycles in L-Shaped Grid GraphsRahnuma Islam Nishat, Sue Whitesides. 325-337 [doi]
- Color Refinement, Homomorphisms, and HypergraphsJan Böker. 338-350 [doi]
- 3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 SlopesDaniel Gonçalves. 351-363 [doi]
- The Exponential-Time Complexity of Counting (Quantum) Graph HomomorphismsHubie Chen, Radu Curticapean, Holger Dell. 364-378 [doi]
- Minimal Separators in Graph Classes Defined by Small Forbidden Induced SubgraphsMartin Milanic, Nevena Pivac. 379-391 [doi]