Bart M. P. Jansen

Bart M. P. Jansen is an Associate Professor at Eindhoven University of Technology in the Department of Mathematics and Computer Science. He leads the Graph Algorithms research group within the Algorithms cluster, focusing on foundational aspects of algorithm design and analysis, particularly in parameterized complexity and kernelization. His academic work bridges theoretical rigor with practical preprocessing techniques to reduce computational search spaces.

His research interests include parameterized complexity, kernelization, graph theory, and algorithmic preprocessing. He has made significant contributions to the understanding of data reduction techniques, especially in graph problems like Feedback Vertex Set and Graph Coloring. His work often involves polynomial compressions, sparsification, and structural graph parameters, aiming to make intractable problems more manageable through preprocessing.

The recent publications reflect a strong trend in theoretical computer science, particularly in fixed-parameter tractability, kernelization lower bounds, and preprocessing for NP-hard problems. His work frequently appears in top venues such as WG, MFCS, IPEC, and ESA, demonstrating sustained excellence in algorithmic research.

• Eindhoven Young Academy of Engineering (2022)
• ERC Starting Grant (2018)
• Christiaan Huygens Prize for ICT (2014)
• Best Paper Awards at WG 2021, MFCS 2016
• Multiple Teaching Awards from GEWIS (2015, 2016, 2018, 2022)
• Veni Grant from NWO (2014)
• University Teaching Qualification (2016)

Bart Jansen has supervised numerous PhD students, including Astrid Pieterse, Huib Donkers, Jari de Kroon, and Shivesh Kumar Roy, and currently advises Ruben Verhaegh and co-supervises Faezeh Motiei and Jeroen Lamme. His research is funded by the European Research Council under the Horizon 2020 programme (ERC grant agreement No 803421, ReduceSearch), supporting a five-year project on rigorous search space reduction. He has served on program committees of major conferences including ICALP, STACS, ESA, and SODA, and is an associate editor for ACM Transactions on Algorithms. He has also organized workshops such as SIGALGO.NL Symposium 2024 and FPT Fest 2023.

He leads the Graph Algorithms group at TU/e, which is part of the broader Algorithms cluster. The group focuses on developing efficient preprocessing techniques, structural graph algorithms, and kernelization methods. His team benefits from strong international collaborations and active participation in the parameterized complexity community.