Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
Block Elimination DistanceDiner, Öznur Yaşar ; Giannopoulou, Archontia C. ; Stamoulis, Giannos ; Thilikos, Dimitrios M.Graphs and combinatorics, 2022-10, Vol.38 (5), Article 133 [Periódico revisado por pares]Tokyo: Springer JapanTexto completo disponível |
|
2 |
Material Type: Artigo
|
Polynomial fixed-parameter algorithms: A case study for longest path on interval graphsGiannopoulou, Archontia C. ; Mertzios, George B. ; Niedermeier, RolfHusfeldt, Thore & Kanj, Iyad (Eds.). (2015). 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). : Leibniz International Proceedings in Informatics, pp. 102-113, LIPIcs : Leibniz international proceedings in informatics(43), 2017-08, Vol.689, p.67-95 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
|
3 |
Material Type: Artigo
|
A Menger-like property of tree-cut widthGiannopoulou, Archontia C. ; Kwon, O-joung ; Raymond, Jean-Florent ; Thilikos, Dimitrios M.Journal of combinatorial theory. Series B, 2021-05, Vol.148, p.1-22 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
|
4 |
Material Type: Artigo
|
Uniform Kernelization Complexity of Hitting Forbidden MinorsGiannopoulou, Archontia ; Jansen, Bart ; Lokshtanov, Daniel ; Saurabh, SaketACM transactions on algorithms, 2017-03, Vol.13 (3), p.1-35 [Periódico revisado por pares]ACMTexto completo disponível |
|
5 |
Material Type: Artigo
|
Cutwidth: Obstructions and Algorithmic AspectsGiannopoulou, Archontia C. ; Pilipczuk, Michał ; Raymond, Jean-Florent ; Thilikos, Dimitrios M. ; Wrochna, MarcinAlgorithmica, 2019-02, Vol.81 (2), p.557-588 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
6 |
Material Type: Artigo
|
Packing and covering immersion-expansions of planar sub-cubic graphsGiannopoulou, Archontia C. ; Kwon, O-joung ; Raymond, Jean-Florent ; Thilikos, Dimitrios M.European journal of combinatorics, 2017-10, Vol.65, p.154-167 [Periódico revisado por pares]Elsevier LtdTexto completo disponível |
|
7 |
Material Type: Artigo
|
Forbidden graphs for tree-depthDvořák, Zdeněk ; Giannopoulou, Archontia C. ; Thilikos, Dimitrios M.European journal of combinatorics, 2012-07, Vol.33 (5), p.969-979 [Periódico revisado por pares]Elsevier LtdTexto completo disponível |
|
8 |
Material Type: Artigo
|
Effective computation of immersion obstructions for unions of graph classesGiannopoulou, Archontia C. ; Salem, Iosif ; Zoros, DimitrisJournal of computer and system sciences, 2014-02, Vol.80 (1), p.207-216 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
|
9 |
Material Type: Artigo
|
LIFO-search: A min–max theorem and a searching game for cycle-rank and tree-depthGiannopoulou, Archontia C. ; Hunter, Paul ; Thilikos, Dimitrios M.Discrete Applied Mathematics, 2012-10, Vol.160 (15), p.2089-2097 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
|
10 |
Material Type: Artigo
|
Forbidding Kuratowski Graphs as ImmersionsGiannopoulou, Archontia C. ; Kamiński, Marcin ; Thilikos, Dimitrios M.Journal of graph theory, 2015-01, Vol.78 (1), p.43-60 [Periódico revisado por pares]Hoboken: Blackwell Publishing LtdTexto completo disponível |