Papers
1
Total Citations
29
H-Index
1
About
Marc Demange is a prominent researcher in combinatorial optimization and graph theory, with a particular focus on the algorithmic applications of graph coloring to real-world problems. His most-cited work, "A tutorial on the use of graph coloring for some problems in robotics" (2007, 29 citations), exemplifies his ability to bridge theoretical computer science and practical engineering challenges. In this influential tutorial, Demange demonstrates how graph coloring techniques can be leveraged to solve complex scheduling, resource allocation, and conflict resolution problems in robotics—a contribution that has guided both roboticists and algorithm designers. Beyond this, his broader research spans graph coloring variants, approximation algorithms, and graph decompositions, often targeting problems in telecommunications, scheduling, and network design. With a career dedicated to making advanced graph theory accessible and applicable, Demange has left a lasting impact on how discrete mathematics informs intelligent systems. His work continues to inspire students and researchers seeking to understand the power of combinatorial methods in tackling real-world optimization tasks.
Research Focus
Key Achievements
Top Papers
- 1A tutorial on the use of graph coloring for some problems in robotics29 citations · 2007