Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky and Maksim Zhukovskii. On anti-stochastic properties of unlabeled graphs
David J. C. Dekker and Bart M. P. Jansen. Kernelization for Feedback Vertex Set via Elimination Distance to a Forest BEST STUDENT PAPER
Benjamin Bergougnoux, Svein Høgemo, Martin Vatshelle and Jan Arne Telle. Recognition of Linear and Star Variants of Leaf Powers is in P
Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka and Viktoriia Korchemna. Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts
Huib Donkers, Bart M. P. Jansen and Jari J. H. de Kroon. Finding k-Secluded Trees Faster
Faisal Abu-Khzam, Henning Fernau and Kevin Mann. Minimal Roman Dominating Functions: Extensions and Enumeration
Giuseppe Liotta, Ignaz Rutter and Alessandra Tappini. Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders
Oswin Aichholzer, Julia Obmann, Pavel Paták, Daniel Perz, Josef Tkadlec and Birgit Vogtenhuber. Disjoint Compatibility via Graph Classes
Esther Galby, Daniel Marx, Philipp Schepper, Roohani Sharma and Prafullkumar Tale. Parameterized complexity of Weighted Multicut in trees
Sándor Kisfaludi-Bak, Karolina Okrasa and Paweł Rzążewski. Computing list homomorphisms in geometric intersection graphs
Csaba Toth. Minimum Weight Euclidean $(1+\varepsilon)$-Spanners BEST PAPER
Robert Scheffler. Linearizing Partial Search Orders
Giacomo Paesani, Daniel Paulusma and Paweł Rzążewski. Classifying Subset Feedback Vertex Set for H-Free Graphs
Jiří Fiala, Ignaz Rutter, Peter Stumpf and Peter Zeman. Extending Partial Representations of Circular-Arc Graphs
Andreas Emil Feldmann and Tung Anh Vu. Generalized k-Center: Distinguishing Doubling and Highway Dimension
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri and Raji R.Pillai. s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs
Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer Mouawad and Sebastian Siebertz. Token sliding on graphs of girth five
Fabian Klute and Marc van Kreveld. On Fully Diverse Sets of Geometric Objects and Graphs
Hans L. Bodlaender, Gunther Cornelissen and Marieke van der Wegen. Problems Hard for Treewidth but Easy for Stable Gonality
Vera Chekan and Torsten Ueckerdt. Polychromatic Colorings of Unions of Geometric Hypergraphs
Hélène Langlois, Frédéric Meunier, Romeo Rizzi and Stéphane Vialette. Algorithmic aspects of small quasi-kernels
Mathew Francis, Atrayee Majumder and Rogers Mathew. Bounding threshold dimension: realizing graphic Boolean functions as the AND of majority functions
Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen Kobourov, Myroslav Kryven, Alexander Wolff and Johannes Zink. The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs
Eduard Eiben, Diptapriyo Majumdar and Ramanujan M. Sridharan. On the Lossy Kernelization for Connected Treedepth Deletion Set
R. Krithika, Roohani Sharma and Prafullkumar Tale. The Complexity of Contracting Bipartite Graphs into Small Cycles
Barnaby Martin, Daniel Paulusma, Siani Smith and Erik Jan van Leeuwen. Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak and Daniel Paulusma. An Algorithmic Framework for Locally Constrained Homomorphisms
Hugo Jacob and Marcin Pilipczuk. Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs
Vikraman Arvind, Roman Nedela, Ilia Ponomarenko and Peter Zeman. Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable
Yasuaki Kobayashi, Kazuhiro Kurita and Kunihiro Wasa. Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings
Jakub Balabán, Petr Hliněný and Jan Jedelský. Twin-width and Transductions of Proper k-Mixed-Thin Graphs
Gabriel Duarte and Uéverton Souza. On the Minimum Cycle Cover problem on graphs with bounded co-degeneracy
