×

zbMATH — the first resource for mathematics

Paschos, Vangelis Th.

Compute Distance To:
Author ID: paschos.vangelis-th Recent zbMATH articles by "Paschos, Vangelis Th."
Published as: Paschos, V.; Paschos, V. T.; Paschos, V. Th; Paschos, V. Th.; Paschos, Vangelis; Paschos, Vangelis T.; Paschos, Vangelis Th; Paschos, Vangelis Th.; Th. Paschos, Vangelis
Homepage: http://www.lamsade.dauphine.fr/~paschos/
External Links: MGP · Wikidata · ResearchGate · dblp · GND
Documents Indexed: 192 Publications since 1991, including 12 Books
all top 5

Serials

17 Theoretical Computer Science
10 Discrete Applied Mathematics
9 European Journal of Operational Research
8 RAIRO. Operations Research
5 Information Processing Letters
5 Operations Research Letters
5 Comptes Rendus de l’Académie des Sciences. Série I
4 Chaos, Solitons and Fractals
4 Foundations of Computing and Decision Sciences
4 Journal of Combinatorial Optimization
4 Algorithmic Operations Research
3 Algorithmica
3 Applied Mathematics Letters
3 Journal of Scheduling
3 Journal of Discrete Algorithms
3 Lecture Notes in Computer Science
3 Mathematics and Statistics Series
2 Acta Informatica
2 Networks
2 RAIRO. Recherche Opérationnelle
2 Annals of Operations Research
2 YUJOR. Yugoslav Journal of Operations Research
2 International Journal of Computer Mathematics
2 Computational Optimization and Applications
2 International Transactions in Operational Research
2 Theory of Computing Systems
2 Discrete Optimization
1 Computing
1 IEEE Transactions on Computers
1 Journal of Computer and System Sciences
1 Journal of the Operational Research Society
1 Bulletin of the Greek Mathematical Society
1 Optimization
1 Belgian Journal of Operations Research, Statistics and Computer Science (JORBEL)
1 Mathématiques, Informatique et Sciences Humaines
1 International Journal of Foundations of Computer Science
1 Mathematical Methods of Operations Research
1 JMMA. Journal of Mathematical Modelling and Algorithms
1 4OR
1 Operational Research. An International Journal
1 Discrete Mathematics, Algorithms and Applications
1 RAIRO. Theoretical Informatics and Applications
1 Computer Science Review

Publications by Year

Citations contained in zbMATH Open

