An -Approximation for Covering and Packing Minor Models of D Chatzidimitriou, JF Raymond, I Sau, DM Thilikos Algorithmica 80, 1330-1356, 2018 | 19 | 2018 |
Minors in graphs of large θr-girth D Chatzidimitriou, JF Raymond, I Sau, DM Thilikos European Journal of Combinatorics 65, 106-121, 2017 | 9 | 2017 |
Sparse obstructions for minor-covering parameters D Chatzidimitriou, DM Thilikos, D Zoros Discrete Applied Mathematics 278, 28-50, 2020 | 3 | 2020 |
FPT algorithms for plane completion problems D Chatzidimitriou, AC Giannopoulou, S Maniatis, C Requilé, DM Thilikos, ... 41st International Symposium on Mathematical Foundations of Computer Science …, 2016 | 1 | 2016 |
A Fixed Parameter Algorithm for Plane Subgraph Completion D Chatzidimitriou, AC Giannopoulou, C Requilé, DM Thilikos, D Zoros CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2015 | | 2015 |
Covering and packing pumpkin models D Chatzidimitriou, JF Raymond, I Sau, DM Thilikos ICGT'2014: 9th International colloquium on graph theory and combinatorics, 2014 | | 2014 |
An Alternative Proof for the NP-completeness of the DA Chatzidimitriou | | |