583 results on '"Dimitrios M. Thilikos"'
Search Results
2. Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes.
3. Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional.
4. Killing a Vortex.
5. Obstructions to Erdös-Pósa Dualities for Minors.
6. Parameterizing the quantification of CMSO: model checking on minor-closed graph classes.
7. Faster Parameterized Algorithms for Modification Problems to Minor-Closed Classes.
8. Compound Logics for Modification Problems.
9. Dynamic Programming on Bipartite Tree Decompositions.
10. Excluding Single-Crossing Matching Minors in Bipartite Graphs.
11. Kernelization for Graph Packing Problems via Rainbow Matching.
12. Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes.
13. Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable.
14. Edge-treewidth: Algorithmic and combinatorial properties.
15. k-apices of minor-closed graph classes. I. Bounding the obstructions.
16. Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm.
17. Combing a Linkage in an Annulus.
18. Killing a vortex.
19. Approximating branchwidth on parametric extensions of planarity.
20. Universal Obstructions of Graph Parameters.
21. Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes.
22. Graph Parameters, Universal Obstructions, and WQO.
23. k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms.
24. A polynomial time algorithm to compute the connected treewidth of a series-parallel graph.
25. Parameterized Complexity of Elimination Distance to First-Order Logic Properties.
26. Contraction Bidimensionality of Geometric Intersection Graphs.
27. An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL.
28. A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth.
29. Parameterized Complexity of Elimination Distance to First-Order Logic Properties.
30. A Constant-Factor Approximation for Weighted Bond Cover.
31. Block Elimination Distance.
32. Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs.
33. An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes.
34. An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL.
35. A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth.
36. Hcore-Init: Neural Network Initialization based on Graph Degeneracy.
37. A Retrospective on (Meta) Kernelization.
38. A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary.
39. Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable.
40. Connected search for a lazy robber.
41. A Menger-like property of tree-cut width.
42. Minimum Reload Cost Graph Factors.
43. Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes.
44. The mixed search game against an agile and visible fugitive is monotone.
45. On Strict Brambles.
46. Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs.
47. On Strict Brambles.
48. The mixed search game against an agile and visible fugitive is monotone.
49. Excluding Single-Crossing Matching Minors in Bipartite Graphs.
50. Faster parameterized algorithms for modification problems to minor-closed 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.