Publications

Conference: International Symposium on Parameterized and Exact Computation

Number of publications: 18

2023

• Mathieu Mari , Timothé Picavet, Michał Pilipczuk , A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items, 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Amsterdam, the Netherlands, 6 September 2023 - 8 September 2023. See in PBN
• Michał Włodarczyk , Juhi Chaudhary, Harmender Gahlawat, Meirav Zehavi, Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs, 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Amsterdam, the Netherlands, 6 September 2023 - 8 September 2023, 285 2023, p. 10:1-10:22. See in PBN
• Konrad K., Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk , Roohani Sharma, Parameterized Complexity Classification for Interval Constraints, 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Amsterdam, the Netherlands, 6 September 2023 - 8 September 2023, 285 2023, p. 11:1--11:19. See in PBN
• Michał Włodarczyk , Meirav Zehavi, Ioannis Koutis, Sidestepping Barriers for Dominating Set in Parameterized Complexity, 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Amsterdam, the Netherlands, 6 September 2023 - 8 September 2023, 285 2023, p. 31:1-31:17. See in PBN

2022

• Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz , On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension, 17th International Symposium on Parameterized and Exact Computation, IPEC 2022, Poczdam, Germany, 7 September 2022 - 9 September 2022. See in PBN
• Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk , Michał Pilipczuk , On the Complexity of Problems on Tree-Structured Graphs, 17th International Symposium on Parameterized and Exact Computation, IPEC 2022, Poczdam, Germany, 7 September 2022 - 9 September 2022, 249 2022, p. 6:1--6:17. See in PBN

2021

• Shaohua Li, Marcin Pilipczuk , Hardness of Metric Dimension in Graphs of Constant Treewidth, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Lisbon, Portugal, 8 September 2021 - 10 September 2021, 214 2021, p. 24:1--24:13. See in PBN
• Huib Donkers, Bart M.P. Jansen, Michał Włodarczyk , Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Lisbon, Portugal, 8 September 2021 - 10 September 2021. See in PBN

2020

• Radek Hušek, Tomáš Masařík , Dušan Knop, Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View, 15th International Symposium on Parameterized and Exact Computation, Hong Kong, China, 14 December 2020 - 18 December 2020. See in PBN
• Marcin Wrochna , PACE solver description: Sallow: A heuristic algorithm for treedepth decompositions, Leibniz International Proceedings in Informatics, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Hong Kong, China, 14 December 2020 - 18 December 2020. See in PBN
• Łukasz Kowalik , Konrad Majewski , The Asymmetric Travelling Salesman Problem In Sparse Digraphs, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Hong Kong, China, 14 December 2020 - 18 December 2020. See in PBN
• Łukasz Kowalik , Marcin Mucha , Wojciech Nadara , Marcin Pilipczuk , Manuel Sorge, Piotr Wygocki , The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Hong Kong, China, 14 December 2020 - 18 December 2020. See in PBN
• Karolina Okrasa, Łukasz Bożyk , Jan Derbisz, Tomasz Krawczyk, Jana Masaříková , Vertex deletion into bipartite permutation graphs, Leibniz International Proceedings in Informatics, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Hong Kong, China, 14 December 2020 - 18 December 2020. See in PBN

2019

• Jana Novotna, Karolina Okrasa, Michał Pilipczuk , Paweł Rzążewski , Erik Jan van Leeuwen, Bartosz Walczak, Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs, 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), Monachium, Germany, 11 September 2019 - 13 September 2019. See in PBN

2018

• Nikolai Karpov, Marcin Pilipczuk , Anna Zych-Pawlewicz , An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs, 12th International Symposium on Parameterized and Exact Computation, Vienna, Austria, 6 September 2017 - 8 September 2017. See in PBN
• Bart M. P. Jansen, Marcin Pilipczuk , Marcin Wrochna , Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor, 12th International Symposium on Parameterized and Exact Computation, Vienna, Austria, 6 September 2017 - 8 September 2017. See in PBN

2017

• Archontia Giannopoulou, Michał Pilipczuk , Jean-florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna , Cutwidth: Obstructions and Algorithmic Aspects, 11th International Symposium on Parameterized and Exact Computation, Aarhus, Denmark, 24 August 2016 - 26 August 2016. See in PBN
• Marcin Pilipczuk , Michał Pilipczuk , Marcin Wrochna , Edge Bipartization Faster Than 2 k∗, 11th International Symposium on Parameterized and Exact Computation, Aarhus, Denmark, 24 August 2016 - 26 August 2016, 63 2017, p. 26:1--26:13. See in PBN