Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
(Meta) KernelizationBodlaender, Hans ; Fomin, Fedor ; Lokshtanov, Daniel ; Penninkx, Eelko ; Saurabh, Saket ; Thilikos, DimitriosJournal of the ACM, 2016-12, Vol.63 (5), p.1-69 [Periódico revisado por pares]New York: ACMTexto completo disponível |
|
2 |
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 |
|
3 |
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 |
|
4 |
Material Type: Capítulo de Livro
|
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph ClassesSaitoh, Toshiki ; Yoshinaka, Ryo ; Bodlaender, Hans L.WALCOM: Algorithms and Computation, p.142-153 [Periódico revisado por pares]Cham: Springer International PublishingSem texto completo |
|
5 |
Material Type: Artigo
|
Efficiently computing the Shapley value of connectivity games in low-treewidth graphsvan der Zanden, Tom C. ; Bodlaender, Hans L. ; Hamers, Herbert J. M.Operational research, 2023-03, Vol.23 (1), Article 6 [Periódico revisado por pares]Berlin/Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
6 |
Material Type: Artigo
|
Characterizing width two for variants of treewidthBodlaender, Hans L. ; Kratsch, Stefan ; Kreuzen, Vincent J.C. ; Kwon, O-joung ; Ok, SeongminDiscrete Applied Mathematics, 2017-01, Vol.216, p.29-46 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
7 |
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 |
|
8 |
Material Type: Artigo
|
Typical Sequences Revisited — Computing Width Parameters of GraphsBodlaender, Hans L ; Jaffke, Lars ; Telle, Jan Arne2023-02Texto completo disponível |
|
9 |
Material Type: Artigo
|
A faster parameterized algorithm for PSEUDOFOREST DELETIONBodlaender, Hans L ; Ono, Hirotaka ; Otachi, Yota2018-02Texto completo disponível |
|
10 |
Material Type: Artigo
|
Steiner trees for hereditary graph classes: A treewidth perspectiveBodlaender, Hans L ; Brettell, Nick ; Johnson, Matthew ; Paesani, Giacomo ; Paulusma, Daniël ; van Leeuwen, Erik Jan2021-05Texto completo disponível |