The predecessor and the accounting algorithm speed up shortest path calculations in traffic routing applications. - Sofie Demeyer; Jan Goedgebeur; Pieter Audenaert; Mario Pickavet; Piet Demeester (ITSC, 2010)

Generation of Cubic graphs. - Gunnar Brinkmann; Jan Goedgebeur; Brendan D. McKay (Discret. Math. Theor. Comput. Sci., 2011)

A Database of Interesting Graphs: The House of Graphs. - Gunnar Brinkmann; Kris Coolsaet; Jan Goedgebeur; Hadrien Mélot (CTW, 2012)

Ramsey Numbers R(K3, G) for Graphs of Order 10. - Gunnar Brinkmann; Jan Goedgebeur; Jan-Christoph Schlage-Puchta (Electron. J. Comb., 2012)

Ramsey numbers R(K3,G) for graphs of order 10 - Gunnar Brinkmann; Jan Goedgebeur; Jan-Christoph Schlage-Puchta (CoRR, 2012)

The Generation of Fullerenes. - Gunnar Brinkmann; Jan Goedgebeur; Brendan D. McKay (J. Chem. Inf. Model., 2012)

Speeding up Martins' algorithm for multiple objective shortest path problems. - Sofie Demeyer; Jan Goedgebeur; Pieter Audenaert; Mario Pickavet; Piet Demeester (4OR, 2013)

New Computational Upper Bounds for Ramsey Numbers R(3, k). - Jan Goedgebeur; Stanislaw P. Radziszowski (Electron. J. Comb., 2013)

The Ramsey Number R(3, K10-e) and Computational Bounds for R(3, G). - Jan Goedgebeur; Stanislaw P. Radziszowski (Electron. J. Comb., 2013)

The Ramsey Number $R(3, K_{10}-e)$ and Computational Bounds for $R(3, G)$. - Jan Goedgebeur; Stanislaw P. Radziszowski (CoRR, 2013)

House of Graphs: A database of interesting graphs. - Gunnar Brinkmann; Kris Coolsaet; Jan Goedgebeur; Hadrien Mélot (Discret. Appl. Math., 2013)

Generation and properties of snarks. - Gunnar Brinkmann; Jan Goedgebeur; Jonas Hägglund; Klas Markström (J. Comb. Theory B, 2013)

Recursive generation of IPR fullerenes. - Jan Goedgebeur; Brendan D. McKay (CoRR, 2015)

Fullerenes with distant pentagons. - Jan Goedgebeur; Brendan D. McKay (CoRR, 2015)

Exhaustive generation of $k$-critical $ mathcal H$-free graphs. - Jan Goedgebeur; Oliver Schaudt (CoRR, 2015)

A counterexample to the pseudo 2-factor isomorphic graph conjecture. - Jan Goedgebeur (Discret. Appl. Math., 2015)

Obstructions for three-coloring graphs with one forbidden induced subgraph. - Maria Chudnovsky; Jan Goedgebeur; Oliver Schaudt; Mingxian Zhong (SODA, 2016)

Exhaustive Generation of k-Critical ℋ-Free Graphs. - Jan Goedgebeur; Oliver Schaudt (WG, 2016)

New results on hypohamiltonian and almost hypohamiltonian graphs. - Jan Goedgebeur; Carol T. Zamfirescu (CoRR, 2016)

Improved bounds for hypohamiltonian graphs. - Jan Goedgebeur; Carol T. Zamfirescu (Ars Math. Contemp., 2017)

Generation and properties of nut graphs. - Kris Coolsaet; Patrick W. Fowler; Jan Goedgebeur (CoRR, 2017)

Generation of Cubic Graphs and Snarks with Large Girth. - Gunnar Brinkmann; Jan Goedgebeur (J. Graph Theory, 2017)

On hypohamiltonian snarks and a theorem of Fiorini. - Jan Goedgebeur; Carol T. Zamfirescu (Ars Math. Contemp., 2018)

On the Smallest Snarks with Oddness 4 and Connectivity 2. - Jan Goedgebeur (Electron. J. Comb., 2018)

A note on 2-bisections of claw-free cubic graphs. - Marién Abreu; Jan Goedgebeur; Domenico Labbate; Giuseppe Mazzuoccolo (Discret. Appl. Math., 2018)

Exhaustive generation of k-critical H-free graphs. - Jan Goedgebeur; Oliver Schaudt (J. Graph Theory, 2018)

Infinitely many planar cubic hypohamiltonian graphs of girth 5. - Jan Goedgebeur; Carol T. Zamfirescu (J. Graph Theory, 2018)

Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. - Jan Goedgebeur; Edita Mácajová; Martin Skoviera (Ars Math. Contemp., 2019)

