| No. |
Title |
Author |
Year |
| 1 |
Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs |
Cohen-Addad, Vincent et al. |
2019 |
| 2 |
Front Matter, Table of Contents, Preface, Conference Organization |
Paul, Christophe et al. |
2019 |
| 3 |
LIPIcs, Volume 115, IPEC'18, Complete Volume |
Paul, Christophe et al. |
2019 |
| 4 |
On Geometric Set Cover for Orthants |
Bringmann, Karl et al. |
2019 |
| 5 |
Progressive Algorithms for Domination and Independence |
Fabianski, Grzegorz et al. |
2019 |
| 6 |
Reachability for Bounded Branching VASS |
Mazowiecki, Filip et al. |
2019 |
| 7 |
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs |
Novotná, Jana et al. |
2019 |
| 8 |
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints |
Knop, Dusan et al. |
2019 |
| 9 |
First-Order Interpretations of Bounded Expansion Classes |
Gajarský, Jakub et al. |
2018 |
| 10 |
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs |
Pilipczuk, Michal et al. |
2018 |
| 11 |
Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking |
Pilipczuk, Michal et al. |
2017 |
| 12 |
Cutwidth: Obstructions and Algorithmic Aspects |
Giannopoulou, Archontia C. et al. |
2017 |
| 13 |
Edge Bipartization Faster Than 2^k |
Pilipczuk, Marcin et al. |
2017 |
| 14 |
Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs |
Barbero, Florian et al. |
2017 |
| 15 |
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes |
Giannopoulou, Archontia C. et al. |
2017 |
| 16 |
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs |
Eickmeyer, Kord et al. |
2017 |
| 17 |
On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk) |
Pilipczuk, Michal |
2017 |
| 18 |
Optimizing Tree Decompositions in MSO |
Bojanczyk, Mikolaj et al. |
2017 |
| 19 |
Tight Lower Bounds for the Complexity of Multicoloring |
Bonamy, Marthe et al. |
2017 |
| 20 |
Hardness of Approximation for H-Free Edge Modification Problems |
Bliznets, Ivan et al. |
2016 |
| 21 |
Kernelization and Sparseness: the Case of Dominating Set |
Drange, Pål Grønås et al. |
2016 |
| 22 |
Lower Bounds for Approximation Schemes for Closest String |
Cygan, Marek et al. |
2016 |
| 23 |
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs |
Pilipczuk, Michal et al. |
2016 |
| 24 |
The Generalised Colouring Numbers on Classes of Bounded Expansion |
Kreutzer, Stephan et al. |
2016 |
| 25 |
Linear Kernels for Outbranching Problems in Sparse Digraphs |
Bonamy, Marthe et al. |
2015 |
| 26 |
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask) |
Marx, Dániel et al. |
2014 |
| 27 |
Exploring Subexponential Parameterized Complexity of Completion Problems |
Drange, Pal Gronas et al. |
2014 |
| 28 |
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings |
Pilipczuk, Michal |
2013 |
| 29 |
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs |
Pilipczuk, Marcin et al. |
2013 |
| 30 |
Tight bounds for Parameterized Complexity of Cluster Editing |
Fomin, Fedor V. et al. |
2013 |
