Resume
Academic Achievements
- The Frank number and nowhere-zero flows on graphs, European Journal of Combinatorics, 2025
- House of Graphs 2.0: A database of interesting graphs and more, Discrete Applied Mathematics, 2023
- The Minimality of the Georges-Kelmans Graph, Mathematics of Computation, 2022
- Large independent sets in triangle-free cubic graphs: beyond planarity, Advances in Combinatorics, 2020
- Graphs with few Hamiltonian Cycles, Mathematics of Computation, 2020
- Obstructions for three-coloring graphs without induced paths on six vertices, Journal of Combinatorial Theory, Series B, 2020
- On minimal triangle-free 6-chromatic graphs, Journal of Graph Theory, 2020
- Exhaustive generation of k-critical H-free graphs, Journal of Graph Theory, 2018
- Improved bounds for hypohamiltonian graphs, Ars Mathematica Contemporanea, 2017
- Generation and properties of Snarks, Journal of Combinatorial Theory, Series B, 2013
- New computational upper bounds for Ramsey numbers R(3,k), Electronic Journal of Combinatorics, 2013
- The Generation of Fullerenes, Journal of Chemical Information and Modeling, 2012
Research Experience
- Assistant professor, Algorithmic Graph Theory Group, Department of Computer Science, KU Leuven Kulak, Etienne Sabbelaan 53, 8500 Kortrijk, Belgium
Background
- Research interests: Combinatorics, Generation of combinatorial structures, Graph algorithms, Graph algorithms with applications in medicine, Graph colouring, Chemical graph theory, Hamiltonicity, Ramsey numbers, Optimisation problems, Computer-aided theorem proving and discovery, Applications of AI in graph theory (and vice versa)