Jan Goedgebeur

Jan Goedgebeur

Universiteit Gent

H-index: 15

Europe-Belgium

About Jan Goedgebeur

Jan Goedgebeur, With an exceptional h-index of 15 and a recent h-index of 13 (since 2020), a distinguished researcher at Universiteit Gent, specializes in the field of Graph Theory, Algorithms, Combinatorial Optimisation.

His recent articles reflect a diverse array of research interests and contributions to the field:

Non-double covered cubic graphs

Exhaustive generation of edge-girth-regular graphs

Generation and new infinite families of K2-hypohamiltonian graphs

HIST-Critical Graphs and Malkevitch's Conjecture

Minimal obstructions to -coloring in hereditary graph classes

Few hamiltonian cycles in graphs with one or two vertex degrees

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

K2‐Hamiltonian graphs: II

Jan Goedgebeur Information

University

Position

___

Citations(all)

1010

Citations(since 2020)

622

Cited By

679

hIndex(all)

15

hIndex(since 2020)

13

i10Index(all)

23

i10Index(since 2020)

18

Email

University Profile Page

Universiteit Gent

Google Scholar

View Google Scholar Profile

Jan Goedgebeur Skills & Research Interests

Graph Theory

Algorithms

Combinatorial Optimisation

Top articles of Jan Goedgebeur

Title

Journal

Author(s)

Publication Date

Non-double covered cubic graphs

arXiv preprint arXiv:2402.08538

Jan Goedgebeur

Davide Mattiolo

Giuseppe Mazzuoccolo

Jarne Renders

Isaak H Wolf

2024/2/13

Exhaustive generation of edge-girth-regular graphs

arXiv preprint arXiv:2401.08271

Jan Goedgebeur

Jorik Jooken

2024/1/16

Generation and new infinite families of K2-hypohamiltonian graphs

Discrete Mathematics

Jan Goedgebeur

Jarne Renders

Carol T Zamfirescu

2024/7/1

HIST-Critical Graphs and Malkevitch's Conjecture

arXiv preprint arXiv:2401.04554

Jan Goedgebeur

Kenta Noguchi

Jarne Renders

Carol T Zamfirescu

2024/1/9

Minimal obstructions to -coloring in hereditary graph classes

arXiv preprint arXiv:2404.11704

Jan Goedgebeur

Jorik Jooken

Karolina Okrasa

Paweł Rzążewski

Oliver Schaudt

2024/4/17

Few hamiltonian cycles in graphs with one or two vertex degrees

Mathematics of Computation

Jan Goedgebeur

Jorik Jooken

On-Hei Solomon Lo

Ben Seamone

Carol Zamfirescu

2024

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

Journal of Heuristics

Louis Carpentier

Jorik Jooken

Jan Goedgebeur

2024/4

K2‐Hamiltonian graphs: II

Journal of Graph Theory

Jan Goedgebeur

Jarne Renders

Gábor Wiener

Carol T Zamfirescu

2024/4

The maximum number of connected sets in regular graphs

arXiv preprint arXiv:2311.00075

Stijn Cambie

Jan Goedgebeur

Jorik Jooken

2023/10/31

Exact enumeration of fullerenes

arXiv preprint arXiv:2304.01655

Philip Engel

Jan Goedgebeur

Peter Smillie

2023/4/4

Efficient Online Scheduling and Routing for Automated Guided Vehicles: Comparing a Novel Loop-Based Algorithm Against Existing Methods

arXiv preprint arXiv:2310.02195

Louis Stubbe

Jens Goemaere

Jan Goedgebeur

2023/10/3

House of Graphs 2.0: a database of interesting graphs and more

Discrete Applied Mathematics

Kris Coolsaet

Sven D’hondt

Jan Goedgebeur

2023/1/30

ON NON-HAMILTONIAN POLYHEDRA WITHOUT CUBIC VERTICES AND THEIR VERTEX-DELETED SUBGRAPHS

DISCUSSIONES MATHEMATICAE GRAPH THEORY

Jan Goedgebeur

Thomas Gringore

Carol T Zamfirescu

2023/9/10

Colouring graphs with no induced six-vertex path or diamond

Theoretical Computer Science

Jan Goedgebeur

Shenwei Huang

Yiao Ju

Owen Merkel

2023/1/4

Some results on k-critical P5-free graphs

Discrete Applied Mathematics

Qingqiong Cai

Jan Goedgebeur

Shenwei Huang

2023/7/31

On the Frank Number and Nowhere-Zero Flows on Graphs

Jan Goedgebeur

Edita Máčajová

Jarne Renders

2023/6/28

Critical -Free Graphs

Wen Xia

Jorik Jooken

Jan Goedgebeur

Shenwei Huang

2023/12/9

Monte Carlo Tree Search and Instance Space Analysis for the 0-1 Knapsack Problem

Jorik Jooken

Patrick De Causmaecker

Pieter Leyman

Jan Goedgebeur

Tony Wauters

2023/6/12

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

arXiv preprint arXiv:2208.14921

Louis Carpentier

Jorik Jooken

Jan Goedgebeur

2022/8/31

The minimality of the Georges–Kelmans graph

Mathematics of Computation

Gunnar Brinkmann

Jan Goedgebeur

Brendan McKay

2022/5

See List of Professors in Jan Goedgebeur University(Universiteit Gent)

Co-Authors

H-index: 60
Brendan McKay

Brendan McKay

Australian National University

H-index: 36
Maria Chudnovsky

Maria Chudnovsky

Princeton University

H-index: 25
Nele Vandersickel

Nele Vandersickel

Universiteit Gent

H-index: 24
Stanisław Radziszowski

Stanisław Radziszowski

Rochester Institute of Technology

H-index: 23
Klas Markström

Klas Markström

Umeå universitet

H-index: 22
Irene Sciriha

Irene Sciriha

University of Malta

academic-engine