1

Pathways to Tractability for Geometric Thickness (Best Paper Award)

Alexander Firbas

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms

Caroppo, Susanna, Da Lozzo, Giordano, Di Battista, Giuseppe, Goodrich, Michael, Martin Nöllenburg

Representing Hypergraphs by Point-Line Incidences

Dobler, Alexander, Kobourov, Stephen G., Mondal, Debajyoti, Martin Nöllenburg

SAT Modulo Symmetries: A Survey

StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners

Florentina Voboril, Peruvemba Ramaswamy, Vaidyanathan, Stefan Szeider

Structural Parameterizations of Simultaneous Planarity

Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Matthias Pfretzschner, Ignaz Rutter

Tackling the Alpha-Domination Problem Heuristically

Enrico Iurlano, Johannes Varga, Günther Raidl

The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators

The Complexity of Extending Fair Allocations of Indivisible Goods

The Computational Complexity of Positive Non-Clashing Teaching in Graphs

Liana Khazaliya