Als u wijzigingen in Pure hebt gemaakt, zullen deze hier binnenkort zichtbaar zijn.

Persoonlijk profiel

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).

Vingerafdruk Verdiep u in de onderzoeksgebieden waarop Bart M.P. Jansen actief is. Deze onderwerplabels komen uit het werk van deze persoon. Samen vormen ze een unieke vingerafdruk.

  • 4 Soortgelijke profielen

Netwerk Recente externe samenwerking op landenniveau. Duik in de details door op de stippen te klikken.

Onderzoeksoutput

  • 429 Citaties
  • 36 Tijdschriftartikel
  • 22 Conferentiebijdrage
  • 4 Rapport
  • 3 Paper

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

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

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

  • 6 Citaten (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, blz. 277-305 29 blz.

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

  • 115 Citaten (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. blz. 1-14 5

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

  • 12 Citaten (Scopus)
    3 Downloads (Pure)

    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. Klein, P. N. (redactie). s.l.: Society for Industrial and Applied Mathematics (SIAM), blz. 1399-1418 20 blz.

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

  • 9 Citaten (Scopus)

    Uniform kernelization complexity of hitting forbidden minors

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

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

    Open Access
    Bestand
  • 8 Citaten (Scopus)
    56 Downloads (Pure)

    Prijzen

    Simplifying prior to solving

    B.M.P. Jansen (Ontvanger), 2018

    Prijs: ERCStartingWetenschappelijk

  • Best Paper Award MFCS 2016

    Bart Jansen (Ontvanger) & A. Pieterse (Ontvanger), 2016

    Prijs: AndersWerk, activiteit of publicatie gerelateerde prijzen (lifetime, best paper, poster etc.)Wetenschappelijk

  • Frontiers in Parameterized Preprocessing

    Bart Jansen (Ontvanger), jul 2014

    Prijs: NWOVeniWetenschappelijk

  • Cursussen

    Algorithms

    1/09/13 → …

    Cursus

    Data Sci & Engineering

    1/09/15 → …

    Cursus

    Scriptie

    Efficient computation of fiber optic networks

    Auteur: van den Boogaart, A., 28 jan 2019

    Begeleider: Jansen, B. (Afstudeerdocent 1) & van der Valk, F. (Externe persoon) (Externe coach)

    Scriptie/masterproef: Master

    Bestand

    Exact algorithms for domination problems parameterized by tree-depth using polynomial space

    Auteur: Ambags, M., 30 sep 2019

    Begeleider: Jansen, B. (Afstudeerdocent 1)

    Scriptie/masterproef: Master

    Bestand

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

    Auteur: Corrias, R., 27 mrt 2017

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

    Scriptie/masterproef: Master

    Bestand

    Lower bounds for preprocessing algorithms based on protrusion replacement

    Auteur: Wulms, J., 31 aug 2016

    Begeleider: Jansen, B. (Afstudeerdocent 1)

    Scriptie/masterproef: Master

    Bestand

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

    Auteur: de Visser, L., 31 aug 2015

    Begeleider: Jansen, B. (Afstudeerdocent 1)

    Scriptie/masterproef: Master

    Bestand