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

Fingerprint Dive into the research topics where Jesper Nederlof is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

  • 4 Similar Profiles

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

Research Output

  • 410 Citations
  • 25 Article
  • 24 Conference contribution
  • 1 Chapter
  • 1 Phd Thesis 4 Research NOT TU/e / Graduation NOT TU/e)

Computing the chromatic number using graph decompositions via matrix rank

Jansen, B. M. P. & Nederlof, J., 26 Nov 2019, In : Theoretical Computer Science. 795, p. 520-539 20 p.

Research output: Contribution to journalArticleAcademicpeer-review

  • Equal-subset-sum faster than the meet-in-the-middle

    Mucha, M., Nederlof, J., Pawlewicz, J. & Węgrzycki, K., Sep 2019, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 73. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 144).

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

    Open Access
    File
  • 5 Downloads (Pure)

    Hamiltonicity below Dirac's condition

    Jansen, B. M. P., Kozma, L. & Nederlof, J., 2019, In : arXiv. 14 p., 1902.01745v1.

    Research output: Contribution to journalArticleAcademic

    Open Access
    File
  • 13 Downloads (Pure)

    Hamiltonicity below Dirac’s condition

    Jansen, B. M. P., Kozma, L. & Nederlof, J., 12 Sep 2019, Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Revised Papers. Sau, I. & Thilikos, D. M. (eds.). Cham: Springer, p. 27-39 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11789 LNCS).

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

  • 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
  • 3 Citations (Scopus)

    Prizes

    Faster algorithms in computer science

    Jesper Nederlof (Recipient), 2019

    Prize: ERCStartingScientific

  • Student theses

    Bank transaction minimization

    Author: Salomé, D., 31 Aug 2017

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

    Student thesis: Bachelor

    File

    Counting connected subgraphs

    Author: Verhaegh, R. F., 8 Jul 2019

    Supervisor: Nederlof, J. (Supervisor 1)

    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

    Euclidean TSP in narrow rectangles

    Author: Alkema, H. Y., 25 Nov 2019

    Supervisor: de Berg, M. T. (Supervisor 1), Nederlof, J. (Supervisor 2), Papapetrou, O. (Supervisor 2) & van der Hofstad, R. W. (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