| 2009 |
|---|
| 72 | EE | Nicolas Bourgeois,
Bruno Escoffier,
Vangelis Th. Paschos,
Johan M. M. van Rooij:
Fast Algorithms for Max Independent Set in Graphs of Small Average Degree
CoRR abs/0901.1563: (2009) |
| 71 | EE | Giorgio Lucarelli,
Ioannis Milis,
Vangelis Th. Paschos:
Max Edge Coloring of Trees
CoRR abs/0901.4002: (2009) |
| 70 | EE | Nicolas Bourgeois,
Federico Della Croce,
Bruno Escoffier,
Cécile Murat,
Vangelis Th. Paschos:
Probabilistic graph-coloring in bipartite and split graphs.
J. Comb. Optim. 17(3): 274-311 (2009) |
| 69 | EE | Nicolas Bourgeois,
Bruno Escoffier,
Vangelis Th. Paschos:
Efficient approximation of min set cover by moderately exponential algorithms.
Theor. Comput. Sci. 410(21-23): 2184-2195 (2009) |
| 2008 |
|---|
| 68 | EE | Cécile Murat,
Vangelis Th. Paschos:
Vertex-Uncertainty in Graph-Problems.
COCOA 2008: 139-148 |
| 67 | EE | Nicolas Bourgeois,
Bruno Escoffier,
Vangelis Th. Paschos:
An O*(1.0977n) Exact Algorithm for max independent setin Sparse Graphs.
IWPEC 2008: 55-65 |
| 66 | EE | Giorgio Lucarelli,
Ioannis Milis,
Vangelis Th. Paschos:
On the Maximum Edge Coloring Problem.
WAOA 2008: 279-292 |
| 65 | EE | Federico Della Croce,
Vangelis Th. Paschos:
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems.
Operational Research 8(3): 235-256 (2008) |
| 2007 |
|---|
| 64 | EE | Vangelis Th. Paschos,
Orestis Telelis,
Vassilis Zissimopoulos:
Steiner Forests on Stochastic Metric Graphs.
COCOA 2007: 112-123 |
| 63 | EE | Aristotelis Giannakos,
Laurent Gourvès,
Jérôme Monnot,
Vangelis Th. Paschos:
On the Performance of Congestion Games for Optimum Satisfiability Problems.
WINE 2007: 220-231 |
| 62 | EE | Bruno Escoffier,
Vangelis Th. Paschos:
Differential approximation of min sat.
European Journal of Operational Research 181(2): 620-633 (2007) |
| 61 | EE | Marc Demange,
Dominique de Werra,
Jérôme Monnot,
Vangelis Th. Paschos:
Time slot scheduling of compatible jobs.
J. Scheduling 10(2): 111-127 (2007) |
| 60 | EE | Federico Della Croce,
Bruno Escoffier,
Vangelis Th. Paschos:
Improved worst-case complexity for the MIN 3-SET COVERING problem.
Oper. Res. Lett. 35(2): 205-210 (2007) |
| 59 | EE | Federico Della Croce,
M. J. Kaminski,
Vangelis Th. Paschos:
An exact algorithm for MAX-CUT in sparse graphs.
Oper. Res. Lett. 35(3): 403-408 (2007) |
| 2006 |
|---|
| 58 | EE | Giorgio Ausiello,
Aristotelis Giannakos,
Vangelis Th. Paschos:
Greedy algorithms for on-line set-covering and related problems.
CATS 2006: 145-151 |
| 57 | EE | Giorgio Ausiello,
Bruno Escoffier,
Jérôme Monnot,
Vangelis Th. Paschos:
Reoptimization of Minimum and Maximum Traveling Salesman's Tours.
SWAT 2006: 196-207 |
| 56 | EE | Cécile Murat,
Vangelis Th. Paschos:
On the probabilistic minimum coloring and minimum k-coloring.
Discrete Applied Mathematics 154(3): 564-586 (2006) |
| 55 | EE | Yury Glazkov,
Alexey Baburin,
Edward Gimadi,
Federico Della Croce,
Vangelis Th. Paschos:
Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2.
Electronic Notes in Discrete Mathematics 27: 35-36 (2006) |
| 54 | EE | Vangelis Th. Paschos:
Jon Lee, A First Course in Combinatorial Optimization, Cambridge Texts in Applied Mathematics.
European Journal of Operational Research 168(3): 1042-1044 (2006) |
| 53 | EE | Giorgio Ausiello,
Vangelis Th. Paschos:
Reductions, completeness and the hardness of approximability.
European Journal of Operational Research 172(3): 719-739 (2006) |
| 52 | EE | Bruno Escoffier,
Jérôme Monnot,
Vangelis Th. Paschos:
Weighted Coloring: further complexity and approximability results.
Inf. Process. Lett. 97(3): 98-103 (2006) |
| 51 | EE | Bruno Escoffier,
Vangelis Th. Paschos:
Completeness in approximation classes beyond APX.
Theor. Comput. Sci. 359(1-3): 369-377 (2006) |
| 2005 |
|---|
| 50 | EE | Bruno Escoffier,
Vangelis Th. Paschos:
Differential Approximation of min sat, max sat and Related Problems.
ICCSA (4) 2005: 192-201 |
| 49 | EE | Federico Della Croce,
Bruno Escoffier,
Cécile Murat,
Vangelis Th. Paschos:
Probabilistic Coloring of Bipartite and Split Graphs.
ICCSA (4) 2005: 202-211 |
| 48 | EE | Bruno Escoffier,
Jérôme Monnot,
Vangelis Th. Paschos:
Weighted Coloring: Further Complexity and Approximability Results.
ICTCS 2005: 205-214 |
| 47 | EE | Federico Della Croce,
Vangelis Th. Paschos:
Computing Optimal Solutions for the min 3-set covering Problem.
ISAAC 2005: 685-692 |
| 46 | EE | Cristina Bazgan,
Jérôme Monnot,
Vangelis Th. Paschos,
Fabrice Serrière:
Greedy Differential Approximations for Min Set Cover.
SOFSEM 2005: 62-71 |
| 45 | EE | Dominique de Werra,
Marc Demange,
Jérôme Monnot,
Vangelis Th. Paschos:
A hypocoloring model for batch scheduling.
Discrete Applied Mathematics 146(1): 3-26 (2005) |
| 44 | EE | Marc Demange,
Vangelis Th. Paschos:
Polynomial approximation algorithms with performance guarantees: An introduction-by-example.
European Journal of Operational Research 165(3): 555-568 (2005) |
| 43 | EE | Bruno Escoffier,
Vangelis Th. Paschos:
Proving completeness by logic.
Int. J. Comput. Math. 82(2): 151-161 (2005) |
| 42 | EE | Giorgio Ausiello,
Cristina Bazgan,
Marc Demange,
Vangelis Th. Paschos:
Completeness in differential approximation classes.
Int. J. Found. Comput. Sci. 16(6): 1267-1295 (2005) |
| 41 | EE | Cristina Bazgan,
Jérôme Monnot,
Vangelis Th. Paschos,
Fabrice Serrière:
On the differential approximation of MIN SET COVER.
Theor. Comput. Sci. 332(1-3): 497-513 (2005) |
| 40 | EE | Marc Demange,
Vangelis Th. Paschos:
On-line vertex-covering.
Theor. Comput. Sci. 332(1-3): 83-108 (2005) |
| 39 | EE | Cristina Bazgan,
Bruno Escoffier,
Vangelis Th. Paschos:
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness.
Theor. Comput. Sci. 339(2-3): 272-292 (2005) |
| 38 | EE | Marc Demange,
Vangelis Th. Paschos:
Improved Approximations for Weighted and Unweighted Graph Problems.
Theory Comput. Syst. 38(6): 763-787 (2005) |
| 2004 |
|---|
| 37 | EE | Giorgio Ausiello,
Marc Demange,
Luigi Laura,
Vangelis Th. Paschos:
Algorithms for the On-Line Quota Traveling Salesman Problem.
COCOON 2004: 290-299 |
| 36 | EE | Cristina Bazgan,
Bruno Escoffier,
Vangelis Th. Paschos:
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation.
ISAAC 2004: 124-136 |
| 35 | EE | Jérôme Monnot,
Vangelis Th. Paschos,
Dominique de Werra,
Marc Demange,
Bruno Escoffier:
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation.
ISAAC 2004: 896-907 |
| 34 | EE | Dominique de Werra,
Marc Demange,
Jérôme Monnot,
Vangelis Th. Paschos:
The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small.
WG 2004: 377-388 |
| 33 | EE | Mhand Hifi,
Vangelis Th. Paschos,
Vassilis Zissimopoulos:
A simulated annealing approach for the circular cutting problem.
European Journal of Operational Research 159(2): 430-448 (2004) |
| 32 | EE | Giorgio Ausiello,
Marc Demange,
Luigi Laura,
Vangelis Th. Paschos:
Algorithms for the On-Line Quota Traveling Salesman Problem.
Inf. Process. Lett. 92(2): 89-94 (2004) |
| 31 | EE | Tinaz Ekim,
Vangelis Th. Paschos:
Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation.
Int. J. Comput. Math. 81(5): 569-582 (2004) |
| 30 | EE | Federico Della Croce,
Andrea Grosso,
Vangelis Th. Paschos:
Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem.
J. Scheduling 7(1): 85-91 (2004) |
| 29 | EE | Jérôme Monnot,
Vangelis Th. Paschos,
Sophie Toulouse:
Local approximations for maximum partial subgraph problem.
Oper. Res. Lett. 32(3): 217-224 (2004) |
| 2003 |
|---|
| 28 | EE | Giorgio Ausiello,
Cristina Bazgan,
Marc Demange,
Vangelis Th. Paschos:
Completeness in Differential Approximation Classes.
MFCS 2003: 179-188 |
| 27 | EE | Cécile Murat,
Vangelis Th. Paschos:
The Probabilistic Minimum Coloring Problem.
WG 2003: 346-357 |
| 26 | EE | Marc Demange,
Jérôme Monnot,
Vangelis Th. Paschos:
Differential approximation results for the Steiner tree problem.
Appl. Math. Lett. 16(5): 733-739 (2003) |
| 25 | EE | Vangelis Th. Paschos:
Polynomial Approximation and Graph-Coloring.
Computing 70(1): 41-86 (2003) |
| 24 | EE | Jérôme Monnot,
Vangelis Th. Paschos,
Sophie Toulouse:
Differential approximation results for the traveling salesman problem with distances 1 and 2.
European Journal of Operational Research 145(3): 557-568 (2003) |
| 23 | EE | Cristina Bazgan,
Vangelis Th. Paschos:
Differential approximation for optimal satisfiability and related problems.
European Journal of Operational Research 147(2): 397-404 (2003) |
| 22 | EE | Jérôme Monnot,
Vangelis Th. Paschos,
Sophie Toulouse:
Optima locaux garantis pour l'approximation différentielle.
Technique et Science Informatiques 22(3): 257-288 (2003) |
| 2002 |
|---|
| 21 | EE | Marc Demange,
Vangelis Th. Paschos:
Algorithms and Models for the On-Line Vertex-Covering.
WG 2002: 102-113 |
| 20 | EE | Marc Demange,
Dominique de Werra,
Jérôme Monnot,
Vangelis Th. Paschos:
Weighted Node Coloring: When Stable Sets Are Expensive.
WG 2002: 114-125 |
| 19 | EE | Cécile Murat,
Vangelis Th. Paschos:
A priori optimization for the probabilistic maximum independent set problem.
Theor. Comput. Sci. 270(1-2): 561-590 (2002) |
| 2001 |
|---|
| 18 | EE | Jérôme Monnot,
Vangelis Th. Paschos,
Sophie Toulouse:
Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2.
FCT 2001: 275-286 |
| 17 | EE | Vangelis Th. Paschos:
On-line independent set by coloring vertices.
Operational Research 1(3): 213-224 (2001) |
| 2000 |
|---|
| 16 | EE | Marc Demange,
Xavier Paradon,
Vangelis Th. Paschos:
On-Line Maximum-Order Induces Hereditary Subgraph Problems.
SOFSEM 2000: 327-335 |
| 1999 |
|---|
| 15 | EE | Cécile Murat,
Vangelis Th. Paschos:
The probabilistic longest path problem.
Networks 33(3): 207-219 (1999) |
| 14 | EE | Federico Della Croce,
Vangelis Th. Paschos,
Alexis Tsoukiàs:
An improved general procedure for lexicographic bottleneck problems.
Oper. Res. Lett. 24(4): 187-194 (1999) |
| 1998 |
|---|
| 13 | EE | Wenceslas Fernandez de la Vega,
Vangelis Th. Paschos,
Andreas Stafylopatis:
Average-Case Complexity for the Execution of Recursive Definitions on Relational Databases.
Acta Inf. 35(3): 211-243 (1998) |
| 12 | EE | Marc Demange,
Pascal Grisoni,
Vangelis Th. Paschos:
Differential Approximation Algorithms for Some Combinatorial Optimization Problems.
Theor. Comput. Sci. 209(1-2): 107-122 (1998) |
| 1997 |
|---|
| 11 | EE | Vangelis Th. Paschos:
A Survey of Approximately Optimal Solutions to Some Covering and Packing Problems.
ACM Comput. Surv. 29(2): 171-209 (1997) |
| 1996 |
|---|
| 10 | EE | Marc Demange,
Vangelis Th. Paschos:
On an Approximation Measure Founded on the Links Between Optimization and Polynomial Approximation Theory.
Theor. Comput. Sci. 158(1&2): 117-141 (1996) |
| 1995 |
|---|
| 9 | | Marc Demange,
Vangelis Th. Paschos:
Constructive - Non-constructive Approximation and Maximum Independent Set Problem.
Combinatorics and Computer Science 1995: 194-207 |
| 8 | EE | Joë Blot,
Wenceslas Fernandez de la Vega,
Vangelis Th. Paschos,
Rachid Saad:
Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems.
Theor. Comput. Sci. 147(1&2): 267-298 (1995) |
| 1994 |
|---|
| 7 | | Marc Demange,
Pascal Grisoni,
Vangelis Th. Paschos:
Approximation Results for the Minimum Graph Coloring Problem.
Inf. Process. Lett. 50(1): 19-23 (1994) |
| 1992 |
|---|
| 6 | | Wenceslas Fernandez de la Vega,
Vangelis Th. Paschos,
Rachid Saad:
Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem.
LATIN 1992: 130-138 |
| 5 | | Vangelis Th. Paschos:
A (Delta/2)-Approximation Algorithm for the Maximum Independent Set Problem.
Inf. Process. Lett. 44(1): 11-13 (1992) |
| 1991 |
|---|
| 4 | | Vangelis Th. Paschos:
A Theorem on the Approximation of Set Cover and Vertex Cover.
FSTTCS 1991: 278-287 |
| 3 | | A. Benkouar,
Yannis Manoussakis,
Vangelis Th. Paschos,
Rachid Saad:
On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs.
ISA 1991: 190-198 |
| 2 | EE | Wenceslas Fernandez de la Vega,
Vangelis Th. Paschos,
A. N. Staylopatis:
On the Mean Execution Time of Recursive Definitions on Relational Databases.
MFDBS 1991: 119-133 |
| 1 | | Vassilis Zissimopoulos,
Vangelis Th. Paschos,
Ferhan Pekergin:
On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems.
IEEE Trans. Computers 40(12): 1413-1418 (1991) |
