![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Michal Pilipczuk
Person information
- affiliation: University of Warsaw, Institute of Informatics, Poland
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j86]Maria Chudnovsky
, Marcin Pilipczuk
, Michal Pilipczuk, Stéphan Thomassé:
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs. SIAM J. Comput. 53(1): 47-86 (2024) - [c130]Jakub Gajarský
, Michal Pilipczuk
, Marek Sokolowski
, Giannos Stamoulis
, Szymon Torunczyk
:
Elementary first-order model checking for sparse graphs. LICS 2024: 36:1-36:14 - [c129]Tuukka Korhonen
, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Fully dynamic approximation schemes on planar and apex-minor-free graphs. SODA 2024: 296-313 - [c128]Mathieu Mari, Anish Mukherjee, Michal Pilipczuk, Piotr Sankowski:
Shortest Disjoint Paths on a Grid. SODA 2024: 346-365 - [c127]Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
A polynomial-time OPTɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. SODA 2024: 625-638 - [c126]Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
:
Parameterized algorithms for block-structured integer programs with large entries. SODA 2024: 740-751 - [c125]Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak:
Cliquewidth and Dimension. SODA 2024: 1437-1446 - [c124]Maria Chudnovsky, Rose McCarty
, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Sparse induced subgraphs in P6-free graphs. SODA 2024: 5291-5299 - [c123]Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini:
Simple and tight complexity lower bounds for solving Rabin games. SOSA 2024: 160-167 - [c122]Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. SOSA 2024: 279-285 - [c121]Katarzyna Anna Kowalska, Michal Pilipczuk:
Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane. STACS 2024: 47:1-47:16 - [c120]Peter Gartland, Daniel Lokshtanov
, Tomás Masarík
, Marcin Pilipczuk
, Michal Pilipczuk, Pawel Rzazewski
:
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. STOC 2024: 683-691 - [i143]Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk:
Elementary first-order model checking for sparse graphs. CoRR abs/2401.16230 (2024) - [i142]Konrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz:
Parameterized dynamic data structure for Split Completion. CoRR abs/2402.08816 (2024) - [i141]Katarzyna Anna Kowalska, Michal Pilipczuk:
Parameterized and approximation algorithms for coverings points with segments in the plane. CoRR abs/2402.16466 (2024) - [i140]Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis:
Minor Containment and Disjoint Paths in almost-linear time. CoRR abs/2404.03958 (2024) - 2023
- [j85]Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
:
Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models. Electron. J. Comb. 30(3) (2023) - [j84]Michal Pilipczuk, Marek Sokolowski
:
Graphs of bounded twin-width are quasi-polynomially χ-bounded. J. Comb. Theory B 161: 382-406 (2023) - [j83]Marthe Bonamy, Jadwiga Czyzewska
, Lukasz Kowalik
, Michal Pilipczuk:
Partitioning edges of a planar graph into linear forests and a matching. J. Graph Theory 104(3): 659-677 (2023) - [j82]Marthe Bonamy
, Michal Pilipczuk, Jean-Sébastien Sereni, Richard Weber:
On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph. Math. Oper. Res. 48(2): 942-953 (2023) - [j81]Jesper Nederlof
, Michal Pilipczuk, Céline M. F. Swennenhuis
, Karol Wegrzycki
:
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. SIAM J. Discret. Math. 37(3): 1566-1586 (2023) - [c119]Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA 2023: 18:1-18:18 - [c118]Tuukka Korhonen
, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Dynamic treewidth. FOCS 2023: 1734-1744 - [c117]Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michal Pilipczuk:
Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1. FOCS 2023: 2262-2277 - [c116]Hans L. Bodlaender
, Carla Groenland
, Michal Pilipczuk:
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters. ICALP 2023: 27:1-27:20 - [c115]Jakub Gajarský, Nikolas Mählmann, Rose McCarty
, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk:
Flipper Games for Monadically Stable Graph Classes. ICALP 2023: 128:1-128:16 - [c114]Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk:
Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. ICALP 2023: 135:1-135:17 - [c113]Mathieu Mari, Timothé Picavet, Michal Pilipczuk:
A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items. IPEC 2023: 33:1-33:20 - [c112]Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Simpler and faster algorithms for detours in planar digraphs. SOSA 2023: 156-165 - [c111]Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk:
On Rational Recursive Sequences. STACS 2023: 24:1-24:21 - [c110]Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number. STACS 2023: 46:1-46:13 - [c109]Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki
, Anna Zych-Pawlewicz
:
Dynamic Data Structures for Parameterized String Problems. STACS 2023: 50:1-50:22 - [i139]Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Simpler and faster algorithms for detours in planar digraphs. CoRR abs/2301.02421 (2023) - [i138]Jakub Gajarský, Nikolas Mählmann, Rose McCarty
, Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Sebastian Siebertz, Marek Sokolowski, Szymon Torunczyk:
Flipper games for monadically stable graph classes. CoRR abs/2301.13735 (2023) - [i137]Marthe Bonamy, Jadwiga Czyzewska, Lukasz Kowalik, Michal Pilipczuk:
Partitioning edges of a planar graph into linear forests and a matching. CoRR abs/2302.13312 (2023) - [i136]Pierre Ohlmann, Michal Pilipczuk, Szymon Torunczyk, Wojciech Przybyszewski:
Canonical decompositions in monadically stable and bounded shrubdepth graph classes. CoRR abs/2303.01473 (2023) - [i135]Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Dynamic treewidth. CoRR abs/2304.01744 (2023) - [i134]Vincent Cohen-Addad, Hung Le, Marcin Pilipczuk, Michal Pilipczuk:
Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1. CoRR abs/2304.07268 (2023) - [i133]Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. CoRR abs/2305.15738 (2023) - [i132]Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. CoRR abs/2307.00406 (2023) - [i131]Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR abs/2307.01285 (2023) - [i130]Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Sparse induced subgraphs in P_6-free graphs. CoRR abs/2307.07330 (2023) - [i129]Michal Pilipczuk, Mathieu Mari, Timothé Picavet:
A parameterized approximation scheme for the 2D-Knapsack problem with wide items. CoRR abs/2307.10672 (2023) - [i128]Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak:
Cliquewidth and dimension. CoRR abs/2308.11950 (2023) - [i127]Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
A polynomial-time OPTε-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. CoRR abs/2310.20325 (2023) - [i126]Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini:
Simple and tight complexity lower bounds for solving Rabin games. CoRR abs/2310.20433 (2023) - [i125]Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski:
Fully dynamic approximation schemes on planar and apex-minor-free graphs. CoRR abs/2310.20623 (2023) - [i124]Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak:
Parameterized algorithms for block-structured integer programs with large entries. CoRR abs/2311.01890 (2023) - [i123]Jan Dreier
, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty
, Michal Pilipczuk, Szymon Torunczyk:
First-Order Model Checking on Monadically Stable Graph Classes. CoRR abs/2311.18740 (2023) - 2022
- [j80]Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis
, Cristian Riveros
:
Dynamic Data Structures for Timed Automata Acceptance. Algorithmica 84(11): 3223-3245 (2022) - [j79]Lukasz Bozyk, Michal Pilipczuk:
On the Erdős-Pósa property for immersions and topological minors in tournaments. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j78]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 B 152: 353-378 (2022) - [j77]Lukasz Bozyk
, Oscar Defrain
, Karolina Okrasa
, Michal Pilipczuk:
On objects dual to tree-cut decompositions. J. Comb. Theory B 157: 401-428 (2022) - [j76]Mikolaj Bojanczyk, Michal Pilipczuk:
Optimizing tree decompositions in MSO. Log. Methods Comput. Sci. 18(1) (2022) - [j75]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) - [j74]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. SIAM J. Comput. 51(6): 1866-1930 (2022) - [j73]Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk:
Shorter Labeling Schemes for Planar Graphs. SIAM J. Discret. Math. 36(3): 2082-2099 (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) - [c108]Lukasz Bozyk, Michal Pilipczuk:
Polynomial Kernel for Immersion Hitting in Tournaments. ESA 2022: 26:1-26:17 - [c107]Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz:
Computing Treedepth in Polynomial Space and Linear FPT Time. ESA 2022: 79:1-79:14 - [c106]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 - [c105]Jakub Gajarský
, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk:
Twin-Width and Types. ICALP 2022: 123:1-123:21 - [c104]Hans L. Bodlaender
, Carla Groenland
, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk:
On the Complexity of Problems on Tree-Structured Graphs. IPEC 2022: 6:1-6:17 - [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 - [i122]Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki:
Bounding generalized coloring numbers of planar graphs using coin models. CoRR abs/2201.09340 (2022) - [i121]Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk:
Treelike decompositions for transductions of sparse graphs. CoRR abs/2201.11082 (2022) - [i120]Michal Pilipczuk, Marek Sokolowski:
Graphs of bounded twin-width are quasi-polynomially χ-bounded. CoRR abs/2202.07608 (2022) - [i119]Michal Pilipczuk, Patrice Ossona de Mendez, Sebastian Siebertz:
Transducing paths in graph classes with unbounded shrubdepth. CoRR abs/2203.16900 (2022) - [i118]Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki
, Karol Wegrzycki, Anna Zych-Pawlewicz:
Dynamic data structures for parameterized string problems. CoRR abs/2205.00441 (2022) - [i117]Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz:
Computing treedepth in polynomial space and linear fpt time. CoRR abs/2205.02656 (2022) - [i116]Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
Independence number of intersection graphs of axis-parallel segments. CoRR abs/2205.15189 (2022) - [i115]Jakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk:
Twin-width and types. CoRR abs/2206.08248 (2022) - [i114]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) - [i113]Lukasz Bozyk, Michal Pilipczuk:
Polynomial kernel for immersion hitting in tournaments. CoRR abs/2208.07789 (2022) - [i112]Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk:
On Rational Recursive Sequences. CoRR abs/2210.01635 (2022) - [i111]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Highly unbreakable graph with a fixed excluded minor are almost rigid. CoRR abs/2210.14629 (2022) - [i110]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Fixed-parameter tractability of Graph Isomorphism in graphs with an excluded minor. CoRR abs/2210.14638 (2022) - [i109]Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk:
On digraphs without onion star immersions. CoRR abs/2211.15477 (2022) - [i108]Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. CoRR abs/2212.01620 (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 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 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]Michal Pilipczuk, Sebastian Siebertz:
Kernelization and approximation of distance-r independent sets on nowhere dense graphs. CoRR abs/1809.05675 (2018) - [i72]Jakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
First-order interpretations of bounded expansion classes. CoRR abs/1810.02389 (2018) - [i71]Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Michal Pilipczuk, Marcin Pilipczuk, Saket Saurabh:
Randomized contractions meet lean decompositions. CoRR abs/1810.06864 (2018) - [i70]Dusan Knop, Michal Pilipczuk, Marcin Wrochna:
Tight complexity lower bounds for integer linear programming with few constraints. CoRR abs/1811.01296 (2018) - [i69]Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
Progressive Algorithms for Domination and Independence. CoRR abs/1811.06799 (2018) - [i68]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. CoRR abs/1812.08003 (2018) - 2017
- [j34]Marthe Bonamy, Lukasz Kowalik
, Michal Pilipczuk
, Arkadiusz Socala:
Linear Kernels for Outbranching Problems in Sparse Digraphs. Algorithmica 79(1): 159-188 (2017) - [j33]Marek Cygan
, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk:
Hitting forbidden subgraphs in graphs of bounded treewidth. Inf. Comput. 256: 62-82 (2017) - [j32]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) - [j31]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) - [j30]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) - [c67]Marthe Bonamy, Lukasz Kowalik
, Michal Pilipczuk
, Arkadiusz Socala, Marcin Wrochna
:
Tight Lower Bounds for the Complexity of Multicoloring. ESA 2017: 18:1-18:14 - [c66]Archontia C. Giannopoulou, Michal Pilipczuk
, Jean-Florent Raymond
, Dimitrios M. Thilikos, Marcin Wrochna
:
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. ICALP 2017: 57:1-57:15 - [c65]Kord Eickmeyer
, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon
, Michal Pilipczuk
, Roman Rabinovich, Sebastian Siebertz
:
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. ICALP 2017: 63:1-63:14 - [c64]Florian Barbero, Christophe Paul
, Michal Pilipczuk
:
Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs. ICALP 2017: 70:1-70:13 - [c63]Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk
, Daniel A. Quiroz
, Roman Rabinovich, Sebastian Siebertz
:
Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion. LICS 2017: 1-11 - [c62]Michal Pilipczuk
, Erik Jan van Leeuwen, Andreas Wiese:
Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. MFCS 2017: 42:1-42:13 - [c61]Michal Pilipczuk
:
On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk). MFCS 2017: 82:1-82:2 - [c60]Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna
:
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. SODA 2017: 1419-1432 - [c59]Mikolaj Bojanczyk, Michal Pilipczuk
:
Optimizing Tree Decompositions in MSO. STACS 2017: 15:1-15:13 - [c58]O-joung Kwon
, Michal Pilipczuk
, Sebastian Siebertz:
On Low Rank-Width Colorings. WG 2017: 372-385 - [i67]Mikolaj Bojanczyk, Michal Pilipczuk:
Optimizing tree decompositions in MSO. CoRR abs/1701.06937 (2017) - [i66]Jan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz:
Model-Checking for Successor-Invariant First-Order Formulas on Graph Classes of Bounded Expansion. CoRR abs/1701.08516 (2017) - [i65]O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz:
On low rank-width colorings. CoRR abs/1703.03304 (2017) - [i64]Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk:
On Wideness and Stability. CoRR abs/1705.09336 (2017) - [i63]Florian Barbero, Christophe Paul, Michal Pilipczuk:
Exploring the complexity of layout parameters in tournaments and semi-complete digraphs. CoRR abs/1706.00617 (2017) - [i62]Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
On Directed Feedback Vertex Set parameterized by treewidth. CoRR abs/1707.01470 (2017) - [i61]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) - [i60]Florian Barbero, Christophe Paul, Michal Pilipczuk:
Strong immersion is a well-quasi-ordering for semi-complete digraphs. CoRR abs/1707.03563 (2017) - [i59]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) - 2016
- [j29]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk:
On Group Feedback Vertex Set Parameterized by the Size of the Cutset. Algorithmica 74(2): 630-642 (2016) - [j28]Ivan Bliznets
, Fedor V. Fomin
, Michal Pilipczuk
, Yngve Villanger:
Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n. Algorithmica 76(2): 569-594 (2016) - [j27]Michal Pilipczuk, Szymon Torunczyk:
On Ultralimits of Sparse Graph Classes. Electron. J. Comb. 23(2): 2 (2016) - [j26]Tatjana V. Abramovskaya, Fedor V. Fomin
, Petr A. Golovach
, Michal Pilipczuk
:
How to hunt an invisible rabbit on a graph. Eur. J. Comb. 52: 12-26 (2016) - [j25]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk:
Known Algorithms for Edge Clique Cover are Probably Optimal. SIAM J. Comput. 45(1): 67-83 (2016) - [j24]Hans L. Bodlaender
, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin
, Daniel Lokshtanov, Michal Pilipczuk
:
A ck n 5-Approximation Algorithm for Treewidth. SIAM J. Comput. 45(2): 317-378 (2016) - [j23]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) - [c57]Ivan Bliznets
, Marek Cygan
, Pawel Komosa, Michal Pilipczuk
:
Hardness of Approximation for H-Free Edge Modification Problems. APPROX-RANDOM 2016: 3:1-3:17 - [c56]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 - [c55]Dmitry Chistikov
, Wojciech Czerwinski, Piotr Hofman
, Michal Pilipczuk
, Michael Wehar:
Shortest Paths in One-Counter Systems. FoSSaCS 2016: 462-478 - [c54]Archontia C. Giannopoulou, Michal Pilipczuk
, Jean-Florent Raymond
, Dimitrios M. Thilikos, Marcin Wrochna
:
Cutwidth: Obstructions and Algorithmic Aspects. IPEC 2016: 15:1-15:13 - [c53]Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna:
Edge Bipartization Faster Than 2^k. IPEC 2016: 26:1-26:13 - [c52]Mikolaj Bojanczyk, Michal Pilipczuk
:
Definability equals recognizability for graphs of bounded treewidth. LICS 2016: 407-416 - [c51]Stephan Kreutzer, Michal Pilipczuk
, Roman Rabinovich, Sebastian Siebertz
:
The Generalised Colouring Numbers on Classes of Bounded Expansion. MFCS 2016: 85:1-85:13 - [c50]Filip Murlak
, Charles Paperman
, Michal Pilipczuk
:
Schema Validation via Streaming Circuits. PODS 2016: 237-249 - [c49]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk
, Michal Pilipczuk:
Subexponential parameterized algorithm for Interval Completion. SODA 2016: 1116-1131 - [c48]Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk:
Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems. SODA 2016: 1132-1151 - [c47]Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin
, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl
, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz
, Somnath Sikdar:
Kernelization and Sparseness: the Case of Dominating Set. STACS 2016: 31:1-31:14 - [c46]Michal Pilipczuk
, Marcin Wrochna
:
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. STACS 2016: 57:1-57:15 - [c45]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Lower Bounds for Approximation Schemes for Closest String. SWAT 2016: 12:1-12:10 - [r3]Michal Pilipczuk:
Computing Cutwidth and Pathwidth of Semi-complete Digraphs. Encyclopedia of Algorithms 2016: 412-415 - [r2]Michal Pilipczuk:
Exact Algorithms for Induced Subgraph Problems. Encyclopedia of Algorithms 2016: 674-678 - [r1]Michal Pilipczuk:
Lower Bounds Based on the Exponential Time Hypothesis: Edge Clique Cover. Encyclopedia of Algorithms 2016: 1159-1162 - [i58]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. CoRR abs/1604.05999 (2016) - [i57]Mikolaj Bojanczyk, Michal Pilipczuk:
Definability equals recognizability for graphs of bounded treewidth. CoRR abs/1605.03045 (2016) - [i56]Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk:
Hardness of approximation for H-free edge modification problems. CoRR abs/1606.02688 (2016) - [i55]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Cutwidth: obstructions and algorithmic aspects. CoRR abs/1606.05975 (2016) - [i54]Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
The Generalised Colouring Numbers on Classes of Bounded Expansion. CoRR abs/1606.08972 (2016) - [i53]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
Tight lower bounds for the complexity of multicoloring. CoRR abs/1607.03432 (2016) - [i52]Archontia C. Giannopoulou, Michal Pilipczuk, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna:
Linear kernels for edge deletion problems to immersion-closed graph classes. CoRR abs/1609.07780 (2016) - [i51]Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk:
Hardness of approximation for strip packing. CoRR abs/1610.07766 (2016) - [i50]Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh:
Below all subsets for Minimal Connected Dominating Set. CoRR abs/1611.00840 (2016) - [i49]Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese:
Approximation and parameterized algorithms for geometric independent set with shrinking. CoRR abs/1611.06501 (2016) - [i48]Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Neighborhood complexity and kernelization for nowhere dense classes of graphs. CoRR abs/1612.08197 (2016) - 2015
- [b1]Marek Cygan, Fedor V. Fomin, Lukasz Kowalik
, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
Parameterized Algorithms. Springer 2015, ISBN 978-3-319-21274-6, pp. 3-555 - [j22]Petr A. Golovach
, Pinar Heggernes
, Pim van 't Hof
, Fredrik Manne, Daniël Paulusma
, Michal Pilipczuk
:
Modifying a Graph Using Vertex Elimination. Algorithmica 72(1): 99-125 (2015) - [j21]Fedor V. Fomin
, Archontia C. Giannopoulou, Michal Pilipczuk
:
Computing Tree-Depth Faster Than 2n. Algorithmica 73(1): 202-216 (2015) - [j20]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Sitting Closer to Friends than Enemies, Revisited. Theory Comput. Syst. 56(2): 394-405 (2015) - [j19]Fedor V. Fomin
, Petr A. Golovach
, Jesper Nederlof, Michal Pilipczuk
:
Minimizing Rosenthal Potential in Multicast Games. Theory Comput. Syst. 57(1): 81-96 (2015) - [j18]Stefan Kratsch, Marcin Pilipczuk
, Michal Pilipczuk, Magnus Wahlström
:
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. SIAM J. Discret. Math. 29(1): 122-144 (2015) - [j17]Ivan Bliznets
, Fedor V. Fomin
, Marcin Pilipczuk
, Michal Pilipczuk:
A Subexponential Parameterized Algorithm for Proper Interval Completion. SIAM J. Discret. Math. 29(4): 1961-1987 (2015) - [j16]Pål Grønås Drange, Fedor V. Fomin
, Michal Pilipczuk
, Yngve Villanger:
Exploring the Subexponential Complexity of Completion Problems. ACM Trans. Comput. Theory 7(4): 14:1-14:38 (2015) - [c44]Pål Grønås Drange, Michal Pilipczuk
:
A Polynomial Kernel for Trivially Perfect Editing. ESA 2015: 424-436 - [c43]Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk
:
Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints. ESA 2015: 545-556 - [c42]Dániel Marx, Michal Pilipczuk
:
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams. ESA 2015: 865-877 - [c41]Marthe Bonamy, Lukasz Kowalik
, Michal Pilipczuk
, Arkadiusz Socala:
Linear Kernels for Outbranching Problems in Sparse Digraphs. IPEC 2015: 199-211 - [c40]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna:
Polynomial Kernelization for Removing Induced Claws and Diamonds. WG 2015: 440-455 - [i47]Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk:
How to Hunt an Invisible Rabbit on a Graph. CTW 2015: 169-172 - [i46]Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk:
How to Hunt an Invisible Rabbit on a Graph. CoRR abs/1502.05614 (2015) - [i45]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna:
Polynomial kernelization for removing induced claws and diamonds. CoRR abs/1503.00704 (2015) - [i44]Dániel Marx, Michal Pilipczuk:
Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. CoRR abs/1504.05476 (2015) - [i43]Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna:
Edge Bipartization faster than 2k. CoRR abs/1507.02168 (2015) - [i42]Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk:
Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems. CoRR abs/1508.05282 (2015) - [i41]Michal Pilipczuk, Szymon Torunczyk:
On ultralimits of sparse graph classes. CoRR abs/1508.07256 (2015) - [i40]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala:
Linear kernels for outbranching problems in sparse digraphs. CoRR abs/1509.01675 (2015) - [i39]Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Lower bounds for approximation schemes for Closest String. CoRR abs/1509.05809 (2015) - [i38]Michal Pilipczuk, Marcin Wrochna:
On space efficiency of algorithms working on structural decompositions of graphs. CoRR abs/1509.05896 (2015) - [i37]Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Michal Pilipczuk, Michael Wehar:
Shortest paths in one-counter systems. CoRR abs/1510.05460 (2015) - [i36]Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna:
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. CoRR abs/1511.01379 (2015) - 2014
- [j15]Marek Cygan
, Dániel Marx, Marcin Pilipczuk
, Michal Pilipczuk, Ildikó Schlotter:
Parameterized Complexity of Eulerian Deletion Problems. Algorithmica 68(1): 41-61 (2014) - [j14]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Scheduling Partially Ordered Jobs Faster than 2 n. Algorithmica 68(3): 692-714 (2014) - [j13]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
On Cutwidth Parameterized by Vertex Cover. Algorithmica 68(4): 940-953 (2014) - [j12]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n. Algorithmica 70(2): 195-207 (2014) - [j11]Fedor V. Fomin
, Bart M. P. Jansen, Michal Pilipczuk
:
Preprocessing subgraph and minor problems: When does a small vertex cover help? J. Comput. Syst. Sci. 80(2): 468-495 (2014) - [j10]Fedor V. Fomin
, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger:
Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters. J. Comput. Syst. Sci. 80(7): 1430-1447 (2014) - [j9]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
On the Hardness of Losing Width. Theory Comput. Syst. 54(1): 73-82 (2014) - [j8]Marek Cygan
, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström
:
Clique Cover and Graph Separation: New Incompressibility Results. ACM Trans. Comput. Theory 6(2): 6:1-6:19 (2014) - [c39]Ivan Bliznets
, Fedor V. Fomin
, Marcin Pilipczuk
, Michal Pilipczuk:
A Subexponential Parameterized Algorithm for Proper Interval Completion. ESA 2014: 173-184 - [c38]Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. FOCS 2014: 186-195 - [c37]Marcin Pilipczuk
, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen:
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. FOCS 2014: 276-285 - [c36]Claire David, Piotr Hofman, Filip Murlak
, Michal Pilipczuk:
Synthesizing transformations from XML schema mappings. ICDT 2014: 61-71 - [c35]Marek Cygan
, Dániel Marx, Marcin Pilipczuk
, Michal Pilipczuk:
Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth. MFCS (2) 2014: 189-200 - [c34]Pål Grønås Drange
, Fedor V. Fomin
, Michal Pilipczuk
, Yngve Villanger:
Exploring Subexponential Parameterized Complexity of Completion Problems. STACS 2014: 288-299 - [c33]Dániel Marx, Michal Pilipczuk
:
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). STACS 2014: 542-553 - [c32]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
Minimum bisection is fixed parameter tractable. STOC 2014: 323-332 - [i35]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
A subexponential parameterized algorithm for Proper Interval Completion. CoRR abs/1402.3472 (2014) - [i34]Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
A subexponential parameterized algorithm for Interval Completion. CoRR abs/1402.3473 (2014) - [i33]Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. CoRR abs/1404.0818 (2014) - [i32]Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk:
Hitting forbidden subgraphs in graphs of bounded treewidth. CoRR abs/1411.4184 (2014) - [i31]Pål Grønås Drange
, Markus S. Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Saket Saurabh, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization and Sparseness: the case of Dominating Set. CoRR abs/1411.4575 (2014) - [i30]Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk:
Representative sets for multisets. CoRR abs/1411.6756 (2014) - [i29]Pål Grønås Drange, Michal Pilipczuk:
A Polynomial Kernel for Trivially Perfect Editing. CoRR abs/1412.7558 (2014) - 2013
- [j7]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Subset Feedback Vertex Set Is Fixed-Parameter Tractable. SIAM J. Discret. Math. 27(1): 290-309 (2013) - [j6]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
On multiway cut parameterized above lower bounds. ACM Trans. Comput. Theory 5(1): 3:1-3:11 (2013) - [c31]Ivan Bliznets
, Fedor V. Fomin
, Michal Pilipczuk
, Yngve Villanger:
Largest Chordal and Interval Subgraphs Faster Than 2 n. ESA 2013: 193-204 - [c30]Fedor V. Fomin
, Michal Pilipczuk
:
Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph. ESA 2013: 505-516 - [c29]Marek Cygan
, Dániel Marx, Marcin Pilipczuk
, Michal Pilipczuk:
The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable. FOCS 2013: 197-206 - [c28]Hans L. Bodlaender
, Pål Grønås Drange
, Markus S. Dregi, Fedor V. Fomin
, Daniel Lokshtanov, Michal Pilipczuk
:
An O(c^k n) 5-Approximation Algorithm for Treewidth. FOCS 2013: 499-508 - [c27]Fedor V. Fomin
, Archontia C. Giannopoulou, Michal Pilipczuk
:
Computing Tree-Depth Faster Than 2 n. IPEC 2013: 137-149 - [c26]Fedor V. Fomin, Michal Pilipczuk:
Jungles, bundles, and fixed parameter tractability. SODA 2013: 396-413 - [c25]Marek Cygan, Marcin Pilipczuk
, Michal Pilipczuk:
Known algorithms for EDGE CLIQUE COVER are probably optimal. SODA 2013: 1044-1053 - [c24]Fedor V. Fomin
, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger:
Tight bounds for Parameterized Complexity of Cluster Editing. STACS 2013: 32-43 - [c23]Michal Pilipczuk
:
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. STACS 2013: 197-208 - [c22]Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen:
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. STACS 2013: 353-364 - [i28]Fedor V. Fomin, Michal Pilipczuk:
Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph. CoRR abs/1301.7314 (2013) - [i27]Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk:
The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable. CoRR abs/1304.4207 (2013) - [i26]Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk:
A O(c^k n) 5-Approximation Algorithm for Treewidth. CoRR abs/1304.6321 (2013) - [i25]Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk:
Computing Tree-depth Faster Than 2n. CoRR abs/1306.3857 (2013) - [i24]Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen:
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. CoRR abs/1306.6593 (2013) - [i23]Dániel Marx, Michal Pilipczuk:
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). CoRR abs/1307.2187 (2013) - [i22]Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Exploring Subexponential Parameterized Complexity of Completion Problems. CoRR abs/1309.4022 (2013) - [i21]Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk:
Minimizing Rosenthal Potential in Multicast Games. CoRR abs/1309.6797 (2013) - [i20]Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh:
Minimum Bisection is fixed parameter tractable. CoRR abs/1311.2563 (2013) - [i19]Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Largest chordal and interval subgraphs faster than 2^n. CoRR abs/1311.4055 (2013) - 2012
- [j5]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion. Algorithmica 64(1): 170-188 (2012) - [j4]Marek Cygan
, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Kernelization hardness of connectivity problems in d-degenerate graphs. Discret. Appl. Math. 160(15): 2131-2141 (2012) - [j3]Marcin Pilipczuk
, Michal Pilipczuk, Riste Skrekovski:
Some results on Vizing's conjecture and related problems. Discret. Appl. Math. 160(16-17): 2484-2490 (2012) - [j2]Marek Cygan
, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More). SIAM J. Comput. 41(4): 815-828 (2012) - [c21]Rajesh Hemant Chitnis
, Marek Cygan
, MohammadTaghi Hajiaghayi, Marcin Pilipczuk
, Michal Pilipczuk:
Designing FPT Algorithms for Cut Problems Using Randomized Contractions. FOCS 2012: 460-469 - [c20]Marek Cygan
, Stefan Kratsch, Marcin Pilipczuk
, Michal Pilipczuk, Magnus Wahlström:
Clique Cover and Graph Separation: New Incompressibility Results. ICALP (1) 2012: 254-265 - [c19]Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk:
Minimizing Rosenthal Potential in Multicast Games. ICALP (2) 2012: 525-536 - [c18]Stefan Kratsch, Marcin Pilipczuk
, Michal Pilipczuk, Magnus Wahlström:
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs. ICALP (1) 2012: 581-593 - [c17]Marcin Pilipczuk
, Michal Pilipczuk:
Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n. IPEC 2012: 3-12 - [c16]Fedor V. Fomin
, Bart M. P. Jansen, Michal Pilipczuk
:
Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? IPEC 2012: 97-108 - [c15]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. LATIN 2012: 195-206 - [c14]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Sitting Closer to Friends Than Enemies, Revisited. MFCS 2012: 296-307 - [c13]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk:
On Group Feedback Vertex Set Parameterized by the Size of the Cutset. WG 2012: 194-205 - [c12]Petr A. Golovach
, Pinar Heggernes
, Pim van 't Hof
, Fredrik Manne, Daniël Paulusma
, Michal Pilipczuk
:
How to Eliminate a Graph. WG 2012: 320-331 - [i18]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Sitting closer to friends than enemies, revisited. CoRR abs/1201.1869 (2012) - [i17]Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström:
Fixed-parameter tractability of multicut in directed acyclic graphs. CoRR abs/1202.5749 (2012) - [i16]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk:
Known algorithms for EDGE CLIQUE COVER are probably optimal. CoRR abs/1203.1754 (2012) - [i15]Fedor V. Fomin, Bart M. P. Jansen, Michal Pilipczuk:
Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? CoRR abs/1206.4912 (2012) - [i14]Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk:
Designing FPT algorithms for cut problems using randomized contractions. CoRR abs/1207.4079 (2012) - [i13]Marcin Pilipczuk, Michal Pilipczuk:
Finding a maximum induced degenerate subgraph faster than 2^n. CoRR abs/1208.4449 (2012) - [i12]Michal Pilipczuk:
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. CoRR abs/1210.5363 (2012) - 2011
- [j1]Marek Cygan
, Geevarghese Philip, Marcin Pilipczuk
, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Dominating set is fixed parameter tractable in claw-free graphs. Theor. Comput. Sci. 412(50): 6982-7000 (2011) - [c11]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Scheduling Partially Ordered Jobs Faster Than 2 n. ESA 2011: 299-310 - [c10]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. FOCS 2011: 150-159 - [c9]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Subset Feedback Vertex Set Is Fixed-Parameter Tractable. ICALP (1) 2011: 449-461 - [c8]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
On Multiway Cut Parameterized above Lower Bounds. IPEC 2011: 1-12 - [c7]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
On the Hardness of Losing Width. IPEC 2011: 159-168 - [c6]Marek Cygan
, Daniel Lokshtanov, Marcin Pilipczuk
, Michal Pilipczuk, Saket Saurabh:
On Cutwidth Parameterized by Vertex Cover. IPEC 2011: 246-258 - [c5]Michal Pilipczuk
:
Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach. MFCS 2011: 520-531 - [c4]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem). SODA 2011: 1666-1674 - [c3]Marek Cygan
, Dániel Marx, Marcin Pilipczuk
, Michal Pilipczuk, Ildikó Schlotter:
Parameterized Complexity of Eulerian Deletion Problems. WG 2011: 131-142 - [i11]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. CoRR abs/1103.0534 (2011) - [i10]Michal Pilipczuk:
Problems parameterized by treewidth tractable in single exponential time: a logical approach. CoRR abs/1104.3057 (2011) - [i9]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
On Multiway Cut parameterized above lower bounds. CoRR abs/1107.1585 (2011) - [i8]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Scheduling partially ordered jobs faster than 2^n. CoRR abs/1108.0810 (2011) - [i7]Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström:
Clique cover and graph separation: New incompressibility results. CoRR abs/1111.0570 (2011) - [i6]Fedor V. Fomin, Michal Pilipczuk:
Jungles, bundles, and fixed parameter tractability. CoRR abs/1112.1538 (2011) - [i5]Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger:
Subexponential fixed-parameter tractability of cluster editing. CoRR abs/1112.4419 (2011) - [i4]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk:
On group feedback vertex set parameterized by the size of the cutset. CoRR abs/1112.6255 (2011) - 2010
- [c2]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion. IPEC 2010: 95-106 - [c1]Marek Cygan
, Marcin Pilipczuk
, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs. WG 2010: 147-158 - [i3]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Subset feedback vertex set is fixed parameter tractable. CoRR abs/1004.2972 (2010) - [i2]Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem). CoRR abs/1004.5010 (2010) - [i1]Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk:
Dominating Set is Fixed Parameter Tractable in Claw-free Graphs. CoRR abs/1011.6239 (2010)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint