Accepted Papers

  1. Rajat Adak, Saraswati Girish Nanoti and Prafullkumar Tale. Revisiting Token Sliding on Chordal Graphs
  2. Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, David Manlove, Fabricio Mendoza Granada and Daniel Paulusma. Optimal b-Colourings and Fall Colourings in H-Free Graphs
  3. Bogdan Alecu, Pedro Bureo Villafana and Vadim Lozin. Cycles in unions of transitive tournaments
  4. Julius Althoetmar, Jamico Schade and Torben Schürenberg. Complexity of Firefighting on Graphs
  5. Antoine Amarilli, Arthur Lombardo and Mikaël Monet. The S-Hamiltonian Cycle Problem
  6. Patrizio Angelini, Sabine Cornelsen, Giordano Da Lozzo, Fabrizio Frati, Philipp Kindermann, Ignaz Rutter and Johannes Zink. Upward-Planar Drawings with Bounded Span
  7. Jørgen Bang-Jensen, Frederic Havet, Florian Hörsch, Clément Rambaud, Amadeus Reinald and Caroline Silva. Making an oriented graph acyclic using inversions of bounded or prescribed size
  8. Benjamin Bergougnoux, Vera Chekan and Stefan Kratsch. Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
  9. Hans L. Bodlaender and Carla Groenland. Trade-off between spread and width for tree decompositions [Best Paper]
  10. Jean Cardinal and Micha Sharir. Implicit representations via the polynomial method
  11. Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud, Mathieu Mari and Prafullkumar Tale. Parameterized Complexity of Isometric Path Partition: Treewidth and Diameter
  12. Yu-Cheng Chiu, Marc Kaufmann, Kostas Lakis and Ulysse Schaller. Geometric Routing in Geometric Inhomogeneous Random Graphs
  13. Pablo Concha-Vega. Is Graph Local Complementation Inherently Sequential?
  14. Konrad K. Dabrowski, Vadim Lozin, Martin Milanič, Andrea Munaro, Daniël Paulusma and Viktor Zamaraev. Graph Classes Closed under Self-intersection
  15. Arun Kumar Das, Vít Jelínek, Jan Kynčl, Martin Pergel, Felix Schröder, Peter Stumpf and Pavel Valtr. High Beer Index Implies Big Hollow Triangles
  16. Tala Eagling-Vose, Jorik Jooken, Felicia Lucke, Barnaby Martin and Daniël Paulusma. Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
  17. Jaroslav Garvardt and Christian Komusiewicz. Clustering with Locally Bounded Ignorance
  18. Petr Golovach, Diptapriyo Majumdar and Saket Saurabh. Polynomial Kernels for Spanning Tree with Diversity Requirements
  19. Carla Groenland, Hidde Koerts and Sophie Spirkl. Faster 3-colouring algorithm for graphs of diameter 3
  20. Shiwali Gupta and Rogers Mathew. Computational and Combinatorial Results on Conflict-free Choosability
  21. Grzegorz Gutowski and Gaurav Kucheriya. Hunting for Directed 2-Spiders
  22. Grzegorz Gutowski and Mikołaj Rams. A Note on the Complexity of Directed Clique
  23. Thekla Hamm, Bart M. P. Jansen and Faezeh Motiei. Parameterized Complexity of Power Network Design: Coordinating Cable Placement is Hard
  24. Juha Harviainen and Pekka Parviainen. Graph Reconstruction with a Connected Components Oracle
  25. Zohair Raza Hassan. The Complexity of Ramsey Arrowing: A Computational Approach for Hardness Proofs
  26. Irene Heinrich, Moritz Lichter, Klara Pakhomenko and Simon Raßmann. Weisfeiler-Leman on graphs of small twin-width
  27. Patryk Jedrzejczak and Lukasz Kowalik. The planar edge-coloring theorem of Vizing in $O(n\log n)$ time
  28. Enrique Junchaya, Alberto Miranda and Cláudio Lucchesi. Lower Bounds for the Pfaffian Number of Graphs
  29. Antonios Kominatos, Reem Mahmoud and Dimitrios Thilikos. Obstructions for Minor-Closed Classes of limiting Densities Below 3/2 [Best Student Paper]
  30. Christian Komusiewicz, Zhenwei Liu, Nils Morawietz and Frank Sommer. Preventing Small Global Cuts by Protecting Edges
  31. Alex Koutsoutis, Kilian Krause, Chun-Hung Liu, Mirza Redzic and Torsten Ueckerdt. On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
  32. Tomáš Masařík, Michał Włodarczyk and Mehmet Akif Yıldız. Optimal path partitions in subcubic and almost-subcubic graphs
  33. Caleb McFarland. Totally Delta-Modular Tree Decompositions of Graphic Matrices for Integer Programming