• Publications
  • Influence
Using tabu search techniques for graph coloring
TLDR
Tabu-Methoden werden benützt, um schrittweise den minimalen Wert einer Funktion zu erreichen. Expand
  • 465
  • 38
  • PDF
An introduction to timetabling
TLDR
Graph theoretical models for timetabling models, with an emphasis on graph theoretical models. Expand
  • 629
  • 31
  • PDF
Scheduling in Sports
The purpose of this paper is to present the problem of scheduling the games of a hockey or football league. It is shown how a graph theoretical model may be used and how some constraints related toExpand
  • 137
  • 16
Some experiments with simulated annealing for coloring graphs
Abstract Methods of thermodynamical simulation have been used for several famous combinatorial optimization problems. For graph coloring (i.e. partition of the node set into as few independent setsExpand
  • 212
  • 11
Geography, games and graphs
  • D. Werra
  • Geography, Mathematics
  • Discret. Appl. Math.
  • 1 December 1980
TLDR
Graph theoretical models are proposed for dealing with so called geographical constraints of a sports league. Expand
  • 92
  • 11
A sufficient condition for equitable edge-colourings of simple graphs
TLDR
We show that an equitable edge-colouring of a graph G is equitable if, for each vertex v of G, the number of edges of any one colour incident with v differs from any other colour incident by at most one. Expand
  • 53
  • 11
Some models of graphs for scheduling sports competitions
  • D. Werra
  • Mathematics, Computer Science
  • Discret. Appl. Math.
  • 1 September 1988
TLDR
Graph-theoretical models are given for constructing the season schedule of a sports league with a regular alternation of home-games and away-games. Expand
  • 100
  • 10
Graph Coloring Problems
  • 225
  • 9
Four classes of perfectly orderable graphs
TLDR
A graph is called “perfectly orderable” if its vertices can be ordered in such a way that, for each induced subgraph F, a certain "greedy" coloring heuristic delivers an optimal coloring of F. Expand
  • 132
  • 9
Balanced optimization problems
Suppose we are given a finite set E, a family F of 'feasible' subsets of E and a real weight c(e) associated with every [email protected] We consider the problem of finding [email protected] forExpand
  • 97
  • 9