D. Werra

Publications
Influence

Using tabu search techniques for graph coloring

A. Hertz, D. Werra
Mathematics, Computer Science
Computing
31 December 1987

Tabu-Methoden werden benützt, um schrittweise den minimalen Wert einer Funktion zu erreichen. Expand

An introduction to timetabling

D. Werra
Computer Science
1 February 1985

Graph theoretical models for timetabling models, with an emphasis on graph theoretical models. Expand

Scheduling in Sports

D. Werra
Mathematics
1981

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 to… Expand

Some experiments with simulated annealing for coloring graphs

M. Chams, A. Hertz, D. Werra
Mathematics
1 November 1987

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 sets… Expand

Geography, games and graphs

D. Werra
Geography, Mathematics
Discret. Appl. Math.
1 December 1980

Graph theoretical models are proposed for dealing with so called geographical constraints of a sports league. Expand

A sufficient condition for equitable edge-colourings of simple graphs

A. Hilton, D. Werra
Mathematics, Computer Science
Discret. Math.
15 April 1994

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

Some models of graphs for scheduling sports competitions

D. Werra
Mathematics, Computer Science
Discret. Appl. Math.
1 September 1988

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

Graph Coloring Problems

D. Werra, D. Kobler
Computer Science
13 February 2013

Four classes of perfectly orderable graphs

V. Chvátal, C. Hoàng, N. Mahadev, D. Werra
Mathematics, Computer Science
J. Graph Theory
1 December 1987

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

Balanced optimization problems

S. Martello, W. Pulleyblank, P. Toth, D. Werra
Mathematics
1 December 1984

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] for… Expand

Recommended Authors