Jorik Jooken

According to our database, Jorik Jooken authored at least 32 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Three-coloring triangle-free graphs without long forbidden paths.

Yidong Zhou, Jorik Jooken, Baoyuan Shan, Jan Goedgebeur, Shenwei Huang

Theor. Comput. Sci., 2026

Vertex-critical (P5, W4)-free graphs.

Wen Xia, Jorik Jooken, Jan Goedgebeur, Iain Beaton, Ben Cameron, Shenwei Huang

Theor. Comput. Sci., 2026

Minimal obstructions to C5-coloring in hereditary graph classes.

Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt

Inf. Comput., 2026

The Gray graph is pseudo 2-factor isomorphic.

Marién Abreu, Jan Goedgebeur, Jorik Jooken, Federico Romaniello, Tibo Van den Eede

Discret. Appl. Math., 2026

On (k,g)-graphs without (g + 1)-cycles.

Leonard Chidiebere Eze, Robert Jajcay, Jorik Jooken

Appl. Math. Comput., 2026

On the Order-Diameter Ratio of Girth-Diameter Cages.

Stijn Cambie, Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede

Proceedings of the SOFSEM 2026: Theory and Practice of Computer Science, 2026

2025

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification.

Tala Eagling-Vose, Jorik Jooken, Felicia Lucke, Barnaby Martin, Daniël Paulusma

CoRR, December, 2025

New small regular graphs of given girth: the cage problem and beyond.

Geoffrey Exoo, Jan Goedgebeur, Jorik Jooken, Louis Stubbe, Tibo Van den Eede

CoRR, November, 2025

Computer-assisted graph theory: a survey.

Jorik Jooken

CoRR, August, 2025

Improved lower bounds on the maximum size of graphs with girth 5.

Jan Goedgebeur, Jorik Jooken, Gwenaël Joret, Tibo Van den Eede

CoRR, August, 2025

Some Results on Critical (P5,H)-free Graphs.

Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang

Theor. Comput. Sci., 2025

Counterexamples to conjectures on the occupancy fraction of graphs.

Stijn Cambie, Jorik Jooken

Math. Comput., 2025

Critical (P5,dart)-free graphs.

Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang

Discret. Appl. Math., 2025

On Vertex-Girth-Regular Graphs: (Non-)Existence, Bounds and Enumeration.

Robert Jajcay, Jorik Jooken, István Porupsánszki

Electron. J. Comb., 2025

The Maximum Number of Connected Sets in Regular Graphs.

Stijn Cambie, Jorik Jooken, Jan Goedgebeur

Electron. J. Comb., 2025

Vertex-Critical (P_5,W₄₎-Free Graphs.

Wen Xia, Jorik Jooken, Jan Goedgebeur, Iain Beaton, Ben Cameron, Shenwei Huang

Proceedings of the Computing and Combinatorics, 2025

2024

A heuristic algorithm using tree decompositions for the maximum happy vertices problem.

Louis Carpentier, Jorik Jooken, Jan Goedgebeur

J. Heuristics, April, 2024

A note on X¯-coloring and Aˆ-coloring 4-regular graphs.

Jorik Jooken

Discret. Math., 2024

Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs.

Jorik Jooken

Discret. Appl. Math., 2024

On (k,g)-Graphs without (g+1)-Cycles.

Leonard Chidiebere Eze, Robert Jajcay, Jorik Jooken

CoRR, 2024

Computational methods for finding bi-regular cages.

Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede

CoRR, 2024

Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes.

Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Some Results on Critical (P_5,H)-Free Graphs.

Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang

Proceedings of the Computing and Combinatorics - 30th International Conference, 2024

2023

Features for the 0-1 knapsack problem based on inclusionwise maximal solutions.

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker

Eur. J. Oper. Res., November, 2023

Evolving test instances of the Hamiltonian completion problem.

Thibault Lechien, Jorik Jooken, Patrick De Causmaecker

Comput. Oper. Res., 2023

Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems.

Jorik Jooken, Pieter Leyman, Tony Wauters, Patrick De Causmaecker

Comput. Oper. Res., 2023

Critical (P_5,dart)-Free Graphs.

Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

A new class of hard problem instances for the 0-1 knapsack problem.

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker

Eur. J. Oper. Res., 2022

Few hamiltonian cycles in graphs with one or two vertex degrees.

Jan Goedgebeur, Jorik Jooken, On-Hei Solomon Lo, Ben Seamone, Carol T. Zamfirescu

CoRR, 2022

A heuristic algorithm for the maximum happy vertices problem using tree decompositions.

Louis Carpentier, Jorik Jooken, Jan Goedgebeur

CoRR, 2022

2020

A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs.

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker

J. Heuristics, 2020

Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem.

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker, Tony Wauters

CoRR, 2020