Marcin Pilipczuk
Uniwersytet Warszawski
H-index: 33
Europe-Poland
Top articles of Marcin Pilipczuk
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof | Karthik CS Dániel Marx Marcin Pilipczuk Uéverton Souza | 2024 | |
Combinatorial Correlation Clustering | arXiv preprint arXiv:2404.05433 | Vincent Cohen-Addad David Rasmussen Lolck Marcin Pilipczuk Mikkel Thorup Shuyi Yan | 2024/4/8 |
Simple and tight complexity lower bounds for solving Rabin games | Antonio Casares Marcin Pilipczuk Michał Pilipczuk Uéverton S Souza KS Thejaswini | 2024 | |
On Weighted Graph Separation Problems and Flow Augmentation | SIAM Journal on Discrete Mathematics | Eun Jung Kim Tomáš Masařík Marcin Pilipczuk Roohani Sharma Magnus Wahlström | 2024/3/31 |
Sparse induced subgraphs in P6-free graphs | Maria Chudnovsky Rose McCarty Marcin Pilipczuk Michał Pilipczuk Paweł Rzążewski | 2024 | |
Max weight independent set in graphs with no long claws: An analog of the gyárfás’ path argument | ACM Transactions on Computation Theory | Konrad Majewski Tomáš Masařík Jana Masaříková Karolina Okrasa Marcin Pilipczuk | 2024/3/14 |
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in -Free Graphs | SIAM Journal on Computing | Maria Chudnovsky Marcin Pilipczuk Michał Pilipczuk Stéphan Thomassé | 2024/2/29 |
Flow-augmentation II: Undirected graphs | ACM Transactions on Algorithms | Eun Jung Kim Stefan Kratsch Marcin Pilipczuk Magnus Wahlström | 2024/3/13 |
Parameterized Complexity Classification for Interval Constraints | arXiv preprint arXiv:2305.13889 | Konrad K Dabrowski Peter Jonsson Sebastian Ordyniak George Osipov Marcin Pilipczuk | 2023/5/23 |
A polynomial bound on the number of minimal separators and potential maximal cliques in -free graphs of bounded clique number | arXiv preprint arXiv:2310.11573 | Marcin Pilipczuk Paweł Rzążewski | 2023/10/17 |
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs | Algorithmica | Thomas Bellitto Shaohua Li Karolina Okrasa Marcin Pilipczuk Manuel Sorge | 2023/5 |
Directed Symmetric Multicut is W [1]-hard | arXiv preprint arXiv:2310.05839 | George Osipov Marcin Pilipczuk | 2023/10/9 |
Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation | Meike Hatzel Lars Jaffke Paloma T Lima Tomáš Masařík Marcin Pilipczuk | 2023 | |
Max Weight Independent Set in sparse graphs with no long claws | arXiv preprint arXiv:2309.16995 | Tara Abrishami Maria Chudnovsky Marcin Pilipczuk Paweł Rzążewski | 2023/9/29 |
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints | Eun Jung Kim Stefan Kratsch Marcin Pilipczuk Magnus Wahlström | 2023 | |
The Influence of Dimensions on the Complexity of Computing Decision Trees | Proceedings of the AAAI Conference on Artificial Intelligence | Stephen G Kobourov Maarten Löffler Fabrizio Montecchiani Marcin Pilipczuk Ignaz Rutter | 2023/6/26 |
Tight bound on treedepth in terms of pathwidth and longest path | Combinatorica | Meike Hatzel Gwenaël Joret Piotr Micek Marcin Pilipczuk Torsten Ueckerdt | 2023/12/19 |
A tight quasi-polynomial bound for Global Label Min-Cut | Lars Jaffke Paloma T Lima Tomáš Masařík Marcin Pilipczuk Uéverton S Souza | 2023 | |
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time | arXiv preprint arXiv:2305.15738 | Peter Gartland Daniel Lokshtanov Tomáš Masařík Marcin Pilipczuk Michał Pilipczuk | 2023/5/25 |
Planar and minor-free metrics embed into metrics of polylogarithmic treewidth with expected multiplicative distortion arbitrarily close to 1 | Vincent Cohen-Addad Hung Le Marcin Pilipczuk Michał Pilipczuk | 2023/11/6 |
Co-Authors
