| A survey of approximately optimal solutions to some covering and packing problems VT Paschos ACM Computing Surveys (CSUR) 29 (2), 171-209, 1997 | 158 | 1997 |
| 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 |
| A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts V Gabrel, A Moulet, C Murat, VT Paschos Annals of Operations Research 69 (0), 115-134, 1997 | 107 | 1997 |
| Differential approximation algorithms for some combinatorial optimization problems M Demange, P Grisoni, VT Paschos Theoretical Computer Science 209 (1-2), 107-122, 1998 | 88 | 1998 |
| Applications of combinatorial optimization VT Paschos John Wiley & Sons, 2014 | 87 | 2014 |
| Completeness in standard and differential approximation classes: Poly-(D) APX-and (D) PTAS-completeness C Bazgan, B Escoffier, VT Paschos Theoretical Computer Science 339 (2-3), 272-292, 2005 | 83 | 2005 |
| Fast Algorithms for max independent set N Bourgeois, B Escoffier, VT Paschos, JMM van Rooij Algorithmica 62, 382-415, 2012 | 80 | 2012 |
| Weighted coloring: further complexity and approximability results B Escoffier, J Monnot, VT Paschos Information Processing Letters 97 (3), 98-103, 2006 | 76 | 2006 |
| A simulated annealing approach for the circular cutting problem M Hifi, VT Paschos, V Zissimopoulos European Journal of Operational Research 159 (2), 430-448, 2004 | 76 | 2004 |
| 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 | 75 | 2004 |
| Reoptimization of minimum and maximum traveling salesman’s tours G Ausiello, B Escoffier, J Monnot, VT Paschos Scandinavian Workshop on Algorithm Theory, 196-207, 2006 | 74 | 2006 |
| Simple and fast reoptimizations for the Steiner tree problem B Escoffier, M Milanič, VT Paschos Algorithmic Operations Research 4 (2), 86-94, 2009 | 67 | 2009 |
| Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms N Bourgeois, B Escoffier, VT Paschos Discrete Applied Mathematics 159 (17), 1954-1970, 2011 | 66 | 2011 |
| 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 |
| Structural parameters, tight bounds, and approximation for (k, r)-center I Katsikarelis, M Lampis, VT Paschos Discrete Applied Mathematics 264, 90-117, 2019 | 59 | 2019 |
| Time slot scheduling of compatible jobs M Demange, D Werra, J Monnot, VT Paschos Journal of Scheduling 10 (2), 111-127, 2007 | 56 | 2007 |
| Fast algorithms for min independent dominating set N Bourgeois, F Della Croce, B Escoffier, VT Paschos Discrete Applied Mathematics 161 (4-5), 558-572, 2013 | 54 | 2013 |
| L'épreuve des inégalités H Lagrange PUF, 2015 | 52 | 2015 |
| Online maximum k-coverage G Ausiello, N Boria, A Giannakos, G Lucarelli, VT Paschos Discrete Applied Mathematics 160 (13-14), 1901-1913, 2012 | 52 | 2012 |
| On subexponential and FPT-time inapproximability E Bonnet, B Escoffier, EJ Kim, VT Paschos Algorithmica 71, 541-565, 2015 | 50 | 2015 |
