A survey of approximately optimal solutions to some covering and packing problems VT Paschos ACM Computing Surveys (CSUR) 29 (2), 171-209, 1997 | 152 | 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 | 108 | 1996 |

Differential approximation algorithms for some combinatorial optimization problems M Demange, P Grisoni, VT Paschos Theoretical Computer Science 209 (1-2), 107-122, 1998 | 83 | 1998 |

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, 115-134, 1997 | 81 | 1997 |

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 | 78 | 2005 |

Fast algorithms for max independent set N Bourgeois, B Escoffier, VT Paschos, JMM van Rooij Algorithmica 62 (1), 382-415, 2012 | 71 | 2012 |

Weighted coloring: further complexity and approximability results B Escoffier, J Monnot, VT Paschos Information Processing Letters 97 (3), 98-103, 2006 | 71 | 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 | 71 | 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 | 69 | 2006 |

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 | 69 | 2004 |

Simple and fast reoptimizations for the Steiner tree problem B Escoffier, M Milanič, V Paschos Algorithmic Operations Research 4 (2), 86-94, 2009 | 65 | 2009 |

Weighted node coloring: when stable sets are expensive M Demange, D Werra, J Monnot, VT Paschos International Workshop on Graph-Theoretic Concepts in Computer Science, 114-125, 2002 | 63 | 2002 |

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 | 54 | 2011 |

Time slot scheduling of compatible jobs M Demange, D Werra, J Monnot, VT Paschos Journal of Scheduling 10 (2), 111-127, 2007 | 51 | 2007 |

Applications of combinatorial optimization VT Paschos John Wiley & Sons, 2014 | 49 | 2014 |

The probabilistic longest path problem C Murat, VT Paschos Networks: An International Journal 33 (3), 207-219, 1999 | 49 | 1999 |

Complexité et approximation polynomiale V Paschos Hermes Science, 2004 | 47 | 2004 |

On the max min vertex cover problem N Boria, F Della Croce, VT Paschos Discrete Applied Mathematics 196, 62-71, 2015 | 46 | 2015 |

Online maximum k-coverage G Ausiello, N Boria, A Giannakos, G Lucarelli, VT Paschos Discrete Applied Mathematics 160 (13-14), 1901-1913, 2012 | 46 | 2012 |

On subexponential and FPT-time inapproximability E Bonnet, B Escoffier, EJ Kim, VT Paschos Algorithmica 71 (3), 541-565, 2015 | 44 | 2015 |