Search

Your search keyword '"THILIKOS, DIMITRIOS M."' showing total 48 results

Search Constraints

Start Over You searched for: Author "THILIKOS, DIMITRIOS M." Remove constraint Author: "THILIKOS, DIMITRIOS M." Publisher springer international publishing Remove constraint Publisher: springer international publishing
48 results on '"THILIKOS, DIMITRIOS M."'

Search Results

1. Block Elimination Distance

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

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

15. Bidimensionality of Geometric Intersection Graphs

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

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