pith. sign in

Dimitrios M. Thilikos

Identifiers

  • name variant Dimitrios M. Thilikos 0.60 · backfill

Papers (50)

  1. Optimal Bounds for the k-Disjoint Paths Problem math.CO · 2026 · author #4
  2. W-state graphs: Structure and Algorithms quant-ph · 2026 · author #3
  3. Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes cs.LO · 2026 · author #5
  4. Colorful Minors math.CO · 2025 · author #2
  5. An Overview of Universal Obstructions for Graph Parameters cs.DM · 2023 · author #3
  6. Finding irrelevant vertices in linear time on bounded-genus graphs cs.DS · 2019 · author #4
  7. Minimum Reload Cost Graph Factors cs.CC · 2018 · author #4
  8. Data-compression for Parametrized Counting Problems on Sparse graphs cs.DS · 2018 · author #3
  9. On the Parameterized Complexity of Graph Modification to First-Order Logic Properties cs.DS · 2018 · author #3
  10. Clustering to Given Connectivities cs.DS · 2018 · author #2
  11. Structured Connectivity Augmentation cs.DS · 2017 · author #3
  12. Parameterized complexity of finding a spanning tree with minimum reload cost diameter cs.DS · 2017 · author #6
  13. Explicit linear kernels for packing problems cs.DS · 2016 · author #4
  14. Linear kernels for edge deletion problems to immersion-closed graph classes cs.DS · 2016 · author #3
  15. A k-core Decomposition Framework for Graph Clustering cs.SI · 2016 · author #6
  16. Cutwidth: obstructions and algorithmic aspects cs.DS · 2016 · author #4
  17. Recent techniques and results on the Erd\H{o}s-P\'osa property cs.DM · 2016 · author #2
  18. Packing and Covering Immersion Models of Planar subcubic Graphs math.CO · 2016 · author #4
  19. The Structure of $W_4$-Immersion-Free Graphs math.CO · 2016 · author #4
  20. Planar Disjoint-Paths Completion cs.DS · 2015 · author #3
  21. An $O(\log OPT)$-approximation for covering and packing minor models of ${\theta}_r$ cs.DS · 2015 · author #4
  22. Minors in graphs of large ${\theta}_r$-girth math.CO · 2015 · author #4
  23. Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism cs.DS · 2015 · author #4
  24. An FPT 2-Approximation for Tree-Cut Decomposition cs.DS · 2015 · author #5
  25. Variants of Plane Diameter Completion cs.DS · 2015 · author #3
  26. Editing to a Planar Graph of Given Degrees cs.DS · 2015 · author #5
  27. An alternative proof for the constructive Asymmetric Lov\'asz Local Lemma cs.DM · 2015 · author #4
  28. The Parameterized Complexity of Graph Cyclability math.CO · 2014 · author #4
  29. Contraction Obstructions for Connected Graph Searching math.CO · 2014 · author #3
  30. A Linear Kernel for Planar Red-Blue Dominating Set cs.DS · 2014 · author #3
  31. Acyclic Edge Coloring through the Lov\'asz Local Lemma cs.DM · 2014 · author #4
  32. A Polynomial-time Algorithm for Outerplanar Diameter Improvement cs.DS · 2014 · author #6
  33. Explicit linear kernels via dynamic programming cs.DS · 2013 · author #4
  34. An edge variant of the Erd\H{o}s-P\'osa property math.CO · 2013 · author #3
  35. Nearly Planar Graphs and {\lambda}-flat Graphs math.CO · 2013 · author #3
  36. Irrelevant Vertices for the Planar Disjoint Paths Problem math.CO · 2013 · author #6
  37. Bidimensionality of Geometric Intersection Graphs cs.DM · 2013 · author #3
  38. Polynomial Gap Extensions of the Erd\H{o}s-P\'osa Theorem cs.DM · 2013 · author #2
  39. Low Polynomial Exclusion of Planar Graph Patterns math.CO · 2013 · author #2
  40. Excluding Graphs as Immersions in Surface Embedded Graphs math.CO · 2013 · author #3
  41. Kernels for (connected) Dominating Set on graphs with Excluded Topological subgraphs cs.DS · 2012 · author #4
  42. Forbidding Kuratowski Graphs as Immersions math.CO · 2012 · author #3
  43. Confronting Intractability via Parameters cs.CC · 2011 · author #2
  44. Dynamic Programming for Graphs on Surfaces cs.DS · 2011 · author #3
  45. Asymptotic Enumeration of Non-crossing Partitions on Surfaces math.CO · 2011 · author #3
  46. Optimizing the Graph Minors Weak Structure Theorem math.CO · 2011 · author #2
  47. Contracting planar graphs to contractions of triangulations math.CO · 2010 · author #3
  48. Rank-width and Tree-width of H-minor-free Graphs math.CO · 2009 · author #3
  49. (Meta) Kernelization cs.DM · 2009 · author #6
  50. Approximating acyclicity parameters of sparse hypergraphs cs.DS · 2008 · author #3

Mentions

  • 1210.0257 #4 · backfill · confidence 0.70 Dimitrios M. Thilikos
  • 1207.5329 #3 · backfill · confidence 0.70 Dimitrios M. Thilikos
  • 1106.3161 #2 · backfill · confidence 0.70 Dimitrios M. Thilikos
  • 1104.2486 #3 · backfill · confidence 0.70 Dimitrios M. Thilikos
  • 1104.2477 #3 · backfill · confidence 0.70 Dimitrios M. Thilikos
  • 1102.5762 #2 · backfill · confidence 0.70 Dimitrios M. Thilikos
  • 1012.2460 #3 · backfill · confidence 0.70 Dimitrios M. Thilikos
  • 0910.0079 #3 · backfill · confidence 0.70 Dimitrios M. Thilikos
  • 0904.0727 #6 · backfill · confidence 0.70 Dimitrios M. Thilikos
  • 0809.3646 #3 · backfill · confidence 0.70 Dimitrios M. Thilikos

Frequent Coauthors