Dominique de Werra

EPFL SB-DO
CM 1 620 (Centre Midi)
Station 10
1015 Lausanne

Dominique de Werra was born in Switzerland in 1942. He graduated in physical engineering at EPFL in 1965, and in 1969, a doctorate in technical sciences. From 1969 to 1971 he was professor at Waterloo University (Canada) in the Management Sciences department. He has been a visiting professor in various European and American High Schools. In 1971 he became professor of Operations Research in Mathematics at EPFL. In 1990, he was appointed Vice President of EPFL and in addition, he became Director of training in autumn 1993. His research focuses on discrete mathematics (combinatorial optimization, graph theory, algorithms, etc.) and their applications to industrial and informatics technology. He has participated and directed several interdisciplinary projects in production, distribution, energy and scheduling. His work leads in particular to the time management problem and specifically to calendar management for important projects (sports, education, etc.). In 1987-1988, he chaired the EURO association which encompasses the Operational Research in Europe. He is Dr. h.c. of Paris University and Ecole Polytechnique in Poznan, and he was the winner of the European gold medal (EURO) of Operational Research in 1995. In March 2000 he was appointed Dean of International Affairs.

Infoscience

Bicolored matchings in some classes of graphs

M.-C. CostaD. de WerraC. PicouleauB. Ries

Graphs and Combinatorics. 2007. DOI : 10.1007/s00373-006-0686-8.

Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization

D. de WerraP. L. Hammer

Annals of Operations Research. 2007. DOI : 10.1007/s10479-006-0101-0.

Time slot scheduling of compatible jobs

M. DemangeD. de WerraJ. MonnotV. Paschos

Journal of Scheduling. 2007. DOI : 10.1007/s10951-006-0003-7.

On the approximation of Min Split-coloring and Min Cocoloring

M. DemangeT. EkimD. de Werra

Journal of Graph Algorithms and Applications. 2006.

Good and nice colorings of balanced hypergraphs

D. de Werra

Discrete Mathematics. 2006. DOI : 10.1016/j.disc.2005.12.044.

Using graphs for some discrete tomography problems

M. C. CostaD. de WerraC. Picouleau

Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.07.003.

Locally Restricted Colorings

I. BlöchligerD. de Werra

Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.05.012.

Construction of sports schedules with multiple venues

D. de WerraT. EkimC. Raess

Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.03.011.

Some simple optimization techniques for self-organized public key management in mobile ad hoc networks

T. Bornand-JaccardD. SchindlD. de Werra

Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.12.002.

Three is easy, two is hard: open shop sum-batch scheduling problem refined

I. V. GribovskaiaC. L. LeeV. StrusevichD. de Werra

Operations Research Letters. 2006. DOI : 10.1016/j.orl.2005.07.006.

(p,k)-coloring problems in line graphs

M. DemangeT. EkimD. de Werra

Theoretical Computer Science. 2005. DOI : 10.1016/j.tcs.2005.09.037.

Partitioning cographs into cliques and stable sets

M. DemangeT. EkimD. de Werra

Discrete Optimization. 2005. DOI : 10.1016/j.disopt.2005.03.003.

Path colorings in bipartite multigraphs

D. de Werra

European Journal of Operational Research. 2005. DOI : 10.1016/j.ejor.2003.05.007.

Variations on the Roy-Gallai Theorem

D. de WerraP. Hansen

4OR. 2005.

On split-coloring problems

T. EkimD. de Werra

Journal of Combinatorial Optimization. 2005. DOI : 10.1007/s10878-005-4103-7.

A solvable case of image reconstruction in discrete tomography

M. C. CostaD. de WerraC. PicouleauD. Schindl

Discrete Applied Mathematics. 2005. DOI : 10.1016/j.dam.2005.03.006.

A hypocoloring model for batch scheduling

D. de WerraM. DemangeJ. MonnotV. T. Paschos

Discrete Applied Mathematics. 2005. DOI : 10.1016/j.dam.2004.06.016.

On Some Properties of Suboptimal Colorings of Graphs

I. BlöchligerD. de Werra

Networks. 2004. DOI : 10.1002/net.10107.

Colorations de graphes: fondements et applications

D. de WerraD. Kobler

RAIRO Operations Research. 2003. DOI : 10.1051/ro:2003013.

Struction revisited

G. AlexeP. L. HammerV. LozinD. de Werra

Discrete Applied Mathematics. 2003. DOI : 10.1016/S0166-218X(03)00388-3.

Using stable sets to bound the chromatic number

D. de WerraP. Hansen

