1

Revisiting Causal Discovery from a Complexity-Theoretic Perspective

Robert Ganian, Viktoriia Korchemna, Stefan Szeider

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings

Dobler, Alexander, Jünger, Michael, Jünger, Paul J., Meffert, Julian, Mutzel, Petra, Martin Nöllenburg

SAT-Based Tree Decomposition with Iterative Cascading Policy Selection

Hai Xia, Stefan Szeider

Selecting User Queries in Interactive Job Scheduling

Johannes Varga, Günther Raidl, Todemann, Tobias

Small unsatisfiable k-CNFs with bounded literal occurrence

Tianwei Zhang, Tomas Peitl, Stefan Szeider

Speeding up Logic-Based Benders Decomposition by Strengthening Cuts with Graph Neural Networks

Johannes Varga, Karlsson, Emil, Günther Raidl, R\n̈nberg, Elina, Lindsten, Fredrik, Rodemann, Tobias

Structure-guided Local Improvement for Maximum Satisfiability

André Schidler, Stefan Szeider

SubModST: A Fast Generic Solver for Submodular~Maximization with Size Constraints

Henning Martin Woydt, Christian Komusiewicz, Frank Sommer

The Complexity of Fair Division of Indivisible Items with Externalities

Argyrios Deligkas and Eduard Eiben and Viktoriia Korchemna and Simon Schierreich

The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k \(≥\) 5

Phuc Hung Hoang