Bart Jansen

Bart Jansen is an Associate Professor in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e). His expertise includes algorithms, complexity theory, and graph theory, with a focus on parameterized (graph) algorithmics, particularly kernelization. He is a member of the NWO Gravitation project NETWORKS, investigating algorithms and stochastics in network problems.

Education: MSc in Applied Computing Science (Utrecht University, 2009), PhD (Utrecht University, 2013). Postdoctoral research at the University of Bergen (2013–2014) before joining TU/e as Assistant Professor, later promoted to Associate Professor.

Research emphasizes systematic development and theoretical analysis of preprocessing algorithms for NP-complete problems. Notable contributions include kernelization complexity, cross-composition techniques, and parameterized preprocessing efficiency.

Selected awards include the VENI Grant (NWO) and the Christiaan Huygens Prize in ICT (2014). He has served on program committees for SODA, ICALP, and others, co-chairing IPEC 2019. Editor roles include ACM Transactions on Algorithms and steering committees for PACE challenges.

Research interests span preprocessing algorithms, kernelization theory, and the interplay between algorithm design and complexity reduction. Current educational activities include teaching advanced algorithms and formal analysis for pre-master students.