1

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares

A. Akitaya, Hugo, Demaine, Erik D., Korman, Matias, Kostitsyna, Irina, Parada, Irene, Sonke, Willem, Speckmann, Bettina, Uehara, Ryuhei, Wulms, Jules

Covering Many (Or Few) Edges with k Vertices in Sparse Graphs

Tomohiro Koana and Christian Komusiewicz and André Nichterlein and Frank Sommer

Detours in Directed Graphs

Fomin, Fedor V., Golovach, Petr A., Lochet, William, Sagunov, Danil, Simonov, Kirill, Saurabh, Saket

Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts

Christian Hatschka

Finding a Cluster in Incomplete Data

Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider

Fine-grained Complexity of Partial Minimum Satisfiability

Bliznets, Ivan, Sagunov, Danil, Simonov, Kirill

FPT Approximation for Fair Minimum-Load Clustering

Bandyapadhyay, Sayan, Fomin, Fedor V., Golovach, Petr A., Purohit, Nidhi, Simonov, Kirill

How to Find a Good Explanation for Clustering?

Sayan Bandyapadhyay and Fedor v. Fomin and Petr A. Golovach and William Lochet and Nidhi Purohit and Kirill Simonov

Learning Beam Search: Utilizing Machine Learning to Guide Beam Search for Solving Combinatorial Optimization Problems

Huber, Marc, Günther Raidl

Learning Large Bayesian Networks with Expert Constraints

Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider