Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Livro
|
Algorithms – ESA 2013Hans L. Italiano, Giuseppe F. Bodlaender Giuseppe F ItalianoSpringer Berlin Heidelberg 2013Acesso online |
|
2 |
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. |
|
3 |
Material Type: Livro
|
Graph-Theoretic Concepts in Computer ScienceInternational Workshop WG H. L BodlaenderSpringer Berlin Heidelberg 2003Acesso online |
|
4 |
Material Type: Artigo
|
Kernelization Lower Bounds by Cross-CompositionBodlaender, Hans L. ; Jansen, Bart M. P. ; Kratsch, StefanSIAM journal on discrete mathematics, 2014-01, Vol.28 (1), p.277-305 [Periódico revisado por pares]Philadelphia: Society for Industrial and Applied MathematicsSem texto completo |
|
5 |
Material Type: Ata de Congresso
|
Treewidth: Characterizations, Applications, and ComputationsBodlaender, Hans L.Graph-Theoretic Concepts in Computer Science, 2006, p.1-14 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergSem texto completo |
|
6 |
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 |
|
7 |
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 |
|
8 |
Material Type: Artigo
|
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut DecompositionsDorn, Frederic ; Penninkx, Eelko ; Bodlaender, Hans L. ; Fomin, Fedor V.Algorithmica, 2010-11, Vol.58 (3), p.790-810 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |
|
9 |
Material Type: Artigo
|
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidthBodlaender, Hans L. ; Cygan, Marek ; Kratsch, Stefan ; Nederlof, JesperInformation and computation, 2015-08, Vol.243, p.86-111 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
|
10 |
Material Type: Artigo
|
Kernel bounds for disjoint cycles and disjoint pathsBodlaender, Hans L. ; Thomassé, Stéphan ; Yeo, AndersTheoretical computer science, 2011-08, Vol.412 (35), p.4570-4578 [Periódico revisado por pares]Oxford: Elsevier B.VTexto completo disponível |