170 results on '"Pilipczuk, Marcin"'
Search Results
2. Simple and tight complexity lower bounds for solving Rabin games
3. Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
4. A tight quasi-polynomial bound for Global Label Min-Cut
5. Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
6. Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
7. Combinatorial Correlation Clustering
8. Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
9. Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs
10. Flow-augmentation II: Undirected Graphs
11. Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás’ path argument
12. On Weighted Graph Separation Problems and Flow Augmentation
13. Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths
14. Constant Congestion Brambles in Directed Graphs
15. Solving hard cut problems via flow-augmentation
16. Quasi-polynomial-time algorithm for Independent Set in Pt-free graphs via shrinking the space of induced paths
17. Efficient fully dynamic elimination forests with applications to detecting long paths and cycles
18. Induced subgraphs of bounded treewidth and the container method
19. Optimal Discretization is Fixed-parameter Tractable
20. Tight Bound on Treedepth in Terms of Pathwidth and Longest Path
21. Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1*
22. Cluster Editing parameterized above modification-disjoint P 3 -packings
23. Surprising Applications of Treewidth Bounds for Planar Graphs
24. Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs
25. The Influence of Dimensions on the Complexity of Computing Decision Trees
26. Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs
27. Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P4
28. Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
29. The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs
30. An Improved FPT Algorithm for Independent Feedback Vertex Set
31. Planar Digraphs
32. Packing Directed Cycles Quarter- and Half-Integrally
33. Hardness of Metric Dimension in Graphs of Constant Treewidth
34. Intrinsic linking of chromatin fiber in human cells
35. Preface to the Special Issue on Parameterized and Exact Computation
36. Fixed-parameter tractability of graph isomorphism in graphs with an excluded minor
37. Directed flow-augmentation
38. Constant Congestion Brambles in Directed Graphs
39. A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs
40. Constant Congestion Brambles
41. Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
42. Exact Algorithms on Graphs of Bounded Average Degree
43. Polynomial Kernelization for Removing Induced Claws and Diamonds
44. Planar Directed k-Vertex-Disjoint Paths Problem
45. Polynomial-time Algorithm for Maximum Weight Independent Set on P 6 -free Graphs
46. Bounded Search Trees
47. Matroids
48. Randomized Methods in Parameterized Algorithms
49. Fixed-parameter intractability
50. Introduction
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.