Publications Peer reviewed articles (49) On 3-Coloring of (2P4, C5 )-Free Graphs Author(s): Vít Jelínek, Tereza Klimošová, Tomáš Masařík, Jana Novotná, Aneta Pokorná Published in: Algorithmica, Issue 01784617, 2022, Page(s) 1526–1547, ISSN 0178-4617 Publisher: Springer Verlag DOI: 10.1007/s00453-022-00937-9 Decreasing the Maximum Average Degree by Deleting an Independent Set or a d-Degenerate Subgraph Author(s): Wojciech Nadara, Marcin Smulewicz Published in: Electronic Journal of Combinatorics, Issue 10778926, 2022, Page(s) P1.49, ISSN 1077-8926 Publisher: Electronic Journal of Combinatorics DOI: 10.37236/9455 Packing Directed Cycles Quarter- and Half-Integrally Author(s): Tomáš Masařík, Irene Muzi, Marcin Pilipczuk, Paweł Rzążewski, Manuel Sorge Published in: Combinatorica, Issue 02099683, 2022, ISSN 0209-9683 Publisher: Springer Verlag DOI: 10.1007/s00493-021-4743-y On objects dual to tree-cut decompositions Author(s): Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk Published in: Journal of Combinatorial Theory, Series B, Issue 00958956, 2022, Page(s) 401-428, ISSN 0095-8956 Publisher: Academic Press DOI: 10.1016/j.jctb.2022.07.009 On Supereulerian 2-Edge-Coloured Graphs Author(s): Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo Published in: Graphs and Combinatorics, 2021, ISSN 0911-0119 Publisher: Springer Verlag DOI: 10.1007/s00373-021-02377-8 Degeneracy of P_t-free and C_>=t-free graphs with no large complete bipartite subgraphs Author(s): Marthe Bonamy, Nicolas Bousquet, Michał Pilipczuk, Paweł Rzążewski, Stephan Thomasse, Bartosz Walczak Published in: Journal of Combinatorial Theory, Series B, Issue 00958956, 2022, Page(s) 353-378, ISSN 0095-8956 Publisher: Academic Press DOI: 10.1016/j.jctb.2021.10.005 Randomized Contractions Meet Lean Decompositions Author(s): Marek Cygan, Paweł Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh, Magnus Wahlström Published in: ACM Transactions on Algorithms, Issue 17/1, 2021, Page(s) 1-30, ISSN 1549-6325 Publisher: Association for Computing Machinary, Inc. DOI: 10.1145/3426738 Improved Bounds for the Excluded-Minor Approximation of Treedepth Author(s): Wojciech Czerwiński, Wojciech Nadara, Marcin Pilipczuk Published in: SIAM Journal on Discrete Mathematics, Issue 35/2, 2021, Page(s) 934-947, ISSN 0895-4801 Publisher: Society for Industrial and Applied Mathematics DOI: 10.1137/19m128819x Jones' Conjecture in Subcubic Graphs Author(s): Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk Published in: Electron. J. Comb., Issue 10778926, 2021, Page(s) P4.5, ISSN 1077-8926 Publisher: Electronic Journal of Combinatorics DOI: 10.37236/9192 Designing RNA Secondary Structures Is Hard Author(s): Édouard Bonnet, Paweł Rzążewski, Florian Sikora Published in: Journal of Computational Biology, Issue 27/3, 2020, Page(s) 302-316, ISSN 1557-8666 Publisher: Mary Ann Liebert, Inc. DOI: 10.1089/cmb.2019.0420 Constant Congestion Brambles in Directed Graphs Author(s): Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge Published in: SIAM Journal on Discrete Mathematics, Issue 08954801, 2022, Page(s) 922-938, ISSN 0895-4801 Publisher: Society for Industrial and Applied Mathematics DOI: 10.1137/21m1417661 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: Journal of Computer and System Sciences, Issue 120, 2021, Page(s) 75-96, ISSN 0022-0000 Publisher: Academic Press DOI: 10.1016/j.jcss.2021.03.001 An Improved FPT Algorithm for Independent Feedback Vertex Set Author(s): Shaohua Li, Marcin Pilipczuk Published in: Theory of Computing Systems, Issue 64/8, 2020, Page(s) 1317-1330, ISSN 1432-4350 Publisher: Springer Verlag DOI: 10.1007/s00224-020-09973-w Constant Congestion Brambles Author(s): Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge Published in: Discrete Mathematics & Theoretical Computer Science, Issue 13658050, 2022, ISSN 1365-8050 Publisher: Maison de l'informatique et des mathematiques discretes DOI: 10.46298/dmtcs.6699 Exact and approximation algorithms for sensor placement against DDoS attacks Author(s): Konstanty Junosza-Szaniawski, Dariusz Nogalski, Paweł Rzążewski Published in: International Journal of Applied Mathematics and Computer Science, Issue 1641876X, 2022, Page(s) 35-49, ISSN 1641-876X Publisher: Technical University Press DOI: 10.34768/amcs-2022-0004 On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five Author(s): Maria Chudnovsky, Marcin Pilipczuk, Michał Pilipczuk, Stéphan Thomassé Published in: SIAM Journal on Discrete Mathematics, Issue 34/2, 2020, Page(s) 1472-1483, ISSN 0895-4801 Publisher: Society for Industrial and Applied Mathematics DOI: 10.1137/19m1249473 Flexibility of Planar Graphs -- Sharpening the Tools to Get Lists of Size Four Author(s): Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomáš Masařík Published in: Discrete Applied Mathematics, Issue 0166218X, 2022, Page(s) 120-132, ISSN 0166-218X Publisher: Elsevier BV DOI: 10.1016/j.dam.2021.09.021 Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs Author(s): Andrzej Grzesik, Tereza Klimošová, Marcin Pilipczuk, Michał Pilipczuk Published in: The Electronic Journal of Combinatorics, Issue 28/1, 2021, ISSN 1077-8926 Publisher: Electronic Journal of Combinatorics DOI: 10.37236/9473 Polynomial Treedepth Bounds in Linear Colorings Author(s): Jeremy Kun, Michael P. O’Brien, Marcin Pilipczuk, Blair D. Sullivan Published in: Algorithmica, Issue 83/1, 2021, Page(s) 361-386, ISSN 0178-4617 Publisher: Springer Verlag DOI: 10.1007/s00453-020-00760-0 Two lower bounds for p-centered colorings Author(s): Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois Published in: Discrete Mathematics & Theoretical Computer Science, Issue 22(4), 2020, ISSN 1365-8050 Publisher: Maison de l'informatique et des mathematiques discretes DOI: 10.23638/dmtcs-22-4-9 Solving Partition Problems Almost Always Requires Pushing Many Vertices Around Author(s): Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Published in: SIAM Journal on Discrete Mathematics, Issue 34/1, 2020, Page(s) 640-681, ISSN 0895-4801 Publisher: Society for Industrial and Applied Mathematics DOI: 10.1137/19m1239362 Vertex Deletion into Bipartite Permutation Graphs Author(s): Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa Published in: Algorithmica, Issue 01784617, 2022, Page(s) 2271-2291, ISSN 0178-4617 Publisher: Springer Verlag DOI: 10.1007/s00453-021-00923-7 U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited Author(s): Jan Kratochvíl, Tomás Masarík, Jana Novotná Published in: Algorithmica, Issue 01784617, 2021, Page(s) 3649–368, ISSN 0178-4617 Publisher: Springer Verlag DOI: 10.1007/s00453-021-00837-4 Coloring squares of planar graphs with small maximum degree Author(s): Mateusz Krzyziński, Paweł Rzążewski, Szymon Tur Published in: Discussiones Mathematicae Graph Theory, Issue 12343099, 2022, ISSN 1234-3099 Publisher: Technical University Press DOI: 10.7151/dmgt.2472 Efficient algorithms for measuring the funnel-likeness of DAGs Author(s): Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge Published in: Journal of Combinatorial Optimization, Issue 39/1, 2020, Page(s) 216-245, ISSN 1382-6905 Publisher: Kluwer Academic Publishers DOI: 10.1007/s10878-019-00464-4 Many-visits TSP revisited Author(s): Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström Published in: J. Comput. Syst. Sci., Issue 00220000, 2022, Page(s) 112-128, ISSN 0022-0000 Publisher: Academic Press DOI: 10.1016/j.jcss.2021.09.007 Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs Author(s): Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk Published in: ACM Transactions on Algorithms, Issue 15496325, 2022, Page(s) 4:1-4:57, ISSN 1549-6325 Publisher: Association for Computing Machinary, Inc. DOI: 10.1145/3414473 Completeness for the Complexity Class ∀∃R and Area-Universality Author(s): Michael Gene Dobbins, Linda Kleist, Tillmann Miltzow, Paweł Rzążewski Published in: Discrete & Computational Geometry, Issue 01795376, 2022, ISSN 0179-5376 Publisher: Springer Verlag DOI: 10.1007/s00454-022-00381-0 Computing the best-case energy complexity of satisfying assignments in monotone circuits Author(s): Janio Carlos Nascimento Silva, Uéverton S. Souza Published in: Theoretical Computer Science, Issue 03043975, 2022, Page(s) 41-55, ISSN 0304-3975 Publisher: Elsevier BV DOI: 10.1016/j.tcs.2022.08.005 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 Publisher: Springer Verlag 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 Publisher: Springer Verlag 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 Publisher: Cambridge University Press 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 Publisher: Academic Press DOI: 10.1016/j.jctb.2018.09.002 On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments Author(s): Bożyk, Łukasz; Pilipczuk, Michał Published in: Discrete Mathematics & Theoretical Computer Science, Issue 13658050, 2022, ISSN 1365-8050 Publisher: Maison de l'informatique et des mathematiques discretes DOI: 10.46298/dmtcs.7099 A Double Exponential Lower Bound for the Distinct Vectors Problem Author(s): Marcin Pilipczuk, Manuel Sorge Published in: Discrete Mathematics & Theoretical Computer Science, Issue 22(4), 2020, ISSN 1365-8050 Publisher: Maison de l'informatique et des mathematiques discretes DOI: 10.23638/dmtcs-22-4-7 (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth Author(s): Marcin Pilipczuk, Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon Published in: Journal of Graph Theory, Issue 97/4, 2021, Page(s) 624-641, ISSN 0364-9024 Publisher: John Wiley & Sons Inc. DOI: 10.1002/jgt.22675 Multi-budgeted Directed Cuts Author(s): Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström Published in: Algorithmica, Issue 82/8, 2020, Page(s) 2135-2155, ISSN 0178-4617 Publisher: Springer Verlag DOI: 10.1007/s00453-019-00609-1 On the density of sets of the Euclidean plane avoiding distance 1 Author(s): Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot Published in: Discrete Mathematics & Theoretical Computer Science, Issue vol. 23 no. 1/Combinatorics, 2021, ISSN 1365-8050 Publisher: Maison de l'informatique et des mathematiques discretes DOI: 10.46298/dmtcs.5153 Tuza's Conjecture for Threshold Graphs Author(s): Marthe Bonamy, Łukasz Bożyk, Andrzej Grzesik, Meike Hatzel, Tomáš Masařík, Jana Novotná, Karolina Okrasa Published in: Discrete Mathematics & Theoretical Computer Science, Issue 13658050, 2022, ISSN 1365-8050 Publisher: Maison de l'informatique et des mathematiques discretes DOI: 10.46298/dmtcs.7660 Linear Bounds for Cycle-free Saturation Games Author(s): Sean English, Tomáš Masařík, Grace McCourt, Erin Meger, Michael S. Ross, Sam Spiro Published in: Electronic Journal of Combinatorics, Issue 10778926, 2022, ISSN 1077-8926 Publisher: Electronic Journal of Combinatorics DOI: 10.37236/10808 Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs Author(s): Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, Bartosz Walczak Published in: Algorithmica, Issue 83/8, 2021, Page(s) 2634-2650, ISSN 0178-4617 Publisher: Springer Verlag DOI: 10.1007/s00453-020-00745-z A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs Author(s): Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk Published in: SIAM Journal on Computing, Issue 00975397, 2022, Page(s) 254-289, ISSN 0097-5397 Publisher: Society for Industrial and Applied Mathematics DOI: 10.1137/19m1304088 Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs Author(s): Thomas Bellitto, Tereza Klimosová, Martin Merker, Marcin Witkowski, Yelena Yuditsky Published in: Graphs and Combinatorics, Issue 09110119, 2021, Page(s) 2595–2599, ISSN 0911-0119 Publisher: Springer Verlag DOI: 10.1007/s00373-021-02380-z EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs Author(s): Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Paweł Rzążewski, Florian Sikora, Stéphan Thomassé Published in: Journal of the ACM, Issue 68/2, 2021, Page(s) 1-38, ISSN 0004-5411 Publisher: Association for Computing Machinary, Inc. DOI: 10.1145/3433160 Threshold Treewidth and Hypertree Width Author(s): Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider Published in: Journal of Artificial Intelligence Research, Issue 10769757, 2022, ISSN 1076-9757 Publisher: Morgan Kaufmann Publishers, Inc. DOI: 10.1613/jair.1.13661 Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory Author(s): Julien Baste, Michael R. Fellows, Lars Jaffke, Tomáš Masařík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond Published in: Artificial Intelligence, Issue 00043702, 2022, ISSN 0004-3702 Publisher: Elsevier BV DOI: 10.1016/j.artint.2021.103644 Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs Author(s): Karolina Okrasa, Paweł Rzaͅżewski Published in: SIAM Journal on Computing, Issue 50/2, 2021, Page(s) 487-508, ISSN 0097-5397 Publisher: Society for Industrial and Applied Mathematics DOI: 10.1137/20m1320146 Matchings under Preferences: Strength of Stability and Tradeoffs Author(s): Jiehua Chen, Piotr Skowron, Manuel Sorge Published in: ACM Transactions on Economics and Computation, Issue 21678375, 2021, Page(s) 20:1-55, ISSN 2167-8375 Publisher: ACM DOI: 10.1145/3485000 h -Index manipulation by undoing merges Author(s): René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh Published in: Quantitative Science Studies, Issue 1/4, 2020, Page(s) 1529-1552, ISSN 2641-3337 Publisher: MIT DOI: 10.1162/qss_a_00093 Conference proceedings (55) The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width Author(s): Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov Published in: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Page(s) 66:1--66:20 Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.icalp.2022.66 U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited Author(s): Jan Kratochvíl, Tomás Masarík, Jana Novotná Published in: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), 2020, Page(s) 57:1--57:14 Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.mfcs.2020.57 Tuza’s Conjecture for Threshold Graphs Author(s): Marthe Bonamy, Łukasz Bożyk, Andrzej Grzesik, Meike Hatzel, Tomáš Masařík, Jana Novotná, Karolina Okrasa Published in: Extended Abstracts EuroComb 2021 - European Conference on Combinatorics, Graph Theory and Applications, Issue 14, 2021, Page(s) 765-771, ISBN 978-3-030-83822-5 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-83823-2_122 Close Relatives (Of Feedback Vertex Set), Revisited Author(s): Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk Published in: 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, 2021, Page(s) 21:1-21:15 Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.ipec.2021.21 Vertex Deletion into Bipartite Permutation Graphs Author(s): Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa Published in: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020, Page(s) 5:1--5:16 Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.ipec.2020.5 On 3-Coloring of $$(2P_4,C_5)$$-Free Graphs Author(s): Vít Jelínek, Tereza Klimošová, Tomáš Masařík, Jana Novotná, Aneta Pokorná Published in: Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers, Issue 12911, 2021, Page(s) 388-401, ISBN 978-3-030-86837-6 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-86838-3_30 Compact Representation for Matrices of Bounded Twin-Width Author(s): Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz Published in: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, 2022, Page(s) 52:1--52:14 Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.stacs.2022.52 Approximating Pathwidth for Graphs of Small Treewidth Author(s): Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 1965-1976, ISBN 978-1-61197-646-5 Publisher: Society for Industrial and Applied Mathematics DOI: 10.1137/1.9781611976465.117 Efficient fully dynamic elimination forests with applications to detecting long paths and cycles Author(s): Jiehua Chen, Wojciech Czerwiński, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michał Pilipczuk, Manuel Sorge, Bartłomiej Wróblewski, Anna Zych-Pawlewicz Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 796-809, ISBN 978-1-61197-646-5 Publisher: Society for Industrial and Applied Mathematics DOI: 10.1137/1.9781611976465.50 Cluster Editing Parameterized Above Modification-Disjoint P3-Packings Author(s): Shaohua Li, Marcin Pilipczuk, Manuel Sorge Published in: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, 2021, Page(s) 49:1--49:16 Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.stacs.2021.49 Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View Author(s): Radek Hušek, Dušan Knop,Tomáš Masařík Published in: 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020, Page(s) 16:1--16:18 Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.ipec.2020.16 On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy Author(s): Gabriel L. Duarte, Uéverton S. Souza Published in: Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, 2022, Page(s) 187-200, ISBN 978-3-031-15913-8 Publisher: Springer DOI: 10.1007/978-3-031-15914-5_14 Hardness of Metric Dimension in Graphs of Constant Treewidth Author(s): Shaohua Li, Marcin Pilipczuk Published in: 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, 2021, Page(s) 24:1-24:13 Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.ipec.2021.24 Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor Author(s): Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh Published in: STOC'22: 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, Page(s) 914-923 Publisher: ACM DOI: 10.1145/3519935.3520076 The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth Author(s): Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki Published in: 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, 2020, Page(s) 37:1--37:18 Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.ipec.2020.37 Computing List Homomorphisms in Geometric Intersection Graphs Author(s): Sándor Kisfaludi-Bak, Karolina Okrasa, Paweł Rzążewski Published in: Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, 2022, Page(s) 313-327 Publisher: Springer DOI: 10.1007/978-3-031-15914-5_23 Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory Author(s): Julien Baste, Michael R. Fellows, Lars Jaffke, Tomáš Masařík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond Published in: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Page(s) 1119-1125, ISBN 978-0-9992411-6-5 Publisher: International Joint Conferences on Artificial Intelligence Organization DOI: 10.24963/ijcai.2020/156 Threshold Treewidth and Hypertree Width Author(s): Robert Ganian, Andre Schidler, Manuel Sorge, Stefan Szeider Published in: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Page(s) 1898-1904, ISBN 978-0-9992411-6-5 Publisher: International Joint Conferences on Artificial Intelligence Organization DOI: 10.24963/ijcai.2020/263 Complexity of the List Homomorphism Problem in Hereditary Graph Classes Author(s): Karolina Okrasa, Paweł Rzążewski Published in: 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), 2021, Page(s) 54:1--54:17 Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.stacs.2021.54 Determining 4-Edge-Connected Components in Linear Time Author(s): Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokolowski Published in: 29th Annual European Symposium on Algorithms (ESA 2021), 2021, Page(s) 71:1--71:15 Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.esa.2021.71 Constant Congestion Brambles in Directed Graphs Author(s): Tomáš Masařík, Marcin Pilipczuk, Paweł Rzążewski, Manuel Sorge Published in: Extended Abstracts EuroComb 2021 - European Conference on Combinatorics, Graph Theory and Applications, Issue 14, 2021, Page(s) 318-324, ISBN 978-3-030-83822-5 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-83823-2_50 Induced subgraphs of bounded treewidth and the container method Author(s): Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Paweł Rzążewski, Paul Seymour Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 1948-1964, ISBN 978-1-61197-646-5 Publisher: Society for Industrial and Applied Mathematics DOI: 10.1137/1.9781611976465.116 Perfect Matching Cuts Partitioning a Graph into Complementary Subgraphs Author(s): Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento, Uéverton S. Souza Published in: Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, 2022, Page(s) 257-269 Publisher: Springer DOI: 10.1007/978-3-031-06678-8_19 Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs Author(s): Hugo Jacob, Marcin Pilipczuk Published in: Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, 2022, Page(s) 287-299 Publisher: Springer DOI: 10.1007/978-3-031-15914-5_21 Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial time Author(s): Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, Page(s) 330-341, ISBN 9781450380539 Publisher: ACM DOI: 10.1145/3406325.3451034 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 Publisher: Springer 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 Publisher: IEEE 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 Publisher: Springer 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 Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 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 Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 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 Publisher: Charles University 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 Publisher: LIPIcs 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, ISBN 9781-450367929 Publisher: ACM Press 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 Publisher: LIPIcs 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 Publisher: LIPIcs 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 Publisher: LIPIcs 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 Publisher: LIPIcs 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 Publisher: ACM 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 Publisher: IEEE 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 Publisher: LIPIcs 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 Publisher: Springer 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 Publisher: LIPIcs DOI: 10.4230/lipics.mfcs.2017.65 The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs Author(s): Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge Published in: 31st International Symposium on Algorithms and Computation, ISAAC 2020, Issue 181, 2020, Page(s) 59:1--59:15 Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.isaac.2020.59 Sparsification Lower Bounds for List H-Coloring Author(s): Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski Published in: 31st International Symposium on Algorithms and Computation (ISAAC 2020), 2020, Page(s) 58:1--58:17 Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.isaac.2020.58 Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths Author(s): Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski Published in: 4th Symposium on Simplicity in Algorithms, SOSA 2021, 2021, Page(s) 204--209, ISBN 978-1-61197-649-6 Publisher: SIAM DOI: 10.1137/1.9781611976496.23 Reducing the Vertex Cover Number via Edge Contractions Author(s): Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale Published in: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, 2022, Page(s) 69:1--69:14 Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.mfcs.2022.69 Solving hard cut problems via flow-augmentation Author(s): Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 149-168, ISBN 978-1-61197-646-5 Publisher: Society for Industrial and Applied Mathematics DOI: 10.1137/1.9781611976465.11 Many Visits TSP Revisited Author(s): Lukasz Kowalik, Shaohua Li, Wojciech Nadara, Marcin Smulewicz, Magnus Wahlström Published in: 28th Annual European Symposium on Algorithms (ESA 2020), 2020, Page(s) 66:1--66:22 Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.esa.2020.66 Polynomial Kernel for Immersion Hitting in Tournaments Author(s): Łukasz Bożyk, Michał Pilipczuk Published in: 30th Annual European Symposium on Algorithms (ESA 2022), 2022, Page(s) 26:1-26:17 Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.esa.2022.26 Computing Treedepth in Polynomial Space and Linear FPT Time Author(s): Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz Published in: 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Page(s) 79:1--79:14 Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.esa.2022.79 Directed flow-augmentation Author(s): Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström Published in: STOC'22: 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, Page(s) 938-947 Publisher: ACM DOI: 10.1145/3519935.3520018 Optimal Discretization is Fixed-parameter Tractable Author(s): Stefan Kratsch, Tomáš Masařík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 1702-1719, ISBN 978-1-61197-646-5 Publisher: Society for Industrial and Applied Mathematics DOI: 10.1137/1.9781611976465.103 Taming Graphs with No Large Creatures and Skinny Ladders Author(s): Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza Published in: 30th Annual European Symposium on Algorithms, ESA 2022, 2022, Page(s) 58:1-58:8 Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.esa.2022.58 Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument Author(s): Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski Published in: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 2022, Page(s) 93:1-93:19 Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.icalp.2022.93 Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs Author(s): Karolina Okrasa, Marta Piecyk, Paweł Rzążewski Published in: 28th Annual European Symposium on Algorithms (ESA 2020), 2020, Page(s) 74:1--74:24 Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik DOI: 10.4230/lipics.esa.2020.74 Book chapters (1) 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, ISBN 978-3-030-17401-9 Publisher: Springer International Publishing DOI: 10.1007/978-3-030-17402-6_9 Searching for OpenAIRE data... There was an error trying to search data from OpenAIRE No results available
