Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Capítulo de Livro
|
Constructive linear time algorithms for branchwidthBodlaender, Hans L. ; Thilikos, Dimitrios M.Automata, Languages and Programming, 1997, p.627-637 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
2 |
Material Type: Capítulo de Livro
|
Isomorphism for graphs of bounded distance widthYamazaki, Koichi ; Bodlaender, Hans L. ; de Fluiter, Babette ; Thilikos, Dimitrios M.Algorithms and Complexity, 1997, p.276-287 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
3 |
Material Type: Artigo
|
It is hard to know when greedy is good for finding independent setsBodlaender, Hans L. ; Thilikos, Dimitrios M. ; Yamazaki, KoichiInformation processing letters, 1997-01, Vol.61 (2), p.101-106 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
4 |
Material Type: Artigo
|
Fugitive-search games on graphs and related parametersDendris, Nick D. ; Kirousis, Lefteris M. ; Thilikos, Dimitrios M.Theoretical computer science, 1997-02, Vol.172 (1), p.233-254 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
|
5 |
Material Type: Artigo
|
Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problemsThilikos, Dimitrios M. ; Bodlaender, Hans L.Information processing letters, 1997-03, Vol.61 (5), p.227-232 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
6 |
Material Type: Artigo
|
On Interval Routing Schemes and TreewidthBodlaender, Hans L. ; van Leeuwen, Jan ; Tan, Richard ; Thilikos, Dimitrios M.Information and computation, 1997-11, Vol.139 (1), p.92-109 [Periódico revisado por pares]San Diego, CA: Elsevier IncTexto completo disponível |
|
7 |
Material Type: Artigo
|
Treewidth for graphs with small chordalityBodlaender, Hans L. ; Thilikos, Dimitrios M.Discrete Applied Mathematics, 1997-11, Vol.79 (1), p.45-61 [Periódico revisado por pares]Lausanne: Elsevier B.VTexto completo disponível |
|
8 |
Material Type: Ata de Congresso
|
Finding Smallest Supertrees Under Minor ContainmentNishimura, Naomi ; Ragde, Prabhakar ; Thilikos, Dimitrios M.Graph-Theoretic Concepts in Computer Science, 1999, p.303-312 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
9 |
Material Type: Artigo
|
Quickly Excluding K2,r from Planar GraphsThilikos, Dimitrios M.Electronic notes in discrete mathematics, 1999-05, Vol.3, p.189-194Elsevier B.VTexto completo disponível |
|
10 |
Material Type: Artigo
|
Graphs with Branchwidth at Most ThreeBodlaender, Hans L ; Thilikos, Dimitrios MJournal of algorithms, 1999-08, Vol.32 (2), p.167-194 [Periódico revisado por pares]San Diego, CA: Elsevier IncTexto completo disponível |