Items where Author is "Pilipczuk, M"
Number of items: 7.
| Date | Author/Title | | Document Type |
|---|
| 2019 | Bacsó, Gábor and Lokshtanov, D and Marx, Dániel and Pilipczuk, M and Tuza, Zsolt
Subexponential-Time Algorithms for Maximum Independent Set in Pt-Free and Broom-Free Graphs | | Article |
| 2018 | Marx, Dániel and Pilipczuk, M and Pilipczuk, M
On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs |  | Book Section |
| 2017 | Cygan, M and Marx, Dániel and Pilipczuk, M and Pilipczuk, M
Hitting forbidden subgraphs in graphs of bounded treewidth | | Article |
| 2017 | Marx, Dániel and Pilipczuk, M
Subexponential parameterized algorithms for graphs of polynomial growth | | Book Section |
| 2016 | Fomin, FV and Lokshtanov, D and Marx, Dániel and Pilipczuk, M and Pilipczuk, M
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering | | Book Section |
| 2015 | Marx, Dániel and Pilipczuk, M
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams | | Book Section |
| 2013 | Cygan, M and Marx, Dániel and Pilipczuk, M and Pilipczuk, M
The planar directed k -Vertex-Disjoint Paths problem is fixed-parameter tractable | | Conference or Workshop Item |
This list was generated on Wed Nov 27 03:14:22 2024 CET.
