1

Compilation and Fast Model Counting beyond CNF

Alexis De Colnet, Stefan Szeider, Tianwei Zhang

Computing small Rainbow Cycle Numbers with SAT modulo Symmetries

Markus Kirchweger, Stefan Szeider

Computing Twin-Width Parameterized by the Feedback Edge Number

Jakub Balabán, Robert Ganian, Mathis Teva Rocton

Counting Vanishing Matrix-Vector Products

Cornelius Brand and Viktoriia Korchemna and Kirill Simonov and Michael Skotnica

Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)

Liana Khazaliya

Enumerating Minimal Solution Sets for Metric Graph Problems

Benjamin Bergougnoux and Oscar Defrain and Fionn Mc Inerney

eSLIM: Circuit Minimization with SAT Based Local Improvement

Franz-Xaver Reichl, Stefan Szeider

Exact Algorithms for Clustered Planarity with Linear Saturators

Da Lozzo, Giordano, Robert Ganian, Gupta, Siddharth, Mohar, Bojan, Ordyniak, Sebastian, Zehavi, Meirav

Explaining Decisions in ML Models: A Parameterized Complexity Analysis

Ordyniak, Sebastian, Paesani, Giacomo and Rychlicki, Mateusz, Stefan Szeider

First-Order Model Checking on Monadically Stable Graph Classes

Jan Niclas Dreier, Eleftheriadis, Ioannis, Mählmann, Nikolas, McCarty, Rose, Pilipczuk, Michał, Toruńczyk, Szymon