Information Processing Letters. 2003. DOI : 10.1016/S0020-0190(03)00266-7.

Variations on the theorem of Birkhoff-von Neumann and extensions

D. de Werra

Graphs and Combinatorics. 2003. DOI : 10.1007/s00373-002-0496-6.

Partitioning the edge set of a bipartite graph into chain packings: complexity of some variations

D. de Werra

Linear Algebra and its Applications. 2003. DOI : 10.1016/S0024-3795(02)00691-2.

Bicolored matchings in some classes of graphs

M.-C. CostaD. de WerraC. PicouleauB. Ries

Graphs and Combinatorics. 2007. DOI : 10.1007/s00373-006-0686-8.

Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization

D. de WerraP. L. Hammer

Annals of Operations Research. 2007. DOI : 10.1007/s10479-006-0101-0.

Time slot scheduling of compatible jobs

M. DemangeD. de WerraJ. MonnotV. Paschos

Journal of Scheduling. 2007. DOI : 10.1007/s10951-006-0003-7.

On the approximation of Min Split-coloring and Min Cocoloring

M. DemangeT. EkimD. de Werra

Journal of Graph Algorithms and Applications. 2006.

Good and nice colorings of balanced hypergraphs

D. de Werra

Discrete Mathematics. 2006. DOI : 10.1016/j.disc.2005.12.044.

Using graphs for some discrete tomography problems

M. C. CostaD. de WerraC. Picouleau

Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.07.003.

Locally Restricted Colorings

I. BlöchligerD. de Werra

Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.05.012.

Construction of sports schedules with multiple venues

D. de WerraT. EkimC. Raess

Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.03.011.

Some simple optimization techniques for self-organized public key management in mobile ad hoc networks

T. Bornand-JaccardD. SchindlD. de Werra

Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.12.002.

Three is easy, two is hard: open shop sum-batch scheduling problem refined

I. V. GribovskaiaC. L. LeeV. StrusevichD. de Werra

Operations Research Letters. 2006. DOI : 10.1016/j.orl.2005.07.006.

(p,k)-coloring problems in line graphs

M. DemangeT. EkimD. de Werra

Theoretical Computer Science. 2005. DOI : 10.1016/j.tcs.2005.09.037.

Partitioning cographs into cliques and stable sets

M. DemangeT. EkimD. de Werra

Discrete Optimization. 2005. DOI : 10.1016/j.disopt.2005.03.003.

Path colorings in bipartite multigraphs

D. de Werra

European Journal of Operational Research. 2005. DOI : 10.1016/j.ejor.2003.05.007.

Variations on the Roy-Gallai Theorem

D. de WerraP. Hansen

4OR. 2005.

On split-coloring problems

T. EkimD. de Werra

Journal of Combinatorial Optimization. 2005. DOI : 10.1007/s10878-005-4103-7.

A solvable case of image reconstruction in discrete tomography

M. C. CostaD. de WerraC. PicouleauD. Schindl

Discrete Applied Mathematics. 2005. DOI : 10.1016/j.dam.2005.03.006.

A hypocoloring model for batch scheduling

D. de WerraM. DemangeJ. MonnotV. T. Paschos

Discrete Applied Mathematics. 2005. DOI : 10.1016/j.dam.2004.06.016.

On Some Properties of Suboptimal Colorings of Graphs

I. BlöchligerD. de Werra

Networks. 2004. DOI : 10.1002/net.10107.

Colorations de graphes: fondements et applications

D. de WerraD. Kobler

RAIRO Operations Research. 2003. DOI : 10.1051/ro:2003013.

Struction revisited

G. AlexeP. L. HammerV. LozinD. de Werra

Discrete Applied Mathematics. 2003. DOI : 10.1016/S0166-218X(03)00388-3.

Using stable sets to bound the chromatic number

D. de WerraP. Hansen

Information Processing Letters. 2003. DOI : 10.1016/S0020-0190(03)00266-7.

Variations on the theorem of Birkhoff-von Neumann and extensions

D. de Werra

Graphs and Combinatorics. 2003. DOI : 10.1007/s00373-002-0496-6.

Partitioning the edge set of a bipartite graph into chain packings: complexity of some variations

D. de Werra

Linear Algebra and its Applications. 2003. DOI : 10.1016/S0024-3795(02)00691-2.

Teaching & PhD

Past EPFL PhD Students

Andreas Rogger, David Schindl, Ivo Blöchliger, Tinaz Ekim, Bernard Ries, Benjamin Leroy-Beaulieu

Past EPFL PhD Students as codirector

Nicolas Zufferey