If you made any changes in Pure these will be visible here soon.

Personal profile

Academic background

Jesper Nederlof received his MSc in Applied Computing Science from Utrecht University (the Netherlands) in 2008. At the University of Bergen, Norway, he successfully defended his PhD thesis titled `Space and Time Efficient Structural Improvements of Dynamic Programming Algorithms’ in December 2011. In 2012-2014, he continued the research of his PhD thesis as a postdoctoral researcher at Utrecht University funded by a NWO open competition project. From February 2014 to October 2014, he worked as a postdoctoral researcher at Maastricht University. He also writes papers featuring a substantial amount of (among others) algorithmic game theory, information theory, representation theory, approximation algorithms and online algorithms.

Research profile

Jesper Nederlof is an Assistant Professor in the Discrete Mathematics group at Eindhoven University of Technology (TU/e). His areas of expertise include software, algorithms, control systems, theoretical computer science and mathematics. Jesper’s research focuses on algorithms for discrete problems and computational complexity. His focus is on exact algorithms for NP-hard problems. The main question is how fast a particular computational problem can be solved exactly in the worst-case setting.

In Jesper’s view, most research on NP-hard problems focuses too strongly on determining whether a problem is in P or in NP and commonly refrains from pursuing the original question (the optimal worst-case running time). This skips the most intriguing part: If P does not equal NP, all NP-hard problems must feature some barrier running time beyond which we cannot improve. What does this mysterious barrier look like, and how does it depend on the problem structure? To prove P = NP requires find modest improvements of the currently naïve exhaustive search algorithms.

Quote

“What I find intriguing about my area is that many fundamental questions of great importance are still wide open, and many results go against our current intuition. Not surprising, since the area is relatively young; there is still a lot to gain, and I’m happy to contribute to this.”

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2011 2019

Computing the chromatic number using graph decompositions via matrix rank

Jansen, B. M. P. & Nederlof, J., 7 Aug 2019, In : Theoretical Computer Science.

Research output: Contribution to journalArticleAcademicpeer-review

Graph Decomposition
Chromatic number
Decomposition
Computing
Graph in graph theory
1 Citation (Scopus)

Nearly ETH-tight algorithms for planar Steiner Tree with terminals on few faces

Kisfaludi-Bak, S., Nederlof, J. & van Leeuwen, E. J., 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. Chan, T. M. (ed.). New York: Association for Computing Machinery, Inc, p. 1015-1034 20 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Open Access
Steiner Tree
Face
Graph in graph theory
Steiner Tree Problem
Trees (mathematics)

Algorithms for combinatorial discrepancy

Garg, S., 10 Oct 2018, Eindhoven: Technische Universiteit Eindhoven. 139 p.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

Open Access
File

Algorithms for k-server problems

Koumoutsos, G., 6 Sep 2018, Eindhoven: Technische Universiteit Eindhoven. 91 p.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

Open Access
File

Algorithms for some metrical service systems

Elias, M., 17 Sep 2018, Eindhoven: Technische Universiteit Eindhoven. 90 p.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

Open Access
File

Prizes

Faster algorithms in computer science

Jesper Nederlof (Recipient), 2019

Recognition: ERCStartingScientific

Computer science
Polynomials
Computational complexity

Courses

Graphs and algorithms

1/09/15 → …

Course

Student theses

Bank transaction minimization

Author: Salomé, D., 31 Aug 2017

Supervisor: Nederlof, J. (Supervisor 1) & Verhoeff, T. (Supervisor 2)

Student thesis: Bachelor

File

Curve clustering: hardness and algorithms

Author: Struijs, M., 26 Nov 2018

Supervisor: Nederlof, J. (Supervisor 1), Buchin, K. (Supervisor 2) & Driemel, A. (Supervisor 2)

Student thesis: Master

File

Graph editing by partial complements

Author: Scholte, T., 31 Aug 2018

Supervisor: Nederlof, J. (Supervisor 1) & Fomin, F. V. (External person) (External coach)

Student thesis: Master

File

Optimization of allocation criteria in multi-warehouse orders for Bol.com

Author: van Hees, L., 31 Aug 2018

Supervisor: Hurkens, C. (Supervisor 1), Nederlof, J. (Supervisor 2) & Adan, I. (Supervisor 2)

Student thesis: Master

File

Triangle partition on graphs of bounded cutwidth: upper- and lower bounds on algorithmic and communication complexity

Author: van Heck, I., 31 Aug 2018

Supervisor: Jansen, B. (Supervisor 1) & Nederlof, J. (Supervisor 2)

Student thesis: Master

File