Hans Bodlaender and the Theory of Kernelization Lower Bounds

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In this short letter I give a brief subjective account of my favorite result with Hans – our kernelization lower bounds framework. The purpose of this manuscript is not to give a formal introduction to this result and the area that spawned from it, nor is it meant to be a comprehensive survey of all related and relevant results. Rather, my aim here is to informally describe the history that lead to this result from a personal perspective, and to outline Hans’s role in the development of this theory into what it is today.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer
Pages18-21
Number of pages4
DOIs
StatePublished - 1 Jan 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12160 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Hans Bodlaender and the Theory of Kernelization Lower Bounds'. Together they form a unique fingerprint.

Cite this