Jorik Jooken

34 papers B 2Journal 29Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Minimal obstructions to C5-coloring in hereditary graph classes.
Inf. Comput.
Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt
2026 J jnl
On (k,g)-graphs without (g + 1)-cycles.
Appl. Math. Comput.
Leonard Chidiebere Eze, Robert Jajcay, Jorik Jooken
2026 B conf
On the Order-Diameter Ratio of Girth-Diameter Cages.
SOFSEM
Stijn Cambie, Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede
2026 J jnl
Vertex-critical (P5, W4)-free graphs.
Theor. Comput. Sci.
Wen Xia, Jorik Jooken, Jan Goedgebeur, Iain Beaton, Ben Cameron, Shenwei Huang
2025 J jnl
Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification.
CoRR
Tala Eagling-Vose, Jorik Jooken, Felicia Lucke, Barnaby Martin, Daniël Paulusma
2025 J jnl
Computer-assisted graph theory: a survey.
CoRR
Jorik Jooken
2025 J jnl
Critical (P5,dart)-free graphs.
Discret. Appl. Math.
Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang
2025 J jnl
Improved lower bounds on the maximum size of graphs with girth 5.
CoRR
Jan Goedgebeur, Jorik Jooken, Gwenaël Joret, Tibo Van den Eede
2025 J jnl
New small regular graphs of given girth: the cage problem and beyond.
CoRR
Geoffrey Exoo, Jan Goedgebeur, Jorik Jooken, Louis Stubbe, Tibo Van den Eede
2025 J jnl
On Vertex-Girth-Regular Graphs: (Non-)Existence, Bounds and Enumeration.
Electron. J. Comb.
Robert Jajcay, Jorik Jooken, István Porupsánszki
2025 J jnl
On the order-diameter ratio of girth-diameter cages.
CoRR
Stijn Cambie, Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede
2025 J jnl
Some Results on Critical (P5,H)-free Graphs.
Theor. Comput. Sci.
Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang
2025 J jnl
The Gray graph is pseudo 2-factor isomorphic.
CoRR
Marién Abreu, Jan Goedgebeur, Jorik Jooken, Federico Romaniello, Tibo Van den Eede
2025 J jnl
The Maximum Number of Connected Sets in Regular Graphs.
Electron. J. Comb.
Stijn Cambie, Jorik Jooken, Jan Goedgebeur
2025 — conf
Vertex-Critical (P
COCOON (2)
Wen Xia, Jorik Jooken, Jan Goedgebeur, Iain Beaton, Ben Cameron, Shenwei Huang
2024 J jnl
A heuristic algorithm using tree decompositions for the maximum happy vertices problem.
J. Heuristics
Louis Carpentier, Jorik Jooken, Jan Goedgebeur
2024 J jnl
A note on X¯-coloring and Aˆ-coloring 4-regular graphs.
Discret. Math.
Jorik Jooken
2024 J jnl
Computational methods for finding bi-regular cages.
CoRR
Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede
2024 J jnl
Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs.
Discret. Appl. Math.
Jorik Jooken
2024 B conf
Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes.
MFCS
Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt
2024 J jnl
On (k,g)-Graphs without (g+1)-Cycles.
CoRR
Leonard Chidiebere Eze, Robert Jajcay, Jorik Jooken
2024 — conf
Some Results on Critical (P
COCOON (1)
Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang
2023 — conf
Critical (P
COCOA (2)
Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang
2023 J jnl
Evolving test instances of the Hamiltonian completion problem.
Comput. Oper. Res.
Thibault Lechien, Jorik Jooken, Patrick De Causmaecker
2023 J jnl
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems.
Comput. Oper. Res.
Jorik Jooken, Pieter Leyman, Tony Wauters, Patrick De Causmaecker
2023 J jnl
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions.
Eur. J. Oper. Res.
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
2022 J jnl
A heuristic algorithm for the maximum happy vertices problem using tree decompositions.
CoRR
Louis Carpentier, Jorik Jooken, Jan Goedgebeur
2022 J jnl
A new class of hard problem instances for the 0-1 knapsack problem.
Eur. J. Oper. Res.
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
2022 J jnl
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions.
CoRR
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
2022 J jnl
Few hamiltonian cycles in graphs with one or two vertex degrees.
CoRR
Jan Goedgebeur, Jorik Jooken, On-Hei Solomon Lo, Ben Seamone, Carol T. Zamfirescu
2020 J jnl
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs.
J. Heuristics
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker
2020 J jnl
Evolving test instances of the Hamiltonian completion problem.
CoRR
Thibault Lechien, Jorik Jooken, Patrick De Causmaecker
2020 J jnl
Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem.
CoRR
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker, Tony Wauters
2019 J jnl
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs.
CoRR
Jorik Jooken, Pieter Leyman, Patrick De Causmaecker