If you made any changes in Pure these will be visible here soon.

Personal profile

Research profile

Bart Jansen is an Assistant 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. Bart’s research interests mainly concern parameterized (graph) algorithmics, with a special focus on provably effective preprocessing (kernelization). He is a member of NETWORKS, an NWO Gravitation project spanning multiple universities in the Netherlands. Its goal is to investigate the interplay between algorithms and stochastics to tackle complex problems on networks.

Bart’s main focus is on understanding the power of data reduction. In practice, the search for the exact solution to an NP-complete problem is often accelerated by orders of magnitude by adding a preprocessing phase. Before attempting to solve the problem, it is simplified by repeatedly applying reduction rules that do not change the answer. How can such reduction rules be developed systematically, how can we explain their success, and how can we predict estimate what types of reduction rules are useful for a certain application? These are questions that Bart attacks on a daily basis.

Quote

“Investigating efficient preprocessing algorithms is like exploring the lost continent of polynomial time. For decades, researchers believed there are no polynomial-time algorithms which are guaranteed to be useful in the search for exact answers to NP-complete problems. But we’re now discovering there is a rich variety of preprocessing algorithms to be found!”

Academic background

Bart Jansen received an MSc in Applied Computing Science from Utrecht University, the Netherlands, in 2009. He received a PhD from the same university in 2013. After working for one year as a postdoctoral researcher at the University of Bergen, Norway, he returned to the Netherlands to become Assistant Professor at TU/e. Bart received a VENI grant from NWO. In June 2014, Bart was awarded the Christiaan Huygens Prize in ICT.

Bart serves as co-chair of IPEC 2019 and is a program committee member of ICALP 2018, WG 2017, ESA 2016 and IPEC 2016. He is an Associate Editor for ACM Transactions on Algorithms (TALG), and on the Steering Committee of PACE (Parameterized Algorithms and Computational Experiments Challenge). He has been a speaker at a wide range of events, including the International Symposium on Parameterized and Exact Computation (IPEC 2017, Vienna, Austria), 2nd Highlights on Algorithms (HALG 2017, Berlin, Germany) and ACM-SIAM Symposium on Discrete Algorithms (SODA 2017, Barcelona, Spain).

Fingerprint Fingerprint is based on mining the text of the person's scientific documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 1 Similar Profiles
Kernelization Mathematics
Polynomials Engineering & Materials Science
Graph in graph theory Mathematics
kernel Mathematics
Parameterization Mathematics
Path Mathematics
Lower bound Mathematics
Polynomial Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2008 2019

  • 433 Citations
  • 25 Article
  • 19 Conference contribution
  • 4 Report
  • 1 Phd Thesis 1 (Research TU/e / Graduation TU/e)
4 Citations (Scopus)

Turing kernelization for finding long paths and cycles in restricted graph classes

Jansen, B. M. P., 2017, In : Journal of Computer and System Sciences. 85, p. 18-37

Research output: Contribution to journalArticleAcademicpeer-review

Kernelization
Long Cycle
Longest Path
Graph Classes
Turing
93 Citations (Scopus)

Kernelization lower bounds by cross-composition

Bodlaender, H. L., Jansen, B. M. P. & Kratsch, S., 2014, In : SIAM Journal on Discrete Mathematics. 28, 1, p. 277-305 29 p.

Research output: Contribution to journalArticleAcademicpeer-review

Kernelization
Lower bound
Feedback Vertex Set
Polynomial Hierarchy
Odd Cycle
9 Citations (Scopus)

Fine-grained complexity analysis of two classic TSP variants

de Berg, M. T., Buchin, K. A., Jansen, B. M. P. & Woeginger, G. J., 2016, 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016), 11-15 July 2016, Rome, Italy. p. 1-14 5

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Complexity Analysis
Exponential time
Bottleneck Problem
Longest Common Subsequence
Beat
9 Citations (Scopus)

Approximation and kernelization for chordal vertex deletion

Jansen, B. M. P. & Pilipczuk, M., 2017, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 16-19 January 2017, Barcelona, Spain. s.l.: Society for Industrial and Applied Mathematics (SIAM), p. 1399-1418 20 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Polynomials
Approximation algorithms
Parameterization
4 Citations (Scopus)

Uniform kernelization complexity of hitting forbidden minors

Giannopoulou, A. C., Jansen, B. M. P., Lokshtanov, D. & Saurabh, S., 1 Mar 2017, In : ACM Transactions on Algorithms. 13, 3, p. 1-35 35

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Forbidden Minor
Kernelization
kernel
Polynomial
Graph in graph theory

Prizes

Simplifying prior to solving

Bart Jansen (Recipient), 2018

Recognition: ERCStartingScientific

Big data

Best Paper Award MFCS 2016

Bart Jansen (Recipient) & Astrid Pieterse (Recipient), 2016

Recognition: OtherCareer, activity or publication related prizes (lifetime, best paper, poster etc.)Scientific

Computer science
Polynomials

Frontiers in Parameterized Preprocessing

Bart Jansen (Recipient), Jul 2014

Recognition: NWOVeniScientific

funding

Courses

Algorithms

1/09/13 → …

Course

Student theses

Efficient computation of fiber optic networks

Author: van den Boogaart, A., 28 Jan 2019

Supervisor: Jansen, B. (Supervisor 1) & van der Valk, F. (External person) (External coach)

Student thesis: Master

Improving efficiency and robustness of the HRDCF for dedicated hardware implementation on FPGA

Author: Corrias, R., 27 Mar 2017

Supervisor: Geilen, M. (Supervisor 1), Jansen, B. (Supervisor 2), Peemen, M. (Supervisor 2) & Stuijk, S. (Supervisor 2)

Student thesis: Master

File

Lower bounds for preprocessing algorithms based on protrusion replacement

Author: Wulms, J., 31 Aug 2016

Supervisor: Jansen, B. (Supervisor 1)

Student thesis: Master

File

Point-feature labelling in the 1-Slider model: a fixed-parameter tractable algorithm

Author: de Visser, L., 31 Aug 2015

Supervisor: Jansen, B. (Supervisor 1)

Student thesis: Master

File

Sparsification upper and lower bounds for graph problems and not-all-equal SAT

Author: Pieterse, A., 31 Aug 2015

Supervisor: Jansen, B. (Supervisor 1)

Student thesis: Master

File