Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDMarcin Pilipczuk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j72]Dániel Marx, Marcin Pilipczuk
, Michal Pilipczuk:
A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs. SIAM J. Comput. 51(2): 254-289 (2022)- [j71]Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Constant Congestion Brambles in Directed Graphs. SIAM J. Discret. Math. 36(2): 922-938 (2022) - [j70]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs. ACM Trans. Algorithms 18(1): 4:1-4:57 (2022) - [j69]Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk:
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. ACM Trans. Algorithms 18(2): 17:1-17:31 (2022) - [c79]Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski:
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ICALP 2022: 93:1-93:19 - [c78]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. STOC 2022: 914-923 - [c77]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Directed flow-augmentation. STOC 2022: 938-947 - [i89]Hugo Jacob, Marcin Pilipczuk:
Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs. CoRR abs/2201.09749 (2022) - [i88]Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski:
Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument. CoRR abs/2203.04836 (2022) - [i87]Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza:
Taming graphs with no large creatures and skinny ladders. CoRR abs/2205.01191 (2022) - [i86]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. CoRR abs/2205.07756 (2022) - [i85]Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk:
On the Complexity of Problems on Tree-structured Graphs. CoRR abs/2206.11828 (2022) - 2021
- [j68]Jeremy Kun, Michael P. O'Brien, Marcin Pilipczuk, Blair D. Sullivan:
Polynomial Treedepth Bounds in Linear Colorings. Algorithmica 83(1): 361-386 (2021) - [j67]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs. Electron. J. Comb. 28(1): 1 (2021) - [j66]Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk:
Jones' Conjecture in Subcubic Graphs. Electron. J. Comb. 28(4) (2021) - [j65]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. J. Graph Theory 97(4): 624-641 (2021) - [j64]Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk:
Improved Bounds for the Excluded-Minor Approximation of Treedepth. SIAM J. Discret. Math. 35(2): 934-947 (2021) - [j63]Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen:
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. SIAM J. Discret. Math. 35(4): 2387-2429 (2021) - [j62]Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh, Magnus Wahlström:
Randomized Contractions Meet Lean Decompositions. ACM Trans. Algorithms 17(1): 6:1-6:30 (2021) - [c76]Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk:
Close Relatives (Of Feedback Vertex Set), Revisited. IPEC 2021: 21:1-21:15 - [c75]Shaohua Li, Marcin Pilipczuk:
Hardness of Metric Dimension in Graphs of Constant Treewidth. IPEC 2021: 24:1-24:13 - [c74]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Solving hard cut problems via flow-augmentation. SODA 2021: 149-168 - [c73]Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz:
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA 2021: 796-809 - [c72]Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge:
Optimal Discretization is Fixed-parameter Tractable. SODA 2021: 1702-1719 - [c71]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced subgraphs of bounded treewidth and the container method. SODA 2021: 1948-1964 - [c70]Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths. SOSA 2021: 204-209 - [c69]Shaohua Li, Marcin Pilipczuk, Manuel Sorge:
Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. STACS 2021: 49:1-49:16 - [c68]Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Finding large induced sparse subgraphs in c>t -free graphs in quasipolynomial time. STOC 2021: 330-341 - [i84]Shaohua Li, Marcin Pilipczuk:
Hardness of Metric Dimension in Graphs of Constant Treewidth. CoRR abs/2102.09791 (2021) - [i83]Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Constant congestion brambles in directed graphs. CoRR abs/2103.08445 (2021) - [i82]Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk:
Close relatives (of Feedback Vertex Set), revisited. CoRR abs/2106.16015 (2021) - [i81]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Directed flow-augmentation. CoRR abs/2111.03450 (2021) - 2020
- [j61]Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström:
Multi-budgeted Directed Cuts. Algorithmica 82(8): 2135-2155 (2020) - [j60]Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois:
Two lower bounds for $p$-centered colorings. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j59]Marcin Pilipczuk, Manuel Sorge:
A Double Exponential Lower Bound for the Distinct Vectors Problem. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j58]Shaohua Li, Marcin Pilipczuk:
An Improved FPT Algorithm for Independent Feedback Vertex Set. Theory Comput. Syst. 64(8): 1317-1330 (2020) - [j57]Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé:
On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five. SIAM J. Discret. Math. 34(2): 1472-1483 (2020) - [j56]Yin Tat Lee, Marcin Pilipczuk, David P. Woodruff:
Introduction to the Special Issue on SODA'18. ACM Trans. Algorithms 16(1): 1:1-1:2 (2020) - [c67]Marcin Pilipczuk:
Surprising Applications of Treewidth Bounds for Planar Graphs. Treewidth, Kernels, and Algorithms 2020: 173-188 - [c66]Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge:
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. ISAAC 2020: 59:1-59:15 - [c65]Lukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, Piotr Wygocki:
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. IPEC 2020: 37:1-37:18 - [c64]Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé:
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs. SODA 2020: 2260-2278 - [e1]Yixin Cao, Marcin Pilipczuk:
15th International Symposium on Parameterized and Exact Computation, IPEC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference). LIPIcs 180, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-172-6 [contents] - [i80]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. CoRR abs/2001.01607 (2020) - [i79]Marcin Pilipczuk, Manuel Sorge:
A Double Exponential Lower Bound for the Distinct Vectors Problem. CoRR abs/2002.01293 (2020) - [i78]Stefan Kratsch, Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Manuel Sorge:
Optimal Discretization is Fixed-parameter Tractable. CoRR abs/2003.02475 (2020) - [i77]Tara Abrishami, Maria Chudnovsky, Marcin Pilipczuk, Pawel Rzazewski, Paul D. Seymour:
Induced subgraphs of bounded treewidth and the container method. CoRR abs/2003.05185 (2020) - [i76]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Covering minimal separators and potential maximal cliques in Pt-free graphs. CoRR abs/2003.12345 (2020) - [i75]Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Michal Pilipczuk, Marcin Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz:
On Dynamic Parameterized k-Path. CoRR abs/2006.00571 (2020) - [i74]Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois:
Two lower bounds for $p$-centered colorings. CoRR abs/2006.04113 (2020) - [i73]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Solving hard cut problems via flow-augmentation. CoRR abs/2007.09018 (2020) - [i72]Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge:
Constant Congestion Brambles. CoRR abs/2008.02133 (2020) - [i71]Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge:
The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. CoRR abs/2009.12892 (2020) - [i70]Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Quasi-polynomial-time algorithm for Independent Set in Pt-free and C>t-free graphs via shrinking the space of connecting subgraphs. CoRR abs/2009.13494 (2020)
2010 – 2019
- 2019
- [j55]Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen:
Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Algorithmica 81(2): 421-438 (2019) - [j54]Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna:
Edge Bipartization Faster than $$2^k$$ 2 k. Algorithmica 81(3): 917-966 (2019) - [j53]Tomasz Kociumaka, Marcin Pilipczuk:
Deleting Vertices to Graphs of Bounded Genus. Algorithmica 81(9): 3655-3691 (2019) - [j52]Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna:
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. Algorithmica 81(10): 3936-3967 (2019) - [j51]Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz:
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. Algorithmica 81(10): 4029-4042 (2019) - [j50]Anita Liebenau, Marcin Pilipczuk, Paul D. Seymour, Sophie Spirkl:
Caterpillars in Erdős-Hajnal. J. Comb. Theory, Ser. B 136: 33-43 (2019) - [j49]Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz:
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness. ACM J. Exp. Algorithmics 24(1): 2.6:1-2.6:34 (2019) - [j48]Michal Ziobro, Marcin Pilipczuk:
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation. ACM J. Exp. Algorithmics 24(1): 2.7:1-2.7:18 (2019) - [j47]Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Minimum Bisection Is Fixed-Parameter Tractable. SIAM J. Comput. 48(2): 417-450 (2019) - [c63]Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk:
Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs. ESA 2019: 33:1-33:14 - [c62]Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk:
Improved Bounds for the Excluded-Minor Approximation of Treedepth. ESA 2019: 34:1-34:13 - [c61]Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing Directed Circuits Quarter-Integrally. ESA 2019: 72:1-72:13 - [c60]Vincent Cohen-Addad, Michal Pilipczuk, Marcin Pilipczuk:
A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs. FOCS 2019: 560-581 - [c59]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs. SODA 2019: 1257-1271 - [c58]Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen:
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. STACS 2019: 39:1-39:18 - [i69]Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé:
On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five. CoRR abs/1903.04761 (2019) - [i68]Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk:
A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs. CoRR abs/1904.10680 (2019) - [i67]Wojciech Czerwinski, Wojciech Nadara, Marcin Pilipczuk:
Improved bounds for the excluded-minor approximation of treedepth. CoRR abs/1904.13077 (2019) - [i66]Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk:
Efficient approximation schemes for uniform-cost clustering problems in planar graphs. CoRR abs/1905.00656 (2019) - [i65]Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing directed circuits quarter-integrally. CoRR abs/1907.02494 (2019) - [i64]Maria Chudnovsky, Marcin Pilipczuk, Michal Pilipczuk, Stéphan Thomassé:
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs. CoRR abs/1907.04585 (2019) - [i63]Shaohua Li, Marcin Pilipczuk, Manuel Sorge:
Cluster Editing parameterized above the size of a modification-disjoint P3 packing is para-NP-hard. CoRR abs/1910.08517 (2019) - [i62]Marthe Bonamy, François Dross, Tomás Masarík, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk:
Jones' Conjecture in subcubic graphs. CoRR abs/1912.01570 (2019) - 2018
- [j46]Krzysztof Choromanski, Dvir Falik, Anita Liebenau, Viresh Patel, Marcin Pilipczuk:
Excluding Hooks and their Complements. Electron. J. Comb. 25(3): 3 (2018) - [j45]Chandra Chekuri, Alina Ene, Marcin Pilipczuk:
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. SIAM J. Discret. Math. 32(3): 2134-2160 (2018) - [j44]Bart M. P. Jansen, Marcin Pilipczuk:
Approximation and Kernelization for Chordal Vertex Deletion. SIAM J. Discret. Math. 32(3): 2258-2301 (2018) - [j43]Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen:
Independence and Efficient Domination on P6-free Graphs. ACM Trans. Algorithms 14(1): 3:1-3:30 (2018) - [j42]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
Subexponential Parameterized Algorithm for Interval Completion. ACM Trans. Algorithms 14(3): 35:1-35:62 (2018) - [j41]Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen:
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. ACM Trans. Algorithms 14(4): 53:1-53:73 (2018) - [j40]Marcin Pilipczuk, Magnus Wahlström:
Directed Multicut is W[1]-hard, Even for Four Terminal Pairs. ACM Trans. Comput. Theory 10(3): 13:1-13:18 (2018) - [c57]Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk:
On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs. FOCS 2018: 474-484 - [c56]Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström:
Multi-Budgeted Directed Cuts. IPEC 2018: 18:1-18:14 - [c55]Krzysztof Kiljan, Marcin Pilipczuk:
Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set. SEA 2018: 12:1-12:12 - [c54]Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz:
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. SEA 2018: 14:1-14:16 - [c53]Michal Ziobro, Marcin Pilipczuk:
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation. SEA 2018: 29:1-29:14 - [c52]Shaohua Li, Marcin Pilipczuk:
An Improved FPT Algorithm for Independent Feedback Vertex Set. WG 2018: 344-355 - [p1]Marcin Pilipczuk, Michal Pilipczuk:
Planar Digraphs. Classes of Directed Graphs 2018: 207-243 - [i61]Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich, Felix Reidl, Sebastian Siebertz:
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness. CoRR abs/1802.09801 (2018) - [i60]Krzysztof Kiljan, Marcin Pilipczuk:
Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set. CoRR abs/1803.00925 (2018) - [i59]Michal Ziobro, Marcin Pilipczuk:
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation. CoRR abs/1803.00927 (2018) - [i58]Shaohua Li, Marcin Pilipczuk:
An improved FPT algorithm for Independent Feedback Vertex Set. CoRR abs/1803.00937 (2018) - [i57]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. CoRR abs/1804.04077 (2018) - [i56]Anita Liebenau, Marcin Pilipczuk, Paul D. Seymour, Sophie Spirkl:
Caterpillars in Erdős-Hajnal. CoRR abs/1810.00811 (2018) - [i55]Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen:
A deterministic polynomial kernel for Odd Cycle Transversal and Vertex Multiway Cut in planar graphs. CoRR abs/1810.01136 (2018) - [i54]Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, Magnus Wahlström:
Multi-budgeted directed cuts. CoRR abs/1810.06848 (2018) - [i53]Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Michal Pilipczuk, Marcin Pilipczuk, Saket Saurabh:
Randomized contractions meet lean decompositions. CoRR abs/1810.06864 (2018) - [i52]Marcin Pilipczuk, Michal Ziobro:
Experimental Evaluation of Parameterized Algorithms for Graph Separation Problems: Half-Integral Relaxations and Matroid-based Kernelization. CoRR abs/1811.07779 (2018) - 2017
- [j39]Marcin Pilipczuk:
A tight lower bound for Vertex Planarization on graphs of bounded treewidth. Discret. Appl. Math. 231: 211-216 (2017) - [j38]Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk:
Hitting forbidden subgraphs in graphs of bounded treewidth. Inf. Comput. 256: 62-82 (2017) - [j37]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna:
Polynomial Kernelization for Removing Induced Claws and Diamonds. Theory Comput. Syst. 60(4): 615-636 (2017) - [j36]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. SIAM J. Comput. 46(1): 161-189 (2017) - [j35]Alexandr Andoni, Debmalya Panigrahi, Marcin Pilipczuk:
Editorial. ACM Trans. Algorithms 13(2): 18:1 (2017) - [j34]Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk:
Hardness of Approximation for Strip Packing. ACM Trans. Comput. Theory 9(3): 14:1-14:7 (2017) - [c51]Dániel Marx, Marcin Pilipczuk:
Subexponential Parameterized Algorithms for Graphs of Polynomial Growth. ESA 2017: 59:1-59:15 - [c50]Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna:
Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor. IPEC 2017: 23:1-23:13 - [c49]Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz:
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. IPEC 2017: 24:1-24:11 - [c48]Bart M. P. Jansen, Marcin Pilipczuk:
Approximation and Kernelization for Chordal Vertex Deletion. SODA 2017: 1399-1418 - [i51]Tomasz Kociumaka, Marcin Pilipczuk:
Deleting vertices to graphs of bounded genus. CoRR abs/1706.04065 (2017) - [i50]Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz:
An exponential lower bound for cut sparsifiers in planar graphs. CoRR abs/1706.06086 (2017) - [i49]Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna:
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. CoRR abs/1707.01797 (2017) - [i48]Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk:
On subexponential parameterized algorithms for Steiner Tree and Directed Subset TSP on planar graphs. CoRR abs/1707.02190 (2017) - [i47]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs. CoRR abs/1707.05491 (2017) - [i46]Anita Liebenau, Marcin Pilipczuk:
The Erdős-Hajnal conjecture for caterpillars and their complements. CoRR abs/1710.08701 (2017) - 2016
- [j33]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk:
On Group Feedback Vertex Set Parameterized by the Size of the Cutset. Algorithmica 74(2): 630-642 (2016) - [j32]Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk:
A Fast Branching Algorithm for Cluster Vertex Deletion. Theory Comput. Syst. 58(2): 357-376 (2016) - [j31]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk:
Known Algorithms for Edge Clique Cover are Probably Optimal. SIAM J. Comput. 45(1): 67-83 (2016) - [j30]Rajesh Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk:
Designing FPT Algorithms for Cut Problems Using Randomized Contractions. SIAM J. Comput. 45(4): 1171-1229 (2016) - [c47]Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. FOCS 2016: 515-524 - [c46]Chandra Chekuri, Alina Ene, Marcin Pilipczuk:
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. ICALP 2016: 7:1-7:14 - [c45]Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna:
Edge Bipartization Faster Than 2^k. IPEC 2016: 26:1-26:13 - [c44]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
Subexponential parameterized algorithm for Interval Completion. SODA 2016: 1116-1131 - [c43]