1

The Parameterized Complexity of Finding Concise Local Explanations

Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider

The Parameterized Complexity of Network Microaggregation

Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth

Liana Khazaliya

A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation

Mayerhofer, Jonas, Markus Kirchweger, Huber, Marc, Günther Raidl

A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications

A Reproducibility Study on User-centric MIR Research and Why it is Important

Peter Knees, Bruce Ferwerda, Andreas Rauber, Sebastian Strumbelj, Annabel Resch, Laurenz Tomandl, Valentin Bauer, Fung Yee Tang, Josip Bobinac, Amila Ceranic, Riad Dizdar

A SAT Approach to Twin-Width

André Schidler, Stefan Szeider

A SAT Attack on Rota’s Basis Conjecture

Markus Kirchweger, Manferd Scheucher, Stefan Szeider

A Unifying Framework for Characterizing and Computing Width Measures

Combinatorial and Algorithmic Aspects of Monadic Stability

Jan Niclas Dreier, Mählmann, Nikolas, Mouawad, Amer E., Siebertz, Sebastian, Vigny, Alexandre