Vangelis Paschos
Vangelis Paschos
Professeur d'Informatique, LAMSADE, Université Paris-Dauphine
Подтвержден адрес электронной почты в домене
Midrapidity Neutral-Pion Production in Proton-Proton Collisions at
SS Adler, S Afanasiev, C Aidala, NN Ajitanand, Y Akiba, J Alexander, ...
Physical review letters 91 (24), 241803, 2003
A survey of approximately optimal solutions to some covering and packing problems
VT Paschos
ACM Computing Surveys (CSUR) 29 (2), 171-209, 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
Differential approximation algorithms for some combinatorial optimization problems
M Demange, P Grisoni, VT Paschos
Theoretical Computer Science 209 (1-2), 107-122, 1998
Dynamic modeling of a disturbance in a multi-agent system for traffic regulation
F Balbo, S Pinson
Decision Support Systems 41 (1), 131-146, 2005
Weighted coloring: further complexity and approximability results
B Escoffier, J Monnot, VT Paschos
Information Processing Letters 97 (3), 98-103, 2006
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
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
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
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
Simple and fast reoptimizations for the Steiner tree problem
B Escoffier, M Milanič, VT Paschos
Algorithmic Operations Research 4 (2), 86-94, 2009
Fast algorithms for max independent set
N Bourgeois, B Escoffier, VT Paschos, JMM van Rooij
Algorithmica 62 (1-2), 382-415, 2012
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
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
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
Time slot scheduling of compatible jobs
M Demange, D De Werra, J Monnot, VT Paschos
Journal of Scheduling 10 (2), 111-127, 2007
Reoptimization of minimum and maximum traveling salesman's tours
G Ausiello, B Escoffier, J Monnot, V Paschos
Journal of Discrete Algorithms 7 (4), 453-463, 2009
Covering graphs with few complete bipartite subgraphs
H Fleischner, E Mujuni, D Paulusma, S Szeider
Theoretical Computer Science 410 (21-23), 2045-2053, 2009
The probabilistic longest path problem
C Murat, VT Paschos
Networks: An International Journal 33 (3), 207-219, 1999
An improved general procedure for lexicographic bottleneck problems
F Della Croce, VT Paschos, A Tsoukias
Operations research letters 24 (4), 187-194, 1999
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20