51 results on '"Thilikos, Dimitrios M."'
Search Results
2. Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs
3. A Retrospective on (Meta) Kernelization
4. Minimum Reload Cost Graph Factors
5. Erratum to: Packing and Covering Immersion Models of Planar Subcubic Graphs
6. Packing and Covering Immersion Models of Planar Subcubic Graphs
7. Minimal Disconnected Cuts in Planar Graphs
8. An FPT 2-Approximation for Tree-cut Decomposition
9. An $$O(\log \mathrm{OPT})$$ O ( log OPT ) -Approximation for Covering/Packing Minor Models of $$\theta _{r}$$ θ r
10. Bidimensionality of Geometric Intersection Graphs
11. The Parameterized Complexity of Graph Cyclability
12. Excluding Graphs as Immersions in Surface Embedded Graphs
13. Characterizing Graphs of Small Carving-Width
14. Increasing the Minimum Degree of a Graph by Contractions
15. Planar Disjoint-Paths Completion
16. Graph Minors and Parameterized Algorithm Design
17. Approximation Algorithms for Domination Search
18. Fast Sub-exponential Algorithms and Compactness in Planar Graphs
19. On Contracting Graphs to Fixed Pattern Graphs
20. Dynamic Programming for Graphs on Surfaces
21. Contractions of Planar Graphs in Polynomial Time
22. Fast Minor Testing in Planar Graphs
23. Induced Packing of Odd Cycles in a Planar Graph
24. Parameterizing Cut Sets in a Graph by the Number of Their Components
25. Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
26. Searching for a Visible, Lazy Fugitive
27. Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
28. Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
29. Fast FPT-Algorithms for Cleaning Grids
30. Kernels for the Vertex Cover Problem on the Preferred Attachment Model
31. Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
32. Bidimensional Parameters and Local Treewidth
33. Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings
34. Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up
35. Computing Small Search Numbers in Linear Time
36. Smaller Kernels for Hitting Set Problems of Constant Arity
37. Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms
38. Searching Is Not Jumping
39. Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
40. The Complexity of Restrictive H-Coloring
41. Exponential Speedup of Fixed-Parameter Algorithms on K 3,3-Minor-Free or K 5-Minor-Free Graphs
42. 1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
43. On the Monotonicity of Games Generated by Symmetric Submodular Functions
44. (H,C,K) -Coloring: Fast, Easy, and Hard Cases
45. A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth
46. Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width
47. On Graph Powers for Leaf-Labeled Trees
48. Finding Smallest Supertrees Under Minor Containment
49. Constructive linear time algorithms for branchwidth
50. Subexponential Parameterized Algorithms
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.