640 results on '"Daniël Paulusma"'
Search Results
2. Graph Homomorphism, Monotone Classes and Bounded Pathwidth.
3. Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
4. Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded.
5. An Algorithmic Framework for Locally Constrained Homomorphisms.
6. The Complexity of Diameter on H-free graphs.
7. Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs.
8. Computing Subset Vertex Covers in H-Free Graphs.
9. Matching Cuts in Graphs of High Girth and H-Free Graphs.
10. Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs.
11. Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius.
12. Clique-width: Harnessing the power of atoms.
13. Finding Matching Cuts in H-Free Graphs.
14. Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs.
15. The Complexity of L(p, q)-Edge-Labelling.
16. The Complexity of Matching Games: A Survey.
17. Few induced disjoint paths for H-free graphs.
18. Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius.
19. Solving problems on generalized convex graphs via mim-width.
20. Classifying subset feedback vertex set for H-free graphs.
21. On the price of independence for vertex cover, feedback vertex set and odd cycle transversal.
22. Few Induced Disjoint Paths for H-Free Graphs.
23. Finding Matching Cuts in H-Free Graphs.
24. Computing Balanced Solutions for Large International Kidney Exchange Schemes.
25. The Complexity of L(p, q)-Edge-Labelling.
26. An Algorithmic Framework for Locally Constrained Homomorphisms.
27. Classifying Subset Feedback Vertex Set for H-Free Graphs.
28. Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs.
29. Bounding the mim-width of hereditary graph classes.
30. Colouring graphs of bounded diameter in the absence of small cycles.
31. Computing Weighted Subset Odd Cycle Transversals in H-free graphs.
32. Induced Disjoint Paths in AT-free graphs.
33. QCSP on Reflexive Tournaments.
34. Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481).
35. On the complexity of matching cut for graphs of bounded radius and H-free graphs.
36. Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter.
37. Disjoint paths and connected subgraphs for H-free graphs.
38. Partitioning H-free graphs of bounded diameter.
39. Computing subset transversals in H-free graphs.
40. Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs.
41. Maximizing Matching Cuts.
42. Computing pivot-minors.
43. Partitioned Matching Games for International Kidney Exchange.
44. Comparing Width Parameters on Graph Classes.
45. Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
46. Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded.
47. QCSP on Reflexive Tournaments.
48. Disjoint Paths and Connected Subgraphs for H-Free Graphs.
49. Partitioning H-Free Graphs of Bounded Diameter.
50. Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block 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.