24 results on '"Pilipczuk, Marcin"'
Search Results
2. Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
3. Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1*
4. Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P4
5. Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor
6. Directed flow-augmentation
7. Finding large induced sparse subgraphs inc >t-free graphs in quasipolynomial time
8. A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs
9. On Subexponential Parameterized Algorithms for Steiner Tree and Directed Subset TSP on Planar Graphs
10. Approximation and Kernelization for Chordal Vertex Deletion
11. Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
12. Independence and Efficient Domination on P6-free Graphs
13. Directed multicut is W[1]-hard, even for four terminal pairs
14. Subexponential parameterized algorithm for Interval Completion
15. The Power of Dynamic Distance Oracles
16. Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
17. Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
18. Minimum bisection is fixed parameter tractable
19. The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable
20. Known algorithms for Edge Clique Cover are probably optimal
21. Minimum bisection is fixed parameter tractable.
22. Designing FPT Algorithms for Cut Problems Using Randomized Contractions
23. Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
24. The stubborn problem is stubborn no more (a polynomial algorithm for 3–compatible colouring and the stubborn list partition problem)
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.