Jan Goedgebeur


Contact

me Jan Goedgebeur
Ghent University
Department of Applied Mathematics, Computer Science and Statistics
Krijgslaan 281 - S9
B-9000 Ghent
Belgium

Phone: +32 9 264 47 70
Fax: +32 9 264 49 95
E-mail: Jan.Goedgebeur[at]UGent.be

Postdoctoral Researcher of the Research Foundation Flanders (FWO)
Curriculum Vitae


Research interests

Publications

Preprints

  1. M. Chudnovsky, J. Goedgebeur, O. Schaudt and M. Zhong, Obstructions for list 3-coloring graphs with one forbidden induced subgraph, 31 pages. Preprint: (pdf).
  2. J. Goedgebeur and C.T. Zamfirescu, On Hypohamiltonian Snarks and a Theorem of Fiorini, 21 pages. Preprint: (arXiv).
  3. J. Goedgebeur and C.T. Zamfirescu, New results on hypohamiltonian and almost hypohamiltonian graphs, 18 pages. Preprint: (arXiv).
  4. J. Goedgebeur and O. Schaudt, Exhaustive generation of k-critical H-free graphs, 17 pages. Preprint: (arXiv).
  5. J. Goedgebeur and C.T. Zamfirescu, Improved bounds for hypohamiltonian graphs, 21 pages. Preprint: (arXiv).
  6. G. Brinkmann and J. Goedgebeur, Generation of cubic graphs and snarks with large girth, 27 pages. Preprint: (arXiv).
  7. M. Chudnovsky, J. Goedgebeur, O. Schaudt and M. Zhong, Obstructions for three-coloring graphs without induced paths on six vertices, 27 pages. Preprint: (arXiv).

Journal articles

  1. J. Goedgebeur and B.D. McKay, Fullerenes with distant pentagons,
    MATCH Commun. Math. Comput. Chem., 74(3):659-672, 2015 (arXiv | pdf).
  2. J. Goedgebeur and B.D. McKay, Recursive generation of IPR fullerenes,
    Journal of Mathematical Chemistry, 53(8):1702-1724, 2015 (arXiv | DOI).
  3. J. Goedgebeur, A counterexample to the pseudo 2-factor isomorphic graph conjecture,
    Discrete Applied Mathematics, 193:57-60, 2015 (arXiv | DOI).
  4. J. Goedgebeur and S.P. Radziszowski, The Ramsey Number R(3,K10-e) and Computational Bounds for R(3,G),
    Electronic Journal of Combinatorics, 20(4), 25 pages, 2013 (arXiv | pdf).
  5. G. Brinkmann, J. Goedgebeur and N. Van Cleemput, The History of the Generation of Cubic Graphs,
    International Journal of Chemical Modeling, 5(2-3):67-89, 2013 (pdf).
  6. G. Brinkmann, J. Goedgebeur, J. Hägglund and K. Markström, Generation and properties of Snarks,
    Journal of Combinatorial Theory, Series B, 103(4):468-488, 2013 (arXiv | DOI).
  7. J. Goedgebeur and S.P. Radziszowski, New computational upper bounds for Ramsey numbers R(3,k),
    Electronic Journal of Combinatorics, 20(1), 28 pages, 2013 (arXiv | pdf).
  8. G. Brinkmann, K. Coolsaet, J. Goedgebeur and H. Mélot, House of Graphs: a database of interesting graphs,
    Discrete Applied Mathematics, 161(1-2):311-314, 2013 (arXiv | DOI).
  9. S. Demeyer, J. Goedgebeur, P. Audenaert, M. Pickavet and P. Demeester, Speeding up Martins' algorithm for multiple objective shortest path problems,
    4OR: A Quarterly Journal of Operations Research, 11(4): 323-348, 2013. (DOI).
  10. G. Brinkmann, J. Goedgebeur and J.C. Schlage-Puchta, Ramsey numbers R(K3,G) for graphs of order 10,
    Electronic Journal of Combinatorics, 19(4), 23 pages, 2012 (arXiv | pdf).
  11. G. Brinkmann, J. Goedgebeur and B.D. McKay, The Generation of Fullerenes,
    Journal of Chemical Information and Modeling, 52(11):2910-2918, 2012 (arXiv | DOI).
  12. G. Brinkmann, J. Goedgebeur and B.D. McKay, The smallest fullerene without a spiral,
    Chemical Physics Letters, 522:54-55, 2012 (DOI | pdf).
  13. G. Brinkmann, J. Goedgebeur and B.D. McKay, Generation of Cubic graphs,
    Discrete Mathematics and Theoretical Computer Science, 13(2):69-80, 2011 (pdf).

Conference papers

  1. J. Goedgebeur and O. Schaudt, Exhaustive generation of k-critical H-free graphs,
    Proc. 42nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG2016), Istanbul, Turkey, LNCS 9941, pages 109-120, 2016 (DOI).
  2. M. Chudnovsky, J. Goedgebeur, O. Schaudt and M. Zhong, Obstructions for three-coloring graphs with one forbidden induced subgraph,
    In Proc. Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA16), Arlington, Virginia, USA, pages 1774-1783, 2016 (DOI).
  3. S. Demeyer, J. Goedgebeur, P. Audenaert, M. Pickavet and P. Demeester, The predecessor and the accounting algorithm speed up shortest path calculations in traffic routing applications,
    In Proc. 13th International IEEE Conference on Intelligent Transportation Systems (ITSC2010), Madeira Island, Portugal, pages 980-985, 2010 (DOI).

Ph.D. thesis

On 24 May 2013 I defended my Ph.D. thesis titled "Generation Algorithms for Mathematical and Chemical Problems". My thesis can be downloaded here and the slides of my public defence here.

Attended conferences

Software

Other

Links