Dominique de Werra
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
Time slot scheduling of compatible jobs
Journal of Scheduling. 2007. DOI : 10.1007/s10951-006-0003-7.Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization
Annals of Operations Research. 2007. DOI : 10.1007/s10479-006-0101-0.Bicolored matchings in some classes of graphs
Graphs and Combinatorics. 2007. DOI : 10.1007/s00373-006-0686-8.Locally Restricted Colorings
Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.05.012.Three is easy, two is hard: open shop sum-batch scheduling problem refined
Operations Research Letters. 2006. DOI : 10.1016/j.orl.2005.07.006.Using graphs for some discrete tomography problems
Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.07.003.Some simple optimization techniques for self-organized public key management in mobile ad hoc networks
Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.12.002.On the approximation of Min Split-coloring and Min Cocoloring
Journal of Graph Algorithms and Applications. 2006.Construction of sports schedules with multiple venues
Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.03.011.Good and nice colorings of balanced hypergraphs
Discrete Mathematics. 2006. DOI : 10.1016/j.disc.2005.12.044.Variations on the Roy-Gallai Theorem
4OR. 2005.On split-coloring problems
Journal of Combinatorial Optimization. 2005. DOI : 10.1007/s10878-005-4103-7.Path colorings in bipartite multigraphs
European Journal of Operational Research. 2005. DOI : 10.1016/j.ejor.2003.05.007.A hypocoloring model for batch scheduling
Discrete Applied Mathematics. 2005. DOI : 10.1016/j.dam.2004.06.016.(p,k)-coloring problems in line graphs
Theoretical Computer Science. 2005. DOI : 10.1016/j.tcs.2005.09.037.Partitioning cographs into cliques and stable sets
Discrete Optimization. 2005. DOI : 10.1016/j.disopt.2005.03.003.A solvable case of image reconstruction in discrete tomography
Discrete Applied Mathematics. 2005. DOI : 10.1016/j.dam.2005.03.006.On Some Properties of Suboptimal Colorings of Graphs
Networks. 2004. DOI : 10.1002/net.10107.Variations on the theorem of Birkhoff-von Neumann and extensions
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
Linear Algebra and its Applications. 2003. DOI : 10.1016/S0024-3795(02)00691-2.Using stable sets to bound the chromatic number
Information Processing Letters. 2003. DOI : 10.1016/S0020-0190(03)00266-7.Colorations de graphes: fondements et applications
RAIRO Operations Research. 2003. DOI : 10.1051/ro:2003013.Struction revisited
Discrete Applied Mathematics. 2003. DOI : 10.1016/S0166-218X(03)00388-3.Time slot scheduling of compatible jobs
Journal of Scheduling. 2007. DOI : 10.1007/s10951-006-0003-7.Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization
Annals of Operations Research. 2007. DOI : 10.1007/s10479-006-0101-0.Bicolored matchings in some classes of graphs
Graphs and Combinatorics. 2007. DOI : 10.1007/s00373-006-0686-8.Locally Restricted Colorings
Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.05.012.Three is easy, two is hard: open shop sum-batch scheduling problem refined
Operations Research Letters. 2006. DOI : 10.1016/j.orl.2005.07.006.Using graphs for some discrete tomography problems
Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.07.003.Some simple optimization techniques for self-organized public key management in mobile ad hoc networks
Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.12.002.On the approximation of Min Split-coloring and Min Cocoloring
Journal of Graph Algorithms and Applications. 2006.Construction of sports schedules with multiple venues
Discrete Applied Mathematics. 2006. DOI : 10.1016/j.dam.2005.03.011.Good and nice colorings of balanced hypergraphs
Discrete Mathematics. 2006. DOI : 10.1016/j.disc.2005.12.044.Variations on the Roy-Gallai Theorem
4OR. 2005.On split-coloring problems
Journal of Combinatorial Optimization. 2005. DOI : 10.1007/s10878-005-4103-7.Path colorings in bipartite multigraphs
European Journal of Operational Research. 2005. DOI : 10.1016/j.ejor.2003.05.007.A hypocoloring model for batch scheduling
Discrete Applied Mathematics. 2005. DOI : 10.1016/j.dam.2004.06.016.(p,k)-coloring problems in line graphs
Theoretical Computer Science. 2005. DOI : 10.1016/j.tcs.2005.09.037.Partitioning cographs into cliques and stable sets
Discrete Optimization. 2005. DOI : 10.1016/j.disopt.2005.03.003.A solvable case of image reconstruction in discrete tomography
Discrete Applied Mathematics. 2005. DOI : 10.1016/j.dam.2005.03.006.On Some Properties of Suboptimal Colorings of Graphs
Networks. 2004. DOI : 10.1002/net.10107.Variations on the theorem of Birkhoff-von Neumann and extensions
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
Linear Algebra and its Applications. 2003. DOI : 10.1016/S0024-3795(02)00691-2.Using stable sets to bound the chromatic number
Information Processing Letters. 2003. DOI : 10.1016/S0020-0190(03)00266-7.Colorations de graphes: fondements et applications
RAIRO Operations Research. 2003. DOI : 10.1051/ro:2003013.Struction revisited
Discrete Applied Mathematics. 2003. DOI : 10.1016/S0166-218X(03)00388-3.Teaching & PhD
Past EPFL PhD Students
Andreas Rogger, David Schindl, Ivo Blöchliger, Tinaz Ekim, Bernard Ries, Benjamin Leroy-Beaulieu