Vangelis Th. Paschos

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 48

Top Venues

CoRR

Theor. Comput. Sci.

Discret. Appl. Math.

RAIRO Oper. Res.

Publications

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 (2024)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Improved (In-)Approximability Bounds for d-Scattered Set. J. Graph Algorithms Appl. 27 (3) (2023)
Bruno Escoffier, Laurent Gourvès, Vangelis Th. Paschos
In memory of Jérôme Monnot. Theor. Comput. Sci. 921 (2022)
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation. Theor. Comput. Sci. 923 (2022)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Structurally parameterized d-scattered set. Discret. Appl. Math. 308 (2022)
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
New Algorithms for Mixed Dominating Set. Discret. Math. Theor. Comput. Sci. 23 (1) (2021)
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation. CIAC (2021)
Nicolas Boria, Laurent Gourvès, Vangelis Th. Paschos, Jérôme Monnot
The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet. WABI (2021)
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation. CoRR (2021)
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
New Algorithms for Mixed Dominating Set. IPEC (2020)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Structural parameters, tight bounds, and approximation for (k, r)-center. Discret. Appl. Math. 264 (2019)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Improved (In-)Approximability Bounds for d-Scattered Set. CoRR (2019)
Tom Denat, Ararat Harutyunyan, Vangelis Th. Paschos
Average-case complexity of a branch-and-bound algorithm for min dominating set. CoRR (2019)
Louis Dublois, Michael Lampis, Vangelis Th. Paschos
New Algorithms for Mixed Dominating Set. CoRR (2019)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Improved (In-)Approximability Bounds for d-Scattered Set. WAOA (2019)
Vangelis Th. Paschos
A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs. CoRR (2019)
Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos
Preface to Special Issue on Algorithms and Complexity. Theor. Comput. Sci. 754 (2019)
Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
The probabilistic minimum dominating set problem. Discret. Appl. Math. 234 (2018)
Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs. Discret. Optim. 27 (2018)
Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos
Time-approximation trade-offs for inapproximable problems. J. Comput. Syst. Sci. 92 (2018)
Evripidis Bampis, Bruno Escoffier, Michael Lampis, Vangelis Th. Paschos
Multistage Matchings. SWAT (2018)
Vangelis Th. Paschos
-vertex cover in bipartite graphs within ratio 0.7. RAIRO Oper. Res. 52 (1) (2018)
Vangelis Th. Paschos
When polynomial approximation meets exact computation. Ann. Oper. Res. 271 (1) (2018)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Structurally Parameterized d-Scattered Set. WG (2018)
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 (2018)
Édouard Bonnet, Vangelis Th. Paschos
Sparsification and subexponential approximation. Acta Informatica 55 (1) (2018)
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) (2017)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. CoRR (2017)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. ISAAC (2017)
Édouard Bonnet, Vangelis Th. Paschos
Dual parameterization and parameterized approximability of subset graph problems. RAIRO Oper. Res. 51 (1) (2017)
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
Structurally Parameterized $d$-Scattered Set. CoRR (2017)
Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos
Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse. STACS (2016)
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)
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)
É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)
Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
Super-polynomial approximation branching algorithms. RAIRO Oper. Res. 50 (4-5) (2016)
Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos
Time-Approximation Trade-offs for Inapproximable Problems. STACS (2016)
Édouard Bonnet, Vangelis Th. Paschos, Florian Sikora
-set cover and related satisfiability problems. RAIRO Theor. Informatics Appl. 50 (3) (2016)
Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization. Algorithmica 71 (3) (2015)
Edouard Bonnet, Michael Lampis, Vangelis Th. Paschos
Time-Approximation Trade-offs for Inapproximable Problems. CoRR (2015)
Vangelis Th. Paschos
Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio~0.7. CoRR (2015)
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 (2015)
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) (2015)
Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos
Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse. CoRR (2015)
Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
On Subexponential and FPT-Time Inapproximability. Algorithmica 71 (3) (2015)
Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos
On the max min vertex cover problem. Discret. Appl. Math. 196 (2015)
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 (2015)
Vangelis Th. Paschos
When polynomial approximation meets exact computation. 4OR 13 (3) (2015)
Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
Approximating MAX SAT by moderately exponential and parameterized algorithms. Theor. Comput. Sci. 560 (2014)
Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos
Special Issue: "Combinatorial Optimization: Theory of Algorithms and Complexity". Theor. Comput. Sci. 540 (2014)
Federico Della Croce, Vangelis Th. Paschos
Efficient algorithms for the max k-vertex cover problem. J. Comb. Optim. 28 (3) (2014)
Edouard Bonnet, Vangelis Th. Paschos
Sparsification and subexponential approximation. CoRR (2014)
Edouard Bonnet, Vangelis Th. Paschos
Parameterized (in)approximability of subset problems. Oper. Res. Lett. 42 (3) (2014)
Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
On the approximation of maximum $k$-vertex cover in bipartite graphs. CoRR (2014)
Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Exponential approximation schemata for some network design problems. J. Discrete Algorithms 22 (2013)
Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
Reoptimization of maximum weight induced hereditary subgraph problems. Theor. Comput. Sci. 514 (2013)
Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization. CoRR (2013)
Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
-Free Subgraph and Max Planar Subgraph. Discret. Math. Algorithms Appl. 5 (2) (2013)
Nicolas Bourgeois, Konrad K. Dabrowski, Marc Demange, Vangelis Th. Paschos
Playing with Parameters: Cross-parameterization in Graphs. CoRR (2013)
Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos
On the max min vertex cover Problem. WAOA (2013)
Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
On Subexponential and FPT-Time Inapproximability. IPEC (2013)
Edouard Bonnet, Vangelis Th. Paschos, Florian Sikora
Multiparameterizations for max $k$-set cover and related satisfiability problems. CoRR (2013)
Edouard Bonnet, Vangelis Th. Paschos
Parameterized (in)approximability of subset problems. CoRR (2013)
Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
-Subgraph. WALCOM (2013)
Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization. IPEC (2013)
Vangelis Th. Paschos
Preface. Theor. Comput. Sci. 511 (2013)
Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
The Probabilistic Min Dominating Set Problem. CSR (2013)
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) (2013)
Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
Fast algorithms for min independent dominating set. Discret. Appl. Math. 161 (4-5) (2013)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
Fast Algorithms for max independent set. Algorithmica 62 (1-2) (2012)
Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
Subexponential and FPT-time Inapproximability of Independent Set and Related Problems CoRR (2012)
Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié
The max quasi-independent set problem. J. Comb. Optim. 23 (1) (2012)
Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. WALCOM (2012)
Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
Algorithms for dominating clique problems. Theor. Comput. Sci. 459 (2012)
Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. LATIN (2012)
Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms. TAMC (2012)
Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
On the probabilistic min spanning tree Problem. J. Math. Model. Algorithms 11 (1) (2012)
Federico Della Croce, Vangelis Th. Paschos
Efficient Algorithms for the max k -vertex cover Problem. IFIP TCS (2012)
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)
Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos
Online maximum k-coverage. Discret. Appl. Math. 160 (13-14) (2012)
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) (2011)
Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos
Online Maximum k-Coverage. FCT (2011)
Nicolas Boria, Vangelis Th. Paschos
A survey on combinatorial optimization in dynamic environments. RAIRO Oper. Res. 45 (3) (2011)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Fast Algorithms for min independent dominating set. SIROCCO (2010)
Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié
The max quasi-independent set Problem. CSR (2010)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
){\mathcal O}(1.08537^n). TAMC (2010)
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos
Probabilistic models for the Steiner Tree problem. Networks 56 (1) (2010)
Nicolas Boria, Vangelis Th. Paschos
Fast reoptimization for the minimum spanning tree problem. J. Discrete Algorithms 8 (3) (2010)
Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
On the max-weight edge coloring problem. J. Comb. Optim. 20 (4) (2010)
Bruno Escoffier, Vangelis Th. Paschos
A survey on the structure of approximation classes. Comput. Sci. Rev. 4 (1) (2010)
Cécile Murat, Vangelis Th. Paschos
Probabilistic optimization in graph-problems. Algorithmic Oper. Res. 5 (1) (2010)
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)
Federico Della Croce, Vangelis Th. Paschos, Roberto Wolfler Calvo
Approximating the metric 2-Peripatetic Salesman Problem. Algorithmic Oper. Res. 5 (1) (2010)
Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
Approximating the max-edge-coloring problem. Theor. Comput. Sci. 411 (34-36) (2010)
Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
On the Probabilistic min spanning tree problem. IMCSIT (2010)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Efficient approximation of min set cover by moderately exponential algorithms. Theor. Comput. Sci. 410 (21-23) (2009)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Approximation of min coloring by moderately exponential algorithms. Inf. Process. Lett. 109 (16) (2009)
Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos
Simple and Fast Reoptimizations for the Steiner Tree Problem. Algorithmic Oper. Res. 4 (2) (2009)
Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
Approximating the Max Edge-Coloring Problem. IWOCA (2009)
Giorgio Ausiello, Nicolas Bourgeois, Telis Giannakos, Vangelis Th. Paschos
Greedy Algorithms For On-Line Set-Covering. Algorithmic Oper. Res. 4 (1) (2009)

Vangelis Th. Paschos.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Vangelis Th. Paschos