After his PhD Marc Demange has held a position of Assistant Professor in Computer Science at Paris 1 Panthéon Sorbonne University. In 2001 he was appointed Associate Professor in Operational Research at ESSEC Business School (Paris - Singapore) and has held a position of full Professor from 2005 to 2014. Meanwhile he has also held several management positions at the same institution: Vice Dean of the Faculty, Associate Dean for Research and Director of ESSEC Romania Centre (in Bucharest). He joined RMIT University in July 2014.
- Combinatorial optimisation
- Algorithmic graph theory
- Efficient solution of hard problems with performance guarantees
- Complexity and polynomial approximation
- Online algorithms
- Inverse combinatorial optimisation
- Operational Research
Current PhD student
- David Ellison (with Dr Graham Clarke), RMIT University, Cop-Rob problems in graphs.
Former PhD students
- Yerim Chung, ``Inverse combinatorial problems and applications’’, Paris I Panthéon-Sorbonne University, France, 2010.
- Bernard Kouakou, ``Online algorithms and applications (in French), Paris I Panthéon-Sorbonne University, France, 2007.
Discrete Mathematics, Algorithms and their analysis, Combinatorial optimisation, Online algorithms, Efficient solutions for hard problems, Graph models for decision problems, Operational Research
- BP083, Bachelor of Science (Mathematics)
- Habitation Degree to supervise PhD (Computer Science), Paris Dauphine University, France, 2000
- PhD (Computer Science), Paris 1 Panthéon-Sorbonne University, France, 1994
- Master of Research, Paris I Panthéon-Sorbonne University, France, 1991
- Aggrégation Degree (Math), France, 1990
- MsC (Applied Math.), Paris XI University - Orsay, France, 1989
- Alumni of ENS Cachan, Mathematics, (1987 – 1991).
- Demange, M.,Ekim, T.,Ries, B. (2016). On the minimum and maximum selective graph coloring problems in some graph classes In: Discrete Applied Mathematics, 204, 77 - 89
- Demange, M.,Ekim, T.,Ries, B.,Tanasescu, C. (2015). On some applications of the selective graph coloring problem In: European Journal of Operational Research, 240, 307 - 314
- Culus, J.,Demange, M.,Marinescu-Ghemeci, R.,Tanasescu, C. (2015). About some robustness and complexity properties of G-graphs networks In: Discrete Applied Mathematics, 182, 34 - 45
- Chung, Y.,Culus, J.,Demange, M. (2015). Inverse chromatic number problems in interval and permutation graphs In: European Journal of Operational Research, 243, 763 - 773
- Demange, M.,Ekim, T.,Tanasescu, C. (2014). Hardness and approximation of minimum maximal matchings In: International Journal of Computer Mathematics, 91, 1635 - 1654
- Demange, M.,Ekim, T. (2014). Efficient recognition of equimatchable graphs In: Information Processing Letters, 114, 66 - 71
- Demange, M.,Monnot, J.,Pop, P.,Ries, B. (2014). On the complexity of the selective graph coloring problem in some special classes of graphs In: Theoretical Computer Science, 540-541, 89 - 102
- Demange, M.,Ekim, T. (2013). A note on the NP-hardness of two matching problems in induced subgrids In: Discrete Mathematics and Theoretical Computer Science, 15, 233 - 242
- Dabrowski, K.,Demange, M.,Lozin, V. (2013). New results on maximum induced matchings in bipartite graphs and beyond In: Theoretical Computer Science, 478, 33 - 40
- Demange, M.,De Werra, D. (2013). On some coloring problems in grids In: Theoretical Computer Science, 472, 9 - 27
1 Masters by Research Current Supervisions
- STEM in situ - Imagining entrepreneurial futures.. Funded by: Women in STEM Programme Grants 2016 from (2016 to 2018)