Erik Jan van Leeuwen

Erik Jan van Leeuwen is an Assistant Professor in the Department of Information and Computing Sciences at Utrecht University, Faculty of Science. His research focuses on theoretical computer science, particularly in algorithm design and analysis.

Education:

• PhD in Computer Science, University of Amsterdam, 2009
• Master's degree (cum laude), Utrecht University, 2004
• Propaedeutic degree (cum laude), Utrecht University, 2000

Research Interests:
Erik Jan van Leeuwen's research lies in the core areas of parameterized complexity, approximation algorithms, graph algorithms, and computational geometry. He investigates structural properties of graphs, especially H-free graphs, and develops efficient algorithms for hard problems in network design, connectivity, and optimization. His recent work explores streaming algorithms, survivable networks, and forbidden subgraph frameworks, contributing to both theoretical foundations and algorithmic techniques.

Publication Trends:
His recent publications show a strong focus on complexity frameworks for forbidden subgraphs, parameterized algorithms for network and graph problems, and structural graph theory. He frequently collaborates on problems involving diameter, connectivity, vertex covers, and disjoint paths in restricted graph classes. There is a clear trend toward fine-grained and parameterized complexity, often leveraging structural decompositions and kernelization.

Scientific Awards:

• Best paper award at IWOCA 2024
• Best paper award at IPEC 2023
• Best student paper award at IPEC 2022
• Third Place, Parameterized Algorithms Challenge
• Philips Mathematics Prize for PhD Students
• BRICKS 2007 Dissemination award

Advising and Grants:
He supervises PhD students Jelle Oostveen (defense scheduled 2025) and Sukanya Pandey (defended 2024, now postdoc at RWTH Aachen). As Principal Investigator, he secured a 2019 NWO grant on Parameterized Algorithms for Network Analysis. Other grants include Utrecht University funding for projects on Fake News in Social Networks and Prediction Methods for Sociological Theory.

Labs and Teams:
He is affiliated with the Theoretical Computer Science group at Utrecht University. He has been involved in organizing Lorentz workshops on Fine-grained and Parameterized Computational Geometry (2025) and Graph Decompositions (2022), indicating active collaboration in specialized research communities.