1

PACE Solver Description: Touiouidth

Gaétan Berthe, Yoann Coudert-Osmont, Alexander Dobler, Laure Morelle, Amadeus Reinald, Mathis Teva Rocton

Proven optimally-balanced Latin rectangles with SAT

Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider

Pseudorandom Finite Models

Jan Niclas Dreier

SAT-Based Generation of Planar Graphs

Markus Kirchweger, Manfred Scheucher, Stefan Szeider

Searching for smallest universal graphs and tournaments with SAT

Tianwei Zhang, Stefan Szeider

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-Il Oum, Michał Pilipczuk, Erik Jan Van Leeuwen

Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF

The Computational Complexity of Concise Hypersphere Classification

The Influence of Dimensions on the Complexity of Computing Decision Trees

Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms

The Parameterized Complexity of Coordinated Motion Planning