Accepted Papers

  1. Rajat Adak, Saraswati Girish Nanoti, and Prafullkumar Tale Revisiting Token Sliding on Chordal Graphs 10.4230/LIPIcs.WG.2026.1
  2. Jungho Ahn, Tala Eagling-Vose, Felicia Lucke, David Manlove, Fabricio Mendoza Granada, and Daniël Paulusma Optimal b-Colourings and Fall Colourings in H-Free Graphs 10.4230/LIPIcs.WG.2026.2
  3. Bogdan Alecu, Pedro Bureo Villafana, and Vadim Lozin Cycles in Unions of Transitive Tournaments 10.4230/LIPIcs.WG.2026.3
  4. Julius Althoetmar, Jamico Schade, and Torben Schürenberg Complexity of Firefighting on Graphs 10.4230/LIPIcs.WG.2026.4
  5. Antoine Amarilli, Arthur Lombardo, and Mikaël Monet The S-Hamiltonian Cycle Problem 10.4230/LIPIcs.WG.2026.5
  6. Patrizio Angelini, Sabine Cornelsen, Giordano Da Lozzo, Fabrizio Frati, Philipp Kindermann, Ignaz Rutter, and Johannes Zink Upward-Planar Drawings with Bounded Span 10.4230/LIPIcs.WG.2026.6
  7. Jørgen Bang-Jensen, Frédéric Havet, Florian Hörsch, Clément Rambaud, Amadeus Reinald, and Caroline Silva Making an Oriented Graph Acyclic Using Inversions of Bounded or Prescribed Size 10.4230/LIPIcs.WG.2026.7
  8. Benjamin Bergougnoux, Vera Chekan, and Stefan Kratsch Tight Bounds for Some W[1]-Hard Problems Parameterized by Multi-Clique-Width 10.4230/LIPIcs.WG.2026.8
  9. Hans L. Bodlaender and Carla Groenland Trade-Off Between Spread and Width for Tree Decompositions [Best Paper] 10.4230/LIPIcs.WG.2026.9
  10. Jean Cardinal and Micha Sharir Implicit Representations via the Polynomial Method 10.4230/LIPIcs.WG.2026.10
  11. Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud, Mathieu Mari, and Prafullkumar Tale Parameterized Complexity of Isometric Path Partition: Treewidth and Diameter 10.4230/LIPIcs.WG.2026.11
  12. Yu-Cheng Chiu, Marc Kaufmann, Kostas Lakis, and Ulysse Schaller Geometric Routing in Geometric Inhomogeneous Random Graphs 10.4230/LIPIcs.WG.2026.12
  13. Pablo Concha-Vega Is Graph Local Complementation Inherently Sequential? 10.4230/LIPIcs.WG.2026.13
  14. Konrad K. Dabrowski, Vadim Lozin, Martin Milanič, Andrea Munaro, Daniël Paulusma, and Viktor Zamaraev Graph Classes Closed Under Self-Intersection 10.4230/LIPIcs.WG.2026.14
  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 10.4230/LIPIcs.WG.2026.15
  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 10.4230/LIPIcs.WG.2026.16
  17. Jaroslav Garvardt and Christian Komusiewicz Clustering with Locally Bounded Ignorance 10.4230/LIPIcs.WG.2026.17
  18. Petr A. Golovach, Diptapriyo Majumdar, and Saket Saurabh Polynomial Kernels for Spanning Tree with Diversity Requirements 10.4230/LIPIcs.WG.2026.18
  19. Carla Groenland, Hidde Koerts, and Sophie Spirkl Faster 3-Colouring Algorithm for Graphs of Diameter 3 10.4230/LIPIcs.WG.2026.19
  20. Shiwali Gupta and Rogers Mathew Computational and Combinatorial Results on Conflict-Free Choosability 10.4230/LIPIcs.WG.2026.20
  21. Grzegorz Gutowski and Gaurav Kucheriya Hunting for Directed 2-Spiders 10.4230/LIPIcs.WG.2026.21
  22. Grzegorz Gutowski and Mikołaj Rams A Note on the Complexity of Directed Clique 10.4230/LIPIcs.WG.2026.22
  23. Thekla Hamm, Bart M. P. Jansen, and Faezeh Motiei Parameterized Complexity of Power Network Design: Coordinating Cable Placement Is Hard 10.4230/LIPIcs.WG.2026.23
  24. Juha Harviainen and Pekka Parviainen Graph Reconstruction with a Connected Components Oracle 10.4230/LIPIcs.WG.2026.24
  25. Zohair Raza Hassan The Complexity of Ramsey Arrowing: A Computational Approach for Hardness Proofs 10.4230/LIPIcs.WG.2026.25
  26. Irene Heinrich, Moritz Lichter, Klara Pakhomenko, and Simon Raßmann Weisfeiler-Leman on Graphs of Small Twin-Width 10.4230/LIPIcs.WG.2026.26
  27. Patryk Jędrzejczak and Łukasz Kowalik The Planar Edge-Coloring Theorem of Vizing in O(nlog n) Time 10.4230/LIPIcs.WG.2026.27
  28. Enrique Junchaya, Alberto Alexandre Assis Miranda, and Cláudio Leonardo Lucchesi Lower Bounds for the Pfaffian Number of Graphs 10.4230/LIPIcs.WG.2026.28
  29. Antonios Kominatos, Reem Mahmoud, and Dimitrios M. Thilikos Obstructions for Minor-Closed Classes of Limiting Densities Below 3/2 [Best Student Paper] 10.4230/LIPIcs.WG.2026.29
  30. Christian Komusiewicz, Zhenwei Liu, Nils Morawietz, and Frank Sommer Preventing Small Global Cuts by Protecting Edges 10.4230/LIPIcs.WG.2026.30
  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 10.4230/LIPIcs.WG.2026.31
  32. Tomáš Masařík, Michał Włodarczyk, and Mehmet Akif Yıldız Optimal Path Partitions in Subcubic and Almost-Subcubic Graphs 10.4230/LIPIcs.WG.2026.32
  33. Caleb McFarland Totally Δ-Modular Tree Decompositions of Graphic Matrices for Integer Programming 10.4230/LIPIcs.WG.2026.33