136 Publications have been cited 754 times in 396 Documents Cited by Year
On an approximation measure founded on the links between optimization and polynomial approximation theory. Zbl 0871.90069
Demange, Marc; Paschos, Vangelis Th
35
1996
Weighted coloring: further complexity and approximability results. Zbl 1181.68173
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
23
2006
Differential approximation algorithms for some combinatorial optimization problems. Zbl 0912.68061
Demange, Marc; Grisoni, Pascal; Paschos, Vangelis Th.
23
1998
Reoptimization of minimum and maximum traveling salesman’s tours. Zbl 1141.90506
Ausiello, Giorgio; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
21
2006
Fast algorithms for max independent set. Zbl 1241.68087
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis T.; van Rooij, Johan M. M.
20
2012
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Zbl 1237.05146
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
20
2011
Simple and fast reoptimizations for the Steiner tree problem. Zbl 1277.90138
Escoffier, Bruno; Milanič, Martin; Paschos, Vangelis Th.
20
2009
A simulated annealing approach for the circular cutting problem. Zbl 1065.90082
Hifi, Mhand; Paschos, Vangelis Th.; Zissimopoulos, Vassilis
20
2004
Weighted node coloring: When stable sets are expensive. Zbl 1022.68092
Demange, Marc; de Werra, D.; Monnot, J.; Paschos, Vangelis Th.
17
2002
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Zbl 1173.05325
de Werra, D.; Demange, M.; Escoffier, B.; Monnot, J.; Paschos, V. Th.
16
2009
Fast algorithms for min independent dominating set. Zbl 1259.05161
Bourgeois, N.; Della Croce, F.; Escoffier, B.; Paschos, V. Th.
15
2013
Time slot scheduling of compatible jobs. Zbl 1154.90439
Demange, M.; de Werra, D.; Monnot, J.; Paschos, V. Th.
15
2007
Hamiltonian problems in edge-colored complete graphs and Eulerian cycles in edge-colored graphs: Some complexity results. Zbl 0868.90128
Benkouar, A.; Manoussakis, Y.; Paschos, V. Th.; Saad, R.
15
1996
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. Zbl 1068.68063
Bazgan, Cristina; Escoffier, Bruno; Paschos, Vangelis Th.
14
2005
Algorithms for the on-line quota traveling salesman problem. Zbl 1178.90282
Ausiello, G.; Demange, M.; Laura, L.; Paschos, V.
14
2004
Efficient approximation of Min Set Cover by moderately exponential algorithms. Zbl 1166.68043
Bourgeois, N.; Escoffier, B.; Paschos, V. Th.
13
2009
An improved general procedure for lexicographic bottleneck problems. Zbl 0954.90039
Della Croce, Federico; Paschos, Vangelis Th.; Tsoukias, Alexis
13
1999
Bridging gap between standard and differential polynomial approximation: The case of bin-packing. Zbl 0942.68144
Demange, M.; Monnot, J.; Paschos, V. Th.
11
1999
Approximation results for the minimum graph coloring problem. Zbl 0806.68085
Demange, Marc; Grisoni, Pascal; Paschos, Vangelis Th.
10
1994
Approximation of min coloring by moderately exponential algorithms. Zbl 1197.05141
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
9
2009
On-line vertex-covering. Zbl 1070.68118
Demange, Marc; Paschos, Vangelis Th.
9
2005
A priori optimization for the probabilistic maximum independent set problem. Zbl 0988.68135
Murat, Cécile; Paschos, Vangelis Th.
9
2002
A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios. Zbl 0919.90140
Paschos, Vangelis Th.; Demange, Marc
9
1997
A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts. Zbl 0880.90092
Gabrel, Virginie; Moulet, Alain; Murat, Cécile; Paschos, Vangelis Th.
9
1997
Reoptimization of minimum and maximum traveling salesman’s tours. Zbl 1180.90259
Ausiello, Giorgio; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis
8
2009
The probabilistic longest path problem. Zbl 0949.90013
Murat, Cécile; Paschos, Vangelis Th.
8
1999
Exact and approximation algorithms for densest \(k\)-subgraph (extended abstract). Zbl 1379.68378
Bourgeois, Nicolas; Giannakos, Aristotelis; Lucarelli, Giorgio; Milis, Ioannis; Paschos, Vangelis Th.
7
2013
A survey on combinatorial optimization in dynamic environments. Zbl 1254.90186
Boria, Nicolas; Paschos, Vangelis T.
7
2011
On the probabilistic minimum coloring and minimum \(k\)-coloring. Zbl 1087.05025
Murat, Cécile; Paschos, Vangelis Th.
7
2006
The probabilistic minimum vertex-covering problem. Zbl 0994.90122
Murat, Cécile; Paschos, Vangelis Th.
7
2002
Improved approximations for maximum independent set via approximation chains. Zbl 0883.68067
Demange, M.; Paschos, V. Th.
7
1997
On the max min vertex cover problem. Zbl 1321.05177
Boria, Nicolas; Della Croce, Federico; Paschos, Vangelis Th.
6
2015
Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization. Zbl 1312.68095
Bonnet, Édouard; Escoffier, Bruno; Paschos, Vangelis; Tourniaire, Émeric
6
2015
Reoptimization of maximum weight induced hereditary subgraph problems. Zbl 1277.68085
Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis Th.
6
2013
Fast reoptimization for the minimum spanning tree problem. Zbl 1192.90218
Boria, Nicolas; Paschos, Vangelis Th.
6
2010
Efficient approximation of combinatorial problems by moderately exponential algorithms. Zbl 1253.68357
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
6
2009
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. Zbl 1169.90466
Baburin, A. E.; Della Croce, F.; Gimadi, E. K.; Glazkov, Y. V.; Paschos, V. Th.
6
2009
An exact algorithm for MAX-CUT in sparse graphs. Zbl 1163.90767
Della Croce, F.; Kaminski, M. J.; Paschos, V. Th.
6
2007
On the differential approximation of MIN SET COVER. Zbl 1070.68153
Bazgan, Cristina; Monnot, Jérôme; Paschos, Vangelis Th.; Serriére, Fabrice
6
2005
A hypocoloring model for batch scheduling. Zbl 1115.68118
de Werra, D.; Demange, M.; Monnot, J.; Paschos, V. Th.
6
2005
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem. Zbl 1306.90048
Della Croce, Federico; Grosso, Andrea; Paschos, Vangelis Th.
6
2004
Weighted coloring on planar, bipartite and split graphs: Complexity and improved approximation. Zbl 1116.68565
de Werra, Dominique; Demange, Mare; Escoffier, Bruno; Monnot, Jerome; Paschos, Vangelis Th.
6
2004
Completeness in differential approximation classes. Zbl 1124.68365
Ausiello, G.; Bazgan, C.; Demange, M.; Paschos, V. Th.
6
2003
Maximizing the number of unused bins. Zbl 1204.90080
Demange, Marc; Monnot, Jérôme; Paschos, Vangelis Th.
6
2001
Master-slave strategy and polynomial approximation. Zbl 1017.90081
Alfandari, Laurent; Paschos, Vangelis Th.
6
2000
A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem. Zbl 0755.68073
Paschos, V. Th.
6
1992
Upper domination: complexity and approximation. Zbl 06631025
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
5
2016
Maximum Independent Set in graphs of average degree at most three in \({\mathcal O}(1.08537^n)\). Zbl 1284.68290
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.; van Rooij, Johan M. M.
5
2010
Probabilistic graph-coloring in bipartite and split graphs. Zbl 1206.05039
Bourgeois, N.; Della Croce, F.; Escoffier, B.; Murat, C.; Paschos, V. Th.
5
2009
Differential approximation of MIN SAT, MAX SAT and related problems. Zbl 1131.90080
Escoffier, Bruno; Paschos, Vangelis Th.
5
2007
Completeness in approximation classes beyond APX. Zbl 1099.68135
Escoffier, Bruno; Paschos, Vangelis Th.
5
2006
Reductions, completeness and the hardness of approximability. Zbl 1111.90092
Ausiello, G.; Paschos, V. Th.
5
2006
Differential approximation for optimal satisfiability and related problems. Zbl 1031.90025
Bazgan, Cristina; Paschos, Vangelis Th.
5
2003
Differential approximation results for the traveling salesman problem with distances 1 and 2. Zbl 1012.90044
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie
5
2003
Differential approximation results for the traveling salesman problem with distances 1 and 2 (extended abstract). Zbl 1003.90035
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie
5
2001
On-line maximum-order induced hereditary subgraph problems. Zbl 1043.68615
Demange, Marc; Paradon, Xavier; Paschos, Vangelis Th.
5
2000
The many facets of upper domination. Zbl 1388.68099
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
4
2018
Time-approximation trade-offs for inapproximable problems. Zbl 1380.68441
Bonnet, Édouard; Lampis, Michael; Paschos, Vangelis Th.
4
2016
Algorithmic aspects of Upper Domination: a parameterised perspective. Zbl 06649751
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
4
2016
New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set. Zbl 1328.68090
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.; Xiao, Mingyu
4
2015
On subexponential and FPT-time inapproximability. Zbl 1312.68232
Bonnet, Edouard; Escoffier, Bruno; Kim, Eun; Paschos, Vangelis
4
2015
Efficient algorithms for the max \(k\)-vertex cover problem. Zbl 1315.90056
Della Croce, Federico; Paschos, Vangelis Th.
4
2014
Approximating MAX SAT by moderately exponential and parameterized algorithms. Zbl 1303.68155
Escoffier, Bruno; Paschos, Vangelis Th.; Tourniaire, Emeric
4
2014
On the max min vertex cover problem. Zbl 1416.68131
Boria, Nicolas; Della Croce, Federico; Paschos, Vangelis Th.
4
2014
On subexponential and FPT-time inapproximability. Zbl 1309.68229
Bonnet, Edouard; Escoffier, Bruno; Kim, Eun Jung; Paschos, Vangelis Th.
4
2013
Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability. Zbl 1258.90040
Kacem, Imed; Paschos, Vangelis Th.
4
2013
On the probabilistic min spanning tree problem. Zbl 1382.05066
Boria, Nicolas; Murat, Cécile; Paschos, Vangelis
4
2012
The max quasi-independent set problem. Zbl 1244.90230
Bourgeois, N.; Giannakos, A.; Lucarelli, G.; Milis, I.; Paschos, V. T.; Pottié, O.
4
2012
On the max-weight edge coloring problem. Zbl 1207.05199
Lucarelli, Giorgio; Milis, Ioannis; Paschos, Vangelis T.
4
2010
Approximating the max-edge-coloring problem. Zbl 1196.68321
Bourgeois, N.; Lucarelli, G.; Milis, I.; Paschos, V. Th.
4
2010
A bottom-up method and fast algorithms for Max Independent Set. Zbl 1285.68060
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.; van Rooij, Johan M. M.
4
2010
Improved approximations for weighted and unweighted graph problems. Zbl 1085.68105
Demange, Marc; Paschos, Vangelis
4
2005
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem. Zbl 1154.90438
Della Croce, Federico; Grosso, Andrea; Paschos, Vangelis Th.
4
2003
Polynomial approximation and graph-coloring. Zbl 1018.05029
Paschos, V. Th.
4
2003
Polynomial approximation of hard NP-problems: local extremals and differential relation. Zbl 1140.90011
Monnot, Jérôme; Paschos, Vangelis T.; Toulouse, Sophie
4
2003
Sparsification and subexponential approximation. Zbl 1408.68068
Bonnet, Édouard; Paschos, Vangelis Th.
3
2018
Exponential approximation schemata for some network design problems. Zbl 1334.68300
Boria, Nicolas; Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
3
2013
New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set. Zbl 1329.68137
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.; Xiao, Mingyu
3
2012
Reoptimization of the maximum weighted \(P_{k }\)-free subgraph problem under vertex insertion. Zbl 1351.68306
Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis Th.
3
2012
Fast algorithms for min independent dominating set. Zbl 1284.05270
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
3
2010
An \(O ^{*}(1.0977^{n })\) exact algorithm for Max Independent Set in sparse graphs. Zbl 1142.68596
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
3
2008
Steiner forests on stochastic metric graphs. Zbl 1175.05119
Paschos, Vangelis Th.; Telelis, Orestis A.; Zissimopoulos, Vassilis
3
2007
Completeness in differential approximation classes. Zbl 1081.68121
Ausiello, Giorgio; Bazgan, Cristina; Demange, Marc; Paschos, Vangelis Th.
3
2005
Approximation algorithms for the traveling salesman problem. Zbl 1064.90572
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie
3
2002
A neural network for the minimum set covering problem. Zbl 0951.68543
Hifi, Mhand; Paschos, Vangelis Th.; Zissimopoulos, Vassilis
3
2000
Some steps towards the conciliation of approximation and optimization theory: a new suggested approximation measure and preliminary results. Zbl 0785.90074
Demange, Marc; Paschos, Vangelis Th.
3
1993
On the approximation of NP-complete problems by using the Boltzmann machine method: the cases of some covering and packing problems. Zbl 1395.68243
Zissimopoulos, V.; Paschos, V. Th.; Pekergin, F.
3
1991
Structural parameters, tight bounds, and approximation for \((k, r)\)-center. Zbl 1414.05102
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th.
2
2019
Exact and superpolynomial approximation algorithms for the densest K-subgraph problem. Zbl 1375.90296
Bourgeois, Nicolas; Giannakos, Aristotelis; Lucarelli, Giorgio; Milis, Ioannis; Paschos, Vangelis Th.
2
2017
When polynomial approximation meets exact computation. Zbl 1355.68128
Paschos, Vangelis Th.
2
2015
Online maximum \(k\)-coverage. Zbl 1246.05079
Ausiello, G.; Boria, N.; Giannakos, A.; Lucarelli, G.; Paschos, V. Th.
2
2012
Approximating MAX SAT by moderately exponential and parameterized algorithms. Zbl 1354.68298
Escoffier, Bruno; Paschos, Vangelis Th.; Tourniaire, Emeric
2
2012
A survey on the structure of approximation classes. Zbl 1300.68031
Escoffier, Bruno; Paschos, Vangelis Th.
2
2010
Approximating the metric 2-peripatetic salesman problem. Zbl 1277.90110
Della Croce, Federico; Paschos, Vangelis Th.; Wolfler Calvo, Roberto
2
2010
Probabilistic models for the Steiner tree problem. Zbl 1207.05184
Paschos, Vangelis Th.; Telelis, Orestis A.; Zissimopoulos, Vassilis
2
2010
The max quasi-independent set problem. Zbl 1285.68059
Bourgeois, N.; Giannakos, A.; Lucarelli, G.; Milis, I.; Paschos, V. Th.; Pottié, O.
2
2010
On the maximum edge coloring problem. (Extended abstract). Zbl 1209.68649
Lucarelli, Giorgio; Milis, Ioannis; Paschos, Vangelis Th.
2
2009
Improved worst-case complexity for the MIN 3-SET COVERING problem. Zbl 1123.68048
Della Croce, Federico; Escoffier, Bruno; Paschos, Vangelis Th.
2
2007
Probabilistic combinatorial optimization of graphs. Zbl 1119.90033
Murat, Cécile; Paschos, Vangelis Th.
2
2006
On-line models and algorithms for max independent set. Zbl 1110.68170
Escoffier, Bruno; Paschos, Vangelis Th.
2
2006
Structural parameters, tight bounds, and approximation for \((k, r)\)-center. Zbl 1414.05102
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th.
2
2019
The many facets of upper domination. Zbl 1388.68099
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
4
2018
Sparsification and subexponential approximation. Zbl 1408.68068
Bonnet, Édouard; Paschos, Vangelis Th.
3
2018
Multistage matchings. Zbl 07238962
Bampis, Evripidis; Escoffier, Bruno; Lampis, Michael; Paschos, Vangelis Th.
1
2018
Structurally parameterized \(d\)-Scattered Set. Zbl 06983014
Katsikarelis, Ioannis; Lampis, Michael; Th. Paschos, Vangelis
1
2018
Combinatorial approximation of maximum \(k\)-vertex cover in bipartite graphs within ratio 0,7. Zbl 1401.05238
Paschos, Vangelis Th.
1
2018
The probabilistic minimum dominating set problem. Zbl 1376.05107
Boria, Nicolas; Murat, Cécile; Paschos, Vangelis Th.
1
2018
Exact and superpolynomial approximation algorithms for the densest K-subgraph problem. Zbl 1375.90296
Bourgeois, Nicolas; Giannakos, Aristotelis; Lucarelli, Giorgio; Milis, Ioannis; Paschos, Vangelis Th.
2
2017
Structural parameters, tight bounds, and approximation for \((k,r)\)-center. Zbl 1457.68126
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th.
1
2017
Dual parameterization and parameterized approximability of subset graph problems. Zbl 1362.68290
Bonnet, Édouard; Paschos, Vangelis Th.
1
2017
Upper domination: complexity and approximation. Zbl 06631025
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
5
2016
Time-approximation trade-offs for inapproximable problems. Zbl 1380.68441
Bonnet, Édouard; Lampis, Michael; Paschos, Vangelis Th.
4
2016
Algorithmic aspects of Upper Domination: a parameterised perspective. Zbl 06649751
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis Th.
4
2016
Parameterized exact and approximation algorithms for maximum \(k\)-set cover and related satisfiability problems. Zbl 1400.68081
Bonnet, Édouard; Paschos, Vangelis Th.; Sikora, Florian
1
2016
A 0.821-ratio purely combinatorial algorithm for maximum \(k\)-vertex cover in bipartite graphs. Zbl 06576672
Bonnet, Édouard; Escoffier, Bruno; Paschos, Vangelis Th.; Stamoulis, Georgios
1
2016
On the max min vertex cover problem. Zbl 1321.05177
Boria, Nicolas; Della Croce, Federico; Paschos, Vangelis Th.
6
2015
Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization. Zbl 1312.68095
Bonnet, Édouard; Escoffier, Bruno; Paschos, Vangelis; Tourniaire, Émeric
6
2015
New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set. Zbl 1328.68090
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.; Xiao, Mingyu
4
2015
On subexponential and FPT-time inapproximability. Zbl 1312.68232
Bonnet, Edouard; Escoffier, Bruno; Kim, Eun; Paschos, Vangelis
4
2015
When polynomial approximation meets exact computation. Zbl 1355.68128
Paschos, Vangelis Th.
2
2015
Efficient algorithms for the max \(k\)-vertex cover problem. Zbl 1315.90056
Della Croce, Federico; Paschos, Vangelis Th.
4
2014
Approximating MAX SAT by moderately exponential and parameterized algorithms. Zbl 1303.68155
Escoffier, Bruno; Paschos, Vangelis Th.; Tourniaire, Emeric
4
2014
On the max min vertex cover problem. Zbl 1416.68131
Boria, Nicolas; Della Croce, Federico; Paschos, Vangelis Th.
4
2014
Parameterized (in)approximability of subset problems. Zbl 1408.68067
Bonnet, Édouard; Paschos, Vangelis Th.
1
2014
Fast algorithms for min independent dominating set. Zbl 1259.05161
Bourgeois, N.; Della Croce, F.; Escoffier, B.; Paschos, V. Th.
15
2013
Exact and approximation algorithms for densest \(k\)-subgraph (extended abstract). Zbl 1379.68378
Bourgeois, Nicolas; Giannakos, Aristotelis; Lucarelli, Giorgio; Milis, Ioannis; Paschos, Vangelis Th.
7
2013
Reoptimization of maximum weight induced hereditary subgraph problems. Zbl 1277.68085
Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis Th.
6
2013
On subexponential and FPT-time inapproximability. Zbl 1309.68229
Bonnet, Edouard; Escoffier, Bruno; Kim, Eun Jung; Paschos, Vangelis Th.
4
2013
Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability. Zbl 1258.90040
Kacem, Imed; Paschos, Vangelis Th.
4
2013
Exponential approximation schemata for some network design problems. Zbl 1334.68300
Boria, Nicolas; Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
3
2013
Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph. Zbl 1271.05063
Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis Th.
1
2013
Fast algorithms for max independent set. Zbl 1241.68087
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis T.; van Rooij, Johan M. M.
20
2012
On the probabilistic min spanning tree problem. Zbl 1382.05066
Boria, Nicolas; Murat, Cécile; Paschos, Vangelis
4
2012
The max quasi-independent set problem. Zbl 1244.90230
Bourgeois, N.; Giannakos, A.; Lucarelli, G.; Milis, I.; Paschos, V. T.; Pottié, O.
4
2012
New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set. Zbl 1329.68137
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.; Xiao, Mingyu
3
2012
Reoptimization of the maximum weighted \(P_{k }\)-free subgraph problem under vertex insertion. Zbl 1351.68306
Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis Th.
3
2012
Online maximum \(k\)-coverage. Zbl 1246.05079
Ausiello, G.; Boria, N.; Giannakos, A.; Lucarelli, G.; Paschos, V. Th.
2
2012
Approximating MAX SAT by moderately exponential and parameterized algorithms. Zbl 1354.68298
Escoffier, Bruno; Paschos, Vangelis Th.; Tourniaire, Emeric
2
2012
Algorithms for dominating clique problems. Zbl 1252.05160
Bourgeois, N.; Della Croce, F.; Escoffier, B.; Paschos, V. Th.
1
2012
Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Zbl 1248.90004
Mahjoub, A. Ridha (ed.); Markakis, Vangelis (ed.); Milis, Ioannis (ed.); Paschos, Vangelis Th. (ed.)
1
2012
Reoptimization of some maximum weight induced hereditary subgraph problems. Zbl 1297.68081
Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis Th.
1
2012
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Zbl 1237.05146
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
20
2011
A survey on combinatorial optimization in dynamic environments. Zbl 1254.90186
Boria, Nicolas; Paschos, Vangelis T.
7
2011
Fast reoptimization for the minimum spanning tree problem. Zbl 1192.90218
Boria, Nicolas; Paschos, Vangelis Th.
6
2010
Maximum Independent Set in graphs of average degree at most three in \({\mathcal O}(1.08537^n)\). Zbl 1284.68290
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.; van Rooij, Johan M. M.
5
2010
On the max-weight edge coloring problem. Zbl 1207.05199
Lucarelli, Giorgio; Milis, Ioannis; Paschos, Vangelis T.
4
2010
Approximating the max-edge-coloring problem. Zbl 1196.68321
Bourgeois, N.; Lucarelli, G.; Milis, I.; Paschos, V. Th.
4
2010
A bottom-up method and fast algorithms for Max Independent Set. Zbl 1285.68060
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.; van Rooij, Johan M. M.
4
2010
Fast algorithms for min independent dominating set. Zbl 1284.05270
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
3
2010
A survey on the structure of approximation classes. Zbl 1300.68031
Escoffier, Bruno; Paschos, Vangelis Th.
2
2010
Approximating the metric 2-peripatetic salesman problem. Zbl 1277.90110
Della Croce, Federico; Paschos, Vangelis Th.; Wolfler Calvo, Roberto
2
2010
Probabilistic models for the Steiner tree problem. Zbl 1207.05184
Paschos, Vangelis Th.; Telelis, Orestis A.; Zissimopoulos, Vassilis
2
2010
The max quasi-independent set problem. Zbl 1285.68059
Bourgeois, N.; Giannakos, A.; Lucarelli, G.; Milis, I.; Paschos, V. Th.; Pottié, O.
2
2010
Simple and fast reoptimizations for the Steiner tree problem. Zbl 1277.90138
Escoffier, Bruno; Milanič, Martin; Paschos, Vangelis Th.
20
2009
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Zbl 1173.05325
de Werra, D.; Demange, M.; Escoffier, B.; Monnot, J.; Paschos, V. Th.
16
2009
Efficient approximation of Min Set Cover by moderately exponential algorithms. Zbl 1166.68043
Bourgeois, N.; Escoffier, B.; Paschos, V. Th.
13
2009
Approximation of min coloring by moderately exponential algorithms. Zbl 1197.05141
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
9
2009
Reoptimization of minimum and maximum traveling salesman’s tours. Zbl 1180.90259
Ausiello, Giorgio; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis
8
2009
Efficient approximation of combinatorial problems by moderately exponential algorithms. Zbl 1253.68357
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
6
2009
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. Zbl 1169.90466
Baburin, A. E.; Della Croce, F.; Gimadi, E. K.; Glazkov, Y. V.; Paschos, V. Th.
6
2009
Probabilistic graph-coloring in bipartite and split graphs. Zbl 1206.05039
Bourgeois, N.; Della Croce, F.; Escoffier, B.; Murat, C.; Paschos, V. Th.
5
2009
On the maximum edge coloring problem. (Extended abstract). Zbl 1209.68649
Lucarelli, Giorgio; Milis, Ioannis; Paschos, Vangelis Th.
2
2009
Greedy algorithms for on-line set-covering. Zbl 1277.90106
Ausiello, Giorgio; Bourgeois, Nicolas; Giannakos, Telis; Paschos, Vangelis Th.
1
2009
Approximating the max edge-coloring problem. Zbl 1267.05112
Bourgeois, Nicolas; Lucarelli, Giorgio; Milis, Ioannis; Paschos, Vangelis Th.
1
2009
An \(O ^{*}(1.0977^{n })\) exact algorithm for Max Independent Set in sparse graphs. Zbl 1142.68596
Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis Th.
3
2008
Time slot scheduling of compatible jobs. Zbl 1154.90439
Demange, M.; de Werra, D.; Monnot, J.; Paschos, V. Th.
15
2007
An exact algorithm for MAX-CUT in sparse graphs. Zbl 1163.90767
Della Croce, F.; Kaminski, M. J.; Paschos, V. Th.
6
2007
Differential approximation of MIN SAT, MAX SAT and related problems. Zbl 1131.90080
Escoffier, Bruno; Paschos, Vangelis Th.
5
2007
Steiner forests on stochastic metric graphs. Zbl 1175.05119
Paschos, Vangelis Th.; Telelis, Orestis A.; Zissimopoulos, Vassilis
3
2007
Improved worst-case complexity for the MIN 3-SET COVERING problem. Zbl 1123.68048
Della Croce, Federico; Escoffier, Bruno; Paschos, Vangelis Th.
2
2007
Weighted coloring: further complexity and approximability results. Zbl 1181.68173
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
23
2006
Reoptimization of minimum and maximum traveling salesman’s tours. Zbl 1141.90506
Ausiello, Giorgio; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
21
2006
On the probabilistic minimum coloring and minimum \(k\)-coloring. Zbl 1087.05025
Murat, Cécile; Paschos, Vangelis Th.
7
2006
Completeness in approximation classes beyond APX. Zbl 1099.68135
Escoffier, Bruno; Paschos, Vangelis Th.
5
2006
Reductions, completeness and the hardness of approximability. Zbl 1111.90092
Ausiello, G.; Paschos, V. Th.
5
2006
Probabilistic combinatorial optimization of graphs. Zbl 1119.90033
Murat, Cécile; Paschos, Vangelis Th.
2
2006
On-line models and algorithms for max independent set. Zbl 1110.68170
Escoffier, Bruno; Paschos, Vangelis Th.
2
2006
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. Zbl 1068.68063
Bazgan, Cristina; Escoffier, Bruno; Paschos, Vangelis Th.
14
2005
On-line vertex-covering. Zbl 1070.68118
Demange, Marc; Paschos, Vangelis Th.
9
2005
On the differential approximation of MIN SET COVER. Zbl 1070.68153
Bazgan, Cristina; Monnot, Jérôme; Paschos, Vangelis Th.; Serriére, Fabrice
6
2005
A hypocoloring model for batch scheduling. Zbl 1115.68118
de Werra, D.; Demange, M.; Monnot, J.; Paschos, V. Th.
6
2005
Improved approximations for weighted and unweighted graph problems. Zbl 1085.68105
Demange, Marc; Paschos, Vangelis
4
2005
Completeness in differential approximation classes. Zbl 1081.68121
Ausiello, Giorgio; Bazgan, Cristina; Demange, Marc; Paschos, Vangelis Th.
3
2005
On-line maximum-order induced hereditary subgraph problems. Zbl 1063.90059
Demange, Marc; Paradon, Xavier; Paschos, Vangelis Th.
2
2005
Polynomial approximation algorithms with performance guarantees: an introduction-by-example. Zbl 1062.90053
Demange, Marc; Paschos, Vangelis Th.
2
2005
Proving completeness by logic. Zbl 1079.68042
Escoffier, Bruno; Paschos, Vangelis Th.
2
2005
Computing optimal solutions for the Min 3-Set Covering problem. Zbl 1175.68198
Della Croce, Federico; Paschos, Vangelis Th.
1
2005
Weighted coloring: Further complexity and approximability results. Zbl 1171.68611
Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis Th.
1
2005
A simulated annealing approach for the circular cutting problem. Zbl 1065.90082
Hifi, Mhand; Paschos, Vangelis Th.; Zissimopoulos, Vassilis
20
2004
Algorithms for the on-line quota traveling salesman problem. Zbl 1178.90282
Ausiello, G.; Demange, M.; Laura, L.; Paschos, V.
14
2004
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem. Zbl 1306.90048
Della Croce, Federico; Grosso, Andrea; Paschos, Vangelis Th.
6
2004
Weighted coloring on planar, bipartite and split graphs: Complexity and improved approximation. Zbl 1116.68565
de Werra, Dominique; Demange, Mare; Escoffier, Bruno; Monnot, Jerome; Paschos, Vangelis Th.
6
2004
Complexity and polynomial approximation. Zbl 1089.68045
Paschos, Vangelis Th.
2
2004
Poly-APX- and PTAS-completeness in standard and differential approximation (Extended abstract). Zbl 1116.68678
Bazgan, Cristina; Escoffier, Bruno; Paschos, Vangelis Th.
1
2004
Completeness in differential approximation classes. Zbl 1124.68365
Ausiello, G.; Bazgan, C.; Demange, M.; Paschos, V. Th.
6
2003
Differential approximation for optimal satisfiability and related problems. Zbl 1031.90025
Bazgan, Cristina; Paschos, Vangelis Th.
5
2003
Differential approximation results for the traveling salesman problem with distances 1 and 2. Zbl 1012.90044
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie
5
2003
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem. Zbl 1154.90438
Della Croce, Federico; Grosso, Andrea; Paschos, Vangelis Th.
4
2003
Polynomial approximation and graph-coloring. Zbl 1018.05029
Paschos, V. Th.
4
2003
Polynomial approximation of hard NP-problems: local extremals and differential relation. Zbl 1140.90011
Monnot, Jérôme; Paschos, Vangelis T.; Toulouse, Sophie
4
2003
...and 36 more Documents
all top 5

