Hans Bodlaender and the Theory of Kernelization Lower Bounds

Dan Hermelin

doi:10.1007/978-3-030-42071-0_3

Hans Bodlaender and the Theory of Kernelization Lower Bounds

Dan Hermelin

Department of Industrial Engineering and Management

Research output: Contribution to journal › Conference article › peer-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 language	English GB
Pages (from-to)	18-21
Number of pages	4
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOIs	https://doi.org/10.1007/978-3-030-42071-0_3
State	Published - 1 Jan 2020

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science (all)

Access to Document

10.1007/978-3-030-42071-0_3

Cite this

@article{ca40659596d64853930ae1aa5944853c,

title = "Hans Bodlaender and the Theory of Kernelization Lower Bounds",

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{\textquoteright}s role in the development of this theory into what it is today.",

author = "Dan Hermelin",

year = "2020",

month = jan,

day = "1",

doi = "10.1007/978-3-030-42071-0_3",

language = "אנגלית",

pages = "18--21",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - Hans Bodlaender and the Theory of Kernelization Lower Bounds

AU - Hermelin, Dan

PY - 2020/1/1

Y1 - 2020/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85090001171&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-42071-0_3

DO - 10.1007/978-3-030-42071-0_3

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:85090001171

SP - 18

EP - 21

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -

Hans Bodlaender and the Theory of Kernelization Lower Bounds

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this