• Publications
  • Influence
Using tabu search techniques for graph coloring
It is shown that tabu search techniques provide almost optimal colorings of graphs having up to 1000 nodes and their efficiency is shown to be significantly superior to the famous simulated annealing.
An introduction to timetabling
  • D. Werra
  • Computer Science
  • 1 February 1985
Graph Coloring Problems
Some models of graphs for scheduling sports competitions
  • D. Werra
  • Sociology
    Discret. Appl. Math.
  • 1 September 1988
Geography, games and graphs
  • D. Werra
  • Geography, Sociology
    Discret. Appl. Math.
  • 1 December 1980
Four classes of perfectly orderable graphs
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. No