Cited by 624 Authors

76 Paschos, Vangelis Th.
31 Monnot, Jérôme
26 Escoffier, Bruno
17 Demange, Marc
11 Bazgan, Cristina
11 Boria, Nicolas
10 Bourgeois, Nicolas
10 Manoussakis, Yannis G.
9 Della Croce, Federico
8 Ausiello, Giorgio
8 Böckenhauer, Hans-Joachim
8 Levit, Vadim E.
8 Lucarelli, Giorgio
8 Mandrescu, Eugen
8 Xiao, Mingyu
7 Bonnet, Edouard
7 Fernau, Henning
7 Hifi, Mhand
7 Murat, Cécile
7 Zissimopoulos, Vassilis
6 Mikhailyuk, Victor A.
6 Milis, Ioannis
6 Mömke, Tobias
6 Nagamochi, Hiroshi
5 Branković, Ljiljana
5 de Werra, Dominique
5 Zehavi, Meirav
4 Bilò, Davide
4 Borozan, Valentin
4 Casel, Katrin
4 Cygan, Marek
4 Hromkovič, Juraj
4 Komm, Dennis
4 Královič, Richard
4 Lampis, Michael
4 Lokshtanov, Daniel
4 M’Hallah, Rym
4 Nace, Dritan
4 Punnen, Abraham P.
4 Saurabh, Saket
4 Shachnai, Hadas
4 Sikora, Florian
4 Sirdey, Renaud
4 Strusevich, Vitaly A.
4 van Rooij, Johan M. M.
4 Zych, Anna
3 Águeda, Raquel
3 Bonifaci, Vincenzo
3 Bougeret, Marin
3 Carlier, Jacques G.
3 Chang, Maw-Shang
3 Chen, Li-Hsuan
3 Ekim, Tınaz
3 Feldmann, Andreas Emil
3 Fujito, Toshihiro
3 Giannakos, Aristotelis
3 Gimadi, Edward Khairutdinovich
3 Halldórsson, Magnús Mar
3 Hassin, Refael
3 Hung, Ling-Ju
3 Khachay, Mikhail Yur’evich
3 Koulamas, Christos P.
3 Laura, Luigi
3 Liedloff, Mathieu
3 Malaguti, Enrico
3 Martinhon, Carlos Alberto
3 Mendy, Gervais
3 Montero, Leandro P.
3 Neznakhina, Katherine
3 Puerto Albandoz, Justo
3 Rossmanith, Peter
3 Saad, Rachid
3 Sprock, Andreas
3 Tamir, Tami
3 Toulouse, Sophie
3 Tourniaire, Emeric
2 Abouelaoualim, A.
2 Akeb, Hakim
2 Alfandari, Laurent
2 Araújo, Júlio César Silva
2 Baburin, Alexey E.
2 Bampis, Evripidis
2 Bodlaender, Hans L.
2 Bortfeldt, Andreas
2 Boudhar, Mourad
2 Boyar, Joan F.
2 Chalermsook, Parinya
2 Chopin, Morgan
2 Das, Kinkar Chandra
2 Delbot, François
2 Dvořák, Zdeněk
2 Epstein, Leah
2 Eto, Hiroshi
2 Ferber, Aaron
2 Fernandez de la Vega, Wenceslas
2 Fernández, Elena
2 Fomin, Fedor V.
2 Fountoulakis, Nikolaos
2 Freund, Daniel
2 Furini, Fabio
...and 524 more Authors
all top 5

