620 results on '"Dimitrios M. Thilikos"'
Search Results
2. Parameterizing the quantification of CMSO: model checking on minor-closed graph classes.
3. Approximating Branchwidth on Parametric Extensions of Planarity.
4. Obstructions to Erdös-Pósa Dualities for Minors.
5. Delineating Half-Integrality of the Erdős-Pósa Property for Minors: The Case of Surfaces.
6. Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes.
7. Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional.
8. A constant-factor approximation for weighted bond cover.
9. Killing a Vortex.
10. Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes.
11. Compound Logics for Modification Problems.
12. Dynamic Programming on Bipartite Tree Decompositions.
13. Excluding Single-Crossing Matching Minors in Bipartite Graphs.
14. Kernelization for Graph Packing Problems via Rainbow Matching.
15. Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes.
16. Vertex identification to a forest.
17. Faster parameterized algorithms for modification problems to minor-closed classes.
18. Parameterizing the quantification of CMSO: model checking on minor-closed graph classes.
19. Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable.
20. Edge-treewidth: Algorithmic and combinatorial properties.
21. k-apices of minor-closed graph classes. I. Bounding the obstructions.
22. Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm.
23. Combing a Linkage in an Annulus.
24. Killing a vortex.
25. Preface to special issue on theory and applications of Graph Searching.
26. k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms.
27. A polynomial time algorithm to compute the connected treewidth of a series-parallel graph.
28. Parameterized Complexity of Elimination Distance to First-Order Logic Properties.
29. Contraction Bidimensionality of Geometric Intersection Graphs.
30. An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL.
31. A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth.
32. Approximating branchwidth on parametric extensions of planarity.
33. Universal Obstructions of Graph Parameters.
34. Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes.
35. Graph Parameters, Universal Obstructions, and WQO.
36. Parameterized Complexity of Elimination Distance to First-Order Logic Properties.
37. A Constant-Factor Approximation for Weighted Bond Cover.
38. Block Elimination Distance.
39. Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs.
40. An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes.
41. An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL.
42. A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth.
43. Hcore-Init: Neural Network Initialization based on Graph Degeneracy.
44. A Retrospective on (Meta) Kernelization.
45. A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary.
46. Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable.
47. Connected search for a lazy robber.
48. A Menger-like property of tree-cut width.
49. Minimum Reload Cost Graph Factors.
50. Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.