Michal Pilipczuk
Orcid: 0000-0001-7891-1988Affiliations:
- University of Warsaw, Institute of Informatics, Poland
According to our database1,
Michal Pilipczuk
authored at least 210 papers
between 2010 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2025
2024
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs.
SIAM J. Comput., February, 2024
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
A polynomial-time OPT<sup>ɛ</sup>-approximation algorithm for maximum independent set of connected subgraphs in a planar graph.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
2023
J. Graph Theory, November, 2023
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space.
SIAM J. Discret. Math., September, 2023
J. Comb. Theory B, July, 2023
Math. Oper. Res., May, 2023
J. Comput. Geom., 2023
A polynomial-time OPT<sup>ε</sup>-approximation algorithm for maximum independent set of connected subgraphs in a planar graph.
CoRR, 2023
CoRR, 2023
Electron. J. Comb., 2023
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023
Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023
A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
2022
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams.
ACM Trans. Algorithms, 2022
Polynomial-time Algorithm for Maximum Weight Independent Set on <i>P</i><sub>6</sub>-free Graphs.
ACM Trans. Algorithms, 2022
ACM Trans. Algorithms, 2022
A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs.
SIAM J. Comput., 2022
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering.
SIAM J. Comput., 2022
Degeneracy of <i>P</i><sub><i>t</i></sub>-free and <i>C</i><sub>⩾<i>t</i></sub>-free graphs with no large complete bipartite subgraphs.
J. Comb. Theory B, 2022
Discret. Math. Theor. Comput. Sci., 2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022
Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
2021
SIAM J. Discret. Math., 2021
SIAM J. Discret. Math., 2021
Log. Methods Comput. Sci., 2021
J. Comb. Theory B, 2021
Kernelization and approximation of distance-r independent sets on nowhere dense graphs.
Eur. J. Comb., 2021
Dagstuhl Reports, 2021
Maintaining CMSO<sub>2</sub> properties on dynamic structures with bounded feedback vertex number.
CoRR, 2021
Electron. J. Comb., 2021
Algorithmica, 2021
Finding large induced sparse subgraphs in <i>c<sub>>t</sub></i> -free graphs in quasipolynomial time.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Quasi-polynomial-time algorithm for Independent Set in <i>P<sub>t</sub></i>-free graphs via shrinking the space of induced paths.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
2020
ACM Trans. Comput. Theory, 2020
ACM Trans. Comput. Log., 2020
ACM Trans. Algorithms, 2020
Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems.
ACM Trans. Algorithms, 2020
On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five.
SIAM J. Discret. Math., 2020
Quasi-polynomial-time algorithm for Independent Set in P<sub>t</sub>-free and C<sub>>t</sub>-free graphs via shrinking the space of connecting subgraphs.
CoRR, 2020
Covering minimal separators and potential maximal cliques in P<sub>t</sub>-free graphs.
CoRR, 2020
CoRR, 2020
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs.
Algorithmica, 2020
Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation.
Algorithmica, 2020
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in <i>H</i>-free graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020
Proceedings of the Treewidth, Kernels, and Algorithms, 2020
2019
ACM Trans. Comput. Theory, 2019
J. Graph Theory, 2019
J. Comb. Theory B, 2019
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs.
CoRR, 2019
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the Integer Programming and Combinatorial Optimization, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
Proceedings of the 30th International Conference on Concurrency Theory, 2019
2018
ACM Trans. Comput. Theory, 2018
ACM Trans. Comput. Theory, 2018
ACM Trans. Algorithms, 2018
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth.
ACM Trans. Algorithms, 2018
ACM Trans. Algorithms, 2018
Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs.
ACM Trans. Algorithms, 2018
Parameterized circuit complexity of model checking first-order logic on sparse structures.
CoRR, 2018
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018
On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
2017
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth.
SIAM J. Comput., 2017
Theory Comput. Syst., 2017
CoRR, 2017
Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017
On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk).
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017
Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017
2016
Encyclopedia of Algorithms, 2016
Encyclopedia of Algorithms, 2016
SIAM J. Comput., 2016
Algorithmica, 2016
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016
Proceedings of the Approximation, 2016
2015
ACM Trans. Comput. Theory, 2015
SIAM J. Discret. Math., 2015
SIAM J. Discret. Math., 2015
Proceedings of the Algorithms - ESA 2015, 2015
2014
ACM Trans. Comput. Theory, 2014
Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters.
J. Comput. Syst. Sci., 2014
J. Comput. Syst. Sci., 2014
Algorithmica, 2014
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask).
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014
2013
SIAM J. Discret. Math., 2013
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph.
Proceedings of the Algorithms - ESA 2013, 2013
Proceedings of the Algorithms - ESA 2013, 2013
2012
A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More).
SIAM J. Comput., 2012
Discret. Appl. Math., 2012
Algorithmica, 2012
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012
2011
Theor. Comput. Sci., 2011
The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem).
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011
2010
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010