Cited in 73 Serials

45 Theoretical Computer Science
42 Discrete Applied Mathematics
32 European Journal of Operational Research
21 Information Processing Letters
17 Algorithmica
12 RAIRO. Operations Research
11 Computers & Operations Research
11 Journal of Combinatorial Optimization
10 Journal of Discrete Algorithms
9 Operations Research Letters
9 Theory of Computing Systems
8 Annals of Operations Research
6 Cybernetics and Systems Analysis
6 Discrete Optimization
5 Chaos, Solitons and Fractals
5 Information Sciences
5 European Journal of Combinatorics
5 Graphs and Combinatorics
4 Discrete Mathematics
4 Journal of Heuristics
4 Optimization Letters
3 Journal of Computer and System Sciences
3 Networks
3 SIAM Journal on Computing
3 Applied Mathematics Letters
3 SIAM Journal on Discrete Mathematics
3 Journal of Global Optimization
3 Computational Optimization and Applications
3 International Transactions in Operational Research
3 Journal of Scheduling
3 Journal of Applied Mathematics
2 Journal of Graph Theory
2 Naval Research Logistics
2 Information and Computation
2 International Journal of Foundations of Computer Science
2 Automation and Remote Control
2 CEJOR. Central European Journal of Operations Research
2 JMMA. Journal of Mathematical Modelling and Algorithms
2 4OR
2 Proceedings of the Steklov Institute of Mathematics
2 Discrete Mathematics, Algorithms and Applications
2 Computer Science Review
1 Acta Informatica
1 Artificial Intelligence
1 Fuzzy Sets and Systems
1 Journal of Optimization Theory and Applications
1 Mathematics of Operations Research
1 Bulletin of the Korean Mathematical Society
1 Statistics & Probability Letters
1 Computer Aided Geometric Design
1 Acta Mathematicae Applicatae Sinica. English Series
1 Optimization
1 Discrete & Computational Geometry
1 Asia-Pacific Journal of Operational Research
1 Computational Geometry
1 International Journal of Computer Mathematics
1 Mathematical Programming. Series A. Series B
1 Advances in Engineering Software
1 Journal of Computer and Systems Sciences International
1 The Electronic Journal of Combinatorics
1 Constraints
1 Doklady Mathematics
1 Optimization Methods & Software
1 Journal of Graph Algorithms and Applications
1 Annals of Combinatorics
1 RAIRO. Theoretical Informatics and Applications
1 International Journal of Intelligent Computing and Cybernetics
1 Operational Research. An International Journal
1 Algorithms
1 Advances in Operations Research
1 RAIRO. Theoretical Informatics and Applications
1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ
1 Journal of Mathematical Modeling

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.