| 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 | 114 | 1996 |
| Differential approximation algorithms for some combinatorial optimization problems M Demange, P Grisoni, VT Paschos Theoretical Computer Science 209 (1-2), 107-122, 1998 | 87 | 1998 |
| 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 | 77 | 2004 |
| 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 | 65 | 2015 |
| Weighted node coloring: when stable sets are expensive M Demange, D Werra, J Monnot, VT Paschos Graph-Theoretic Concepts in Computer Science: 28th International Workshop …, 2002 | 63 | 2002 |
| Time slot scheduling of compatible jobs M Demange, D Werra, J Monnot, VT Paschos Journal of Scheduling 10 (2), 111-127, 2007 | 56 | 2007 |
| L'épreuve des inégalités H Lagrange PUF, 2015 | 54 | 2015 |
| New results on maximum induced matchings in bipartite graphs and beyond KK Dabrowski, M Demange, VV Lozin Theoretical Computer Science 478, 33-40, 2013 | 45 | 2013 |
| Partitioning cographs into cliques and stable sets M Demange, T Ekim, D De Werra Discrete Optimization 2 (2), 145-153, 2005 | 44 | 2005 |
| Hardness and approximation of minimum maximal matchings M Demange, T Ekim, C Tanasescu International Journal of Computer Mathematics 91 (8), 1635 - 1654, 2014 | 43* | 2014 |
| An introduction to inverse combinatorial problems M Demange, J Monnot Paradigms of Combinatorial Optimization: Problems and New Approaches, 547-586, 2014 | 41 | 2014 |
| On the complexity of the selective graph coloring problem in some special classes of graphs M Demange, J Monnot, P Pop, B Ries Theoretical Computer Science 540, 89-102, 2014 | 40* | 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 | 40 | 2005 |
| 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 | 39 | 1999 |
| 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 | 38 | 2009 |
| 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 | 38* | 1999 |
| On-line vertex-covering M Demange, VT Paschos Theoretical Computer Science 332 (1-3), 83-108, 2005 | 35 | 2005 |
| Approximation results for the minimum graph coloring problem M Demange, P Grisoni, VT Paschos Information Processing Letters 50 (1), 19-23, 1994 | 35 | 1994 |
| On the online track assignment problem M Demange, G Di Stefano, B Leroy-Beaulieu Discrete Applied Mathematics 160 (7-8), 1072-1093, 2012 | 34* | 2012 |
| 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 | 31 | 2009 |
Vangelis PaschosProfesseur d'Informatique, LAMSADE, Université Paris-DauphineVerified email at lamsade.dauphine.fr
