183 results on '"Erik Jan van Leeuwen"'
Search Results
2. Separator Theorem and Algorithms for Planar Hyperbolic Graphs.
3. Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
4. Parameterized Complexity of Streaming Diameter and Connectivity Problems.
5. The Complexity of Diameter on H-free graphs.
6. The Parameterised Complexity Of Integer Multicommodity Flow.
7. Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth.
8. Computing Subset Vertex Covers in H-Free Graphs.
9. Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs.
10. Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs.
11. Few induced disjoint paths for H-free graphs.
12. Parameterized Complexity of Streaming Diameter and Connectivity Problems.
13. Few Induced Disjoint Paths for H-Free Graphs.
14. The Parameterized Complexity of the Survivable Network Design Problem.
15. Planar Multiway Cut with Terminals on Few Faces.
16. Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs.
17. Induced Disjoint Paths in AT-free graphs.
18. Disjoint paths and connected subgraphs for H-free graphs.
19. Separator Theorem and Algorithms for Planar Hyperbolic Graphs.
20. Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
21. Streaming Deletion Problems Parameterized by Vertex Cover.
22. Disjoint Paths and Connected Subgraphs for H-Free Graphs.
23. Steiner Trees for Hereditary Graph Classes.
24. Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes.
25. What Graphs are 2-Dot Product Graphs?
26. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
27. Algorithms for the rainbow vertex coloring problem on graph classes.
28. Steiner trees for hereditary graph classes: A treewidth perspective.
29. A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs.
30. A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs.
31. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
32. On Geometric Set Cover for Orthants.
33. Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces.
34. Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces.
35. Complexity of independency and cliquy trees.
36. Disconnected cuts in claw-free graphs.
37. Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs.
38. Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.
39. Complexity Framework For Forbidden Subgraphs.
40. Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs.
41. Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision.
42. Streaming deletion problems parameterized by vertex cover.
43. Disconnected Cuts in Claw-free Graphs.
44. Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs.
45. Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.
46. Algorithms and Bounds for Very Strong Rainbow Coloring.
47. Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs.
48. Domination When the Stars Are Out.
49. Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs.
50. The Parameterized Complexity of the Survivable Network Design 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.