23 results on '"Pilipczuk, Marcin"'
Search Results
2. The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs
3. Packing Directed Cycles Quarter- and Half-Integrally
4. Hardness of Metric Dimension in Graphs of Constant Treewidth
5. Preface to the Special Issue on Parameterized and Exact Computation
6. Polynomial Treedepth Bounds in Linear Colorings
7. An Improved FPT Algorithm for Independent Feedback Vertex Set
8. Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
9. Multi-budgeted Directed Cuts
10. Deleting Vertices to Graphs of Bounded Genus
11. An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
12. Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs
13. Edge Bipartization Faster than $$2^k$$ 2 k
14. Polynomial Kernelization for Removing Induced Claws and Diamonds
15. A Fast Branching Algorithm for Cluster Vertex Deletion
16. Sitting Closer to Friends than Enemies, Revisited
17. Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n
18. On the Hardness of Losing Width
19. On Cutwidth Parameterized by Vertex Cover
20. Scheduling Partially Ordered Jobs Faster than 2 n
21. Parameterized Complexity of Eulerian Deletion Problems
22. An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion
23. The negative association property for the absolute values of random variables equidistributed on a generalized Orlicz ball
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.