Vangelis Th. Paschos

196 papers A 2B 29C 13Misc 3Journal 129Unranked 15

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Average-case complexity of a branch-and-bound algorithm for Min Dominating Set. Discret. Appl. Math. Tom Denat, Ararat Harutyunyan, Nikolaos Melissinos, Vangelis Th. Paschos
2023	J	`jnl`	Improved (In-)Approximability Bounds for d-Scattered Set. J. Graph Algorithms Appl. Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2022	J	`jnl`	In memory of Jérôme Monnot. Theor. Comput. Sci. Bruno Escoffier, Laurent Gourvès, Vangelis Th. Paschos
2022	J	`jnl`	Structurally parameterized d-scattered set. Discret. Appl. Math. Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2022	J	`jnl`	Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation. Theor. Comput. Sci. Louis Dublois, Michael Lampis, Vangelis Th. Paschos
2021	J	`jnl`	New Algorithms for Mixed Dominating Set. Discret. Math. Theor. Comput. Sci. Louis Dublois, Michael Lampis, Vangelis Th. Paschos
2021	C	`conf`	The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet. WABI Nicolas Boria, Laurent Gourvès, Vangelis Th. Paschos, Jérôme Monnot
2021	J	`jnl`	Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation. CoRR Louis Dublois, Michael Lampis, Vangelis Th. Paschos
2021	C	`conf`	Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation. CIAC Louis Dublois, Michael Lampis, Vangelis Th. Paschos
2020	B	`conf`	New Algorithms for Mixed Dominating Set. IPEC Louis Dublois, Michael Lampis, Vangelis Th. Paschos
2019	J	`jnl`	A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs. CoRR Vangelis Th. Paschos
2019	J	`jnl`	Average-case complexity of a branch-and-bound algorithm for min dominating set. CoRR Tom Denat, Ararat Harutyunyan, Vangelis Th. Paschos
2019	B	`conf`	Improved (In-)Approximability Bounds for d-Scattered Set. WAOA Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2019	J	`jnl`	Improved (In-)Approximability Bounds for d-Scattered Set. CoRR Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2019	J	`jnl`	New Algorithms for Mixed Dominating Set. CoRR Louis Dublois, Michael Lampis, Vangelis Th. Paschos
2019	J	`jnl`	Preface to Special Issue on Algorithms and Complexity. Theor. Comput. Sci. Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos
2019	J	`jnl`	Structural parameters, tight bounds, and approximation for (k, r)-center. Discret. Appl. Math. Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2018	J	`jnl`	Combinatorial approximation of maximum RAIRO Oper. Res. Vangelis Th. Paschos
2018	—	`ch.`	Differential Ratio Approximation. Handbook of Approximation Algorithms and Metaheuristics (1) Giorgio Ausiello, Vangelis Th. Paschos
2018	—	`conf`	Multistage Matchings. SWAT Evripidis Bampis, Bruno Escoffier, Michael Lampis, Vangelis Th. Paschos
2018	J	`jnl`	Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs. Discret. Optim. Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
2018	—	`ch.`	Reductions That Preserve Approximability. Handbook of Approximation Algorithms and Metaheuristics (1) Giorgio Ausiello, Vangelis Th. Paschos
2018	J	`jnl`	Sparsification and subexponential approximation. Acta Informatica Édouard Bonnet, Vangelis Th. Paschos
2018	B	`conf`	Structurally Parameterized d-Scattered Set. WG Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2018	J	`jnl`	The many facets of upper domination. Theor. Comput. Sci. Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2018	J	`jnl`	The probabilistic minimum dominating set problem. Discret. Appl. Math. Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
2018	J	`jnl`	Time-approximation trade-offs for inapproximable problems. J. Comput. Syst. Sci. Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos
2018	J	`jnl`	When polynomial approximation meets exact computation. Ann. Oper. Res. Vangelis Th. Paschos
2017	C	`ed.`	Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings CIAC Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos
2017	J	`jnl`	Dual parameterization and parameterized approximability of subset graph problems. RAIRO Oper. Res. Édouard Bonnet, Vangelis Th. Paschos
2017	J	`jnl`	Exact and superpolynomial approximation algorithms for the densest k-subgraph problem. Eur. J. Oper. Res. Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
2017	B	`conf`	Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. ISAAC Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2017	J	`jnl`	Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. CoRR Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2017	J	`jnl`	Structurally Parameterized $d$-Scattered Set. CoRR Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
2016	B	`conf`	A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. LATIN Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
2016	C	`conf`	Algorithmic Aspects of Upper Domination: A Parameterised Perspective. AAIM Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2016	J	`jnl`	Parameterized exact and approximation algorithms for maximum RAIRO Theor. Informatics Appl. Édouard Bonnet, Vangelis Th. Paschos, Florian Sikora
2016	A	`conf`	Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse. STACS Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos
2016	J	`jnl`	Super-polynomial approximation branching algorithms. RAIRO Oper. Res. Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
2016	A	`conf`	Time-Approximation Trade-offs for Inapproximable Problems. STACS Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos
2016	C	`conf`	Upper Domination: Complexity and Approximation. IWOCA Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2015	J	`jnl`	Algorithmic Aspects of Upper Domination. CoRR Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2015	C	`ed.`	Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings CIAC Vangelis Th. Paschos, Peter Widmayer
2015	J	`jnl`	Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n, p)$ random model. CoRR Nicolas Bourgeois, R. Catellier, Tom Denat, Vangelis Th. Paschos
2015	J	`jnl`	Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio~0.7. CoRR Vangelis Th. Paschos
2015	J	`jnl`	Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization. Algorithmica Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
2015	J	`jnl`	New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. Theory Comput. Syst. Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao
2015	J	`jnl`	On Subexponential and FPT-Time Inapproximability. Algorithmica Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
2015	J	`jnl`	On the max min vertex cover problem. Discret. Appl. Math. Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos
2015	J	`jnl`	Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse. CoRR Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos
2015	J	`jnl`	Time-Approximation Trade-offs for Inapproximable Problems. CoRR Edouard Bonnet, Michael Lampis, Vangelis Th. Paschos
2015	J	`jnl`	When polynomial approximation meets exact computation. 4OR Vangelis Th. Paschos
2014	J	`jnl`	Approximating MAX SAT by moderately exponential and parameterized algorithms. Theor. Comput. Sci. Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
2014	C	`ed.`	Combinatorial Optimization - Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers ISCO Pierre Fouilhoux, Luis Eduardo Neves Gouveia, Ali Ridha Mahjoub, Vangelis Th. Paschos
2014	J	`jnl`	Efficient algorithms for the max k-vertex cover problem. J. Comb. Optim. Federico Della Croce, Vangelis Th. Paschos
2014	J	`jnl`	On the approximation of maximum $k$-vertex cover in bipartite graphs. CoRR Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
2014	J	`jnl`	Parameterized (in)approximability of subset problems. Oper. Res. Lett. Edouard Bonnet, Vangelis Th. Paschos
2014	J	`jnl`	Sparsification and subexponential approximation. CoRR Edouard Bonnet, Vangelis Th. Paschos
2014	J	`jnl`	Special Issue: "Combinatorial Optimization: Theory of Algorithms and Complexity". Theor. Comput. Sci. Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos
2013	B	`conf`	Exact and Approximation Algorithms for Densest WALCOM Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
2013	J	`jnl`	Exponential approximation schemata for some network design problems. J. Discrete Algorithms Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2013	J	`jnl`	Fast algorithms for min independent dominating set. Discret. Appl. Math. Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
2013	B	`conf`	Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization. IPEC Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
2013	J	`jnl`	Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization. CoRR Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
2013	J	`jnl`	Multiparameterizations for max $k$-set cover and related satisfiability problems. CoRR Edouard Bonnet, Vangelis Th. Paschos, Florian Sikora
2013	B	`conf`	On Subexponential and FPT-Time Inapproximability. IPEC Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
2013	B	`conf`	On the max min vertex cover Problem. WAOA Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos
2013	J	`jnl`	Parameterized (in)approximability of subset problems. CoRR Edouard Bonnet, Vangelis Th. Paschos
2013	J	`jnl`	Playing with Parameters: Cross-parameterization in Graphs. CoRR Nicolas Bourgeois, Konrad K. Dabrowski, Marc Demange, Vangelis Th. Paschos
2013	J	`jnl`	Preface. Theor. Comput. Sci. Vangelis Th. Paschos
2013	J	`jnl`	Reoptimization of maximum weight induced hereditary subgraph problems. Theor. Comput. Sci. Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
2013	J	`jnl`	Reoptimization under Vertex Insertion: Max P Discret. Math. Algorithms Appl. Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
2013	Misc	`conf`	The Probabilistic Min Dominating Set Problem. CSR Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
2013	J	`jnl`	Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability. Discret. Optim. Imed Kacem, Vangelis Th. Paschos
2012	J	`jnl`	Algorithms for dominating clique problems. Theor. Comput. Sci. Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
2012	C	`conf`	Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms. TAMC Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
2012	C	`ed.`	Combinatorial Optimization - Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers ISCO Ali Ridha Mahjoub, Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos
2012	—	`conf`	Efficient Algorithms for the max k -vertex cover Problem. IFIP TCS Federico Della Croce, Vangelis Th. Paschos
2012	J	`jnl`	Fast Algorithms for max independent set. Algorithmica Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2012	B	`conf`	New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. IPEC Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao
2012	J	`jnl`	On the probabilistic min spanning tree Problem. J. Math. Model. Algorithms Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
2012	J	`jnl`	Online maximum k-coverage. Discret. Appl. Math. Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos
2012	B	`conf`	Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. LATIN Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
2012	B	`conf`	Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. WALCOM Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
2012	J	`jnl`	Subexponential and FPT-time Inapproximability of Independent Set and Related Problems CoRR Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
2012	J	`jnl`	The max quasi-independent set problem. J. Comb. Optim. Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié
2011	J	`jnl`	A survey on combinatorial optimization in dynamic environments. RAIRO Oper. Res. Nicolas Boria, Vangelis Th. Paschos
2011	J	`jnl`	Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discret. Appl. Math. Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2011	B	`conf`	Online Maximum k-Coverage. FCT Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos
2010	—	`conf`	A Bottom-Up Method and Fast Algorithms for max independent set. SWAT Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2010	J	`jnl`	A survey on the structure of approximation classes. Comput. Sci. Rev. Bruno Escoffier, Vangelis Th. Paschos
2010	J	`jnl`	Approximating the max-edge-coloring problem. Theor. Comput. Sci. Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
2010	J	`jnl`	Approximating the metric 2-Peripatetic Salesman Problem. Algorithmic Oper. Res. Federico Della Croce, Vangelis Th. Paschos, Roberto Wolfler Calvo
2010	B	`conf`	Fast Algorithms for min independent dominating set. SIROCCO Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2010	J	`jnl`	Fast reoptimization for the minimum spanning tree problem. J. Discrete Algorithms Nicolas Boria, Vangelis Th. Paschos
2010	C	`conf`	Maximum Independent Set in Graphs of Average Degree at Most Three in TAMC Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2010	—	`conf`	On the Probabilistic min spanning tree problem. IMCSIT Nicolas Boria, Cécile Murat, Vangelis Th. Paschos
2010	J	`jnl`	On the max-weight edge coloring problem. J. Comb. Optim. Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
2010	J	`jnl`	Probabilistic models for the Steiner Tree problem. Networks Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos
2010	J	`jnl`	Probabilistic optimization in graph-problems. Algorithmic Oper. Res. Cécile Murat, Vangelis Th. Paschos
2010	Misc	`conf`	The max quasi-independent set Problem. CSR Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié
2009	C	`conf`	Approximating the Max Edge-Coloring Problem. IWOCA Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
2009	J	`jnl`	Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. Discret. Appl. Math. Alexey Baburin, Federico Della Croce, Edward Gimadi, Y. V. Glazkov, Vangelis Th. Paschos
2009	J	`jnl`	Approximation of min coloring by moderately exponential algorithms. Inf. Process. Lett. Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2009	B	`conf`	Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. WADS Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2009	J	`jnl`	Efficient approximation of min set cover by moderately exponential algorithms. Theor. Comput. Sci. Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2009	B	`conf`	Exact Algorithms for Dominating Clique Problems. ISAAC Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
2009	J	`jnl`	Fast Algorithms for Max Independent Set in Graphs of Small Average Degree CoRR Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2009	J	`jnl`	Fast algorithms for min independent dominating set CoRR Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2009	J	`jnl`	Greedy Algorithms For On-Line Set-Covering. Algorithmic Oper. Res. Giorgio Ausiello, Nicolas Bourgeois, Telis Giannakos, Vangelis Th. Paschos
2009	J	`jnl`	Max Edge Coloring of Trees CoRR Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
2009	J	`jnl`	Probabilistic graph-coloring in bipartite and split graphs. J. Comb. Optim. Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos
2009	J	`jnl`	Reoptimization of minimum and maximum traveling salesman's tours. J. Discrete Algorithms Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
2009	J	`jnl`	Simple and Fast Reoptimizations for the Steiner Tree Problem. Algorithmic Oper. Res. Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos
2009	J	`jnl`	Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discret. Appl. Math. Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
2008	—	`conf`	An O*(1.0977 IWPEC Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2008	—	`book`	Combinatorial Optimization and Theoretical Computer Science - Interfaces and Perspectives: 30th Anniversary of the LAMSADE. Vangelis Th. Paschos
2008	J	`jnl`	Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems. Oper. Res. Federico Della Croce, Vangelis Th. Paschos
2008	B	`conf`	On the Maximum Edge Coloring Problem. WAOA Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
2008	C	`conf`	Vertex-Uncertainty in Graph-Problems. COCOA Cécile Murat, Vangelis Th. Paschos
2007	J	`jnl`	An exact algorithm for MAX-CUT in sparse graphs. Oper. Res. Lett. Federico Della Croce, Marcin Jakub Kaminski, Vangelis Th. Paschos
2007	—	`ch.`	Differential Ratio Approximation. Handbook of Approximation Algorithms and Metaheuristics Giorgio Ausiello, Vangelis Th. Paschos
2007	J	`jnl`	Differential approximation of min sat. Eur. J. Oper. Res. Bruno Escoffier, Vangelis Th. Paschos
2007	J	`jnl`	Improved worst-case complexity for the MIN 3-SET COVERING problem. Oper. Res. Lett. Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
2007	—	`conf`	On the Performance of Congestion Games for Optimum Satisfiability Problems. WINE Aristotelis Giannakos, Laurent Gourvès, Jérôme Monnot, Vangelis Th. Paschos
2007	—	`ch.`	Reductions That Preserve Approximability. Handbook of Approximation Algorithms and Metaheuristics Giorgio Ausiello, Vangelis Th. Paschos
2007	C	`conf`	Steiner Forests on Stochastic Metric Graphs. COCOA Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos
2007	J	`jnl`	Time slot scheduling of compatible jobs. J. Sched. Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos
2006	J	`jnl`	Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2. Electron. Notes Discret. Math. Yury Glazkov, Alexey Baburin, Edward Gimadi, Federico Della Croce, Vangelis Th. Paschos
2006	J	`jnl`	Completeness in approximation classes beyond APX. Theor. Comput. Sci. Bruno Escoffier, Vangelis Th. Paschos
2006	—	`conf`	Greedy algorithms for on-line set-covering and related problems. CATS Giorgio Ausiello, Aristotelis Giannakos, Vangelis Th. Paschos
2006	J	`jnl`	Jon Lee, A First Course in Combinatorial Optimization, Cambridge Texts in Applied Mathematics. Eur. J. Oper. Res. Vangelis Th. Paschos
2006	J	`jnl`	On the probabilistic minimum coloring and minimum Discret. Appl. Math. Cécile Murat, Vangelis Th. Paschos
2006	J	`jnl`	On-line models and algorithms for max independent set. RAIRO Oper. Res. Bruno Escoffier, Vangelis Th. Paschos
2006	J	`jnl`	Reductions, completeness and the hardness of approximability. Eur. J. Oper. Res. Giorgio Ausiello, Vangelis Th. Paschos
2006	—	`conf`	Reoptimization of Minimum and Maximum Traveling Salesman's Tours. SWAT Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
2006	J	`jnl`	Weighted Coloring: further complexity and approximability results. Inf. Process. Lett. Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
2005	J	`jnl`	A hypocoloring model for batch scheduling. Discret. Appl. Math. Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos
2005	J	`jnl`	Completeness in differential approximation classes. Int. J. Found. Comput. Sci. Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos
2005	J	`jnl`	Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. Theor. Comput. Sci. Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos
2005	B	`conf`	Computing Optimal Solutions for the min 3-set covering Problem. ISAAC Federico Della Croce, Vangelis Th. Paschos
2005	—	`conf`	Differential Approximation of min sat, max sat and Related Problems. ICCSA (4) Bruno Escoffier, Vangelis Th. Paschos
2005	B	`conf`	Greedy Differential Approximations for Min Set Cover. SOFSEM Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière
2005	J	`jnl`	Improved Approximations for Weighted and Unweighted Graph Problems. Theory Comput. Syst. Marc Demange, Vangelis Th. Paschos
2005	J	`jnl`	On the differential approximation of MIN SET COVER. Theor. Comput. Sci. Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière
2005	J	`jnl`	On-line maximum-order induced hereditary subgraph problems. Int. Trans. Oper. Res. Marc Demange, Xavier Paradon, Vangelis Th. Paschos
2005	J	`jnl`	On-line vertex-covering. Theor. Comput. Sci. Marc Demange, Vangelis Th. Paschos
2005	J	`jnl`	Polynomial approximation algorithms with performance guarantees: An introduction-by-example. Eur. J. Oper. Res. Marc Demange, Vangelis Th. Paschos
2005	—	`conf`	Probabilistic Coloring of Bipartite and Split Graphs. ICCSA (4) Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos
2005	J	`jnl`	Proving completeness by logic. Int. J. Comput. Math. Bruno Escoffier, Vangelis Th. Paschos
2005	—	`conf`	Weighted Coloring: Further Complexity and Approximability Results. ICTCS Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
2004	J	`jnl`	A simulated annealing approach for the circular cutting problem. Eur. J. Oper. Res. Mhand Hifi, Vangelis Th. Paschos, Vassilis Zissimopoulos
2004	Misc	`conf`	Algorithms for the On-Line Quota Traveling Salesman Problem. COCOON Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos
2004	J	`jnl`	Algorithms for the On-Line Quota Traveling Salesman Problem. Inf. Process. Lett. Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos
2004	J	`jnl`	Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation. Int. J. Comput. Math. Tínaz Ekim, Vangelis Th. Paschos
2004	J	`jnl`	Local approximations for maximum partial subgraph problem. Oper. Res. Lett. Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
2004	J	`jnl`	Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem. J. Sched. Federico Della Croce, Andrea Grosso, Vangelis Th. Paschos
2004	B	`conf`	Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. ISAAC Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos
2004	B	`conf`	The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. WG Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos
2004	B	`conf`	Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. ISAAC Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier
2003	J	`jnl`	Approximation algorithms for the traveling salesman problem. Math. Methods Oper. Res. Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
2003	B	`conf`	Completeness in Differential Approximation Classes. MFCS Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos
2003	J	`jnl`	Differential approximation for optimal satisfiability and related problems. Eur. J. Oper. Res. Cristina Bazgan, Vangelis Th. Paschos
2003	J	`jnl`	Differential approximation results for the Steiner tree problem. Appl. Math. Lett. Marc Demange, Jérôme Monnot, Vangelis Th. Paschos
2003	J	`jnl`	Differential approximation results for the traveling salesman problem with distances 1 and 2. Eur. J. Oper. Res. Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
2003	J	`jnl`	Optima locaux garantis pour l'approximation différentielle. Tech. Sci. Informatiques Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
2003	J	`jnl`	Polynomial Approximation and Graph-Coloring. Computing Vangelis Th. Paschos
2003	B	`conf`	The Probabilistic Minimum Coloring Problem. WG Cécile Murat, Vangelis Th. Paschos
2002	J	`jnl`	A priori optimization for the probabilistic maximum independent set problem. Theor. Comput. Sci. Cécile Murat, Vangelis Th. Paschos
2002	B	`conf`	Algorithms and Models for the On-Line Vertex-Covering. WG Marc Demange, Vangelis Th. Paschos
2002	J	`jnl`	Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances. RAIRO Oper. Res. Marc Demange, Vangelis Th. Paschos
2002	J	`jnl`	Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation. RAIRO Oper. Res. Marc Demange, Vangelis Th. Paschos
2002	B	`conf`	Weighted Node Coloring: When Stable Sets Are Expensive. WG Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos
2001	B	`conf`	Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2. FCT Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
2001	J	`jnl`	On-line independent set by coloring vertices. Oper. Res. Vangelis Th. Paschos
2000	J	`jnl`	Master-Slave Strategy and Polynomial Approximation. Comput. Optim. Appl. Laurent Alfandari, Vangelis Th. Paschos
2000	B	`conf`	On-Line Maximum-Order Induces Hereditary Subgraph Problems. SOFSEM Marc Demange, Xavier Paradon, Vangelis Th. Paschos
1999	J	`jnl`	An improved general procedure for lexicographic bottleneck problems. Oper. Res. Lett. Federico Della Croce, Vangelis Th. Paschos, Alexis Tsoukiàs
1999	J	`jnl`	Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems. RAIRO Oper. Res. Marc Demange, Vangelis Th. Paschos
1999	J	`jnl`	The probabilistic longest path problem. Networks Cécile Murat, Vangelis Th. Paschos
1998	J	`jnl`	Average-Case Complexity for the Execution of Recursive Definitions on Relational Databases. Acta Informatica Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Andreas Stafylopatis
1998	J	`jnl`	Differential Approximation Algorithms for Some Combinatorial Optimization Problems. Theor. Comput. Sci. Marc Demange, Pascal Grisoni, Vangelis Th. Paschos
1997	J	`jnl`	A Survey of Approximately Optimal Solutions to Some Covering and Packing Problems. ACM Comput. Surv. Vangelis Th. Paschos
1997	J	`jnl`	A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts. Ann. Oper. Res. Virginie Gabrel, Alain Moulet, Cécile Murat, Vangelis Th. Paschos
1997	J	`jnl`	The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems. Comput. Optim. Appl. Marc Demange, Vangelis Th. Paschos
1996	J	`jnl`	On an Approximation Measure Founded on the Links Between Optimization and Polynomial Approximation Theory. Theor. Comput. Sci. Marc Demange, Vangelis Th. Paschos
1995	J	`jnl`	Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems. Theor. Comput. Sci. Joël Blot, Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad
1995	—	`conf`	Constructive - Non-constructive Approximation and Maximum Independent Set Problem. Combinatorics and Computer Science Marc Demange, Vangelis Th. Paschos
1994	J	`jnl`	Approximation Results for the Minimum Graph Coloring Problem. Inf. Process. Lett. Marc Demange, Pascal Grisoni, Vangelis Th. Paschos
1992	J	`jnl`	A (Delta/2)-Approximation Algorithm for the Maximum Independent Set Problem. Inf. Process. Lett. Vangelis Th. Paschos
1992	B	`conf`	Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem. LATIN Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad
1992	J	`jnl`	Evaluation of the Execution Cost of Recursive Definitions. Comput. J. Vangelis Th. Paschos, Andreas Stafylopatis
1991	—	`conf`	A Theorem on the Approximation of Set Cover and Vertex Cover. FSTTCS Vangelis Th. Paschos
1991	J	`jnl`	On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems. IEEE Trans. Computers Vassilis Zissimopoulos, Vangelis Th. Paschos, Ferhan Pekergin
1991	—	`conf`	On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs. ISA A. Benkouar, Yannis Manoussakis, Vangelis Th. Paschos, Rachid Saad
1991	—	`conf`	On the Mean Execution Time of Recursive Definitions on Relational Databases. MFDBS Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, A. N. Staylopatis