48 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. Block Elimination Distance
6. Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs
7. An Alternate Proof of the Algorithmic Lovász Local Lemma
8. A Retrospective on (Meta) Kernelization
9. An FPT 2-Approximation for Tree-cut Decomposition
10. An
11. Minimal Disconnected Cuts in Planar Graphs
12. A Polynomial-Time Algorithm for Outerplanar Diameter Improvement
13. Editing to a Planar Graph of Given Degrees
14. Minimum Reload Cost Graph Factors
15. Bidimensionality of Geometric Intersection Graphs
16. Minimal Disconnected Cuts in Planar Graphs
17. An FPT 2-Approximation for Tree-cut Decomposition
18. An $$O(\log \mathrm{OPT})$$ O ( log OPT ) -Approximation for Covering/Packing Minor Models of $$\theta _{r}$$ θ r
19. Bidimensionality of Geometric Intersection Graphs
20. A Turing Kernelization Dichotomy for Structural Parameterizations of -Minor-Free Deletion
21. Fast Breadth-First Search in Still Less Space
22. Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts
23. Local Approximation of the Maximum Cut in Regular Graphs
24. The 4-Steiner Root Problem
25. Maximum Independent Sets in Subcubic Graphs: New Results
26. Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs
27. Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
28. Color Refinement, Homomorphisms, and Hypergraphs
29. Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs
30. 3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes
31. Hamiltonicity Below Dirac’s Condition
32. The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms
33. Maximum Matchings and Minimum Blocking Sets in -Graphs
34. A Polynomial-Time Algorithm for the Independent Set Problem in -Free Graphs
35. Travelling on Graphs with Small Highway Dimension
36. Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth
37. Classified Rank-Maximal Matchings and Popular Matchings – Algorithms and Hardness
38. Independent Set Reconfiguration Parameterized by Modular-Width
39. Intersection Graphs of Non-crossing Paths
40. Approximating Minimum Dominating Set on String Graphs
41. Linear MIM-Width of Trees
42. Geometric Representations of Dichotomous Ordinal Data
43. Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs
44. The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
45. Graph Functionality
46. On Happy Colorings, Cuts, and Structural Parameterizations
47. Shortest Reconfiguration of Matchings
48. Flip Distances Between Graph Orientations
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.