Als u wijzigingen in Pure hebt gemaakt, zullen deze hier binnenkort zichtbaar zijn.

Persoonlijk profiel

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

Vingerafdruk Duik in de onderzoeksthema's waar Jesper Nederlof actief is. Deze onderwerplabels komen voort uit het werk van deze persoon. Samen vormen ze een unieke vingerafdruk.

  • 4 Vergelijkbare profielen
Exponential time Rekenkunde
Subset Sum Rekenkunde
Dynamic programming Engineering en materiaalwetenschappen
Treewidth Rekenkunde
Polynomials Engineering en materiaalwetenschappen
Hamiltonians Engineering en materiaalwetenschappen
Decomposition Engineering en materiaalwetenschappen
Hamiltonian circuit Rekenkunde

Netwerk Recente externe samenwerking op landenniveau. Duik in de details door op de stippen te klikken.

Onderzoeksoutput 2011 2019

Computing the chromatic number using graph decompositions via matrix rank

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

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Graph Decomposition
Chromatic number
Decomposition
Computing
Graph in graph theory
1 Downloads (Pure)

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. (redactie). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 blz. 73. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 144).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Open Access
Bestand
Polynomials
Set theory
Computational complexity

Hamiltonicity below Dirac's condition

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

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademic

Open Access
Bestand
Hamiltonicity
Vertex Degree
Paul Adrien Maurice Dirac
Hamiltonian circuit
Tractability

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. (redactie). Cham: Springer, blz. 27-39 13 blz. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11789 LNCS).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Hamiltonians
Hamiltonicity
Graph theory
Parameterization
Paul Adrien Maurice Dirac
2 Citaties (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. (redactie). New York: Association for Computing Machinery, Inc, blz. 1015-1034 20 blz.

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Open Access
Steiner Tree
Face
Graph in graph theory
Steiner Tree Problem
K-space

Prijzen

Faster algorithms in computer science

Jesper Nederlof (Ontvanger), 2019

Prijs: ERCStartingWetenschappelijk

Computer science
Polynomials
Computational complexity

Cursussen

Graphs and algorithms

1/09/15 → …

Cursus

Scriptie

Bank transaction minimization

Auteur: Salomé, D., 31 aug 2017

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

Scriptie/masterproef: Bachelor

Bestand

Counting connected subgraphs

Auteur: Verhaegh, R. F., 8 jul 2019

Begeleider: Nederlof, J. (Afstudeerdocent 1)

Scriptie/masterproef: Bachelor

Bestand

Curve clustering: hardness and algorithms

Auteur: Struijs, M., 26 nov 2018

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

Scriptie/masterproef: Master

Bestand

Euclidean TSP in narrow rectangles

Auteur: Alkema, H. Y., 25 nov 2019

Begeleider: de Berg, M. T. (Afstudeerdocent 1), Nederlof, J. (Afstudeerdocent 2), Papapetrou, O. (Afstudeerdocent 2) & van der Hofstad, R. W. (Afstudeerdocent 2)

Scriptie/masterproef: Master

Bestand

Graph editing by partial complements

Auteur: Scholte, T., 31 aug 2018

Begeleider: Nederlof, J. (Afstudeerdocent 1) & Fomin, F. V. (Externe persoon) (Externe coach)

Scriptie/masterproef: Master

Bestand