default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVangelis Th. Paschos
Person information
- affiliation: PSL Research University, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j107]Tom Denat, Ararat Harutyunyan, Nikolaos Melissinos, Vangelis Th. Paschos:
Average-case complexity of a branch-and-bound algorithm for Min Dominating Set. Discret. Appl. Math. 345: 4-8 (2024)- 2023
- [j106]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Improved (In-)Approximability Bounds for d-Scattered Set. J. Graph Algorithms Appl. 27(3): 219-238 (2023) - 2022
- [j105]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structurally parameterized d-scattered set. Discret. Appl. Math. 308: 168-186 (2022) - [j104]Bruno Escoffier, Laurent Gourvès, Vangelis Th. Paschos:
In memory of Jérôme Monnot. Theor. Comput. Sci. 921: 1-3 (2022) - [j103]Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation. Theor. Comput. Sci. 923: 271-291 (2022) - 2021
- [j102]Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
New Algorithms for Mixed Dominating Set. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [c58]Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation. CIAC 2021: 202-215 - [c57]Nicolas Boria, Laurent Gourvès, Vangelis Th. Paschos, Jérôme Monnot:
The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet. WABI 2021: 5:1-5:12 - [i22]Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation. CoRR abs/2101.07550 (2021) - 2020
- [c56]Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
New Algorithms for Mixed Dominating Set. IPEC 2020: 9:1-9:17
2010 – 2019
- 2019
- [j101]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structural parameters, tight bounds, and approximation for (k, r)-center. Discret. Appl. Math. 264: 90-117 (2019) - [j100]Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos:
Preface to Special Issue on Algorithms and Complexity. Theor. Comput. Sci. 754: 1-2 (2019) - [c55]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Improved (In-)Approximability Bounds for d-Scattered Set. WAOA 2019: 202-216 - [i21]Tom Denat, Ararat Harutyunyan, Vangelis Th. Paschos:
Average-case complexity of a branch-and-bound algorithm for min dominating set. CoRR abs/1902.01874 (2019) - [i20]Vangelis Th. Paschos:
A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs. CoRR abs/1909.08435 (2019) - [i19]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Improved (In-)Approximability Bounds for d-Scattered Set. CoRR abs/1910.05589 (2019) - [i18]Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
New Algorithms for Mixed Dominating Set. CoRR abs/1911.08964 (2019) - 2018
- [j99]Édouard Bonnet, Vangelis Th. Paschos:
Sparsification and subexponential approximation. Acta Informatica 55(1): 1-15 (2018) - [j98]Vangelis Th. Paschos:
When polynomial approximation meets exact computation. Ann. Oper. Res. 271(1): 87-103 (2018) - [j97]Nicolas Boria, Cécile Murat, Vangelis Th. Paschos:
The probabilistic minimum dominating set problem. Discret. Appl. Math. 234: 93-113 (2018) - [j96]Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis:
Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs. Discret. Optim. 27: 26-56 (2018) - [j95]Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos:
Time-approximation trade-offs for inapproximable problems. J. Comput. Syst. Sci. 92: 171-180 (2018) - [j94]Vangelis Th. Paschos:
Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio 0.7. RAIRO Oper. Res. 52(1): 305-314 (2018) - [j93]Cristina Bazgan, Ljiljana Brankovic
, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
The many facets of upper domination. Theor. Comput. Sci. 717: 2-25 (2018) - [c54]Evripidis Bampis, Bruno Escoffier, Michael Lampis, Vangelis Th. Paschos:
Multistage Matchings. SWAT 2018: 7:1-7:13 - [c53]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structurally Parameterized d-Scattered Set. WG 2018: 292-305 - [p2]Giorgio Ausiello, Vangelis Th. Paschos:
Reductions That Preserve Approximability. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 243-258 - [p1]Giorgio Ausiello, Vangelis Th. Paschos:
Differential Ratio Approximation. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 259-274 - 2017
- [j92]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Exact and superpolynomial approximation algorithms for the densest k-subgraph problem. Eur. J. Oper. Res. 262(3): 894-903 (2017) - [j91]Édouard Bonnet, Vangelis Th. Paschos:
Dual parameterization and parameterized approximability of subset graph problems. RAIRO Oper. Res. 51(1): 261-266 (2017) - [c52]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. ISAAC 2017: 50:1-50:13 - [e4]Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos:
Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings. Lecture Notes in Computer Science 10236, 2017, ISBN 978-3-319-57585-8 [contents] - [i17]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. CoRR abs/1704.08868 (2017) - [i16]Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structurally Parameterized $d$-Scattered Set. CoRR abs/1709.02180 (2017) - 2016
- [j90]Édouard Bonnet, Vangelis Th. Paschos, Florian Sikora:
Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems. RAIRO Theor. Informatics Appl. 50(3): 227-240 (2016) - [j89]Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Super-polynomial approximation branching algorithms. RAIRO Oper. Res. 50(4-5): 979-994 (2016) - [c51]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Algorithmic Aspects of Upper Domination: A Parameterised Perspective. AAIM 2016: 113-124 - [c50]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Upper Domination: Complexity and Approximation. IWOCA 2016: 241-252 - [c49]Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis:
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. LATIN 2016: 235-248 - [c48]Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos:
Time-Approximation Trade-offs for Inapproximable Problems. STACS 2016: 22:1-22:14 - [c47]Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos:
Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse. STACS 2016: 37:1-37:14 - 2015
- [j88]Vangelis Th. Paschos:
When polynomial approximation meets exact computation. 4OR 13(3): 227-245 (2015) - [j87]Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos:
On Subexponential and FPT-Time Inapproximability. Algorithmica 71(3): 541-565 (2015) - [j86]Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization. Algorithmica 71(3): 566-580 (2015) - [j85]Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos:
On the max min vertex cover problem. Discret. Appl. Math. 196: 62-71 (2015) - [j84]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao:
New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. Theory Comput. Syst. 56(2): 330-346 (2015) - [e3]Vangelis Th. Paschos, Peter Widmayer:
Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings. Lecture Notes in Computer Science 9079, Springer 2015, ISBN 978-3-319-18172-1 [contents] - [i15]Edouard Bonnet, Michael Lampis, Vangelis Th. Paschos:
Time-Approximation Trade-offs for Inapproximable Problems. CoRR abs/1502.05828 (2015) - [i14]Vangelis Th. Paschos:
Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio~0.7. CoRR abs/1502.07930 (2015) - [i13]Nicolas Bourgeois, R. Catellier, Tom Denat, Vangelis Th. Paschos:
Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n, p)$ random model. CoRR abs/1505.04969 (2015) - [i12]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Algorithmic Aspects of Upper Domination. CoRR abs/1506.07260 (2015) - [i11]Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos:
Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse. CoRR abs/1507.04391 (2015) - 2014
- [j83]Federico Della Croce, Vangelis Th. Paschos:
Efficient algorithms for the max k-vertex cover problem. J. Comb. Optim. 28(3): 674-691 (2014) - [j82]Edouard Bonnet, Vangelis Th. Paschos:
Parameterized (in)approximability of subset problems. Oper. Res. Lett. 42(3): 222-225 (2014) - [j81]Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos:
Special Issue: "Combinatorial Optimization: Theory of Algorithms and Complexity". Theor. Comput. Sci. 540: 1 (2014) - [j80]Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Approximating MAX SAT by moderately exponential and parameterized algorithms. Theor. Comput. Sci. 560: 147-157 (2014) - [e2]Pierre Fouilhoux, Luis Eduardo Neves Gouveia, Ali Ridha Mahjoub, Vangelis Th. Paschos:
Combinatorial Optimization - Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8596, Springer 2014, ISBN 978-3-319-09173-0 [contents] - [i10]Edouard Bonnet, Vangelis Th. Paschos:
Sparsification and subexponential approximation. CoRR abs/1402.2843 (2014) - [i9]Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis:
On the approximation of maximum $k$-vertex cover in bipartite graphs. CoRR abs/1409.6952 (2014) - 2013
- [j79]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Fast algorithms for min independent dominating set. Discret. Appl. Math. 161(4-5): 558-572 (2013) - [j78]Imed Kacem, Vangelis Th. Paschos:
Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability. Discret. Optim. 10(1): 61-68 (2013) - [j77]Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization under Vertex Insertion: Max PK-Free Subgraph and Max Planar Subgraph. Discret. Math. Algorithms Appl. 5(2) (2013) - [j76]Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Exponential approximation schemata for some network design problems. J. Discrete Algorithms 22: 43-52 (2013) - [j75]Vangelis Th. Paschos:
Preface. Theor. Comput. Sci. 511: 1 (2013) - [j74]Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of maximum weight induced hereditary subgraph problems. Theor. Comput. Sci. 514: 61-74 (2013) - [c46]Nicolas Boria, Cécile Murat, Vangelis Th. Paschos:
The Probabilistic Min Dominating Set Problem. CSR 2013: 298-309 - [c45]Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos:
On Subexponential and FPT-Time Inapproximability. IPEC 2013: 54-65 - [c44]Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization. IPEC 2013: 66-77 - [c43]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Exact and Approximation Algorithms for Densest k-Subgraph. WALCOM 2013: 114-125 - [c42]Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos:
On the max min vertex cover Problem. WAOA 2013: 37-48 - [i8]Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization. CoRR abs/1306.2217 (2013) - [i7]Edouard Bonnet, Vangelis Th. Paschos, Florian Sikora:
Multiparameterizations for max $k$-set cover and related satisfiability problems. CoRR abs/1309.4718 (2013) - [i6]Nicolas Bourgeois, Konrad K. Dabrowski, Marc Demange, Vangelis Th. Paschos:
Playing with Parameters: Cross-parameterization in Graphs. CoRR abs/1309.6144 (2013) - [i5]Edouard Bonnet, Vangelis Th. Paschos:
Parameterized (in)approximability of subset problems. CoRR abs/1310.5576 (2013) - 2012
- [j73]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
Fast Algorithms for max independent set. Algorithmica 62(1-2): 382-415 (2012) - [j72]Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos:
Online maximum k-coverage. Discret. Appl. Math. 160(13-14): 1901-1913 (2012) - [j71]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié:
The max quasi-independent set problem. J. Comb. Optim. 23(1): 94-117 (2012) - [j70]Nicolas Boria, Cécile Murat, Vangelis Th. Paschos:
On the probabilistic min spanning tree Problem. J. Math. Model. Algorithms 11(1): 45-76 (2012) - [j69]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Algorithms for dominating clique problems. Theor. Comput. Sci. 459: 77-88 (2012) - [c41]Federico Della Croce, Vangelis Th. Paschos:
Efficient Algorithms for the max k -vertex cover Problem. IFIP TCS 2012: 295-309 - [c40]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao:
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. IPEC 2012: 25-36 - [c39]Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. LATIN 2012: 73-84 - [c38]Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms. TAMC 2012: 202-213 - [c37]Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. WALCOM 2012: 76-87 - [e1]Ali Ridha Mahjoub, Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos:
Combinatorial Optimization - Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7422, Springer 2012, ISBN 978-3-642-32146-7 [contents] - [i4]Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos:
Subexponential and FPT-time Inapproximability of Independent Set and Related Problems. CoRR abs/1211.6656 (2012) - 2011
- [j68]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discret. Appl. Math. 159(17): 1954-1970 (2011) - [j67]Nicolas Boria, Vangelis Th. Paschos:
A survey on combinatorial optimization in dynamic environments. RAIRO Oper. Res. 45(3): 241-294 (2011) - [c36]Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos:
Online Maximum k-Coverage. FCT 2011: 181-192 - 2010
- [j66]Federico Della Croce, Vangelis Th. Paschos, Roberto Wolfler Calvo:
Approximating the metric 2-Peripatetic Salesman Problem. Algorithmic Oper. Res. 5(1): 13-20 (2010) - [j65]Cécile Murat, Vangelis Th. Paschos:
Probabilistic optimization in graph-problems. Algorithmic Oper. Res. 5(1): 49-64 (2010) - [j64]Bruno Escoffier, Vangelis Th. Paschos:
A survey on the structure of approximation classes. Comput. Sci. Rev. 4(1): 19-40 (2010) - [j63]Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
On the max-weight edge coloring problem. J. Comb. Optim. 20(4): 429-442 (2010) - [j62]Nicolas Boria, Vangelis Th. Paschos:
Fast reoptimization for the minimum spanning tree problem. J. Discrete Algorithms 8(3): 296-310 (2010) - [j61]Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos:
Probabilistic models for the Steiner Tree problem. Networks 56(1): 39-49 (2010) - [j60]Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Approximating the max-edge-coloring problem. Theor. Comput. Sci. 411(34-36): 3055-3067 (2010) - [c35]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié:
The max quasi-independent set Problem. CSR 2010: 60-71 - [c34]Nicolas Boria, Cécile Murat, Vangelis Th. Paschos:
On the Probabilistic min spanning tree problem. IMCSIT 2010: 893-900 - [c33]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Fast Algorithms for min independent dominating set. SIROCCO 2010: 247-261 - [c32]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
A Bottom-Up Method and Fast Algorithms for max independent set. SWAT 2010: 62-73 - [c31]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){\mathcal O}(1.08537^n). TAMC 2010: 373-384
2000 – 2009
- 2009
- [j59]Giorgio Ausiello, Nicolas Bourgeois, Telis Giannakos, Vangelis Th. Paschos:
Greedy Algorithms For On-Line Set-Covering. Algorithmic Oper. Res. 4(1): 36-48 (2009) - [j58]Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos:
Simple and Fast Reoptimizations for the Steiner Tree Problem. Algorithmic Oper. Res. 4(2): 86-94 (2009) - [j57]Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discret. Appl. Math. 157(4): 819-832 (2009) - [j56]Alexey Baburin, Federico Della Croce, Edward Gimadi, Y. V. Glazkov, Vangelis Th. Paschos:
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. Discret. Appl. Math. 157(9): 1988-1992 (2009) - [j55]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Approximation of min coloring by moderately exponential algorithms. Inf. Process. Lett. 109(16): 950-954 (2009) - [j54]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) - [j53]Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of minimum and maximum traveling salesman's tours. J. Discrete Algorithms 7(4): 453-463 (2009) - [j52]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) - [c30]Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos:
Exact Algorithms for Dominating Clique Problems. ISAAC 2009: 4-13 - [c29]Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Approximating the Max Edge-Coloring Problem. IWOCA 2009: 83-94 - [c28]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. WADS 2009: 507-518 - [i3]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) - [i2]Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Max Edge Coloring of Trees. CoRR abs/0901.4002 (2009) - [i1]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Fast algorithms for min independent dominating set. CoRR abs/0905.1993 (2009) - 2008
- [b1]Vangelis Th. Paschos:
Combinatorial Optimization and Theoretical Computer Science - Interfaces and Perspectives: 30th Anniversary of the LAMSADE. Wiley 2008, ISBN 978-1-8482-1021-9, pp. 1-515 - [j51]Federico Della Croce, Vangelis Th. Paschos:
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems. Oper. Res. 8(3): 235-256 (2008) - [c27]Cécile Murat, Vangelis Th. Paschos:
Vertex-Uncertainty in Graph-Problems. COCOA 2008: 139-148 - [c26]Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs. IWPEC 2008: 55-65 - [c25]Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
On the Maximum Edge Coloring Problem. WAOA 2008: 279-292 - 2007
- [j50]Bruno Escoffier, Vangelis Th. Paschos:
Differential approximation of min sat. Eur. J. Oper. Res. 181(2): 620-633 (2007) - [j49]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) - [j48]Federico Della Croce, Marcin Jakub Kaminski, Vangelis Th. Paschos:
An exact algorithm for MAX-CUT in sparse graphs. Oper. Res. Lett. 35(3): 403-408 (2007) - [j47]Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos:
Time slot scheduling of compatible jobs. J. Sched. 10(2): 111-127 (2007) - [c24]Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos:
Steiner Forests on Stochastic Metric Graphs. COCOA 2007: 112-123 - [c23]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 - [r2]Giorgio Ausiello, Vangelis Th. Paschos:
Reductions That Preserve Approximability. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r1]Giorgio Ausiello, Vangelis Th. Paschos:
Differential Ratio Approximation. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j46]Cécile Murat, Vangelis Th. Paschos:
On the probabilistic minimum coloring and minimum k-coloring. Discret. Appl. Math. 154(3): 564-586 (2006) - [j45]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. Electron. Notes Discret. Math. 27: 35-36 (2006) - [j44]Vangelis Th. Paschos:
Jon Lee, A First Course in Combinatorial Optimization, Cambridge Texts in Applied Mathematics. Eur. J. Oper. Res. 168(3): 1042-1044 (2006) - [j43]Giorgio Ausiello, Vangelis Th. Paschos:
Reductions, completeness and the hardness of approximability. Eur. J. Oper. Res. 172(3): 719-739 (2006) - [j42]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted Coloring: further complexity and approximability results. Inf. Process. Lett. 97(3): 98-103 (2006) - [j41]Bruno Escoffier, Vangelis Th. Paschos:
On-line models and algorithms for max independent set. RAIRO Oper. Res. 40(2): 129-142 (2006) - [j40]Bruno Escoffier, Vangelis Th. Paschos:
Completeness in approximation classes beyond APX. Theor. Comput. Sci. 359(1-3): 369-377 (2006) - [c22]Giorgio Ausiello, Aristotelis Giannakos, Vangelis Th. Paschos:
Greedy algorithms for on-line set-covering and related problems. CATS 2006: 145-151 - [c21]Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of Minimum and Maximum Traveling Salesman's Tours. SWAT 2006: 196-207 - 2005
- [j39]Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos:
A hypocoloring model for batch scheduling. Discret. Appl. Math. 146(1): 3-26 (2005) - [j38]Marc Demange, Vangelis Th. Paschos:
Polynomial approximation algorithms with performance guarantees: An introduction-by-example. Eur. J. Oper. Res. 165(3): 555-568 (2005) - [j37]Bruno Escoffier, Vangelis Th. Paschos:
Proving completeness by logic. Int. J. Comput. Math. 82(2): 151-161 (2005) - [j36]Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos:
Completeness in differential approximation classes. Int. J. Found. Comput. Sci. 16(6): 1267-1295 (2005) - [j35]Marc Demange, Xavier Paradon, Vangelis Th. Paschos:
On-line maximum-order induced hereditary subgraph problems. Int. Trans. Oper. Res. 12(2): 185-201 (2005) - [j34]Marc Demange, Vangelis Th. Paschos:
Improved Approximations for Weighted and Unweighted Graph Problems. Theory Comput. Syst. 38(6): 763-787 (2005) - [j33]Marc Demange, Vangelis Th. Paschos:
On-line vertex-covering. Theor. Comput. Sci. 332(1-3): 83-108 (2005) - [j32]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) - [j31]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) - [c20]Bruno Escoffier, Vangelis Th. Paschos:
Differential Approximation of min sat, max sat and Related Problems. ICCSA (4) 2005: 192-201 - [c19]Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos:
Probabilistic Coloring of Bipartite and Split Graphs. ICCSA (4) 2005: 202-211 - [c18]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted Coloring: Further Complexity and Approximability Results. ICTCS 2005: 205-214 - [c17]Federico Della Croce, Vangelis Th. Paschos:
Computing Optimal Solutions for the min 3-set covering Problem. ISAAC 2005: 685-692 - [c16]Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière:
Greedy Differential Approximations for Min Set Cover. SOFSEM 2005: 62-71 - 2004
- [j30]Mhand Hifi, Vangelis Th. Paschos, Vassilis Zissimopoulos:
A simulated annealing approach for the circular cutting problem. Eur. J. Oper. Res. 159(2): 430-448 (2004) - [j29]Tínaz 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) - [j28]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) - [j27]Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Local approximations for maximum partial subgraph problem. Oper. Res. Lett. 32(3): 217-224 (2004) - [j26]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. Sched. 7(1): 85-91 (2004) - [c15]Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos:
Algorithms for the On-Line Quota Traveling Salesman Problem. COCOON 2004: 290-299 - [c14]Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos:
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. ISAAC 2004: 124-136 - [c13]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 - [c12]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 - 2003
- [j25]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) - [j24]Vangelis Th. Paschos:
Polynomial Approximation and Graph-Coloring. Computing 70(1): 41-86 (2003) - [j23]Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Differential approximation results for the traveling salesman problem with distances 1 and 2. Eur. J. Oper. Res. 145(3): 557-568 (2003) - [j22]Cristina Bazgan, Vangelis Th. Paschos:
Differential approximation for optimal satisfiability and related problems. Eur. J. Oper. Res. 147(2): 397-404 (2003) - [j21]Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Approximation algorithms for the traveling salesman problem. Math. Methods Oper. Res. 56(3): 387-405 (2003) - [j20]Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Optima locaux garantis pour l'approximation différentielle. Tech. Sci. Informatiques 22(3): 257-288 (2003) - [c11]Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos:
Completeness in Differential Approximation Classes. MFCS 2003: 179-188 - [c10]Cécile Murat, Vangelis Th. Paschos:
The Probabilistic Minimum Coloring Problem. WG 2003: 346-357 - 2002
- [j19]Marc Demange, Vangelis Th. Paschos:
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation. RAIRO Oper. Res. 36(3): 237-277 (2002) - [j18]Marc Demange, Vangelis Th. Paschos:
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances. RAIRO Oper. Res. 36(4): 311-350 (2002) - [j17]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) - [c9]Marc Demange, Vangelis Th. Paschos:
Algorithms and Models for the On-Line Vertex-Covering. WG 2002: 102-113 - [c8]Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos:
Weighted Node Coloring: When Stable Sets Are Expensive. WG 2002: 114-125 - 2001
- [j16]Vangelis Th. Paschos:
On-line independent set by coloring vertices. Oper. Res. 1(3): 213-224 (2001) - [c7]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 - 2000
- [j15]Laurent Alfandari, Vangelis Th. Paschos:
Master-Slave Strategy and Polynomial Approximation. Comput. Optim. Appl. 16(3): 231-245 (2000) - [c6]Marc Demange, Xavier Paradon, Vangelis Th. Paschos:
On-Line Maximum-Order Induces Hereditary Subgraph Problems. SOFSEM 2000: 327-335
1990 – 1999
- 1999
- [j14]Cécile Murat, Vangelis Th. Paschos:
The probabilistic longest path problem. Networks 33(3): 207-219 (1999) - [j13]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) - [j12]Marc Demange, Vangelis Th. Paschos:
Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems. RAIRO Oper. Res. 33(4): 481-507 (1999) - 1998
- [j11]Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Andreas Stafylopatis:
Average-Case Complexity for the Execution of Recursive Definitions on Relational Databases. Acta Informatica 35(3): 211-243 (1998) - [j10]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
- [j9]Virginie Gabrel, Alain Moulet, Cécile Murat, Vangelis Th. Paschos:
A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts. Ann. Oper. Res. 69: 115-134 (1997) - [j8]Marc Demange, Vangelis Th. Paschos:
The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems. Comput. Optim. Appl. 7(3): 307-324 (1997) - [j7]Vangelis Th. Paschos:
A Survey of Approximately Optimal Solutions to Some Covering and Packing Problems. ACM Comput. Surv. 29(2): 171-209 (1997) - 1996
- [j6]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
- [j5]Joël 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) - [c5]Marc Demange, Vangelis Th. Paschos:
Constructive - Non-constructive Approximation and Maximum Independent Set Problem. Combinatorics and Computer Science 1995: 194-207 - 1994
- [j4]Marc Demange, Pascal Grisoni, Vangelis Th. Paschos:
Approximation Results for the Minimum Graph Coloring Problem. Inf. Process. Lett. 50(1): 19-23 (1994) - 1992
- [j3]Vangelis Th. Paschos, Andreas Stafylopatis:
Evaluation of the Execution Cost of Recursive Definitions. Comput. J. 35(Additional-Papers): A429-A437 (1992) - [j2]Vangelis Th. Paschos:
A (Delta/2)-Approximation Algorithm for the Maximum Independent Set Problem. Inf. Process. Lett. 44(1): 11-13 (1992) - [c4]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 - 1991
- [j1]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) - [c3]Vangelis Th. Paschos:
A Theorem on the Approximation of Set Cover and Vertex Cover. FSTTCS 1991: 278-287 - [c2]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 - [c1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
