21 results on '"van Leeuwen, Erik Jan"'
Search Results
2. Few induced disjoint paths for H-free graphs
3. Upper bounding rainbow connection number by forest number
4. Induced Disjoint Paths in AT-free graphs
5. Disjoint paths and connected subgraphs for H-free graphs
6. Algorithms for the rainbow vertex coloring problem on graph classes
7. Steiner trees for hereditary graph classes: A treewidth perspective
8. Disconnected cuts in claw-free graphs
9. Complexity of independency and cliquy trees
10. Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
11. Co-Bipartite Neighborhood Edge Elimination Orderings
12. Polynomial kernels for deletion to classes of acyclic digraphs
13. Shortcutting directed and undirected networks with a degree constraint
14. Complexity of metric dimension on planar graphs
15. Parameterized complexity dichotomy for Steiner Multicut
16. Induced disjoint paths in circular-arc graphs in linear time
17. The Firefighter problem on graph classes
18. What Graphs are 2-Dot Product Graphs?
19. Algorithms for diversity and clustering in social networks through dot product graphs
20. Parameterized complexity of firefighting
21. 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.