22 results on '"van Leeuwen, Erik Jan"'
Search Results
2. The parameterized complexity of the survivable network design problem
3. Streaming deletion problems parameterized by vertex cover
4. Few induced disjoint paths for H-free graphs
5. Upper bounding rainbow connection number by forest number
6. Induced Disjoint Paths in AT-free graphs
7. Disjoint paths and connected subgraphs for H-free graphs
8. Algorithms for the rainbow vertex coloring problem on graph classes
9. Steiner trees for hereditary graph classes: A treewidth perspective
10. Disconnected cuts in claw-free graphs
11. Complexity of independency and cliquy trees
12. Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
13. Polynomial kernels for deletion to classes of acyclic digraphs
14. Shortcutting directed and undirected networks with a degree constraint
15. Complexity of metric dimension on planar graphs
16. Parameterized complexity dichotomy for Steiner Multicut
17. Induced disjoint paths in circular-arc graphs in linear time
18. The Firefighter problem on graph classes
19. Parameterized complexity of firefighting
20. Co-Bipartite Neighborhood Edge Elimination Orderings
21. What Graphs are 2-Dot Product Graphs?
22. Spanners of bounded degree graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.