No. |
Title |
Author |
Year |
---|

1 |
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument |
Majewski, Konrad et al. |
2022 |

2 |
On the Complexity of Problems on Tree-Structured Graphs |
Bodlaender, Hans L. et al. |
2022 |

3 |
Taming Graphs with No Large Creatures and Skinny Ladders |
Gajarský, Jakub et al. |
2022 |

4 |
Close Relatives (Of Feedback Vertex Set), Revisited |
Jacob, Hugo et al. |
2021 |

5 |
Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings |
Li, Shaohua et al. |
2021 |

6 |
Hardness of Metric Dimension in Graphs of Constant Treewidth |
Li, Shaohua et al. |
2021 |

7 |
Front Matter, Table of Contents, Preface, Conference Organization |
Cao, Yixin et al. |
2020 |

8 |
LIPIcs, Volume 180, IPEC 2020, Complete Volume |
Cao, Yixin et al. |
2020 |

9 |
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs |
Bellitto, Thomas et al. |
2020 |

10 |
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth |
Kowalik, Łukasz et al. |
2020 |

11 |
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs |
Jansen, Bart M. P. et al. |
2019 |

12 |
Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs |
Cohen-Addad, Vincent et al. |
2019 |

13 |
Improved Bounds for the Excluded-Minor Approximation of Treedepth |
Czerwinski, Wojciech et al. |
2019 |

14 |
Multi-Budgeted Directed Cuts |
Kratsch, Stefan et al. |
2019 |

15 |
Packing Directed Circuits Quarter-Integrally |
Masarík, Tomás et al. |
2019 |

16 |
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs |
Karpov, Nikolai et al. |
2018 |

17 |
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness |
Nadara, Wojciech et al. |
2018 |

18 |
Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set |
Kiljan, Krzysztof et al. |
2018 |

19 |
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation |
Ziobro, Michal et al. |
2018 |

20 |
Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor |
Jansen, Bart M. P. et al. |
2018 |

21 |
Edge Bipartization Faster Than 2^k |
Pilipczuk, Marcin et al. |
2017 |

22 |
Subexponential Parameterized Algorithms for Graphs of Polynomial Growth |
Marx, Dániel et al. |
2017 |

23 |
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs |
Chekuri, Chandra et al. |
2016 |

24 |
Kernelization and Sparseness: the Case of Dominating Set |
Drange, Pål Grønås et al. |
2016 |

25 |
Lower Bounds for Approximation Schemes for Closest String |
Cygan, Marek et al. |
2016 |

26 |
On Routing Disjoint Paths in Bounded Treewidth Graphs |
Ene, Alina et al. |
2016 |

27 |
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs |
Pilipczuk, Marcin et al. |
2013 |

28 |
Tight bounds for Parameterized Complexity of Cluster Editing |
Fomin, Fedor V. et al. |
2013 |

29 |
Approximation Algorithms for Union and Intersection Covering Problems |
Cygan, Marek et al. |
2011 |