ParAI

Parameterised Partially-Predrawn Crossing Number

Thekla Hamm and Petr Hlinený

Parameterized Algorithms for Queue Layouts

Bhore, Sujoy, Robert Ganian, Montecchiani, Fabrizio, Martin Nöllenburg

Parameterized Algorithms for Upward Planarity

Sum-of-Products with Default Values: Algorithms and Complexity Results

Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider

Testing Upward Planarity of Partial 2-Trees

The Complexity of Envy-Free Graph Cutting

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