Giannopoulou, Archontia C.
- Tree Deletion Set has a Polynomial Kernel (but no OPTO(1) approximation)
2013/09/30 by Giannopoulou, Archontia C., Lokshtanov, Daniel, Saurabh, Saket +1 · 1 citation
#Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
- Uniform Kernelization Complexity of Hitting Forbidden Minors
2015/02/13 by Archontia C. Giannopoulou, Bart M. P. Jansen, Giannopoulou, Archontia C. +5 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Limits and Structures in Graph Theory
- 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
- A Flat Wall Theorem for Matching Minors in Bipartite Graphs
2021/10/14 by Giannopoulou, Archontia C., Wiederrecht, Sebastian · 1 citation
#05C20 #05C75 #05C83 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.2
- 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