| No. |
Title |
Author |
Year |
| 1 |
Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes |
Ohlmann, Pierre et al. |
2023 |
| 2 |
Dynamic Data Structures for Parameterized String Problems |
Olkowski, Jędrzej et al. |
2023 |
| 3 |
Flipper Games for Monadically Stable Graph Classes |
Gajarský, Jakub et al. |
2023 |
| 4 |
Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number |
Majewski, Konrad et al. |
2023 |
| 5 |
On Rational Recursive Sequences |
Clemente, Lorenzo et al. |
2023 |
| 6 |
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters |
Bodlaender, Hans L. et al. |
2023 |
| 7 |
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth |
Bergougnoux, Benjamin et al. |
2023 |
| 8 |
Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures |
Pilipczuk, Michał et al. |
2022 |
| 9 |
Compact Representation for Matrices of Bounded Twin-Width |
Pilipczuk, Michał et al. |
2022 |
| 10 |
Computing Treedepth in Polynomial Space and Linear FPT Time |
Nadara, Wojciech et al. |
2022 |
| 11 |
Isolation Schemes for Problems on Decomposable Graphs |
Nederlof, Jesper et al. |
2022 |
| 12 |
On the Complexity of Problems on Tree-Structured Graphs |
Bodlaender, Hans L. et al. |
2022 |
| 13 |
Polynomial Kernel for Immersion Hitting in Tournaments |
Bożyk, Łukasz et al. |
2022 |
| 14 |
Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391) |
Král’, Daniel et al. |
2022 |
| 15 |
Twin-Width and Types |
Gajarský, Jakub et al. |
2022 |
| 16 |
Dynamic Data Structures for Timed Automata Acceptance |
Grez, Alejandro et al. |
2021 |
| 17 |
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity |
Cslovjecsek, Jana et al. |
2021 |
| 18 |
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes |
Chudnovsky, Maria et al. |
2020 |
| 19 |
On Polynomial Recursive Sequences |
Cadilhac, Michaël et al. |
2020 |
| 20 |
VC Density of Set Systems Definable in Tree-Like Graphs |
Paszke, Adam et al. |
2020 |
| 21 |
Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs |
Cohen-Addad, Vincent et al. |
2019 |
| 22 |
Front Matter, Table of Contents, Preface, Conference Organization |
Paul, Christophe et al. |
2019 |
| 23 |
LIPIcs, Volume 115, IPEC'18, Complete Volume |
Paul, Christophe et al. |
2019 |
| 24 |
On Geometric Set Cover for Orthants |
Bringmann, Karl et al. |
2019 |
| 25 |
Progressive Algorithms for Domination and Independence |
Fabianski, Grzegorz et al. |
2019 |
| 26 |
Reachability for Bounded Branching VASS |
Mazowiecki, Filip et al. |
2019 |
| 27 |
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs |
Novotná, Jana et al. |
2019 |
| 28 |
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints |
Knop, Dusan et al. |
2019 |
| 29 |
First-Order Interpretations of Bounded Expansion Classes |
Gajarský, Jakub et al. |
2018 |
| 30 |
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs |
Pilipczuk, Michal et al. |
2018 |
| 31 |
Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking |
Pilipczuk, Michal et al. |
2017 |
| 32 |
Cutwidth: Obstructions and Algorithmic Aspects |
Giannopoulou, Archontia C. et al. |
2017 |
| 33 |
Edge Bipartization Faster Than 2^k |
Pilipczuk, Marcin et al. |
2017 |
| 34 |
Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs |
Barbero, Florian et al. |
2017 |
| 35 |
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes |
Giannopoulou, Archontia C. et al. |
2017 |
| 36 |
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs |
Eickmeyer, Kord et al. |
2017 |
| 37 |
On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk) |
Pilipczuk, Michal |
2017 |
| 38 |
Optimizing Tree Decompositions in MSO |
Bojanczyk, Mikolaj et al. |
2017 |
| 39 |
Tight Lower Bounds for the Complexity of Multicoloring |
Bonamy, Marthe et al. |
2017 |
| 40 |
Hardness of Approximation for H-Free Edge Modification Problems |
Bliznets, Ivan et al. |
2016 |
| 41 |
Kernelization and Sparseness: the Case of Dominating Set |
Drange, Pål Grønås et al. |
2016 |
| 42 |
Lower Bounds for Approximation Schemes for Closest String |
Cygan, Marek et al. |
2016 |
| 43 |
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs |
Pilipczuk, Michal et al. |
2016 |
| 44 |
The Generalised Colouring Numbers on Classes of Bounded Expansion |
Kreutzer, Stephan et al. |
2016 |
| 45 |
Linear Kernels for Outbranching Problems in Sparse Digraphs |
Bonamy, Marthe et al. |
2015 |
| 46 |
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask) |
Marx, Dániel et al. |
2014 |
| 47 |
Exploring Subexponential Parameterized Complexity of Completion Problems |
Drange, Pal Gronas et al. |
2014 |
| 48 |
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings |
Pilipczuk, Michal |
2013 |
| 49 |
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs |
Pilipczuk, Marcin et al. |
2013 |
| 50 |
Tight bounds for Parameterized Complexity of Cluster Editing |
Fomin, Fedor V. et al. |
2013 |
