Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
An annotated bibliography on guaranteed graph searchingFomin, Fedor V. ; Thilikos, Dimitrios M.Theoretical computer science, 2008-06, Vol.399 (3), p.236-245 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
2 |
Material Type: Artigo
|
Contraction Bidimensionality of Geometric Intersection GraphsBaste, Julien ; Thilikos, Dimitrios M.Algorithmica, 2022, Vol.84 (2), p.510-531 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
3 |
Material Type: Artigo
|
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithmsBaste, Julien ; Sau, Ignasi ; Thilikos, Dimitrios M.Theoretical computer science, 2020-04, Vol.814, p.135-152 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
|
4 |
Material Type: Artigo
|
Compactors for parameterized counting problemsThilikos, Dimitrios M.Computer science review, 2021-02, Vol.39, p.100344, Article 100344Elsevier IncTexto completo disponível |
|
5 |
Material Type: Artigo
|
D-cores: measuring collaboration of directed graphs based on degeneracyGiatsidis, Christos ; Thilikos, Dimitrios M. ; Vazirgiannis, MichalisKnowledge and information systems, 2013-05, Vol.35 (2), p.311-343 [Periódico revisado por pares]London: Springer-VerlagTexto completo disponível |
|
6 |
Material Type: Artigo
|
Minimum Reload Cost Graph FactorsBaste, Julien ; Gözüpek, Didem ; Shalom, Mordechai ; Thilikos, Dimitrios M.Theory of computing systems, 2021-07, Vol.65 (5), p.815-838 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
7 |
Material Type: Artigo
|
Recent techniques and results on the Erdős–Pósa propertyRaymond, Jean-Florent ; Thilikos, Dimitrios M.Discrete Applied Mathematics, 2017-11, Vol.231, p.25-43 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
8 |
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 |
|
9 |
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 |
|
10 |
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 |