Existence of $d$-regular nut graphs for $d$ at most 11. - Patrick W. Fowler; John Baptist Gauci; Jan Goedgebeur; Tomaz Pisanski; Irene Sciriha (CoRR, 2019)

An algorithm and new bounds for the circular flow number of snarks. - Jan Goedgebeur; Davide Mattiolo; Giuseppe Mazzuoccolo (CoRR, 2019)

Large independent sets in triangle-free cubic graphs: beyond planarity. - Wouter Cames van Batenburg; Jan Goedgebeur; Gwenaël Joret (CoRR, 2019)

On the minimum leaf number of cubic graphs. - Jan Goedgebeur; Kenta Ozeki; Nico Van Cleemput; Gábor Wiener (Discret. Math., 2019)

Bounds for the smallest k-chromatic graphs of given girth. - Geoffrey Exoo; Jan Goedgebeur (Discret. Math. Theor. Comput. Sci., 2019)

On almost hypohamiltonian graphs. - Jan Goedgebeur; Carol T. Zamfirescu (Discret. Math. Theor. Comput. Sci., 2019)

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs. - Marién Abreu; Jan Goedgebeur; Domenico Labbate; Giuseppe Mazzuoccolo (J. Graph Theory, 2019)

k-Critical Graphs in P5-Free Graphs. - Kathie Cameron; Jan Goedgebeur; Shenwei Huang; Yongtang Shi (COCOON, 2020)

Structural and computational results on platypus graphs. - Jan Goedgebeur; Addie Neyt; Carol T. Zamfirescu (Appl. Math. Comput., 2020)

The smallest nontrivial snarks of oddness 4. - Jan Goedgebeur; Edita Mácajová; Martin Skoviera (Discret. Appl. Math., 2020)

Computational results and new bounds for the circular flow number of snarks. - Jan Goedgebeur; Davide Mattiolo; Giuseppe Mazzuoccolo (Discret. Math., 2020)

Existence of regular nut graphs for degree at most 11. - Patrick W. Fowler; John Baptist Gauci; Jan Goedgebeur; Tomaz Pisanski; Irene Sciriha (Discuss. Math. Graph Theory, 2020)

Obstructions for three-coloring graphs without induced paths on six vertices. - Maria Chudnovsky; Jan Goedgebeur; Oliver Schaudt; Mingxian Zhong (J. Comb. Theory, Ser. B, 2020)

On minimal triangle-free 6-chromatic graphs. - Jan Goedgebeur (J. Graph Theory, 2020)

Graphs with few hamiltonian cycles. - Jan Goedgebeur; Barbara Meersman; Carol T. Zamfirescu (Math. Comput., 2020)

Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs. - Maria Chudnovsky; Jan Goedgebeur; Oliver Schaudt; Mingxian Zhong (SIAM J. Discret. Math., 2020)

New bounds for Ramsey numbers R(Kk-e, Kl-e). - Jan Goedgebeur; Steven Van Overberghe (CoRR, 2021)

Some Results on k-Critical P5-Free Graphs. - Qingqiong Cai; Jan Goedgebeur; Shenwei Huang (CoRR, 2021)

A unified approach to construct snarks with circular flow number 5. - Jan Goedgebeur; Davide Mattiolo; Giuseppe Mazzuoccolo (J. Graph Theory, 2021)

Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. - Flavia Bonomo-Braberman; Maria Chudnovsky; Jan Goedgebeur; Peter Maceli; Oliver Schaudt; Maya Stein; Mingxian Zhong (Theor. Comput. Sci., 2021)

k-Critical graphs in P5-free graphs. - Kathie Cameron; Jan Goedgebeur; Shenwei Huang; Yongtang Shi (Theor. Comput. Sci., 2021)

An introduction to Computational Graph Theory and Generation Algorithms (invited paper). - Jan Goedgebeur (ITAT, 2022)

A heuristic algorithm for the maximum happy vertices problem using tree decompositions. - Louis Carpentier; Jorik Jooken; Jan Goedgebeur (CoRR, 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)

New bounds for Ramsey numbers R(Kk-e, Kl-e). - Jan Goedgebeur; Steven Van Overberghe (Discret. Appl. Math., 2022)

Switching 3-edge-colorings of cubic graphs. - Jan Goedgebeur; Patric R. J. Östergård (Discret. Math., 2022)

The minimality of the Georges-Kelmans graph. - Gunnar Brinkmann; Jan Goedgebeur; Brendan D. McKay (Math. Comput., 2022)

