Nfpc

The Complexity of k-Means Clustering when Little is Known

The Complexity of Temporal Vertex Cover in Small-Degree Graphs

Thekla Hamm and Nina Klobas and George B. Mertzios and Paul G. Spirakis

Threshold Treewidth and Hypertree Width

Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider

Weighted Model Counting with Twin-Width

Robert Ganian, Filip Pokr ́Yvka, Andre Schidler, Kirill Simonov, Stefan Szeider

Computing Kemeny Rankings from d-Euclidean Preferences

Thekla Hamm, Martin Lackner, Anna Rapberger

Crossing-Optimal Extension of Simple Drawings

Graphs with at most two moplexes

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

Graphs with two moplexes

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

Measuring what matters: A hybrid approach to dynamic programming with treewidth

New Width Parameters for SAT and Sharp-SAT

Robert Ganian, Stefan Szeider