Archontia C. Giannopoulou

61 papers A* 6A 2B 8C 1Journal 41Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Braces of Perfect Matching Width 2. Electron. J. Comb. Archontia C. Giannopoulou, Meike Hatzel, Sebastian Wiederrecht
2024	A*	`conf`	A Flat Wall Theorem for Matching Minors in Bipartite Graphs. STOC Archontia C. Giannopoulou, Sebastian Wiederrecht
2024	J	`jnl`	A graph searching game for block treedepth and a cubic kernel by vertex cover. Theor. Comput. Sci. Archontia C. Giannopoulou, Filippos Mavropoulos
2024	J	`jnl`	Excluding a planar matching minor in bipartite graphs. J. Comb. Theory B Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
2023	A*	`conf`	Excluding Single-Crossing Matching Minors in Bipartite Graphs. SODA Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht
2022	J	`jnl`	Block Elimination Distance. Graphs Comb. Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
2022	A*	`conf`	Directed Tangle Tree-Decompositions and Applications. SODA Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
2022	J	`jnl`	Excluding Single-Crossing Matching Minors in Bipartite Graphs. CoRR Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht
2021	J	`jnl`	A Flat Wall Theorem for Matching Minors in Bipartite Graphs. CoRR Archontia C. Giannopoulou, Sebastian Wiederrecht
2021	J	`jnl`	A Menger-like property of tree-cut width. J. Comb. Theory B Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2021	B	`conf`	Block Elimination Distance. WG Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
2021	J	`jnl`	Block Elimination Distance. CoRR Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos
2021	J	`jnl`	Excluding a Planar Matching Minor in Bipartite Graphs. CoRR Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
2021	J	`jnl`	Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. SIAM J. Discret. Math. Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2021	J	`jnl`	Preface to the special issue on Graph Searching: Theory and Applications. Theor. Comput. Sci. Spyros Angelopoulos, Nancy E. Clarke, Fedor V. Fomin, Archontia C. Giannopoulou, Roman Rabinovich
2021	J	`jnl`	Two Disjoint Alternating Paths in Bipartite Graphs. CoRR Archontia C. Giannopoulou, Sebastian Wiederrecht
2020	A*	`conf`	The Directed Flat Wall Theorem. SODA Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
2020	J	`jnl`	The canonical directed tree decomposition and its applications to the directed disjoint paths problem. CoRR Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon
2019	J	`jnl`	Braces of Perfect Matching Width 2. CoRR Archontia C. Giannopoulou, Meike Hatzel, Sebastian Wiederrecht
2019	J	`jnl`	Cutwidth: Obstructions and Algorithmic Aspects. Algorithmica Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2019	A	`conf`	Lean Tree-Cut Decompositions: Obstructions and Algorithms. STACS Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2018	J	`jnl`	Lean tree-cut decompositions: obstructions and algorithms. CoRR Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2017	A*	`conf`	Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. ICALP Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2017	J	`jnl`	Matching Connectivity: On the Structure of Graphs with Perfect Matchings. Electron. Notes Discret. Math. Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
2017	A*	`conf`	Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. ICALP Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
2017	J	`jnl`	Packing and covering immersion-expansions of planar sub-cubic graphs. Eur. J. Comb. Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2017	J	`jnl`	Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs. Theor. Comput. Sci. Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
2017	J	`jnl`	Uniform Kernelization Complexity of Hitting Forbidden Minors. ACM Trans. Algorithms Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2016	B	`conf`	Cutwidth: Obstructions and Algorithmic Aspects. IPEC Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2016	J	`jnl`	Cutwidth: obstructions and algorithmic aspects. CoRR Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
2016	B	`conf`	FPT Algorithms for Plane Completion Problems. MFCS Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros
2016	J	`jnl`	Linear kernels for edge deletion problems to immersion-closed graph classes. CoRR Archontia C. Giannopoulou, Michal Pilipczuk, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna
2016	J	`jnl`	Neighborhood complexity and kernelization for nowhere dense classes of graphs. CoRR Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
2016	J	`jnl`	New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. SIAM J. Discret. Math. Archontia C. Giannopoulou, George B. Mertzios
2016	B	`conf`	Packing and Covering Immersion Models of Planar Subcubic Graphs. WG Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
2016	J	`jnl`	Tree Deletion Set Has a Polynomial Kernel but No OPT SIAM J. Discret. Math. Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
2015	C	`conf`	A Fixed Parameter Algorithm for Plane Subgraph Completion. CTW Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros
2015	J	`jnl`	Computing Tree-Depth Faster Than 2 Algorithmica Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk
2015	J	`jnl`	Forbidding Kuratowski Graphs as Immersions. J. Graph Theory Archontia C. Giannopoulou, Marcin Jakub Kaminski, Dimitrios M. Thilikos
2015	A	`conf`	New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. STACS Archontia C. Giannopoulou, George B. Mertzios
2015	J	`jnl`	Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs. CoRR Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
2015	B	`conf`	Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs. IPEC Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
2015	—	`conf`	Uniform Kernelization Complexity of Hitting Forbidden Minors. ICALP (1) Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2015	J	`jnl`	Uniform Kernelization Complexity of Hitting Forbidden Minors. CoRR Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2014	J	`jnl`	Effective computation of immersion obstructions for unions of graph classes. J. Comput. Syst. Sci. Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros
2014	J	`jnl`	New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. CoRR Archontia C. Giannopoulou, George B. Mertzios
2014	—	`conf`	Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation). FSTTCS Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
2013	B	`conf`	Computing Tree-Depth Faster Than 2 n. IPEC Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk
2013	J	`jnl`	Computing Tree-depth Faster Than 2 CoRR Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk
2013	B	`conf`	Excluding Graphs as Immersions in Surface Embedded Graphs. WG Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos
2013	J	`jnl`	Optimizing the Graph Minors Weak Structure Theorem. SIAM J. Discret. Math. Archontia C. Giannopoulou, Dimitrios M. Thilikos
2013	J	`jnl`	Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation). CoRR Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
2012	J	`jnl`	Effective Computation of Immersion Obstructions for Unions of Graph Classes CoRR Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros
2012	—	`conf`	Effective Computation of Immersion Obstructions for Unions of Graph Classes. SWAT Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros
2012	J	`jnl`	Forbidden graphs for tree-depth. Eur. J. Comb. Zdenek Dvorák, Archontia C. Giannopoulou, Dimitrios M. Thilikos
2012	J	`jnl`	Forbidding Kuratowski Graphs as Immersions CoRR Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos
2012	J	`jnl`	LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth. Discret. Appl. Math. Archontia C. Giannopoulou, Paul Hunter, Dimitrios M. Thilikos
2012	B	`conf`	New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting. LATIN Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh
2011	J	`jnl`	A min-max theorem for LIFO-search. Electron. Notes Discret. Math. Archontia C. Giannopoulou, Dimitrios M. Thilikos
2011	J	`jnl`	Optimizing the Graph Minors Weak Structure Theorem CoRR Archontia C. Giannopoulou, Dimitrios M. Thilikos
2009	J	`jnl`	Obstructions for Tree-depth. Electron. Notes Discret. Math. Archontia C. Giannopoulou, Dimitrios M. Thilikos