| No. |
Title |
Author |
Year |
| 1 |
Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard) |
Marx, Dániel et al. |
2022 |
| 2 |
Computing Generalized Convolutions Faster Than Brute Force |
Esmer, Barış Can et al. |
2022 |
| 3 |
Domination and Cut Problems on Chordal Graphs with Bounded Leafage |
Galby, Esther et al. |
2022 |
| 4 |
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves |
Bringmann, Karl et al. |
2022 |
| 5 |
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search |
Esmer, Barış Can et al. |
2022 |
| 6 |
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201) |
Grohe, Martin et al. |
2022 |
| 7 |
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth |
Marx, Dániel et al. |
2021 |
| 8 |
On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting |
Cohen-Addad, Vincent et al. |
2021 |
| 9 |
Chordless Cycle Packing Is Fixed-Parameter Tractable |
Marx, Dániel |
2020 |
| 10 |
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction |
Künnemann, Marvin et al. |
2020 |
| 11 |
Hitting Long Directed Cycles Is Fixed-Parameter Tractable |
Göke, Alexander et al. |
2020 |
| 12 |
Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy |
Marx, Dániel et al. |
2020 |
| 13 |
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs |
Cohen-Addad, Vincent et al. |
2019 |
| 14 |
Finding and Counting Permutations via CSPs |
Berendsohn, Benjamin Aram et al. |
2019 |
| 15 |
How Does Object Fatness Impact the Complexity of Packing in d Dimensions? |
Kisfaludi-Bak, Sándor et al. |
2019 |
| 16 |
Multi-Budgeted Directed Cuts |
Kratsch, Stefan et al. |
2019 |
| 17 |
New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) |
Fomin, Fedor V. et al. |
2019 |
| 18 |
Parameterized Streaming Algorithms for Min-Ones d-SAT |
Agrawal, Akanksha et al. |
2019 |
| 19 |
Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization |
Egri, László et al. |
2018 |
| 20 |
Front Matter, Table of Contents, Preface, Conference Organization |
Chatzigiannakis, Ioannis et al. |
2018 |
| 21 |
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms |
Bonnet, Édouard et al. |
2018 |
| 22 |
LIPIcs, Volume 107, ICALP'18, Complete Volume |
Chatzigiannakis, Ioannis et al. |
2018 |
| 23 |
The Parameterized Hardness of the k-Center Problem in Transportation Networks |
Feldmann, Andreas Emil et al. |
2018 |
| 24 |
Fine-Grained Complexity of Coloring Unit Disks and Balls |
Biró, Csaba et al. |
2017 |
| 25 |
Graphs, Hypergraphs, and the Complexity of Conjunctive Database Queries (Invited Talk) |
Marx, Dániel |
2017 |
| 26 |
H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms |
Bacsó, Gábor et al. |
2017 |
| 27 |
Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix |
Chen, Lin et al. |
2017 |
| 28 |
Subexponential Parameterized Algorithms for Graphs of Polynomial Growth |
Marx, Dániel et al. |
2017 |
| 29 |
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221) |
Erickson, Jeff et al. |
2016 |
| 30 |
Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs |
Marx, Dániel et al. |
2016 |
