Bart M.P. Jansen

Bart M.P. Jansen is an Associate Professor in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e). His research focuses on parameterized algorithms and kernelization, particularly exploring systematic development and theoretical foundations of preprocessing techniques for NP-complete problems. He is a member of the NETWORKS NWO Gravitation project, investigating algorithms and stochastics for network problems.

Education: MSc (2009) and PhD (2013) in Applied Computing Science from Utrecht University. Postdoctoral research at the University of Bergen (2013-2014) before joining TU/e as Assistant Professor.

Research interests include complexity theory, graph theory, and algorithmic preprocessing. Notable contributions include kernelization lower bounds, preprocessing for TSP variants, and parameterized graph algorithms. He has received prestigious awards such as the ERC Starting Grant (2018), VENI Grant (2014), and Best Paper Awards at MFCS 2016 and WG 2021.

Teaching responsibilities include courses on Algorithms, Exact Algorithms for NP-hard Problems, and Formal Algorithm Analysis. He serves as an Associate Editor for ACM Transactions on Algorithms and co-chaired the International Symposium on Parameterized and Exact Computation (IPEC 2019).