français | english		EPFL > people@EPFL > Dominique de Werra login

Professor Emeritus SB SB-DEC PH-SB

Dominique de Werra office(s): MAA1417 phone(s): [+41 21 69] 32562 BIOGRAPHY 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. MAIN PUBLICATIONS D. de Werra and P. L. Hammer. Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization. Annals of Operations Research, 149(1):67-73, 2007. [ DOI | Details ] M. Demange, D. de Werra, J. Monnot, and V. Paschos. Time slot scheduling of compatible jobs. Journal of Scheduling, 10(2):11-127, 2007. [ DOI | Details ] C. Bentz, M.-C. Costa, C. Picouleau, D. de Werra, and B. Ries. Degree-constrained edge partitioning in graphs arising from discrete tomography. 2007. [ DOI | Details ] M.-C. Costa, D. de Werra, C. Picouleau, and B. Ries. Bicolored matchings in some classes of graphs. Graphs and Combinatorics, 23(1):47-60, 2007. [ DOI | Details ] D. de Werra. Good and nice colorings of balanced hypergraphs. Discrete Mathematics, 306:2630-2636, 2006. [ DOI | Details ] M. Demange, T. Ekim, and D. de Werra. On the approximation of Min Split-coloring and Min Cocoloring. Journal of Graph Algorithms and Applications, 10(2):297-315, 2006. [ DOI | Details ] D. de Werra, T. Ekim, and C. Raess. Construction of sports schedules with multiple venues. Discrete Applied Mathematics, 154:47-58, 2006. [ DOI | Details ] M. C. Costa, D. de Werra, and C. Picouleau. Using graphs for some discrete tomography problems. Discrete Applied Mathematics, 154(1):35-46, 2006. [ DOI | Details ] T. Bornand-Jaccard, D. Schindl, and D. de Werra. Some simple optimization techniques for self-organized public key management in mobile ad hoc networks. Discrete Applied Mathematics, 154:1223-1235, 2006. [ DOI | Details ] I. V. Gribovskaia, C. L. Lee, V. Strusevich, and D. de Werra. Three is easy, two is hard: open shop sum-batch scheduling problem refined. Operations Research Letters, 34:459-464, 2006. [ DOI | Details ] I. Blöchliger and D. de Werra. Locally Restricted Colorings. Discrete Applied Mathematics, 154:158-165, 2006. [ DOI | Details ] D. de Werra, M. Demange, J. Monnot, and V. T. Paschos. A hypocoloring model for batch scheduling. Discrete Applied Mathematics, 146:3-26, 2005. [ DOI | Details ] D. de Werra. Path colorings in bipartite multigraphs. European Journal of Oper. Research, 164:575-584, 2005. [ DOI | Details ] M. C. Costa, D. de Werra, C. Picouleau, and D. Schindl. A solvable case of image reconstruction in discrete tomography. Discrete Applied Mathematics, 148(3):240-245, 2005. [ DOI | Details ] D. de Werra and P. Hansen. Variations on the Roy-Gallai Theorem. 4OR, 3:245-251, 2005. [ DOI | Details ] T. Ekim and D. de Werra. On split-coloring problems. Journal of Combinatorial Optimization, 10(3):211-225, 2005. [ DOI | Details ] M. Demange, T. Ekim, and D. de Werra. (p,k)-coloring problems in line graphs. Theoretical Computer Science, 349(3):462-474, 2005. [ DOI | Details ] M. Demange, T. Ekim, and D. de Werra. Partitioning cographs into cliques and stable sets. Discrete Optimization, 2(2):145-153, 2005. [ DOI | Details ] I. Blöchliger and D. de Werra. On Some Properties of Suboptimal Colorings of Graphs. Networks, 43(2):103-108, 2004. [ DOI | Details | Full Text ] D. de Werra and P. Hansen. Using stable sets to bound the chromatic number. Information Processing Letters, 87:127-131, 2003. [ DOI | Details ] D. de Werra. Variations on the theorem of Birkhoff-von Neumann and extensions. Graphs and Combinatorics, 19:263-278, 2003. [ DOI | Details ] D. de Werra. Partitioning the edge set of a bipartite graph into chain packings: complexity of some variations. Linear Algebra and its Applications, 268:315-327, 2003. [ DOI | Details ] G. Alexe, P. L. Hammer, V. Lozin, and D. de Werra. Struction revisited. Discrete Applied Mathematics, 132(1-3):27-46, 2003. [ DOI | Details ] D. de Werra and D. Kobler. Colorations de graphes: fondements et applications. RAIRO Operations Research, 37:29-66, 2003. [ DOI | Details ]

Links CV Publications Conferences Theses Jury