PeopleGunnar Brinkmann Kris Coolsaet Herman De Beukelaer Veerle Fack Jan Goedgebeur Nicolas Van Cleemput Former membersMirka Cimráková Jan Degraer Hadrien Mélot Adriaan Peeters Heide Sticker Dries Van Dyck Stéphanie Vanhove Michaël Vyverman Joost Winne
CaGeHome page
House of GraphsHome page
GrInvInHome page
Links
Spherical quadrangles ...
Fast vector arithmetic over GF(3)
Equi  equilateral embedding of polyhedra
Critical Ptfree graphs
Cubic graphs and snarks
Fullerenes
MTF and Ramsey graphs
Hypohamiltonian graphs
Azulenoids
Nanocones
Pregraphs
DelaneyDress graphs
3class association schemes
Yutsis project

Our research group belongs to the
Department of
Applied Mathematics & Computer science
of Ghent University.
Research topics

We study search and generation algorithms on combinatorial
objects like graphs, incidence geometries en subsets of these
objects with interesting combinatorial properties.
Quite often these algorithms require a recursive traversal of a
treelike search space using various pruning heuristics. Specific
pruning methods exploit the inherent symmetries of the objects
(automorphisms, equivalences, unique labelings) or are based on
mathematical properties that are specific to the problem at hand.
On the one hand we try to design, improve and study these
combinatorial algorithms, but on the other hand we also apply these
algorithms to real mathematical problems, hoping to generate new
mathematical results in combinatorial theory and combinatorial
geometry in particular.

We are also interested in other algorithmic aspects of graph
theory. We have done research on optimal algoritms for
dataexchange on networks of parallel processors, efficient reduction of cubical Yutsisgraphs and distance related
properties of rotation graphs for binary coupling trees.
This research domain has applications in representation theory, more
specifically in finding optimal expressions for 3njcoefficients, and
also in mathematical biology, in the computation of similarity
measures for dendrograms.