Critical (P5,dart)-Free Graphs. - Wen Xia; Jorik Jooken; Jan Goedgebeur; Shenwei Huang (COCOA (2), 2023)

Efficient Online Scheduling and Routing for Automated Guided Vehicles: Comparing a Novel Loop-Based Algorithm Against Existing Methods. - Louis Stubbe; Jens Goemaere; Jan Goedgebeur (CoRR, 2023)

K2-Hamiltonian Graphs: II. - Jan Goedgebeur; Jarne Renders; Gábor Wiener; Carol T. Zamfirescu (CoRR, 2023)

Generation and New Infinite Families of K2-hypohamiltonian Graphs. - Jan Goedgebeur; Jarne Renders; Carol T. Zamfirescu (CoRR, 2023)

House of Graphs 2.0: A database of interesting graphs and more. - Kris Coolsaet; Sven D'hondt; Jan Goedgebeur (Discret. Appl. Math., 2023)

Colouring graphs with no induced six-vertex path or diamond. - Jan Goedgebeur; Shenwei Huang; Yiao Ju; Owen D. Merkel (Theor. Comput. Sci., 2023)

Some results on k-critical P5-free graphs. - Qingqiong Cai; Jan Goedgebeur; Shenwei Huang (Discret. Appl. Math., 2023)

Some Results on Critical (P5,H)-Free Graphs. - Wen Xia; Jorik Jooken; Jan Goedgebeur; Shenwei Huang (COCOON (1), 2024)

Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. - Jan Goedgebeur; Jorik Jooken; Karolina Okrasa; Pawel Rzazewski; Oliver Schaudt (MFCS, 2024)

HIST-Critical Graphs and Malkevitch's Conjecture. - Jan Goedgebeur; Kenta Noguchi; Jarne Renders; Carol T. Zamfirescu (CoRR, 2024)

On the existence of factors intersecting sets of cycles in regular graphs. - Jan Goedgebeur; Davide Mattiolo; Giuseppe Mazzuoccolo; Jarne Renders; Luca Toffanetti; Isaak H. Wolf (CoRR, 2024)

Computational methods for finding bi-regular cages. - Jan Goedgebeur; Jorik Jooken; Tibo Van den Eede (CoRR, 2024)

Infinite families of planar graphs of a given injective chromatic number. - Matias Daneels; Jan Goedgebeur; Jarne Renders (CoRR, 2024)

Generation and new infinite families of K2-hypohamiltonian graphs. - Jan Goedgebeur; Jarne Renders; Carol T. Zamfirescu (Discret. Math., 2024)

On non-hamiltonian polyhedra without cubic vertices and their vertex-deleted subgraphs. - Jan Goedgebeur; Thomas Gringore; Carol T. Zamfirescu (Discuss. Math. Graph Theory, 2024)

A heuristic algorithm using tree decompositions for the maximum happy vertices problem. - Louis Carpentier; Jorik Jooken; Jan Goedgebeur (J. Heuristics, 2024)

K2-Hamiltonian graphs: II. - Jan Goedgebeur; Jarne Renders; Gábor Wiener; Carol T. Zamfirescu (J. Graph Theory, 2024)

Vertex-Critical (P5,W4)-Free Graphs. - Wen Xia; Jorik Jooken; Jan Goedgebeur; Iain Beaton; Ben Cameron; Shenwei Huang (COCOON (2), 2025)

Generation of Cycle Permutation Graphs and Permutation Snarks. - Jan Goedgebeur; Jarne Renders (SOFSEM (1), 2025)

The Maximum Number of Connected Sets in Regular Graphs. - Stijn Cambie; Jorik Jooken; Jan Goedgebeur (Electron. J. Comb., 2025)

Critical (P5,dart)-free graphs. - Wen Xia; Jorik Jooken; Jan Goedgebeur; Shenwei Huang (Discret. Appl. Math., 2025)

The Frank number and nowhere-zero flows on graphs. - Jan Goedgebeur; Edita Mácajová; Jarne Renders (Eur. J. Comb., 2025)

Some Results on Critical (P5,H)-free Graphs. - Wen Xia; Jorik Jooken; Jan Goedgebeur; Shenwei Huang (Theor. Comput. Sci., 2025)

Network fault costs based on minimum leaf spanning trees. - Jan Goedgebeur; Jarne Renders; Gábor Wiener; Carol T. Zamfirescu (CoRR, 2025)

The Gray graph is pseudo 2-factor isomorphic. - Marién Abreu; Jan Goedgebeur; Jorik Jooken; Federico Romaniello; Tibo Van den Eede (CoRR, 2025)