Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Livro
|
Graph-Theoretic Concepts in Computer Science: 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised PapersSau, Ignasi ; Thilikos, Dimitrios M. Sau, Ignasi ; Thilikos, Dimitrios M.Cham: Springer International Publishing 2019Sem texto completo |
|
2 |
Material Type: Artigo
|
A polynomial time algorithm to compute the connected treewidth of a series–parallel graphMescoff, Guillaume ; Paul, Christophe ; Thilikos, Dimitrios M.Discrete Applied Mathematics, 2022-05, Vol.312, p.72-85 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
3 |
Material Type: Artigo
|
Contraction Bidimensionality of Geometric Intersection GraphsBaste, Julien ; Thilikos, Dimitrios M.Algorithmica, 2022-02, Vol.84 (2), p.510-531 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
4 |
Material Type: Artigo
|
Explicit Linear Kernels for Packing ProblemsGarnero, Valentin ; Paul, Christophe ; Sau, Ignasi ; Thilikos, Dimitrios M.Algorithmica, 2019-04, Vol.81 (4), p.1615-1656 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
5 |
Material Type: Artigo
|
Connected search for a lazy robberAdler, Isolde ; Paul, Christophe ; Thilikos, Dimitrios M.Journal of graph theory, 2021-07, Vol.97 (4), p.510-552 [Periódico revisado por pares]Hoboken: Wiley Subscription Services, IncTexto completo disponível |
|
6 |
Material Type: Artigo
|
On the Parameterized Complexity of Graph Modification to First-Order Logic PropertiesFomin, Fedor V. ; Golovach, Petr A. ; Thilikos, Dimitrios M.Theory of computing systems, 2020-02, Vol.64 (2), p.251-271 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
7 |
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 |
|
8 |
Material Type: Artigo
|
An FPT 2-Approximation for Tree-Cut DecompositionKim, Eun Jung ; Oum, Sang-il ; Paul, Christophe ; Sau, Ignasi ; Thilikos, Dimitrios M.Algorithmica, 2018, Vol.80 (1), p.116-135 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
9 |
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 |
|
10 |
Material Type: Artigo
|
Parameterized complexity of finding a spanning tree with minimum reload cost diameterBaste, Julien ; Gözüpek, Didem ; Paul, Christophe ; Sau, Ignasi ; Shalom, Mordechai ; Thilikos, Dimitrios M.Networks, 2020-04, Vol.75 (3), p.259-277 [Periódico revisado por pares]Hoboken, USA: John Wiley & Sons, IncTexto completo disponível |