Michal Pilipczuk

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 246

Top Venues

Publications

Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk
Elementary first-order model checking for sparse graphs. LICS (2024)
Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
Parameterized algorithms for block-structured integer programs with large entries. SODA (2024)
Jakub Gajarský, Michal Pilipczuk, Marek Sokolowski, Giannos Stamoulis, Szymon Torunczyk
Elementary first-order model checking for sparse graphs. CoRR (2024)
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) (2024)
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)
Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. SOSA (2024)
Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak
Cliquewidth and Dimension. SODA (2024)
Mathieu Mari, Anish Mukherjee, Michal Pilipczuk, Piotr Sankowski
Shortest Disjoint Paths on a Grid. SODA (2024)
Katarzyna Anna Kowalska, Michal Pilipczuk
Parameterized and approximation algorithms for coverings points with segments in the plane. CoRR (2024)
Katarzyna Anna Kowalska, Michal Pilipczuk
Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane. STACS (2024)
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)
Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
Fully dynamic approximation schemes on planar and apex-minor-free graphs. SODA (2024)
Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
-free graphs. SODA (2024)
Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis
Minor Containment and Disjoint Paths in almost-linear time. CoRR (2024)
Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. SODA (2024)
Konrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz
Parameterized dynamic data structure for Split Completion. CoRR (2024)
Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number. STACS (2023)
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 (2023)
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) (2023)
Hans L. Bodlaender, Carla Groenland, Michal Pilipczuk
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters. ICALP (2023)
Michal Pilipczuk, Mathieu Mari, Timothé Picavet
A parameterized approximation scheme for the 2D-Knapsack problem with wide items. CoRR (2023)
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 (2023)
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)
Jana Cslovjecsek, Martin Koutecký, Alexandra Lassota, Michal Pilipczuk, Adam Polak
Parameterized algorithms for block-structured integer programs with large entries. CoRR (2023)
Lukasz Kowalik, Alexandra Lassota, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard. CoRR (2023)
Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michal Pilipczuk, Szymon Torunczyk
First-Order Model Checking on Monadically Stable Graph Classes. CoRR (2023)
Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
Fully dynamic approximation schemes on planar and apex-minor-free graphs. CoRR (2023)
Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models. Electron. J. Comb. 30 (3) (2023)
Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz
Dynamic Data Structures for Parameterized String Problems. STACS (2023)
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) (2023)
Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
Dynamic treewidth. FOCS (2023)
Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. CoRR (2023)
Pierre Ohlmann, Michal Pilipczuk, Szymon Torunczyk, Wojciech Przybyszewski
Canonical decompositions in monadically stable and bounded shrubdepth graph classes. CoRR (2023)
Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
Simpler and faster algorithms for detours in planar digraphs. CoRR (2023)
Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
Dynamic treewidth. CoRR (2023)
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)
Antonio Casares, Marcin Pilipczuk, Michal Pilipczuk, Uéverton S. Souza, K. S. Thejaswini
Simple and tight complexity lower bounds for solving Rabin games. CoRR (2023)
Michal Pilipczuk, Marek Sokolowski
-bounded. J. Comb. Theory, Ser. B 161 (2023)
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) (2023)
Mathieu Mari, Timothé Picavet, Michal Pilipczuk
A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items. IPEC (2023)
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)
Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
Simpler and faster algorithms for detours in planar digraphs. SOSA (2023)
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 (2023)
Maria Chudnovsky, Rose McCarty, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
Sparse induced subgraphs in P_6-free graphs. CoRR (2023)
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 (2023)
Marthe Bonamy, Jadwiga Czyzewska, Lukasz Kowalik, Michal Pilipczuk
Partitioning edges of a planar graph into linear forests and a matching. CoRR (2023)
Gwenaël Joret, Piotr Micek, Michal Pilipczuk, Bartosz Walczak
Cliquewidth and dimension. CoRR (2023)
Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk
On Rational Recursive Sequences. STACS (2023)
Pierre Ohlmann, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
Canonical Decompositions in Monadically Stable and Bounded Shrubdepth Graph Classes. ICALP (2023)
Jakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
Twin-width and types. CoRR (2022)
Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
Bounding generalized coloring numbers of planar graphs using coin models. CoRR (2022)
Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz
Dynamic data structures for parameterized string problems. CoRR (2022)
Michal Pilipczuk, Patrice Ossona de Mendez, Sebastian Siebertz
Transducing paths in graph classes with unbounded shrubdepth. CoRR (2022)
Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk
-free Graphs. ACM Trans. Algorithms 18 (1) (2022)
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)
Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros
Dynamic Data Structures for Timed Automata Acceptance. Algorithmica 84 (11) (2022)
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) (2022)
Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk
On the Complexity of Problems on Tree-Structured Graphs. IPEC (2022)
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)
Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
Independence number of intersection graphs of axis-parallel segments. CoRR (2022)
Mikolaj Bojanczyk, Michal Pilipczuk
Optimizing tree decompositions in MSO. Log. Methods Comput. Sci. 18 (1) (2022)
Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz
Computing treedepth in polynomial space and linear fpt time. CoRR (2022)
Jakub Gajarský, Michal Pilipczuk, Szymon Torunczyk
Stable graphs of bounded twin-width. LICS (2022)
Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
Shorter Labeling Schemes for Planar Graphs. SIAM J. Discret. Math. 36 (3) (2022)
Lukasz Bozyk, Michal Pilipczuk
Polynomial kernel for immersion hitting in tournaments. CoRR (2022)
Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk
Treelike decompositions for transductions of sparse graphs. CoRR (2022)
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) (2022)
Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. CoRR (2022)
Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
Highly unbreakable graph with a fixed excluded minor are almost rigid. CoRR (2022)
Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
Fixed-parameter tractability of Graph Isomorphism in graphs with an excluded minor. CoRR (2022)
Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak
-free graphs with no large complete bipartite subgraphs. J. Comb. Theory, Ser. B 152 (2022)
Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz
Computing Treedepth in Polynomial Space and Linear FPT Time. ESA (2022)
Jakub Gajarský, Michal Pilipczuk, Wojciech Przybyszewski, Szymon Torunczyk
Twin-Width and Types. ICALP (2022)
Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk
Treelike Decompositions for Transductions of Sparse Graphs. LICS (2022)
Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk
On the Complexity of Problems on Tree-structured Graphs. CoRR (2022)
Lukasz Bozyk, Michal Pilipczuk
Polynomial Kernel for Immersion Hitting in Tournaments. ESA (2022)
Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk
On objects dual to tree-cut decompositions. J. Comb. Theory, Ser. B 157 (2022)
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) (2022)
Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh
Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor. STOC (2022)
Michal Pilipczuk, Marek Sokolowski
Graphs of bounded twin-width are quasi-polynomially χ-bounded. CoRR (2022)
Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk
On digraphs without onion star immersions. CoRR (2022)
Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Isolation Schemes for Problems on Decomposable Graphs. STACS (2022)
Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk
On Rational Recursive Sequences. CoRR (2022)
Dániel Marx, Michal Pilipczuk
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams. ACM Trans. Algorithms 18 (2) (2022)
Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz
Compact Representation for Matrices of Bounded Twin-Width. STACS (2022)
Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
-free graphs in quasipolynomial time. STOC (2021)
Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski
-free graphs via shrinking the space of induced paths. SOSA (2021)
Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk
Definable decompositions for graphs of bounded linear cliquewidth. Log. Methods Comput. Sci. 17 (1) (2021)
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)
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) (2021)
Michal Pilipczuk, Sebastian Siebertz
Kernelization and approximation of distance-r independent sets on nowhere dense graphs. Eur. J. Comb. 94 (2021)
Jakub Gajarský, Michal Pilipczuk, Szymon Torunczyk
Stable graphs of bounded twin-width. CoRR (2021)
Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. CoRR (2021)
Alejandro Grez, Filip Mazowiecki, Michal Pilipczuk, Gabriele Puppis, Cristian Riveros
Dynamic Data Structures for Timed Automata Acceptance. IPEC (2021)
Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
Rankwidth meets stability. SODA (2021)
Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Isolation schemes for problems on decomposable graphs. CoRR (2021)
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) (2021)
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) (2021)
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) (2021)
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) (2021)

Michal Pilipczuk.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michal Pilipczuk