Archontia C. Giannopoulou

According to our database1, Archontia C. Giannopoulou authored at least 24 papers between 2009 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Matching Connectivity: On the Structure of Graphs with Perfect Matchings.
Electronic Notes in Discrete Mathematics, 2017

Packing and covering immersion-expansions of planar sub-cubic graphs.
Eur. J. Comb., 2017

Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation.
SIAM J. Discrete Math., 2016

Packing and Covering Immersion Models of Planar Subcubic Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

FPT Algorithms for Plane Completion Problems.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Cutwidth: Obstructions and Algorithmic Aspects.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015
Forbidding Kuratowski Graphs as Immersions.
Journal of Graph Theory, 2015

Computing Tree-Depth Faster Than 2n.
Algorithmica, 2015

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Uniform Kernelization Complexity of Hitting Forbidden Minors.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

A Fixed Parameter Algorithm for Plane Subgraph Completion.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation).
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013
Optimizing the Graph Minors Weak Structure Theorem.
SIAM J. Discrete Math., 2013

Excluding Graphs as Immersions in Surface Embedded Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Computing Tree-Depth Faster Than 2 n.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012
Forbidden graphs for tree-depth.
Eur. J. Comb., 2012

LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth.
Discrete Applied Mathematics, 2012

Effective Computation of Immersion Obstructions for Unions of Graph Classes.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
A min-max theorem for LIFO-search.
Electronic Notes in Discrete Mathematics, 2011

2009
Obstructions for Tree-depth.
Electronic Notes in Discrete Mathematics, 2009


  Loading...