Skip to main content

Cuts and decompositions: algorithms and combinatorial properties

Searching for OpenAIRE data...

Publications

On Directed Feedback Vertex Set parameterized by treewidth

Author(s): Bonamy, Marthe; Kowalik, Łukasz; Nederlof, Jesper; Pilipczuk, Michał; Socała, Arkadiusz; Wrochna, Marcin
Published in: Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, LNCS 11159, 2018, Page(s) 65-78
DOI: 10.1007/978-3-030-00256-5_6

On subexponential parameterized algorithms for Steiner Tree and Directed Subset TSP on planar graphs

Author(s): Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michał
Published in: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science, 2018, Page(s) 474-484
DOI: 10.1109/FOCS.2018.00052

An improved FPT algorithm for Independent Feedback Vertex Set

Author(s): Li, Shaohua; Pilipczuk, Marcin
Published in: Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, LNCS 111159, 2018
DOI: 10.1007/978-3-030-00256-5_28

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around

Author(s): Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen
Published in: Proceedings of the 26th Annual European Symposium on Algorithms (ESA '18), 2018, Page(s) 51:1-51:14
DOI: 10.4230/LIPIcs.ESA.2018.51

Cluster Editing in Multi-Layer and Temporal Graphs

Author(s): Jiehua Chen, Ondrej Suchy, Hendrik Molter, Manuel Sorge
Published in: Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC'18), 2018

Flexibility of planar graphs without 4-cycles

Author(s): Masařík, Tomáš
Published in: Acta Mathematica Universitatis Comenianae, Issue 88(3), 2019, Page(s) 935-940

Multi-budgeted directed cuts

Author(s): Kratsch, Stefan; Li, Shaohua; Marx, Dániel; Pilipczuk, Marcin; Wahlström, Magnus
Published in: 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), 2018, Page(s) 18:1-18:14
DOI: 10.4230/lipics.ipec.2018.18

Matchings under Preferences - Strength of Stability and Trade-Offs

Author(s): Jiehua Chen, Piotr Skowron, Manuel Sorge
Published in: Proceedings of the 2019 ACM Conference on Economics and Computation - EC '19, 2019, Page(s) 41-59
DOI: 10.1145/3328526.3329555

On Computing Centroids According to the $p$-Norms of Hamming Distance Vectors

Author(s): Chen, Jiehua; Hermelin, Danny; Sorge, Manuel
Published in: 27th Annual European Symposium on Algorithms (ESA '19), 2019, Page(s) 28:1--28:16
DOI: 10.4230/lipics.esa.2019.28

Improved Bounds for the Excluded-Minor Approximation of Treedepth

Author(s): Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk
Published in: 27th Annual European Symposium on Algorithms (ESA 2019), 2019, Page(s) 34:1-34:13
DOI: 10.4230/lipics.esa.2019.34

Packing Directed Circuits Quarter-Integrally

Author(s): Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Paweł Rzążewski, Manuel Sorge
Published in: 27th Annual European Symposium on Algorithms (ESA 2019), 2019, Page(s) 72:1-72:13
DOI: 10.4230/lipics.esa.2019.72

Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs

Author(s): Vincent Cohen-Addad, Marcin Pilipczuk, Michał Pilipczuk
Published in: 27th Annual European Symposium on Algorithms (ESA 2019), 2019, Page(s) 33:1-33:14
DOI: 10.4230/lipics.esa.2019.33

Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs

Author(s): Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé
Published in: ACM-SIAM Symposium on Discrete Algorithms (SODA20), 2020

A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs

Author(s): Vincent Cohen-Addad, Marcin Pilipczuk, Michał Pilipczuk
Published in: 60th Annual IEEE Symposium on Foundations of Computer Science, 2019

Algorithmic Properties of Sparse Digraphs

Author(s): Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz
Published in: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), 2019, Page(s) 46:1-46:20
DOI: 10.4230/lipics.stacs.2019.46

Representing Graphs and Hypergraphs by Touching Polygons in 3D

Author(s): William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
Published in: Graph Drawing 2019, 2019

An Improved FPT Algorithm for the Flip Distance Problem

Author(s): Shaohua Li, Qilong Feng, Xiangzhong Meng, Jianxin Wang
Published in: 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, 2017
DOI: 10.4230/lipics.mfcs.2017.65

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$Pt-Free and Broom-Free Graphs

Author(s): Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
Published in: Algorithmica, 2018, ISSN 0178-4617
DOI: 10.1007/s00453-018-0479-5

An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs

Author(s): Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz
Published in: Algorithmica, 2018, ISSN 0178-4617
DOI: 10.1007/s00453-018-0504-8

Assessing the Computational Complexity of Multi-Layer Subgraph Detection

Author(s): Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
Published in: Network Science, 2018, ISSN 2050-1242

Caterpillars in Erdős–Hajnal

Author(s): Anita Liebenau, Marcin Pilipczuk, Paul Seymour, Sophie Spirkl
Published in: Journal of Combinatorial Theory, Series B, 2018, ISSN 0095-8956
DOI: 10.1016/j.jctb.2018.09.002

Your Rugby Mates Don’t Need to Know Your Colleagues: Triadic Closure with Edge Colors

Author(s): Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
Published in: Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27–29, 2019, Proceedings, Issue 11485, 2019, Page(s) 99-111
DOI: 10.1007/978-3-030-17402-6_9