Generate a tailored SOP for Dr. Bart Jansen. Improve your application with a focused, well-structured draft.
Bart Jansen is an Associate Professor in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e). His areas of expertise include algorithms, complexity theory, and graph theory. His research interests primarily focus on parameterized (graph) algorithmics, with a specific emphasis on provably effective preprocessing (kernelization). Bart is a member of NETWORKS, a NWO Gravitation project that spans multiple universities in the Netherlands, aimed at investigating the interplay between algorithms and stochastics to address complex problems in networks. Bart's main focus is on understanding the power of data reduction in practice, aiming to enhance the search for exact solutions to NP-complete problems. He approaches these problems by simplifying them through the repeated application of reduction rules to change answers. Over the decades, the belief that polynomial-time algorithms guarantee useful searches for exact answers to NP-complete problems is being challenged as researchers uncover a rich variety of effective preprocessing algorithms.
University of Bergen • Bergen, Norway
Conducted research post doctorate in algorithms and complexity.
Eindhoven University of Technology • Eindhoven, Netherlands
Instruct and conduct research in algorithms and graph theory.
Specific departments like Industrial Design require a portfolio. Programs like Data Science and AI require a GRE-General test for certain international backgrounds.