


Остановите войну!
for scientists:
Michal 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
- [j75]Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak:
Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs. J. Comb. Theory, Ser. B 152: 353-378 (2022) - [j74]Mikolaj Bojanczyk, Michal Pilipczuk:
Optimizing tree decompositions in MSO. Log. Methods Comput. Sci. 18(1) (2022) - [j73]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) - [j72]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) - [j71]Dániel Marx, Michal Pilipczuk:
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams. ACM Trans. Algorithms 18(2): 13:1-13:64 (2022) - [j70]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) - [c105]Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny:
Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures. ICALP 2022: 102:1-102:18 - [c104]Jakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk:
Twin-Width and Types. ICALP 2022: 123:1-123:21 - [c103]Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk:
Treelike Decompositions for Transductions of Sparse Graphs. LICS 2022: 31:1-31:14 - [c102]Jakub Gajarský, Michal Pilipczuk, Szymon Torunczyk:
Stable graphs of bounded twin-width. LICS 2022: 39:1-39:12 - [c101]Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
:
Isolation Schemes for Problems on Decomposable Graphs. STACS 2022: 50:1-50:20 - [c100]Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz:
Compact Representation for Matrices of Bounded Twin-Width. STACS 2022: 52:1-52:14 - [c99]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. STOC 2022: 914-923 - [i116]Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki:
Bounding generalized coloring numbers of planar graphs using coin models. CoRR abs/2201.09340 (2022) - [i115]Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk:
Treelike decompositions for transductions of sparse graphs. CoRR abs/2201.11082 (2022) - [i114]Michal Pilipczuk, Marek Sokolowski:
Graphs of bounded twin-width are quasi-polynomially χ-bounded. CoRR abs/2202.07608 (2022) - [i113]Michal Pilipczuk, Patrice Ossona de Mendez, Sebastian Siebertz:
Transducing paths in graph classes with unbounded shrubdepth. CoRR abs/2203.16900 (2022) - [i112]Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz:
Dynamic data structures for parameterized string problems. CoRR abs/2205.00441 (2022) - [i111]Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz:
Computing treedepth in polynomial space and linear fpt time. CoRR abs/2205.02656 (2022) - [i110]Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
Independence number of intersection graphs of axis-parallel segments. CoRR abs/2205.15189 (2022) - [i109]Jakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk:
Twin-width and types. CoRR abs/2206.08248 (2022) - [i108]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
- [j69]Jana Novotná, Karolina Okrasa
, Michal Pilipczuk, Pawel Rzazewski
, Erik Jan van Leeuwen, Bartosz Walczak:
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica 83(8): 2634-2650 (2021) - [j68]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) - [j67]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) - [j66]Michal Pilipczuk, Sebastian Siebertz:
Kernelization and approximation of distance-r independent sets on nowhere dense graphs. Eur. J. Comb. 94: 103309 (2021) - [j65]Michal Pilipczuk, Sebastian Siebertz:
Polynomial bounds for centered colorings on proper minor-closed graph classes. J. Comb. Theory, Ser. B 151: 111-147 (2021) - [j64]Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk:
Definable decompositions for graphs of bounded linear cliquewidth. Log. Methods Comput. Sci. 17(1) (2021) - [j63]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond
, Dimitrios M. Thilikos, Marcin Wrochna
:
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. SIAM J. Discret. Math. 35(1): 105-151 (2021) - [j62]Marcin Brianski, Piotr Micek, Michal Pilipczuk, Michal T. Seweryn
:
Erdös-Hajnal Properties for Powers of Sparse Graphs. SIAM J. Discret. Math. 35(1): 447-464 (2021) - [j61]Maria Chudnovsky
, Jason King, Michal Pilipczuk, Pawel Rzazewski
, Sophie Spirkl:
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. SIAM J. Discret. Math. 35(4): 2357-2386 (2021) - [j60]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) - [c98]Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel:
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. ESA 2021: 33:1-33:14 - [c97]Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros:
Dynamic Data Structures for Timed Automata Acceptance. IPEC 2021: 20:1-20:18 - [c96]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 - [c95]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Rankwidth meets stability. SODA 2021: 2014-2033 - [c94]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 - [c93]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 - [e2]Lukasz Kowalik
, Michal Pilipczuk
, Pawel Rzazewski
:
Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers. Lecture Notes in Computer Science 12911, Springer 2021, ISBN 978-3-030-86837-6 [contents] - [i107]Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk:
On objects dual to tree-cut decompositions. CoRR abs/2103.14667 (2021) - [i106]Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi:
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. CoRR abs/2103.17041 (2021) - [i105]Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki:
Isolation schemes for problems on decomposable graphs. CoRR abs/2105.01465 (2021) - [i104]Jakub Gajarský, Michal Pilipczuk, Szymon Torunczyk:
Stable graphs of bounded twin-width. CoRR abs/2107.03711 (2021) - [i103]Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Maintaining CMSO2 properties on dynamic structures with bounded feedback vertex number. CoRR abs/2107.06232 (2021) - [i102]Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz:
Compact representation for matrices of bounded twin-width. CoRR abs/2110.08106 (2021) - [i101]Michal Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz, Szymon Torunczyk, Alexandre Vigny:
Algorithms and data structures for first-order logic with connectivity under vertex failures. CoRR abs/2111.03725 (2021) - [i100]Daniel Král', Michal Pilipczuk, Sebastian Siebertz, Blair D. Sullivan:
Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391). Dagstuhl Reports 11(8): 115-128 (2021) - 2020
- [j59]Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
:
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. Algorithmica 82(6): 1703-1739 (2020) - [j58]Christophe Paul, Michal Pilipczuk:
Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation. Algorithmica 82(8): 2133-2134 (2020) - [j57]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Xuding Zhu:
Clustering Powers of Sparse Graphs. Electron. J. Comb. 27(4): 4 (2020) - [j56]O-joung Kwon
, Michal Pilipczuk, Sebastian Siebertz
:
On low rank-width colorings. Eur. J. Comb. 83 (2020) - [j55]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) - [j54]Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk, Lukás Mach:
Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems. ACM Trans. Algorithms 16(2): 25:1-25:31 (2020) - [j53]Marthe Bonamy, Oscar Defrain
, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond
:
Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants. ACM Trans. Algorithms 16(3): 39:1-39:23 (2020) - [j52]Kord Eickmeyer
, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez
, Michal Pilipczuk, Daniel A. Quiroz
, Roman Rabinovich, Sebastian Siebertz:
Model-Checking on Ordered Structures. ACM Trans. Comput. Log. 21(2): 11:1-11:28 (2020) - [j51]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez
, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk
:
First-Order Interpretations of Bounded Expansion Classes. ACM Trans. Comput. Log. 21(4): 29:1-29:41 (2020) - [j50]Dusan Knop, Michal Pilipczuk, Marcin Wrochna
:
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. ACM Trans. Comput. Theory 12(3): 19:1-19:19 (2020) - [c92]Michal Pilipczuk:
Computing Tree Decompositions. Treewidth, Kernels, and Algorithms 2020: 189-213 - [c91]Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski
, Sophie Spirkl:
Finding Large H-Colorable Subgraphs in Hereditary Graph Classes. ESA 2020: 35:1-35:17 - [c90]Michaël Cadilhac
, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
On Polynomial Recursive Sequences. ICALP 2020: 117:1-117:17 - [c89]Adam Paszke, Michal Pilipczuk:
VC Density of Set Systems Definable in Tree-Like Graphs. MFCS 2020: 78:1-78:13 - [c88]Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk:
Shorter Labeling Schemes for Planar Graphs. SODA 2020: 446-462 - [c87]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 - [c86]Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi:
An exponential time parameterized algorithm for planar disjoint paths. STOC 2020: 1307-1316 - [c85]Jesper Nederlof
, Michal Pilipczuk
, Céline M. F. Swennenhuis
, Karol Wegrzycki
:
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. WG 2020: 27-39 - [i99]Marthe Bonamy, Michal Pilipczuk, Jean-Sébastien Sereni:
On the effect of symmetry requirement for rendezvous on the complete graph. CoRR abs/2002.03764 (2020) - [i98]Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki:
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. CoRR abs/2002.04368 (2020) - [i97]Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros:
The monitoring problem for timed automata. CoRR abs/2002.07049 (2020) - [i96]Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues:
On polynomial recursive sequences. CoRR abs/2002.08630 (2020) - [i95]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Xuding Zhu:
Clustering powers of sparse graphs. CoRR abs/2003.03605 (2020) - [i94]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Covering minimal separators and potential maximal cliques in Pt-free graphs. CoRR abs/2003.12345 (2020) - [i93]Adam Paszke, Michal Pilipczuk:
VC density of set systems defnable in tree-like graphs. CoRR abs/2003.14177 (2020) - [i92]Maria Chudnovsky, Jason King, Michal Pilipczuk, Pawel Rzazewski, Sophie Spirkl:
Finding large $H$-colorable subgraphs in hereditary graph classes. CoRR abs/2004.09425 (2020) - [i91]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) - [i90]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Rankwidth meets stability. CoRR abs/2007.07857 (2020) - [i89]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) - [i88]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna:
Integer Programming and Incidence Treedepth. CoRR abs/2012.00079 (2020) - [i87]Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel:
Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity. CoRR abs/2012.11742 (2020)
2010 – 2019
- 2019
- [j49]Archontia C. Giannopoulou, Michal Pilipczuk
, Jean-Florent Raymond
, Dimitrios M. Thilikos, Marcin Wrochna
:
Cutwidth: Obstructions and Algorithmic Aspects. Algorithmica 81(2): 557-588 (2019) - [j48]Marcin Pilipczuk
, Michal Pilipczuk, Marcin Wrochna:
Edge Bipartization Faster than $$2^k$$ 2 k. Algorithmica 81(3): 917-966 (2019) - [j47]Fedor V. Fomin
, Michal Pilipczuk:
On width measures and topological problems on semi-complete digraphs. J. Comb. Theory, Ser. B 138: 78-165 (2019) - [j46]Florian Barbero, Christophe Paul
, Michal Pilipczuk:
Strong immersion is a well-quasi-ordering for semicomplete digraphs. J. Graph Theory 90(4): 484-496 (2019) - [j45]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman
, Michal Pilipczuk, Michael Wehar:
Shortest paths in one-counter systems. Log. Methods Comput. Sci. 15(1) (2019) - [j44]Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Minimum Bisection Is Fixed-Parameter Tractable. SIAM J. Comput. 48(2): 417-450 (2019) - [j43]Marthe Bonamy, Lukasz Kowalik
, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
:
Tight Lower Bounds for the Complexity of Multicoloring. ACM Trans. Comput. Theory 11(3): 13:1-13:19 (2019) - [c84]Filip Mazowiecki, Michal Pilipczuk:
Reachability for Bounded Branching VASS. CONCUR 2019: 28:1-28:13 - [c83]Karl Bringmann, Sándor Kisfaludi-Bak
, Michal Pilipczuk, Erik Jan van Leeuwen:
On Geometric Set Cover for Orthants. ESA 2019: 26:1-26:18 - [c82]Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk:
Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs. ESA 2019: 33:1-33:14 - [c81]Vincent Cohen-Addad, Michal Pilipczuk, Marcin Pilipczuk:
A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs. FOCS 2019: 560-581 - [c80]Eduard Eiben, Robert Ganian, Dusan Knop
, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
:
Integer Programming and Incidence Treedepth. IPCO 2019: 194-204 - [c79]Jana Novotná
, Karolina Okrasa
, Michal Pilipczuk, Pawel Rzazewski
, Erik Jan van Leeuwen, Bartosz Walczak:
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. IPEC 2019: 23:1-23:11 - [c78]Andrzej Grzesik
, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs. SODA 2019: 1257-1271 - [c77]Michal Pilipczuk, Sebastian Siebertz
:
Polynomial bounds for centered colorings on proper minor-closed graph classes. SODA 2019: 1501-1520 - [c76]Grzegorz Fabianski
, Michal Pilipczuk, Sebastian Siebertz
, Szymon Torunczyk:
Progressive Algorithms for Domination and Independence. STACS 2019: 27:1-27:16 - [c75]Dusan Knop
, Michal Pilipczuk, Marcin Wrochna
:
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. STACS 2019: 44:1-44:15 - [e1]Christophe Paul, Michal Pilipczuk:
13th International Symposium on Parameterized and Exact Computation, IPEC 2018, August 20-24, 2018, Helsinki, Finland. LIPIcs 115, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-084-2 [contents] - [i86]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) - [i85]Filip Mazowiecki, Michal Pilipczuk:
Reachability for Bounded Branching VASS. CoRR abs/1904.10226 (2019) - [i84]Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk:
A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs. CoRR abs/1904.10680 (2019) - [i83]Vincent Cohen-Addad, Marcin Pilipczuk, Michal Pilipczuk:
Efficient approximation schemes for uniform-cost clustering problems in planar graphs. CoRR abs/1905.00656 (2019) - [i82]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) - [i81]Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk:
Shorter Labeling Schemes for Planar Graphs. CoRR abs/1908.03341 (2019) - [i80]Marthe Bonamy, Michal Pilipczuk:
Graphs of bounded cliquewidth are polynomially χ-bounded. CoRR abs/1910.00697 (2019) - [i79]Jana Novotná
, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak:
Subexponential-time algorithms for finding large induced sparse subgraphs. CoRR abs/1910.01082 (2019) - [i78]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
- [j42]Pål Grønås Drange, Michal Pilipczuk
:
A Polynomial Kernel for Trivially Perfect Editing. Algorithmica 80(12): 3481-3524 (2018) - [j41]Daniel Lokshtanov, Michal Pilipczuk
, Saket Saurabh:
Below All Subsets for Minimal Connected Dominating Set. SIAM J. Discret. Math. 32(3): 2332-2345 (2018) - [j40]Fedor V. Fomin
, Daniel Lokshtanov, Saket Saurabh, Michal Pilipczuk
, Marcin Wrochna
:
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. ACM Trans. Algorithms 14(3): 34:1-34:45 (2018) - [j39]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) - [j38]Florian Barbero, Christophe Paul
, Michal Pilipczuk
:
Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs. ACM Trans. Algorithms 14(3): 38:1-38:31 (2018) - [j37]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) - [j36]Michal Pilipczuk
, Marcin Wrochna
:
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. ACM Trans. Comput. Theory 9(4): 18:1-18:36 (2018) - [j35]Ivan Bliznets
, Marek Cygan, Pawel Komosa, Michal Pilipczuk:
Hardness of Approximation for H-free Edge Modification Problems. ACM Trans. Comput. Theory 10(2): 9:1-9:32 (2018) - [c74]Michal Pilipczuk
, Erik Jan van Leeuwen, Andreas Wiese
:
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. ESA 2018: 65:1-65:13 - [c73]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 - [c72]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez
, Michal Pilipczuk
, Sebastian Siebertz
, Szymon Torunczyk
:
First-Order Interpretations of Bounded Expansion Classes. ICALP 2018: 126:1-126:14 - [c71]Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk
:
Definable decompositions for graphs of bounded linear cliquewidth. LICS 2018: 135-144 - [c70]Michal Pilipczuk
, Sebastian Siebertz
, Szymon Torunczyk
:
Parameterized circuit complexity of model-checking on sparse structures. LICS 2018: 789-798 - [c69]Michal Pilipczuk
, Sebastian Siebertz
, Szymon Torunczyk
:
On the number of types in sparse graphs. LICS 2018: 799-808 - [c68]Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk
, Arkadiusz Socala, Marcin Wrochna
:
On Directed Feedback Vertex Set Parameterized by Treewidth. WG 2018: 65-78 - [p1]Marcin Pilipczuk
, Michal Pilipczuk:
Planar Digraphs. Classes of Directed Graphs 2018: 207-243 - [i77]Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk:
Definable decompositions for graphs of bounded linear cliquewidth. CoRR abs/1803.05937 (2018) - [i76]Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
Parameterized circuit complexity of model checking first-order logic on sparse structures. CoRR abs/1805.03488 (2018) - [i75]Michal Pilipczuk, Sebastian Siebertz:
Polynomial bounds for centered colorings on proper minor-closed graph classes. CoRR abs/1807.03683 (2018) - [i74]Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese:
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. CoRR abs/1807.07626 (2018) - [i73]