1. Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Paschos, Fast algorithms for min independent dominating set, Discrete Applied Mathematics 0, 9999
2. Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos, Johan van Rooij, Fast Algorithms for max independent set, Algorithmica 62, pages 382-415, 2012(Preliminary version)
3. Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Paschos, Olivier Pottié, The Max Quasi-Independent Set Problem, Journal of Combinatorial Optimization 23, pages 94-117, 2012(Preliminary version)
4. Nicolas Boria, Cécile Murat, Vangelis Paschos, On the probabilistic MIN SPANNING TREE problem, Journal of Mathematical Modeling and Algorithms 0, 2012(Preliminary version)
5. Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Paschos, Online maximum k-coverage, Discrete Applied Mathematics 0, 2012(Preliminary version)
6. Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos, Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms, Discrete Applied Mathematics 159, pages 1954-1970, 2011(Preliminary version)
7. Stratos Paschos, Vangelis Paschos, Reoptimization of the minimum spanning tree, WIREs Computational Statistics 0, 2011
8. Nicolas Boria, Vangelis Paschos, A survey on combinatorial optimization in dynamic environments, RAIRO - Operations Research 45, pages 241-294, 2011(Preliminary version)
9. Giorgio Lucarelli, Ioannis Milis, Vangelis Paschos, On the max-weight edge coloring problem, Journal of Combinatorial Optimization 20, pages 429-442, 2010(Preliminary version)
10. Vangelis Paschos, Orestis Telelis, Vassilis Zissimopoulos, Probabilistic models for the STEINER TREE problem, Networks 56, pages 39-49, 2010(Preliminary version)
11. Bruno Escoffier, Vangelis Paschos, A survey on the structure of approximation classes, Computer Science Review 4, pages 19-40, 2010(Preliminary version)
12. Cécile Murat, Vangelis Paschos, Probabilistic optimization in graph-problems, Algorithmic Operations Research 5, pages 49-64, 2010(Preliminary version)
13. Federico Della Croce, Vangelis Paschos, Roberto Wolfler Calvo, Approximating the metric 2-peripatetic salesman problem, Algorithmic Operations Research 5, pages 13-20, 2010
14. Nicolas Boria, Vangelis Paschos, Fast reoptimization for the minimum spanning tree problem, Journal of Discrete Algorithms 8, pages 296-310, 2010(Preliminary version)
15. Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Paschos, Approximating the max edge-coloring problem, Theoretical Computer Science 0, pages 3055-3067, 2010(Preliminary version)
16. Giorgio Ausiello, Nicolas Bourgeois, Aristotelis Giannakos, Vangelis Paschos, Greedy algorithms for on-line set-covering, Algoritrhmic Operations Reserach 4, pages 36-48, 2009(Preliminary version)
17. Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Paschos, Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation, Discrete Applied Mathematics 157, pages 819-832, 2009(Preliminary version)
18. Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Paschos, Reoptimization of minimum and maximum traveling salesman's tours, Journal of Discrete Algorithms 7, pages 453-463, 2009(Preliminary version)
19. Bruno Escoffier, Martin Milanic, Vangelis Paschos, Simple and fast reoptimizations for the Steiner tree problem, Algorithmic Operations Research 4, pages 86-94, 2009(Preliminary version)
20. Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Paschos, Probabilistic graph-coloring in bipartite and split graphs, Journal of Combinatorial Optimization 17, pages 274-311, 2009(Preliminary version)
21. Aleksei Baburin, Federico Della Croce, Edward Gimadi, Yuri Glazkov, Vangelis Paschos, Approximation algorithms for the 2 - peripatetic salesman problem with edge weights 1 and 2, Discrete Applied Mathematics 157, pages 1988-1992, 2009
22. Vangelis Paschos, An overview on polynomial approximation of NP-hard problems, Yugoslav Journal of Operations Research 19, pages 3-40, 2009(Preliminary version)
23. Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos, Efficient approximation of MIN SET COVER by moderately exponential algorithms, Theoretical Computer Science 410, pages 2184-2195, 2009(Preliminary version)
24. Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos, Efficient approximation of MIN COLORING by moderately exponential algorithms, Information Processing Letters 109, pages 950-954, 2009(Preliminary version)
25. Federico Della Croce, Vangelis Paschos, Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems, Operational Research: An International Journal 8, pages 235-256, 2008(Preliminary version)
26. Bruno Escoffier, Vangelis Paschos, Differential approximation of MIN SAT, MAX SAT and related problems, European Journal of Operational Research 181, pages 620-633, 2007(Preliminary version)
27. Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Paschos, Time slot scheduling of compatible jobs, Journal of Scheduling 10, pages 111-127, 2007(Preliminary version)
28. Federico Della Croce, Bruno Escoffier, Vangelis Paschos, Improved worst-case complexity for the MIN 3-SET COVERING problem, Operations Research Letters 35, pages 205-210, 2007(Preliminary version)
29. Federico Della Croce, Marcin Kaminski, Vangelis Paschos, An exact algorithm for MAX CUT in sparse graphs, Operations Research Letters 35, pages 403-408, 2007(Preliminary version)
30. Cécile Murat, Vangelis Paschos, On the probabilistic minimum coloring and minimum k-coloring, Discrete Applied Mathematics 154, pages 564-586, 2006(Preliminary version)
31. Giorgio Ausiello, Vangelis Paschos, Reductions, completeness and the hardness of approximability, European Journal of Operational Research 172, pages 719-739, 2006
32. Bruno Escoffier, Jérôme Monnot, Vangelis Paschos, Weighted coloring: further complexity and approximability results, Information Processing Letters 97, pages 98-103, 2006(Preliminary version)
33. Bruno Escoffier, Vangelis Paschos, On-line models and algorithms for MAX INDEPENDENT SET, RAIRO Operations Research 40, pages 129-142, 2006
34. Bruno Escoffier, Vangelis Paschos, Completeness in approximation classes beyond APX, Theoretical Computer Science 359, pages 369-377, 2006(Preliminary version)
35. Bruno Escoffier, Vangelis Paschos, Proving completeness by logic, International Journal of Computer Mathematics 82, pages 151-161, 2005(Preliminary version)
36. Marc Demange, Xavier Paradon, Vangelis Paschos, On-line maximum-order induced hereditary subgraph problems, International Transactions on Operational Research 12, pages 185-201, 2005(Preliminary version)
37. Marc Demange, Vangelis Paschos, Polynomial approximation algorithms with performance guarantees: an introduction-by-example, European Journal of Operational Research 165, pages 555-568, 2005
38. Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Paschos, Completeness in differential approximation classes, International Journal of Foundations of Computer Science 16, pages 1267-1295, 2005(Preliminary version)
39. Marc Demange, Vangelis Paschos, Improved approximations for weighted and unweighted graph problems, Theory of Computing Systems 38, pages 763-787, 2005(Preliminary version)
40. Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Paschos, A hypocoloring model for batch scheduling, Discrete Applied Mathematics 146, pages 27-42, 2005(Preliminary version)
41. Marc Demange, Vangelis Paschos, On-line vertex-covering, Theoretical Computer Science 332, pages 83-108, 2005(Preliminary version)
42. Cristina Bazgan, Jérôme Monnot, Vangelis Paschos, Fabrice Serrière, Differential approximations for min set cover, Theoretical Computer Science 332, pages 497-513, 2005(Preliminary version)
43. Cristina Bazgan, Bruno Escoffier, Vangelis Paschos, Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness, Theoretical Computer Science 339, pages 272-292, 2005(Preliminary version)
44. Federico Della Croce, Andrea Grosso, Vangelis Paschos, Lower bounds on the approximation ratios of leading heuristics for the single machine total tardiness problem, Journal of Scheduling 7, pages 85-91, 2004(Preliminary version)
45. Jérôme Monnot, Vangelis Paschos, Sophie Toulouse, Local approximations for maximum partial subgraph problem, Operations Research Letters 32, pages 217-224, 2004(Preliminary version)
46. Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Paschos, Algorithms for the on-line quota traveling salesman problem, Information Processing Letters 92, pages 89-94, 2004(Preliminary version)
47. Mhand Hifi, Vangelis Paschos, Vassilis Zissimopoulos, A simulated annealing approach for the circular cutting problem, European Journal of Operational Research 159, pages 430-448, 2004
48. Stratos Paschos, Vangelis Paschos, Vassilis Zissimopoulos, The antennas pre-assignment problem, Chaos, Solitons and Fractals 22, pages 821-829, 2004
49. Tinaz Ekim, Vangelis Paschos, Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation, International Journal of Computer Mathematics 81, pages 569-582, 2004
50. Jérôme Monnot, Vangelis Paschos, Sophie Toulouse, Optima locaux garantis pour l'approximation différentielle, Technique et Science Informatiques 22, pages 257-288, 2003(Preliminary version)
51. Marc Demange, Jérôme Monnot, Vangelis Paschos, Differential approximation results for the Steiner tree problem, Applied Mathematics Letters 16, pages 733-739, 2003
52. Vangelis Paschos, Polynomial approximation and graph-coloring, Computing 70, 2003(Preliminary version)
53. Cristina Bazgan, Vangelis Paschos, Differential approximation for satisfiability and related problems, European Journal of Operational Research 147, 2003(Preliminary version)
54. Jérôme Monnot, Vangelis Paschos, Sophie Toulouse, Differential approximation results for traveling salesman problem with distance 1 and 2, European Journal of Operational Research 145, pages 557-568, 2003(Preliminary version)
55. Marc Demange, Vangelis Paschos, Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation, RAIRO Operations Research 36, 2002(Preliminary version)
56. Marc Demange, Vangelis Paschos, Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances, RAIRO Operations Research 36, 2002(Preliminary version)
57. Jérôme Monnot, Vangelis Paschos, Sophie Toulouse, Approximation algorithms for the traveling salesman problem, Mathematical Methods of Operational Research 56, pages 387-405, 2002(Preliminary version)
58. Vangelis Paschos, On-line independent set by coloring vertices, Operational Research: An International Journal 2, 2002
59. Cécile Murat, Vangelis Paschos, The probabilistic maximum independent set problem, Theoretical Computer Science 270, 2002(Preliminary version)
60. Cécile Murat, Vangelis Paschos, The probabilistic minimum vertex covering problem, International Transactions on Operational Research 9, 2002(Preliminary version)
61. Aris Likas, Vangelis Paschos, An efficient heuristic for the traveling salesman problem based upon a new solution representation, Chaos Solitons and Fractals 16, 2002(Preliminary version)
62. Vangelis Paschos, A note on the approximation ratio of graph-coloring, Foundations of Computing and Decision Sciences 26, 2002(Preliminary version)
63. Marc Demange, Jérôme Monnot, Vangelis Paschos, Maximizing the number of unused bins , Foundations of Computing and Decision Sciences 26, pages 169-186, 2001
64. Laurent Alfandari, Vangelis Paschos, Master-slave strategies and polynomial approximation, Computational Optimization and Applications 16, 2000(Preliminary version)
65. Mhand Hifi, Vangelis Paschos, Vassilis Zissimopoulos, A neural network for minimum set covering problem, Chaos Solitons and Fractals 11, 2000
66. Vangelis Paschos, Studying graph-stability to apprehend relative hardness of constructive - non-constructive approximation, Bulletin of the Greek Mathematical Society 43, pages 37-54, 2000
67. Laurent Alfandari, Vangelis Paschos, Approximating the minimum rooted spanning tree with radius 2, International Transactions on Operational Research 6, 1999
68. Cécile Murat, Vangelis Paschos, The probabilistic longest path problem, Networks 33, 1999
69. Federico Della Croce, Vangelis Paschos, Alexis Tsoukiàs, An improved general procedure for lexicographic bottleneck problems, Operations Research Letters 24, 1999
70. Marc Demange, Jérôme Monnot, Vangelis Paschos, Bridging gap between standard and differential polynomial approximation: the case of bin-packing, Applied Mathematics Letters 12, pages 127-133, 1999
71. Marc Demange, Vangelis Paschos, Asymptotic differential approximation ratio: definitions, motivations and an application to bin-packing, RAIRO Operations Research 33, 1999
72. Marc Demange, Pascal Grisoni, Vangelis Paschos, Differential approximation algorithms for some combinatorial optimization problems, Theoretical Computer Science 209, 1998(Preliminary version)
73. Lalo Fernandez de la Vega, Vangelis Paschos, Andreas Stafylopatis, Average case complexity for the execution of recursive definitions on relational databases, Acta Informatica 34, 1998(Preliminary version)
74. Vangelis Paschos, A survey on how optimal solutions to some covering and packing problems can be approximated, ACM Computing Surveys 29, 1997
75. Vangelis Paschos, Marc Demange, A generalization of König-Egervary graphs and heuristics for maximum independent set problem with improved approximation ratios, European Journal of Operational Research 97, 1997(Preliminary version)
76. Marc Demange, Vangelis Paschos, Improved approximations for maximum independent set via approximation chains, Applied Mathematics Letters 10, 1997
77. Marc Demange, Vangelis Paschos, The approximability behavior of some combinatorial problems with respect to the approximability of a class of maximum independent set problems, Computational Optimization and Applications 7, 1997(Preliminary version)
78. Virginie Gabrel, Alain Moulet, Cécile Murat, Vangelis Paschos, A new single model and derived algorithms for the satellite shots planning problem using graph theory concepts, Annals of Operations Research 69, 1997
79. Marc Demange, Vangelis Paschos, On an approximation measure founded on the links between optimization and polynomial approximation theory, Theoretical Computer Science 158, 1996(Preliminary version)
80. A. Benkouar, Yannis Manoussakis, Vangelis Paschos, Rachid Saad, Hamiltonian problems in edge-colored complete graphs and Eulerian cycles in edge-colored graphs: some complexity results, RAIRO Operations Research 30, 1996
81. Marc Demange, Vangelis Paschos, Valeurs extrémales d'un problème d'optimisation combinatoire et approximation polynomiale, Mathématiques, Informatique et Sciences Humaines 135, 1996
82. Joël Blot, Lalo Fernandez de la Vega, Vangelis Paschos, Rachid Saad, Average case analysis of greedy algorithms for optimisation problems on set systems, Theoretical Computer Science 147, 1995(Preliminary version)
83. Mohamed Afif, Mhand Hifi, Vangelis Paschos, Vassilis Zissimopoulos, A new efficient heuristic for minimum set covering problem, Journal of the Operational Research Society 46, 1995
84. Vangelis Paschos, Laure Renotte, Approximability preserving reductions for NP-complete problems, Foundations of Computing and Decision Sciences 20, 1995(Preliminary version)
85. Mohamed Afif, Aris Likas, Vangelis Paschos, A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem, Chaos, Solitons and Fractals 5, 1995
86. Vangelis Paschos, A note on the improvement of the maximum independent set's approximation ratio, Yugoslav Journal of Operations Research 5, 1995
87. Monia Bellalouna, Cécile Murat, Vangelis Paschos, Probabilistic combinatorial optimization problems: a new domain in Operational Research, European Journal of Operational Research 87, 1995
88. Cécile Murat, Vangelis Paschos, Problème du stable probabiliste, Comptes Rendus de l'Académie des Sciences de Paris 321, 1995
89. Marc Demange, Vangelis Paschos, L'approximabilité de la couverture d'ensembles et d'un problème de programmation convexe par rapport à celle d'une classe de problèmes de stabilité, Comptes Rendus de l'Académie des Sciences de Paris 321, 1995
90. Joël Blot, Lalo Fernandez de la Vega, Vangelis Paschos, Rachid Saad, Analyse en moyenne de la performance des algorithmes gloutons pour des problèmes d'optimisation sur des systèmes d'ensembles, Comptes Rendus de l'Académie des Sciences de Paris 321, 1995
91. Vangelis Paschos, A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set, RAIRO Operations Research 28, 1994(Preliminary version)
92. Marc Demange, Pascal Grisoni, Vangelis Paschos, Approximation results for the minimum graph coloring problem, Information Processing Letters 50, 1994
93. Vangelis Paschos, Marc Demange, Approximation algorithms for minimum set covering problem: a survey, Foundations of Computing and Decision Sciences 19, 1994
94. Marc Demange, Pascal Grisoni, Vangelis Paschos, Quelques résultats dans le cadre d'une nouvelle théorie de l'approximation polynomiale, Comptes Rendus de l'Académie des Sciences de Paris 318, 1994
95. Vangelis Paschos, Ferhan Pekergin, Vassilis Zissimopoulos, Approximating the optimal solutions of some hard graph problems by a Boltzmann machine, Belgian Journal of Operations Research, Statistics and Computer Science 33, 1993
96. Marc Demange, Vangelis Paschos, Quelques étapes vers la conciliation de la théorie d'approximation et celle d'optimisation : une nouvelle théorie d'approximation polynomiale et résultats préliminaires, Comptes Rendus de l'Académie des Sciences de Paris 317, 1993
97. Vangelis Paschos, A D/2-approximation algorithm for the maximum independent set problem, Information Processing Letters 44, 1992
98. Vangelis Paschos, Andreas Stafylopatis, Evaluation of the execution cost of recursive definitions, The Computer Journal 35, 1992
99. Vassilis Zissimopoulos, Vangelis Paschos, Ferhan Pekergin, On the approximation of NP-complete problems by using Boltzmann machine method: the cases of some covering and packing problems, IEEE Transactions on Computers 40, 1991