default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArchontia C. Giannopoulou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
:
Excluding a planar matching minor in bipartite graphs. J. Comb. Theory B 164: 161-221 (2024)- [j20]Archontia C. Giannopoulou, Filippos Mavropoulos:
A graph searching game for block treedepth and a cubic kernel by vertex cover. Theor. Comput. Sci. 1011: 114718 (2024) - [c19]Archontia C. Giannopoulou, Sebastian Wiederrecht:
A Flat Wall Theorem for Matching Minors in Bipartite Graphs. STOC 2024: 716-727 - 2023
- [c18]Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Excluding Single-Crossing Matching Minors in Bipartite Graphs. SODA 2023: 2111-2121 - 2022
- [j19]Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos:
Block Elimination Distance. Graphs Comb. 38(5): 133 (2022) - [c17]Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon:
Directed Tangle Tree-Decompositions and Applications. SODA 2022: 377-405 - [i20]Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Excluding Single-Crossing Matching Minors in Bipartite Graphs. CoRR abs/2212.09348 (2022) - 2021
- [j18]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
A Menger-like property of tree-cut width. J. Comb. Theory B 148: 1-22 (2021) - [j17]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. SIAM J. Discret. Math. 35(1): 105-151 (2021) - [j16]Spyros Angelopoulos, Nancy E. Clarke, Fedor V. Fomin, Archontia C. Giannopoulou, Roman Rabinovich:
Preface to the special issue on Graph Searching: Theory and Applications. Theor. Comput. Sci. 858: 145-146 (2021) - [c16]Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos:
Block Elimination Distance. WG 2021: 28-38 - [i19]Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos:
Block Elimination Distance. CoRR abs/2103.01872 (2021) - [i18]Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht:
Excluding a Planar Matching Minor in Bipartite Graphs. CoRR abs/2106.00703 (2021) - [i17]Archontia C. Giannopoulou, Sebastian Wiederrecht:
Two Disjoint Alternating Paths in Bipartite Graphs. CoRR abs/2110.02013 (2021) - [i16]Archontia C. Giannopoulou, Sebastian Wiederrecht:
A Flat Wall Theorem for Matching Minors in Bipartite Graphs. CoRR abs/2110.07553 (2021) - 2020
- [c15]Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon:
The Directed Flat Wall Theorem. SODA 2020: 239-258 - [i15]Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon:
The canonical directed tree decomposition and its applications to the directed disjoint paths problem. CoRR abs/2009.13184 (2020)
2010 – 2019
- 2019
- [j15]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Cutwidth: Obstructions and Algorithmic Aspects. Algorithmica 81(2): 557-588 (2019) - [c14]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Lean Tree-Cut Decompositions: Obstructions and Algorithms. STACS 2019: 32:1-32:14 - [i14]Archontia C. Giannopoulou, Meike Hatzel, Sebastian Wiederrecht:
Braces of Perfect Matching Width 2. CoRR abs/1902.06307 (2019) - 2018
- [i13]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Lean tree-cut decompositions: obstructions and algorithms. CoRR abs/1808.00863 (2018) - 2017
- [j14]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Packing and covering immersion-expansions of planar sub-cubic graphs. Eur. J. Comb. 65: 154-167 (2017) - [j13]Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht:
Matching Connectivity: On the Structure of Graphs with Perfect Matchings. Electron. Notes Discret. Math. 61: 505-511 (2017) - [j12]Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh:
Uniform Kernelization Complexity of Hitting Forbidden Minors. ACM Trans. Algorithms 13(3): 35:1-35:35 (2017) - [j11]Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier:
Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs. Theor. Comput. Sci. 689: 67-95 (2017) - [c13]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. ICALP 2017: 57:1-57:15 - [c12]Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. ICALP 2017: 63:1-63:14 - 2016
- [j10]Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý:
Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation. SIAM J. Discret. Math. 30(3): 1371-1384 (2016) - [j9]Archontia C. Giannopoulou, George B. Mertzios:
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. SIAM J. Discret. Math. 30(3): 1685-1725 (2016) - [c11]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Cutwidth: Obstructions and Algorithmic Aspects. IPEC 2016: 15:1-15:13 - [c10]Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros:
FPT Algorithms for Plane Completion Problems. MFCS 2016: 26:1-26:13 - [c9]Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Packing and Covering Immersion Models of Planar Subcubic Graphs. WG 2016: 74-84 - [i12]Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna:
Cutwidth: obstructions and algorithmic aspects. CoRR abs/1606.05975 (2016) - [i11]Archontia C. Giannopoulou, Michal Pilipczuk, Dimitrios M. Thilikos, Jean-Florent Raymond, Marcin Wrochna:
Linear kernels for edge deletion problems to immersion-closed graph classes. CoRR abs/1609.07780 (2016) - [i10]Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz:
Neighborhood complexity and kernelization for nowhere dense classes of graphs. CoRR abs/1612.08197 (2016) - 2015
- [j8]Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk:
Computing Tree-Depth Faster Than 2n. Algorithmica 73(1): 202-216 (2015) - [j7]Archontia C. Giannopoulou, Marcin Jakub Kaminski, Dimitrios M. Thilikos:
Forbidding Kuratowski Graphs as Immersions. J. Graph Theory 78(1): 43-60 (2015) - [c8]Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh:
Uniform Kernelization Complexity of Hitting Forbidden Minors. ICALP (1) 2015: 629-641 - [c7]Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier:
Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs. IPEC 2015: 102-113 - [c6]Archontia C. Giannopoulou, George B. Mertzios:
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. STACS 2015: 354-366 - [i9]Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros:
A Fixed Parameter Algorithm for Plane Subgraph Completion. CTW 2015: 97-100 - [i8]Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh:
Uniform Kernelization Complexity of Hitting Forbidden Minors. CoRR abs/1502.03965 (2015) - [i7]Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier:
Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs. CoRR abs/1506.01652 (2015) - 2014
- [j6]Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros:
Effective computation of immersion obstructions for unions of graph classes. J. Comput. Syst. Sci. 80(1): 207-216 (2014) - [c5]Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý:
Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation). FSTTCS 2014: 85-96 - [i6]Archontia C. Giannopoulou, George B. Mertzios:
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs. CoRR abs/1412.1543 (2014) - 2013
- [j5]Archontia C. Giannopoulou, Dimitrios M. Thilikos:
Optimizing the Graph Minors Weak Structure Theorem. SIAM J. Discret. Math. 27(3): 1209-1227 (2013) - [c4]Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk:
Computing Tree-Depth Faster Than 2 n. IPEC 2013: 137-149 - [c3]Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos:
Excluding Graphs as Immersions in Surface Embedded Graphs. WG 2013: 274-285 - [i5]Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk:
Computing Tree-depth Faster Than 2n. CoRR abs/1306.3857 (2013) - [i4]Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý:
Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation). CoRR abs/1309.7891 (2013) - 2012
- [j4]Archontia C. Giannopoulou, Paul Hunter, Dimitrios M. Thilikos:
LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth. Discret. Appl. Math. 160(15): 2089-2097 (2012) - [j3]Zdenek Dvorák, Archontia C. Giannopoulou, Dimitrios M. Thilikos:
Forbidden graphs for tree-depth. Eur. J. Comb. 33(5): 969-979 (2012) - [c2]Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh:
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting. LATIN 2012: 408-419 - [c1]Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros:
Effective Computation of Immersion Obstructions for Unions of Graph Classes. SWAT 2012: 165-176 - [i3]Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos:
Forbidding Kuratowski Graphs as Immersions. CoRR abs/1207.5329 (2012) - [i2]Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros:
Effective Computation of Immersion Obstructions for Unions of Graph Classes. CoRR abs/1207.5636 (2012) - 2011
- [j2]Archontia C. Giannopoulou, Dimitrios M. Thilikos:
A min-max theorem for LIFO-search. Electron. Notes Discret. Math. 38: 395-400 (2011) - [i1]Archontia C. Giannopoulou, Dimitrios M. Thilikos:
Optimizing the Graph Minors Weak Structure Theorem. CoRR abs/1102.5762 (2011)
2000 – 2009
- 2009
- [j1]Archontia C. Giannopoulou, Dimitrios M. Thilikos:
Obstructions for Tree-depth. Electron. Notes Discret. Math. 34: 249-253 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
