Skip to main navigation Skip to search Skip to main content

Algorithms, complexity, and Hans

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

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.
Original languageEnglish
Title of host publicationTreewidth, Kernels, and Algorithms
Subtitle of host publicationEssays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday
EditorsFedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen
Place of PublicationCham, Switzerland
PublisherSpringer
Pages22-27
Number of pages6
ISBN (Electronic)978-3-42071-0
ISBN (Print)978-3-030-42070-3
DOIs
Publication statusPublished - 2020

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume12160
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Algorithms
  • Computational complexity
  • Graphs
  • Networks
  • Parameterized complexity
  • Structural algorithmics
  • Treewidth

Fingerprint

Dive into the research topics of 'Algorithms, complexity, and Hans'. Together they form a unique fingerprint.

Cite this