You are not logged in | Log in

Marcin Pilipczuk

Number of publications: 152

2023

Lars Jaffke, Paloma Thomé de Lima, Tomáš Masařík , Marcin Pilipczuk , Uéverton Dos Santos Souza, A tight quasi-polynomial bound for Global Label Min-Cut, Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Florencja, Italy, 22 January 2023 - 25 January 2023. See in PBN
Meike Hatzel, Lars Jaffke, Paloma Thomé de Lima, Tomáš Masařík , Marcin Pilipczuk , Roohani Sharma, Manuel Sorge, Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation, Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Florencja, Italy, 22 January 2023 - 25 January 2023. See in PBN
Eun Jung, Stefan Kratsch, Marcin Pilipczuk , Magnus Wahlstr{\"{o}}m, Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints, 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Florencja, Italy, 22 January 2023 - 25 January 2023. 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
Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk , Michał Pilipczuk , Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1*, 64th IEEE Annual Symposium on Foundations of Computer Science, Santa Cruz, the United States of America, 6 November 2023 - 9 November 2023. See in PBN
Linda Cook, Tomáš Masařík , Marcin Pilipczuk , Amadeus Reinald, Uéverton Dos Santos Souza, Proving a Directed Analogue of the Gyárfás-Sumner Conjecture for Orientations of $P_4$, The Electronic Journal of Combinatorics, 30 (3) 2023, p. 1-27. See in PBN
Linda Cook, Tomáš Masařík , Marcin Pilipczuk , Amadeus Reinald, Uéverton Dos Santos Souza, Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P4, European Conference on Combinatorics, Graph Theory and Applications, European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'23), Praha, Czechia, 28 August 2023 - 1 September 2023. See in PBN
Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk , Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms, The Influence of Dimensions on the Complexity of Computing Decision Trees, Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Washington, the United States of America, 7 February 2023 - 14 February 2023, 37 (7) 2023, p. 8343-8350. See in PBN

2022

Dániel Marx, Marcin Pilipczuk , Michał Pilipczuk , A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs, SIAM Journal on Computing, 51 (2) 2022, p. 254-289. See in PBN
Hugo Jacob, Marcin Pilipczuk , Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs, Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tuebingen, Germany, 22 June 2022 - 24 June 2022, 13453 2022, p. 287--299. See in PBN
Meike Hatzel, Pawel Komosa, Marcin Pilipczuk , Manuel Sorge, Constant Congestion Brambles, Discrete Mathematics and Theoretical Computer Science, vol. 24, no. 1 (Graph Theory) 2022. See in PBN
Tomáš Masařík , Marcin Pilipczuk , Paweł Rzążewski , Manuel Sorge, Constant Congestion Brambles in Directed Graphs, SIAM Journal on Discrete Mathematics, 36 (2) 2022, p. 922-938. See in PBN
Eun Jung, Stefan Kratsch, Marcin Pilipczuk , Magnus Wahlstr{\"{o}}m, Directed flow-augmentation, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rzym, Italy, 20 June 2022 - 24 June 2022. See in PBN
Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rzym, Italy, 20 June 2022 - 24 June 2022. See in PBN
Shaohua Li, Marcin Pilipczuk , Hardness of Metric Dimension in Graphs of Constant Treewidth, Algorithmica, 84 2022, p. 3110--3155. See in PBN
Konrad Majewski , Tomáš Masařík , Jana Masaříková , Karolina Okrasa, Marcin Pilipczuk , Paweł Rzążewski , Marek Sokołowski , Max weight independent set in graphs with no long claws: An analog of the Gyárfás' path argument, Leibniz International Proceedings in Informatics, LIPIcs, 49th International Colloquium on Automata, Languages and Programming, Paris, France, 4 July 2022 - 8 July 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
Tomáš Masařík , Irene Muzi, Marcin Pilipczuk , Paweł Rzążewski , Manuel Sorge, Packing Directed Cycles Quarter- and Half-Integrally, Combinatorica, 42 (S2) 2022, p. 1409-1438. See in PBN
Marek Cygan , Jesper Nederlof, Marcin Pilipczuk , Johan M. M. Van Rooij, Jakub Onufry Wojtaszczyk, Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time, ACM Transactions on Algorithms, 18 (2) 2022, p. 1-31. See in PBN
Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering, SIAM Journal on Computing, 51 (6) 2022, p. 1866-1930. See in PBN
Jakub Gajarský , Lars Jaffke, Paloma T., Jana Novotná, Marcin Pilipczuk , Paweł Rzążewski , Uéverton S., Taming Graphs with No Large Creatures and Skinny Ladders, 2022. See in PBN
Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk , Manuel Sorge, The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs, Algorithmica, 85 (5) 2022, p. 1202-1250. See in PBN

2021

Shaohua Li, Marcin Pilipczuk , Manuel Sorge, Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings, 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 16 March 2021 - 19 March 2021. See in PBN
Tomáš Masařík , Marcin Pilipczuk , Paweł Rzążewski , Manuel Sorge, Constant Congestion Brambles in Directed Graphs, European Conference on Combinatorics, Graph Theory and Appliations 2021, Barcelona, Spain, 6 September 2021 - 10 September 2021. See in PBN
Andrzej Grzesik, Tereza Klimošová, Marcin Pilipczuk , Michał Pilipczuk , Covering minimal separators andpotential maximal cliques in $P_{t}$-free graphs, Electronic Journal of Combinatorics, 28 (1) 2021. See in PBN
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 , Efficient fully dynamic elimination forests with applications to detecting long paths and cycles, the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, Virginia (Virtual Conference), the United States of America, 10 January 2021 - 13 January 2021. See in PBN
Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Paweł Rzążewski , Finding large induced sparse subgraphs in C>t -free graphs in quasipolynomial time, 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual, Italy, 21 June 2021 - 25 June 2021. See in PBN
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
Wojciech Czerwiński , Wojciech Nadara , Marcin Pilipczuk , Improved Bounds for the Excluded-Minor Approximation of Treedepth, SIAM Journal on Discrete Mathematics, 35 (2) 2021, p. 934-947. See in PBN
Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk , Paweł Rzążewski , Paul Seymour, Induced subgraphs of bounded treewidth and the container method, the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, Virginia (Virtual Conference), the United States of America, 10 January 2021 - 13 January 2021. See in PBN
Marthe Bonamy, François Dross, Tomáš Masařík , Andrea Munaro, Wojciech Nadara , Marcin Pilipczuk , Michał Pilipczuk , Jones' Conjecture in Subcubic Graphs, Electronic Journal of Combinatorics, 28 (4) 2021, p. P4.5: 1-12. See in PBN
Stefan Kratsch, Tomáš Masařík , Irene Muzi, Marcin Pilipczuk , Manuel Sorge, Optimal Discretization is Fixed-parameter Tractable, the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, Virginia (Virtual Conference), the United States of America, 10 January 2021 - 13 January 2021. See in PBN
Marcin Pilipczuk , Michał Pilipczuk , Paweł Rzążewski , Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths, 4th Symposium on Simplicity in Algorithms, Alexandria, VA, the United States of America, 11 January 2021 - 12 January 2021. See in PBN
Marek Cygan , Paweł Komosa, Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Magnus Wahlström, Randomized Contractions Meet Lean Decompositions, ACM Transactions on Algorithms, 17 (1) 2021, p. 1948-1964. See in PBN
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk , Magnus Wahlström, Solving hard cut problems via flow-augmentation*, the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), Alexandria, Virginia (Virtual Conference), the United States of America, 10 January 2021 - 13 January 2021. See in PBN
Marcin Pilipczuk , Ni Luh Dewi Sintiari, Stéphan Thomassé, Nicolas Trotignon, (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth, Journal of Graph Theory, 97 (4) 2021, p. 624-641. See in PBN

2020

Marcin Pilipczuk , Manuel Sorge, A Double Exponential Lower Bound for the Distinct Vectors Problem, Discrete Mathematics and Theoretical Computer Science, 22 (4) 2020. See in PBN
Shaohua Li, Marcin Pilipczuk , An Improved FPT Algorithm for Independent Feedback Vertex Set, Theory of Computing Systems, 64 (8) 2020, p. 1317-1330. See in PBN
Maria Chudnovsky, Marcin Pilipczuk , Michał Pilipczuk , Stéphan Thomassé, On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five, SIAM Journal on Discrete Mathematics, 34 (2) 2020, p. 1472-1483. See in PBN
Jeremy Kun, Michael P. O’Brien, Marcin Pilipczuk , Blair D. Sullivan, Polynomial Treedepth Bounds in Linear Colorings, Algorithmica, 83 (1) 2020, p. 361-386. See in PBN
Maria Chudnovsky, Marcin Pilipczuk , Michał Pilipczuk , Stéphan Thomassé, Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs, 31st ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, the United States of America, 5 January 2020 - 8 January 2020. See in PBN
Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk , Manuel Sorge, The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs, 31st International Symposium on Algorithms and Computation, online, Hong Kong, 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
Lo{\"{\i}}c Dubois, Gwena{\"{e}}l Joret, Guillem Perarnau, Marcin Pilipczuk , Fran{\c{c}}ois Pitois, Two lower bounds for p-centered colorings, Discrete Mathematics and Theoretical Computer Science, 22 2020. See in PBN

2019

Nikolai Karpov, Marcin Pilipczuk , Anna Zych-Pawlewicz , An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs, Algorithmica, 81 (10) 2019, p. 4029-4042. See in PBN
Tomasz Kociumaka, Marcin Pilipczuk , Deleting Vertices to Graphs of Bounded Genus, Algorithmica, 81 (9) 2019, p. 3655-3691. See in PBN
Marcin Pilipczuk , Michał Pilipczuk , Marcin Wrochna , Edge Bipartization Faster than 2^k, Algorithmica, 81 (3) 2019, p. 917–966. See in PBN
Wojciech Czerwiński , Wojciech Nadara , Marcin Pilipczuk , Improved Bounds for the Excluded-Minor Approximation of Treedepth, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019, 144 2019, p. 34:1--34:13. See in PBN
Marek Cygan , Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Minimum Bisection Is Fixed-Parameter Tractable, SIAM Journal on Computing, 48 (2) 2019, p. 417-450. See in PBN
Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk , Magnus Wahlström, Multi-budgeted Directed Cuts, Algorithmica, 82 (8) 2019, p. 2135-2155. See in PBN
Tomáš Masařík , Irene Muzi, Marcin Pilipczuk , Paweł Rzążewski , Manuel Sorge, Packing Directed Circuits Quarter-Integrally, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019. See in PBN
Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk , Zsolt Tuza, Erik Jan van Leeuwen, Subexponential-Time Algorithms for Maximum Independent Set in Pt -Free and Broom-Free Graphs, Algorithmica, 81 (2) 2019, p. 421-438. See in PBN
Bart M. P. Jansen, Marcin Pilipczuk , Marcin Wrochna , Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor, Algorithmica, 81 (10) 2019, p. 3936-3967. 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
Shaohua Li, Marcin Pilipczuk , An Improved FPT Algorithm for Independent Feedback Vertex Set, 44th International Workshop on Graph-Theoretic Concepts in Computer, Cottbus, Germany, 27 June 2018 - 29 June 2018. See in PBN
Anita Liebenau, Marcin Pilipczuk , Paul Seymour, Sophie Spirkl, Caterpillars in Erdős–Hajnal, Journal of Combinatorial Theory. Series B, 2018. See in PBN
Marcin Pilipczuk , Magnus Wahlström, Directed Multicut is W[1]-hard, Even for Four Terminal Pairs, ACM Transactions on Computation Theory, 10 (3) 2018, p. 1–18. See in PBN
Wojciech Nadara , Marcin Pilipczuk , Roman Rabinovich, Felix Reidl, Sebastian Siebertz, Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness, 17th International Symposium on Experimental Algorithms, L'Aquila, Italy, 27 June 2018 - 29 June 2018. See in PBN
Krzysztof Choromanski, Dvir Falik, Anita Liebenau, Viresh Patel, Marcin Pilipczuk , Excluding Hooks and their Complements, Electronic Journal of Combinatorics, 25 (3) 2018, p. P3.27:1 - P3.27: 33. See in PBN
Krzysztof Kiljan, Marcin Pilipczuk , Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set, 17th International Symposium on Experimental Algorithms, L'Aquila, Italy, 27 June 2018 - 29 June 2018. See in PBN
Marcin Pilipczuk , Michał Ziobro, Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation, 17th International Symposium on Experimental Algorithms, L'Aquila, Italy, 27 June 2018 - 29 June 2018. See in PBN
Daniel Lokshtanov, Marcin Pilipczuk , Erik Jan van Leeuwen, Independence and Efficient Domination on P_6-free Graphs, ACM Transactions on Algorithms, 14 (1) 2018, p. 3:1-3:30. See in PBN
Marcin Pilipczuk , Michał Pilipczuk , Piotr Sankowski , Erik Jan van Leeuwen, Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs, ACM Transactions on Algorithms, 14 (4) 2018, p. 53:1-53:73. See in PBN
Daniel Marx, Marcin Pilipczuk , Michał Pilipczuk , On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs, 59th Annual IEEE Symposium on Foundations of Computer Science, Paris, France, 7 October 2018 - 9 October 2018. See in PBN
Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk , Michał Pilipczuk , Subexponential Parameterized Algorithm for Interval Completion, ACM Transactions on Algorithms, 14 (3) 2018, p. 35:1-35:62. 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

Marcin Pilipczuk , A tight lower bound for Vertex Planarization on graphs of bounded treewidth, Discrete Applied Mathematics, 231 2017, p. 211-216. See in PBN
Bart M. P. Jansen, Marcin Pilipczuk , Approximation and Kernelization for Chordal Vertex Deletion, 28th ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 16 January 2017 - 19 January 2017. 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
Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth, SIAM Journal on Computing, 46 (1) 2017, p. 161–189. See in PBN
Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk , Michał Pilipczuk , Hardness of Approximation for Strip Packing, ACM Transactions on Computation Theory, 9 (3) 2017, p. 14:1-7. See in PBN
Marek Cygan , Daniel Marx, Marcin Pilipczuk , Michał Pilipczuk , Hitting forbidden subgraphs in graphs of bounded treewidth, Information and Computation, 256 2017, p. 62-82. See in PBN
Daniel Marx, Marcin Pilipczuk , Subexponential Parameterized Algorithms for Graphs of Polynomial Growth, 25th Annual European Symposium on Algorithms, Vienna, Austria, 4 September 2017 - 6 September 2017. See in PBN

2016

Anudhyan Boral, Marek Cygan , Tomasz Kociumaka, Marcin Pilipczuk , A Fast Branching Algorithm for Cluster Vertex Deletion, Theory of Computing Systems, 2016. See in PBN
Chandra Chekuri, Alina Ene, Marcin Pilipczuk , Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs, 43rd International Colloquium on Automata, Languages, and Programming, Rzym, Italy, 11 July 2016 - 15 July 2016. See in PBN
Rajesh Chitnis, Marek Cygan , MohammadTaghi Hajiaghayi, Marcin Pilipczuk , Michał Pilipczuk , Designing FPT Algorithms for Cut Problems Using Randomized Contractions, SIAM Journal on Computing, 2016. See in PBN
Marcin Pilipczuk , Magnus Wahlström, Directed multicut is W[1]-hard, even for four terminal pairs, Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, the United States of America, 10 January 2016 - 12 January 2016. See in PBN
Erik Jan van Leeuwen, Daniel Lokshtanov, Marcin Pilipczuk , Independence and Efficient Domination on P6-free Graphs, Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, the United States of America, 10 January 2016 - 12 January 2016. See in PBN
Paal Gronaas Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Felix Reidl, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar, Fernando S\'anchez Villaamil, Kernelization and Sparseness: the Case of Dominating Set, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), Orlean, France, 17 February 2016 - 20 February 2016. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Known Algorithms for Edge Clique Cover are Probably Optimal, SIAM Journal on Computing, 2016. See in PBN
Marek Cygan , Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Lower Bounds for Approximation Schemes for Closest String, 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland, 2016. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , On Group Feedback Vertex Set Parameterized by the Size of the Cutset, Algorithmica, 2016. See in PBN
Alina Ene, Matthias Mnich, Marcin Pilipczuk , Andrej Risteski, On Routing Disjoint Paths in Bounded Treewidth Graphs, 15th Scandinavian Symposium and Workshops on Algorithm Theory, Reykjavik, Iceland, 22 June 2016 - 24 June 2016. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Marcin Wrochna , Erik Jan van Leeuwen, Polynomial Kernelization for Removing Induced Claws and Diamonds, Theory of Computing Systems, 2016. See in PBN
Marek Cygan , Erik Jan van Leeuwen, Marcin Pilipczuk , Michał Pilipczuk , Marcin Wrochna , Polynomial Kernelization for Removing Induced Claws and Diamonds, 41st International Workshop on Graph-Theoretic Concepts in Computer Science, Garching, Germany, 17 June 2015 - 19 June 2015. See in PBN
Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk , Michał Pilipczuk , Subexponential parameterized algorithm for Interval Completion, Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, the United States of America, 10 January 2016 - 12 January 2016. See in PBN
Fedor V. Fomin, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering, IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, New Brunswick, the United States of America, 9 October 2016 - 11 January 2017. See in PBN

2015

Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk , Michał Pilipczuk , A Subexponential Parameterized Algorithm for Proper Interval Completion, SIAM Journal on Discrete Mathematics, 2015. See in PBN
Marek Cygan , Marcin Pilipczuk , Faster exponential-time algorithms in graphs of bounded average degree, Information and Computation, 2015. See in PBN
Stefan Kratsch, Marcin Pilipczuk , Michał Pilipczuk , Magnus Wahlström, Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs, SIAM Journal on Discrete Mathematics, 2015. See in PBN
Marek Cygan , Fedor Fomin, Łukasz Kowalik , Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Parameterized Algorithms, 2015. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Onufry Wojtaszczyk, Sitting Closer to Friends than Enemies, Revisited, Theory of Computing Systems, 2015. See in PBN
Jakub Oćwieja, Marcin Pilipczuk , Piotr Sankowski , Anna Zych-Pawlewicz , Jakub Łącki, The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree, Forty-Seventh Annual ACM on Symposium on Theory of Computing, Portland, the United States of America, 14 June 2015 - 17 June 2015. See in PBN

2014

Anudhyan Boral, Marek Cygan , Tomasz Kociumaka, Marcin Pilipczuk , A Fast Branching Algorithm for Cluster Vertex Deletion, 9th International Computer Science Symposium in Russia, Moscow, the Russian Federation, 7 June 2014 - 11 June 2014. See in PBN
Ivan Bliznets, Fedor Fomin, Marcin Pilipczuk , Michał Pilipczuk , A Subexponential Parameterized Algorithm for Proper Interval Completion, 22th Annual European Symposium on Algorithms, Wrocław, Poland, 8 September 2014 - 10 September 2014. See in PBN
Marek Cygan , Stefan Kratsch, Marcin Pilipczuk , Michał Pilipczuk , Magnus Wahlström, Clique Cover and Graph Separation: New Incompressibility Results, ACM Transactions on Computation Theory, 2014. See in PBN
Tomasz Kociumaka, Marcin Pilipczuk , Faster deterministic Feedback Vertex Set, Information Processing Letters, 2014. See in PBN
Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth, 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, the United States of America, 18 October 2014 - 21 October 2014. See in PBN
Marek Cygan , Dániel Marx, Marcin Pilipczuk , Michał Pilipczuk , Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth, Mathematical Foundations of Computer Science 2014 - 39th International Symposium, Budapest, Hungary, 25 August 2014 - 29 August 2014. See in PBN
Marek Cygan , Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, Minimum bisection is fixed parameter tractable, Symposium on Theory of Computing, STOC 2014, New York, the United States of America, 31 May 2014 - 3 June 2014. See in PBN
Marcin Pilipczuk , Michał Pilipczuk , Piotr Sankowski , Erik Jan van Leeuwen, Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs, 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, the United States of America, 18 October 2014 - 21 October 2014. See in PBN
Marek Cygan , Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, On Cutwidth Parameterized by Vertex Cover, Algorithmica, 2014. See in PBN
Marek Cygan , Daniel Lokshtanov, Marcin Pilipczuk , Michał Pilipczuk , Saket Saurabh, On the Hardness of Losing Width, Theory of Computing Systems, 2014. See in PBN
Marek Cygan , Dániel Marx, Marcin Pilipczuk , Michał Pilipczuk , Ildikó Schlotter, Parameterized Complexity of Eulerian Deletion Problems, Algorithmica, 2014. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Scheduling Partially Ordered Jobs Faster than 2^n, Algorithmica, 2014. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n, Algorithmica, 2014. See in PBN
Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk , Michał Pilipczuk , Yngve Villanger, Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters, Journal of Computer and System Sciences, 2014. See in PBN

2013

Marek Cygan , Marcin Pilipczuk , Riste Skrekovski, A bound on the number of perfect matchings in Klee-graphs, Discrete Mathematics and Theoretical Computer Science, 2013. See in PBN
Marek Cygan , Marcin Pilipczuk , Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree, Automata, Languages, and Programming - 40th International Colloquium, Riga, Latvia, 8 July 2013 - 12 July 2013. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Known algorithms for EDGE CLIQUE COVER are probably optimal, Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, the United States of America, 6 January 2013 - 8 January 2013. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, On multiway cut parameterized above lower bounds, ACM Transactions on Computation Theory, 2013. See in PBN
Marek Cygan , Marcin Pilipczuk , Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms, Information Processing Letters, 2013. See in PBN
Marcin Pilipczuk , Michał Pilipczuk , Piotr Sankowski , Erik Jan van Leeuwen, Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs, 30th International Symposium on Theoretical Aspects of Computer Science, Kiel, Germany, 27 February 2013 - 2 March 2013. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, SIAM Journal on Discrete Mathematics, 2013. See in PBN
Marek Cygan , Dániel Marx, Marcin Pilipczuk , Michał Pilipczuk , The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable, 54th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, the United States of America, 26 October 2013 - 29 October 2013. See in PBN
Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk , Michał Pilipczuk , Yngve Villanger, Tight bounds for Parameterized Complexity of Cluster Editing, 30th International Symposium on Theoretical Aspects of Computer Science, Kiel, Germany, 27 February 2013 - 2 March 2013. See in PBN
Łukasz Kowalik , Marcin Pilipczuk , Karol Suchan, Towards optimal kernel for connected vertex cover in planar graphs, Discrete Applied Mathematics, 2013. See in PBN

2012

Marek Cygan , Fabrizio Grandoni, Stefano Leonardi, Marcin Pilipczuk , Piotr Sankowski , A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees, Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, 10 September 2012 - 12 September 2012. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More), SIAM Journal on Computing, 2012. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion, Algorithmica, 2012. See in PBN
Marek Cygan , Marcin Pilipczuk , Bandwidth and distortion revisited, Discrete Applied Mathematics, 2012. See in PBN
Marek Cygan , Stefan Kratsch, Marcin Pilipczuk , Michał Pilipczuk , Magnus Wahlström, Clique Cover and Graph Separation: New Incompressibility Results, Automata, Languages, and Programming - 39th International Colloquium, Warwick, the United Kingdom of Great Britain and Northern Ireland, 9 July 2012 - 13 July 2012. See in PBN
Rajesh Hemant Chitnis, Marek Cygan , MohammadTaghi Hajiaghayi, Marcin Pilipczuk , Michał Pilipczuk , Designing FPT Algorithms for Cut Problems Using Randomized Contractions, 53rd Annual IEEE Symposium on Foundations of Computer Science, New Brunswick, the United States of America, 20 October 2012 - 23 October 2012. See in PBN
Marek Cygan , Marcin Pilipczuk , Even Faster Exact Bandwidth, ACM Transactions on Algorithms, 2012. See in PBN
Marcin Pilipczuk , Michał Pilipczuk , Finding a Maximum Induced Degenerate Subgraph Faster Than 2^n, Parameterized and Exact Computation - 7th International Symposium, Ljubljana, Slovenia, 12 September 2012 - 14 September 2012. See in PBN
Stefan Kratsch, Marcin Pilipczuk , Michał Pilipczuk , Magnus Wahlström, Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs, Automata, Languages, and Programming - 39th International Colloquium, Warwick, the United Kingdom of Great Britain and Northern Ireland, 9 July 2012 - 13 July 2012. See in PBN
Stefan Kratsch, Marcin Pilipczuk , Ashutosh Rai, Venkatesh Raman, Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs, Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, 4 July 2012 - 6 July 2012. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Kernelization hardness of connectivity problems in d-degenerate graphs, Discrete Applied Mathematics, 2012. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , On Group Feedback Vertex Set Parameterized by the Size of the Cutset, Graph-Theoretic Concepts in Computer Science - 38th International Workshop, Jerusalem, Israel, 26 June 2012 - 28 June 2012. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Sitting Closer to Friends Than Enemies, Revisited, Mathematical Foundations of Computer Science 2012 - 37th International Symposium, Bratislava, Slovakia, 27 August 2012 - 31 August 2012. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n, LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, 16 April 2012 - 20 April 2012. See in PBN
Marcin Pilipczuk , Michał Pilipczuk , Riste Skrekovski, Some results on Vizing's conjecture and related problems, Discrete Applied Mathematics, 2012. See in PBN

2011

Marek Cygan , Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha , Marcin Pilipczuk , Piotr Sankowski , Approximation Algorithms for Union and Intersection Covering Problems, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Mumbai, India, 12 December 2011 - 14 December 2011. See in PBN
Daniel Binkele-Raible, Ljiljana Brankovic, Marek Cygan , Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Marcin Pilipczuk , Peter Rossmanith, Jakub Wojtaszczyk, Breaking the 2^n-barrier for Irredundance: Two lines of attack, Journal of Discrete Algorithms, 2011. See in PBN
Marek Cygan , Marcin Pilipczuk , Jakub Wojtaszczyk, Capacitated domination faster than O(2^n), Information Processing Letters, 2011. See in PBN
Marcin Pilipczuk , Characterization of compact subsets of curves with omega-continuous derivatives, Fundamenta Mathematicae, 2011. See in PBN
Marek Cygan , Geevarghese Philip, Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Dominating set is fixed parameter tractable in claw-free graphs, Theoretical Computer Science, 2011. See in PBN
Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk , Riste Skrekovski, On the Zagreb index inequality of graphs with prescribed vertex degrees, Discrete Applied Mathematics, 2011. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Ildiko Schlotter, Parameterized Complexity of Eulerian Deletion Problems, Lecture Notes in Computer Science, 2011. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Scheduling Partially Ordered Jobs Faster Than 2n, Lecture Notes in Computer Science, 2011. See in PBN
Marek Cygan , Jesper Nederlof, Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Johan van Rooij, Solving connectivity problems parameterized by treewidth in single exponential time, IEEE 52nd Annual Symposium on Foundations of Computer Science, Palm Springs, the United States of America, 22 October 2011 - 25 October 2011. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Lecture Notes in Computer Science, 2011. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem), Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, the United States of America, 23 January 2011 - 25 January 2011. See in PBN

2010

Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, An improved FPT algorithm and quadratic kernel for pathwidth one vertex deletion, Lecture Notes in Computer Science, 2010. See in PBN
Marek Cygan , Marcin Pilipczuk , Jakub Wojtaszczyk, Capacitated domination faster than O(2^n), Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, 21 June 2010 - 23 June 2010. See in PBN
Marek Cygan , Marcin Pilipczuk , Exact and approximate bandwidth, Theoretical Computer Science, 2010. See in PBN
Marek Cygan , Marcin Pilipczuk , Jakub Wojtaszczyk, Irredundant set faster than O(2^n), Algorithms and Complexity, 7th International Conference, Rome, Italy, 26 May 2010 - 28 May 2010. See in PBN
Marek Cygan , Marcin Pilipczuk , Michał Pilipczuk , Jakub Wojtaszczyk, Kernelization hardness of connectivity problems in d-degenerate graphs, Graph Theoretic Concepts in Computer Science - 36th International Workshop, Zaros, Greece, 28 June 2010 - 30 June 2010. See in PBN

2009

Marek Cygan, Marcin Pilipczuk , Exact and Approximate Bandwidth, Lecture Notes in Computer Science, 2009. See in PBN

2008

Piotr Hofman , Marcin Pilipczuk , A few new facts about the EKG sequence, Journal of Integer Sequences, 2008. See in PBN
Marcin Pilipczuk , Jakub Wojtaszczyk, The negative association property for the absolute values of random variables equidistributed on a gene ralized Orlicz ball, Positivity, 2008. See in PBN