1

EPTAS for \emphk-means Clustering of Affine Subspaces

Eduard Eiben and Fedor v. Fomin and Petr A. Golovach and William Lochet and Fahad Panolan and Kirill Simonov

Finding the Hardest Formulas for Resolution (Extended Abstract)

First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving

Wolfgang Schreiner and Franz-Xaver Reichl

Graphs with two moplexes

Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic

Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes

Jan Niclas Dreier

Layered Area-Proportional Rectangle Contact Representation

Martin Nöllenburg, Villedieu, Anaïs, Wulms, Jules

Learning fast-inference Bayesian networks

Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider

Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems

Adrian Bracher, Nikolaus Frohner, Günther Raidl

On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications

Sayan Bandyapadhyay and Fedor v. Fomin and Kirill Simonov

Parameterized Complexity of Feature Selection for Categorical Data Clustering

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