Associate Professor Marc Demange
Associate Professor
Details
-
College: School of Science
-
Department: School of Science
-
Campus: City Campus Australia
-
marc.demange@rmit.edu.au
About
Associate Professor Marc Demange joined RMIT University in July 2014.
Previous positions include Associate and then full Professor in Operational Research at ESSEC Business School, Paris and Singapore. He 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). Prior to that he was Assistant Professor in Computer Science at Paris 1 Panthéon Sorbonne University, Paris.
Previous positions include Associate and then full Professor in Operational Research at ESSEC Business School, Paris and Singapore. He 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). Prior to that he was Assistant Professor in Computer Science at Paris 1 Panthéon Sorbonne University, Paris.
Research fields
- 4901 Applied mathematics
- 4904 Pure mathematics
- 4613 Theory of computation
- 4601 Applied computing
- 4609 Information systems
Supervisor projects
- New Robust and Probabilistic Models for Shelter Location in Wild Fire Context
- 1 Sep 2017
- An intelligent healthcare system with peer-to-peer learning and data assessment
- 14 Oct 2016
- The Game of Cops and Robbers on graphs
- 21 Jul 2014
Teaching interests
Program leader
• BP083, Bachelor of Science (Mathematics)
Teaching
• MATH 1150, MATH 2045, Discrete Mathematics
• MATH 1074, Mathematics for Computing
• COSC 2627, Discrete Structures for Computing
• MATH2126, Elements of Professional Practice
Supervisor interests
Algorithmic graph theory, Computational complexity, Polynomial approximation of NP-hard problems, On-line algorithms, Discrete mathematics, Operational research
• BP083, Bachelor of Science (Mathematics)
Teaching
• MATH 1150, MATH 2045, Discrete Mathematics
• MATH 1074, Mathematics for Computing
• COSC 2627, Discrete Structures for Computing
• MATH2126, Elements of Professional Practice
Supervisor interests
Algorithmic graph theory, Computational complexity, Polynomial approximation of NP-hard problems, On-line algorithms, Discrete mathematics, Operational research
Research interests
• Combinatorial optimisation
• Algorithmic graph theory
• Efficient solution of hard problems with performance guarantees:
– Complexity and polynomial approximation
– Online algorithms
• Inverse combinatorial optimisation
• Operational research
• Algorithmic graph theory
• Efficient solution of hard problems with performance guarantees:
– Complexity and polynomial approximation
– Online algorithms
• Inverse combinatorial optimisation
• Operational research
