Marc Demange
Marc Demange
Associate Professor, Mathematical Science, RMIT, Melbourne, Australia
Verified email at rmit.edu.au - Homepage
Title
Cited by
Cited by
Year
On an approximation measure founded on the links between optimization and polynomial approximation theory
M Demange, VT Paschos
Theoretical Computer Science 158 (1-2), 117-141, 1996
1081996
Differential approximation algorithms for some combinatorial optimization problems
M Demange, P Grisoni, VT Paschos
Theoretical Computer Science 209 (1-2), 107-122, 1998
791998
Algorithms for the on-line quota traveling salesman problem
G Ausiello, M Demange, L Laura, V Paschos
International Computing and Combinatorics Conference, 290-299, 2004
642004
Weighted node coloring: when stable sets are expensive
M Demange, D de Werra, J Monnot, VT Paschos
International Workshop on Graph-Theoretic Concepts in Computer Science, 114-125, 2002
602002
Time slot scheduling of compatible jobs
M Demange, D De Werra, J Monnot, VT Paschos
Journal of Scheduling 10 (2), 111-127, 2007
472007
Partitioning cographs into cliques and stable sets
M Demange, TN Ekim, D De Werra
Discrete Optimization 2 (2), 145-153, 2005
392005
New results on maximum induced matchings in bipartite graphs and beyond
KK Dabrowski, M Demange, VV Lozin
Theoretical Computer Science 478, 33-40, 2013
362013
Performance characterization and first clinical evaluation of a intra-operative compact gamma imager
L Menard, Y Charon, M Solal, M Ricard, P Laniece, R Mastrippolito, ...
IEEE Transactions on Nuclear Science 46 (6), 2068-2074, 1999
36*1999
On some applications of the selective graph coloring problem
M Demange, T Ekim, B Ries, C Tanasescu
European Journal of Operational Research 240 (2), 307 - 314, 2015
332015
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
D de Werra, M Demange, B Escoffier, J Monnot, VT Paschos
Discrete Applied Mathematics 157 (4), 819-832, 2009
332009
Bridging gap between standard and differential polynomial approximation: the case of bin-packing
M Demange, J Monnot, VT Paschos
Applied Mathematics Letters 12 (7), 127-133, 1999
331999
Hardness and approximation of minimum maximal matchings
M Demange, T Ekim, C Tanasescu
International Journal of Computer Mathematics 91 (8), 1635 - 1654, 2014
32*2014
Completeness in differential approximation classes
G Ausiello, C Bazgan, M Demange, VT Paschos
International Journal of Foundations of Computer Science 16 (06), 1267-1295, 2005
322005
On-line vertex-covering
M Demange, VT Paschos
Theoretical Computer Science 332 (1-3), 83-108, 2005
31*2005
A tutorial on the use of graph coloring for some problems in robotics
M Demange, T Ekim, D de Werra
European Journal of Operational Research 192 (1), 41-55, 2009
302009
Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation
D De Werra, M Demange, B Escoffier, J Monnot, VT Paschos
International Symposium on Algorithms and Computation, 896-907, 2004
302004
On the online track assignment problem
M Demange, G Di Stefano, B Leroy-Beaulieu
Discrete Applied Mathematics 160 (7-8), 1072-1093, 2012
28*2012
Approximation results for the minimum graph coloring problem
M Demange, P Grisoni, VT Paschos
Information Processing Letters 50 (1), 19-23, 1994
281994
Improved approximations for maximum independent set via approximation chains
M Demange, VT Paschos
Applied Mathematics Letters 10 (3), 105-110, 1997
271997
An introduction to inverse combinatorial problems
M Demange, J Monnot
Paradigms of Combinatorial Optimization: Problems and New Approaches, 547-586, 2014
262014
The system can't perform the operation now. Try again later.
Articles 1–20