Algorithms, complexity, and Hans
Publication date
2020
Authors
van Leeuwen, Jan
Editors
Fomin, Fedor V.
Kratsch, Stefan
van Leeuwen, Erik Jan
Advisors
Supervisors
Document Type
Part of book
Metadata
Show full item recordCollections
License
taverne
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.
Keywords
Algorithms, Computational complexity, Graphs, Networks, Parameterized complexity, Structural algorithmics, Treewidth, Taverne
Citation
van Leeuwen, J 2020, Algorithms, complexity, and Hans. in F V Fomin, S Kratsch & E J van Leeuwen (eds), Treewidth, Kernels, and Algorithms : Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday. Lecture Notes in Computer Science, vol. 12160, Springer, Cham, Switzerland, pp. 22-27. https://doi.org/10.1007/978-3-030-42071-0_4