Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
A linear-time algorithm for finding tree-decompositions of small treewidthBODLAENDER, H. LSIAM journal on computing, 1996-12, Vol.25 (6), p.1305-1317 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
|
2 |
Material Type: Livro
|
Algorithms – ESA 2013Hans L. Italiano, Giuseppe F. Bodlaender Giuseppe F ItalianoSpringer Berlin Heidelberg 2013Acesso online |
|
3 |
Material Type: Artigo
|
A faster parameterized algorithm for Pseudoforest DeletionBodlaender, Hans L. ; Ono, Hirotaka ; Otachi, YotaDiscrete Applied Mathematics, 2018-02, Vol.236, p.42-56 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
4 |
Material Type: Livro
|
Experimental and efficient algorithms third international workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28 2004 : proceedingsWEA 2004 (2004 Angra dos Reis, Brazil) Celso C Ribeiro; Simone L Martins; European Association for Theoretical Computer ScienceBerlin Springer London c2004Acesso online. A biblioteca também possui exemplares impressos. |
|
5 |
Material Type: Livro
|
Graph-Theoretic Concepts in Computer ScienceInternational Workshop WG H. L BodlaenderSpringer Berlin Heidelberg 2003Acesso online |
|
6 |
Material Type: Artigo
|
Algorithms for graphs embeddable with few crossings per edgeGRIGORIEV, Alexander ; BODLAENDER, Hans LAlgorithmica, 2007-09, Vol.49 (1), p.1-11 [Periódico revisado por pares]New York, NY: SpringerTexto completo disponível |
|
7 |
Material Type: Artigo
|
On the maximum weight minimal separatorHanaka, Tesshu ; Bodlaender, Hans L. ; van der Zanden, Tom C. ; Ono, HirotakaTheoretical computer science, 2019-12, Vol.796, p.294-308 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
|
8 |
Material Type: Artigo
|
Typical Sequences Revisited — Computing Width Parameters of GraphsBodlaender, Hans L. ; Jaffke, Lars ; Telle, Jan ArneTheory of computing systems, 2023-02, Vol.67 (1), p.52-88 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
9 |
Material Type: Artigo
|
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized ComplexityBodlaender, Hans L. ; Ono, Hirotaka ; Otachi, YotaAlgorithmica, 2018-07, Vol.80 (7), p.2160-2180 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
10 |
Material Type: Artigo
|
A partial k-arboretum of graphs with bounded treewidthBodlaender, Hans L.Theoretical computer science, 1998-12, Vol.209 (1), p.1-45 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |