Algorithms, complexity, and Hans

DSpace/Manakin Repository

Algorithms, complexity, and Hans
 
van Leeuwen, J.
(2020) Fomin, Fedor V., Kratsch, Stefan, van Leeuwen, Erik Jan (eds.), Treewidth, Kernels, and Algorithms, pp. 22 - 27
Lecture Notes in Computer Science, pp. 22 - 27
(Part of book)
Abstract
In this essay on the occasion of Hans Bodlaender’s 60th birthday, we recount some of the early developments in the field in which Hans made his mark and of their context at Utrecht University.
Download/Full Text
Open Access version via Utrecht University Repository Publisher version
 
Keywords: Algorithms, Computational complexity, Graphs, Networks, Parameterized complexity, Structural algorithmics, Treewidth, Taverne
DOI: https://doi.org/10.1007/978-3-030-42071-0_4
ISSN: 0302-9743
ISBN: 978-3-030-42070-3
978-3-42071-0
Publisher: Springer, Springer
(Peer reviewed)
 
 
See more statistics about this item