D. de Werra
Papers
2
Total Citations
51
H-Index
2
About
D. de Werra is a leading figure in combinatorial optimization and graph theory, with a particular focus on the application of graph coloring to scheduling and robotics. His work bridges theoretical elegance and practical problem-solving, most notably through his development of multiconstrained chromatic scheduling models that address complex resource allocation issues. In his highly cited tutorial on graph coloring for robotics (2007, 29 citations), de Werra demonstrates how classical graph-theoretic techniques can be adapted to optimize robot task assignment and collision-free motion planning. His 1999 paper on multiconstrained chromatic scheduling (22 citations) further solidifies his reputation, introducing innovative constraints that extend traditional coloring problems to real-world timetabling and production systems. Beyond these key contributions, de Werra has authored numerous influential works on edge coloring, bipartite graphs, and sports scheduling, earning him recognition as a pioneer in applied graph theory. His research continues to inspire students and practitioners seeking to harness discrete mathematics for solving tangible engineering and operational challenges.
Research Focus
Key Achievements
Top Papers
- 1A tutorial on the use of graph coloring for some problems in robotics29 citations · 2007
- 2On a multiconstrained model for chromatic scheduling22 citations · 1999