vix.ing · top · new · best · stats · spec

Dimitrios M. Thilikos

  1. (Meta) Kernelization
    2009/04/04 by Hans L. Bodlaender, Fedor V. Fomin, Bodlaender, Hans L. +9 · 13 citations
    Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Computational Geometry and Mesh Generation
  2. Recent techniques and results on the Erdős-Pósa property
    2016/03/15 by Jean‐Florent Raymond, Raymond, Jean-Florent, Dimitrios M. Thilikos +1 · 4 citations
    Computer Science · Engineering · Mathematics · #05C70 #Advanced Graph Theory Research #Analytic Number Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #G.2.2 #Limits and Structures in Graph Theory #Mathematical functions and polynomials #graph theory and CDMA systems
  3. Dynamic Programming for Graphs on Surfaces
    2011/04/13 by Juanjo Rué, Ignasi Sau, Rué, Juanjo +3 · 3 citations
    Computer Science · #05C85 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
  4. Explicit linear kernels via dynamic programming
    2013/12/23 by Valentin Garnero, Christophe Paul, Garnero, Valentin +5 · 2 citations
    Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Graph Labeling and Dimension Problems
  5. Bidimensionality and Kernels
    2016/06/17 by Fedor V. Fomin, Fomin, Fedor V., Daniel Lokshtanov +5 · 2 citations
    Computer Science · #Advanced Graph Theory Research #Formal Methods in Verification #semigroups and automata theory
  6. Approximating acyclicity parameters of sparse hypergraphs
    2008/09/22 by Fedor V. Fomin, Fomin, Fedor V., Petr A. Golovach +3 · 1 citation
    Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Limits and Structures in Graph Theory #cs.CC #cs.DS
  7. A Linear Kernel for Planar Red-Blue Dominating Set
    2014/08/27 by Valentin Garnero, Garnero, Valentin, Ignasi Sau +3 · 1 citation
    Computer Science · Mathematics · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #Complexity and Algorithms in Graphs
  8. Editing to a Planar Graph of Given Degrees
    2015/08/11 by Konrad K. Dabrowski, Petr A. Golovach, Dabrowski, Konrad K. +7 · 1 citation
    Biochemistry, Genetics and Molecular Biology · #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Protein Degradation and Inhibitors
  9. Linear kernels for edge deletion problems to immersion-closed graph\n classes
    2016/09/25 by Archontia C. Giannopoulou, Giannopoulou, Archontia C., Michał Pilipczuk +7 · 1 citation
    Computer Science · #05C85 #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.2 #Machine Learning and Algorithms
  10. Explicit linear kernels for packing problems
    2016/10/19 by Valentin Garnero, Garnero, Valentin, Christophe Paul +5 · 1 citation
    Computer Science · Mathematics · #05C85 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Limits and Structures in Graph Theory
  11. On the Parameterized Complexity of Graph Modification to First-Order\n Logic Properties
    2018/05/11 by Fedor V. Fomin, Fomin, Fedor V., Petr A. Golovach +3 · 1 citation
    Computer Science · #05C85 #68R10 #68W05 #Advanced Graph Theory Research #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Formal Methods in Verification #semigroups and automata theory
  12. Data-compression for Parametrized Counting Problems on Sparse graphs
    2018/09/21 by Eun Jung Kim, Marı́a Serna, Kim, Eun Jung +3 · 1 citation
    Computer Science · #68R10 #68W01 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Graph Labeling and Dimension Problems
  13. Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
    2019/07/05 by Petr A. Golovach, Golovach, Petr A., Giannos Stamoulis +3 · 1 citation
    Computer Science · #05C85 #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Topological and Geometric Data Analysis
  14. A linear fixed parameter tractable algorithm for connected pathwidth
    2020/04/24 by Mamadou Moustapha Kanté, Christophe Paul, Kanté, Mamadou Moustapha +3 · 1 citation
    Computer Science · #Advanced Graph Theory Research #Computational Geometry and Mesh Generation #Complexity and Algorithms in Graphs
  15. Block Elimination Distance
    2021/03/02 by Öznur Yaşar Diner, Diner, Öznur Yaşar, Archontia C. Giannopoulou +5 · 1 citation
    Computer Science · Mathematics · #05C69 #05C75 #05C83 #Advanced Graph Theory Research #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Graph theory and applications #Interconnection Networks and Systems
  16. Killing a Vortex
    2022/07/11 by Dimitrios M. Thilikos, Thilikos, Dimitrios M., Sebastian Wiederrecht +1 · 2 citations
    Computer Science · Mathematics · #05C83 #05C85 #68R05 #68R10 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #G.2.2 #Limits and Structures in Graph Theory
  17. k-apices of minor-closed graph classes. II. Parameterized algorithms
    2020/04/27 by Ignasi Sau, Sau, Ignasi, Giannos Stamoulis +3 · 1 citation
    Computer Science · Mathematics · #05C69 #05C75 #05C83 #05C85 #68R10 #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
  18. k-apices of minor-closed graph classes. I. Bounding the obstructions
    2021/03/01 by Ignasi Sau, Giannos Stamoulis, Sau, Ignasi +3 · 1 citation
    Computer Science · Mathematics · #Advanced Graph Theory Research #Graph theory and applications #Limits and Structures in Graph Theory
  19. Dynamic programming on bipartite tree decompositions
    2023/09/14 by Lars Jaffke, Laure Morelle, Jaffke, Lars +5 · 1 citation
    Computer Science · #Advanced Graph Theory Research #Optimization and Search Problems #Complexity and Algorithms in Graphs
  20. Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
    2021/03/11 by Julien Baste, Baste, Julien, Ignasi Sau +3 · 1 citation
    Computer Science · Mathematics · #05C69 #05C75 #05C83 #05C85 #68R10 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Limits and Structures in Graph Theory
  21. Finding irrelevant vertices in linear time on bounded-genus graphs
    2019/07/12 by Petr A. Golovach, Stavros G. Kolliopoulos, Golovach, Petr A. +5 · 1 citation
    Computer Science · #05C69 #05C75 #05C83 #05C85 #68R10 #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.2 #Optimization and Search Problems
  22. Contraction Bidimensionality of Geometric Intersection Graphs
    2022/07/20 by Julien Baste, Dimitrios M. Thilikos, Baste, Julien +1 · 1 citation
    Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Computational Geometry and Mesh Generation