Vangelis Th. Paschos

Vangelis Th. Paschos, Nicolas Boria, Cécile Murat, 2010, Proceedings of the International Multiconference on Computer Science and Information Technology.

On the approximation of maximum $k$-vertex cover in bipartite graphs pdf

Vangelis Th. Paschos, Bruno Escoffier, Édouard Bonnet, 2014, ArXiv.

Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems

Vangelis Th. Paschos, Federico Della Croce, 2008, Oper. Res..

14. Algorithmic Games

Vangelis Th. Paschos, Aristotelis Giannakos, Olivier Pottié, 2010 .

The max quasi-independent set problem

Vangelis Th. Paschos, Ioannis Milis, Giorgio Lucarelli, 2012, J. Comb. Optim..

On the max min vertex cover problem

Vangelis Th. Paschos, Federico Della Croce, Nicolas Boria, 2015, Discret. Appl. Math..

Applications of combinatorial optimization

Vangelis Th. Paschos, V. Paschos, 2010 .

Algorithms for the On-Line Quota Traveling Salesman Problem

Vangelis Th. Paschos, Giorgio Ausiello, Marc Demange, 2004, Inf. Process. Lett..

Time-approximation trade-offs for inapproximable problems

Vangelis Th. Paschos, Édouard Bonnet, Michael Lampis, 2015, J. Comput. Syst. Sci..

A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs pdf

Vangelis Th. Paschos, 2019, ArXiv.

A survey on the structure of approximation classes

Vangelis Th. Paschos, Bruno Escoffier, V. Paschos, 2010, Comput. Sci. Rev..

Differential Approximation Algorithms for Some Combinatorial Optimization Problems

Vangelis Th. Paschos, Marc Demange, Pascal Grisoni, 1998, Theor. Comput. Sci..

Fast algorithms for min independent dominating set

Vangelis Th. Paschos, Federico Della Croce, Bruno Escoffier, 2013, Discret. Appl. Math..

The many facets of upper domination

Vangelis Th. Paschos, Klaus Jansen, Henning Fernau, 2017, Theor. Comput. Sci..

Efficient algorithms for the max $$k$$-vertex cover problem

Vangelis Th. Paschos, Federico Della Croce, F. D. Croce, 2012, J. Comb. Optim..

The Probabilistic Minimum Coloring Problem

Vangelis Th. Paschos, Cécile Murat, V. Paschos, 2003, WG.

Applications of Combinatorial Optimization: Th. Paschos/Applications of Combinatorial Optimization

Vangelis Th. Paschos, 2013 .

The probabilistic minimum dominating set problem

Vangelis Th. Paschos, Nicolas Boria, Cécile Murat, 2018, Discret. Appl. Math..

Parameterized (in)approximability of subset problems pdf

Vangelis Th. Paschos, Édouard Bonnet, V. Paschos, 2013, Oper. Res. Lett..

Online models for set-covering: the flaw of greediness

Vangelis Th. Paschos, Giorgio Ausiello, Aristotelis Giannakos, 2010 .

On the max-weight edge coloring problem

Vangelis Th. Paschos, Ioannis Milis, Giorgio Lucarelli, 2010, J. Comb. Optim..

Poly-APX- and PTAS-Completeness in Standard and Differential Approximation

Vangelis Th. Paschos, Bruno Escoffier, Cristina Bazgan, 2004, ISAAC.

Exact and superpolynomial approximation algorithms for the densest k-subgraph problem

Vangelis Th. Paschos, Ioannis Milis, Giorgio Lucarelli, 2017, Eur. J. Oper. Res..

The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small

Vangelis Th. Paschos, Dominique de Werra, Jérôme Monnot, 2004, WG.

Preface to Special Issue on Algorithms and Complexity

Vangelis Th. Paschos, Aris Pagourtzis, Dimitris Fotakis, 2019, Theor. Comput. Sci..

Subexponential and FPT-time Inapproximability of Independent Set and Related Problems pdf

Vangelis Th. Paschos, Eun Jung Kim, Bruno Escoffier, 2012, ArXiv.

Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2

Vangelis Th. Paschos, Jérôme Monnot, Sophie Toulouse, 2001, FCT.

Concepts of Combinatorial Optimization: Th. Paschos/Concepts of Combinatorial Optimization

Vangelis Th. Paschos, 2013 .

Exponential approximation schemata for some network design problems

Vangelis Th. Paschos, Bruno Escoffier, Nicolas Boria, 2013, J. Discrete Algorithms.

On the Mean Execution Time of Recursive Definitions on Relational Databases

Vangelis Th. Paschos, Wenceslas Fernandez de la Vega, A. N. Staylopatis, 1991, MFDBS.

Combinatorial Optimization and Theoretical Computer Science - Interfaces and Perspectives: 30th Anniversary of the LAMSADE

Vangelis Th. Paschos, 2008 .

Improved worst-case complexity for the MIN 3-SET COVERING problem

Vangelis Th. Paschos, Federico Della Croce, Bruno Escoffier, 2007, Oper. Res. Lett..

Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n,p)$ random model pdf

Vangelis Th. Paschos, Nicolas Bourgeois, R. Catellier, 2015, 1505.04969.

New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set

Vangelis Th. Paschos, Mingyu Xiao, Jérôme Monnot, 2014, Theory of Computing Systems.

Proceedings of the Second international conference on Combinatorial Optimization

Vangelis Th. Paschos, Ioannis Milis, A. Ridha Mahjoub, 2012 .

A (Delta/2)-Approximation Algorithm for the Maximum Independent Set Problem

Vangelis Th. Paschos, 1992, Inf. Process. Lett..

Algorithms for dominating clique problems

Vangelis Th. Paschos, Federico Della Croce, Bruno Escoffier, 2012, Theor. Comput. Sci..

On-line models and algorithms for max independent set

Vangelis Th. Paschos, Bruno Escoffier, 2006, RAIRO Oper. Res..

Fast Algorithms for Max Independent Set in Graphs of Small Average Degree pdf

Vangelis Th. Paschos, Bruno Escoffier, Johan M. M. van Rooij, 2009, ArXiv.

Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse pdf

Vangelis Th. Paschos, Michael Lampis, Dimitris Fotakis, 2015, STACS.

On Subexponential and FPT-Time Inapproximability

Vangelis Th. Paschos, Eun Jung Kim, Bruno Escoffier, 2013, Algorithmica.

Steiner Forests on Stochastic Metric Graphs

Vangelis Th. Paschos, Vassilis Zissimopoulos, Orestis Telelis, 2007, COCOA.

Completeness in differential approximation classes

Vangelis Th. Paschos, Giorgio Ausiello, Marc Demange, 2005, Int. J. Found. Comput. Sci..

A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs

Vangelis Th. Paschos, Bruno Escoffier, Édouard Bonnet, 2016, LATIN.

A survey on combinatorial optimization in dynamic environments

Vangelis Th. Paschos, Nicolas Boria, V. Paschos, 2011, RAIRO Oper. Res..

On-Line Maximum-Order Induces Hereditary Subgraph Problems

Vangelis Th. Paschos, Marc Demange, Xavier Paradon, 2000, SOFSEM.

On the Maximum Edge Coloring Problem

Vangelis Th. Paschos, Ioannis Milis, Giorgio Lucarelli, 2009, WAOA.

Combinatorial Optimization and Theorical Computer Science: Interfaces and Perspectives

Vangelis Th. Paschos, 2008 .

Computing Optimal Solutions for the min 3-set covering Problem

Vangelis Th. Paschos, Federico Della Croce, 2005, ISAAC.

Super-polynomial approximation branching algorithms

Vangelis Th. Paschos, Bruno Escoffier, Emeric Tourniaire, 2016, RAIRO Oper. Res..

Efficient approximation of min set cover by moderately exponential algorithms

Vangelis Th. Paschos, Bruno Escoffier, Nicolas Bourgeois, 2009, Theor. Comput. Sci..

Jon Lee, A First Course in Combinatorial Optimization, Cambridge Texts in Applied Mathematics

Vangelis Th. Paschos, V. Paschos, 2006, Eur. J. Oper. Res..

Algorithmic Aspects of Upper Domination: A Parameterised Perspective

Vangelis Th. Paschos, Klaus Jansen, Henning Fernau, 2016, AAIM.

Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2

Vangelis Th. Paschos, Federico Della Croce, Edward Gimadi, 2009, Discret. Appl. Math..

Special Issue: "Combinatorial Optimization: Theory of Algorithms and Complexity"

Vangelis Th. Paschos, Evangelos Markakis, Ioannis Milis, 2014, Theor. Comput. Sci..

Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){\mathcal O}(1.08537^n)

Vangelis Th. Paschos, Bruno Escoffier, Johan M. M. van Rooij, 2010, TAMC.

Reoptimization under Vertex Insertion: Max PK-Free Subgraph and Max Planar Subgraph

Vangelis Th. Paschos, Jérôme Monnot, Nicolas Boria, 2013, Discret. Math. Algorithms Appl..

On-line models for set-covering: the power of greediness

Vangelis Th. Paschos, Giorgio Ausiello, Aristotelis Giannakos, 2006 .

Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximationa

Vangelis Th. Paschos, Tinaz Ekim, 2004, Int. J. Comput. Math..

Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances

Vangelis Th. Paschos, Marc Demange, V. Paschos, 2002, RAIRO Oper. Res..

Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation

Vangelis Th. Paschos, Marc Demange, V. Paschos, 2002, RAIRO Oper. Res..

A Bottom-Up Method and Fast Algorithms for max independent set

Vangelis Th. Paschos, Bruno Escoffier, Johan M. M. van Rooij, 2010, SWAT.

Efficient algorithms for the max $$k$$-vertex cover problem

Vangelis Th. Paschos, Federico Della Croce, 2014, J. Comb. Optim..

A New Efficient Heuristic for the Minimum Set Covering Problem

Vangelis Th. Paschos, Mhand Hifi, Vassilis Zissimopoulos, 1995 .

Time-Approximation Trade-offs for Inapproximable Problems

Vangelis Th. Paschos, Édouard Bonnet, Michael Lampis, 2016, STACS.

When polynomial approximation meets exact computation

Vangelis Th. Paschos, V. Paschos, 2015, 4OR.

Vertex-Uncertainty in Graph-Problems

Vangelis Th. Paschos, Cécile Murat, V. Paschos, 2008, COCOA.

Approximation algorithms for the traveling salesman problem

Vangelis Th. Paschos, Jérôme Monnot, Sophie Toulouse, 2003, Math. Methods Oper. Res..

Summary of Volume 2: Paradigms of Combinatorial Optimization

Vangelis Th. Paschos, 2014 .

Combinatorial Optimization Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers

Vangelis Th. Paschos, Ali Ridha Mahjoub, Ioannis Milis, 2012 .

Master-Slave Strategy and Polynomial Approximation

Vangelis Th. Paschos, Laurent Alfandari, Laurent Alfandari, 2000, Comput. Optim. Appl..

Differential approximation results for the traveling salesman problem with distances 1 and 2

Vangelis Th. Paschos, Jérôme Monnot, Sophie Toulouse, 2001, Eur. J. Oper. Res..

Parameterized Algorithms for the Max K-set Cover and Related Satisfiability Problems Parameterized Exact and Approximation Algorithms for Maximum K-set Cover and Related Satisfiability Problems

Vangelis Th. Paschos, Édouard Bonnet, Florian Sikora, 2022 .

On the max min vertex cover problem

Vangelis Th. Paschos, Federico Della Croce, Nicolas Boria, 2013, Discret. Appl. Math..

Probabilistic models for the Steiner Tree problem

Vangelis Th. Paschos, Vassilis Zissimopoulos, Orestis Telelis, 2010, Networks.

Approximability preserving reductions

Vangelis Th. Paschos, Giorgio Ausiello, 2005 .

On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs

Vangelis Th. Paschos, Rachid Saad, Yannis Manoussakis, 1991, ISA.

Reductions, completeness and the hardness of approximability

Vangelis Th. Paschos, Giorgio Ausiello, G. Ausiello, 2006, Eur. J. Oper. Res..

Approximating the Max Edge-Coloring Problem

Vangelis Th. Paschos, Ioannis Milis, Giorgio Lucarelli, 2009, IWOCA.

Sparsification and subexponential approximation

Vangelis Th. Paschos, Édouard Bonnet, V. Paschos, 2014, Acta Informatica.

Reoptimization of Minimum and Maximum Traveling Salesman's Tours

Vangelis Th. Paschos, Giorgio Ausiello, Jérôme Monnot, 2006, SWAT.

Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems

Vangelis Th. Paschos, Marc Demange, 1999, RAIRO Oper. Res..

Multistage Matchings

Vangelis Th. Paschos, Evripidis Bampis, Bruno Escoffier, 2018, SWAT.

Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center pdf

Vangelis Th. Paschos, Michael Lampis, Ioannis Katsikarelis, 2017, ISAAC.

Differential Ratio Approximation

Vangelis Th. Paschos, Giorgio Ausiello, G. Ausiello, 2007, Handbook of Approximation Algorithms and Metaheuristics.

Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms

Vangelis Th. Paschos, Bruno Escoffier, Emeric Tourniaire, 2012, TAMC.

Differential approximation results for the Steiner tree problem

Vangelis Th. Paschos, Jérôme Monnot, Marc Demange, 2003, Appl. Math. Lett..

Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2

Vangelis Th. Paschos, Federico Della Croce, Edward Gimadi, 2006, Electron. Notes Discret. Math..

On-line independent set by coloring vertices

Vangelis Th. Paschos, 2001, Oper. Res..

Proceedings of the 9th International Conference on Algorithms and Complexity - Volume 9079

Vangelis Th. Paschos, Peter Widmayer, 2015 .

Average-case complexity of a branch-and-bound algorithm for min dominating set pdf

Vangelis Th. Paschos, Ararat Harutyunyan, Tom Denat, 2019, ArXiv.

Improved (In-)Approximability Bounds for d-Scattered Set

Vangelis Th. Paschos, Michael Lampis, Ioannis Katsikarelis, 2019, WAOA.

A simulated annealing approach for the circular cutting problem

Vangelis Th. Paschos, Mhand Hifi, Vassilis Zissimopoulos, 2004, Eur. J. Oper. Res..

On the differential approximation of MIN SET COVER

Vangelis Th. Paschos, Jérôme Monnot, Cristina Bazgan, 2005, Theor. Comput. Sci..

A Theorem on the Approximation of Set Cover and Vertex Cover

Vangelis Th. Paschos, 1991, FSTTCS.

Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms

Vangelis Th. Paschos, Bruno Escoffier, Nicolas Bourgeois, 2009, WADS.

Approximation Results for the Minimum Graph Coloring Problem

Vangelis Th. Paschos, Marc Demange, Pascal Grisoni, 1994, Inf. Process. Lett..

Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems

Vangelis Th. Paschos, Jérôme Monnot, Nicolas Boria, 2012, LATIN.

Approximating the metric 2-Peripatetic Salesman Problem

Vangelis Th. Paschos, Federico Della Croce, Roberto Wolfler Calvo, 2010, Algorithmic Oper. Res..

Maximizing the number of unused bins by first-fit-decreasing

Vangelis Th. Paschos, Jérôme Monnot, Marc Demange, 2001 .

20. Algorithmic Games

Vangelis Th. Paschos, Aristotelis Giannakos, 2014 .

Differential approximation for optimal satisfiability and related problems

Vangelis Th. Paschos, Cristina Bazgan, V. Paschos, 2003, Eur. J. Oper. Res..

Probabilistic Coloring of Bipartite and Split Graphs

Vangelis Th. Paschos, Federico Della Croce, Bruno Escoffier, 2005, ICCSA.

Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio~0.7 pdf

Vangelis Th. Paschos, 2018, RAIRO Oper. Res..

An exact algorithm for 1-in-3 SAT pdf

Vangelis Th. Paschos, 'Edouard Bonnet, 2013, ArXiv.

Optima locaux garantis pour l'approximation différentielle

Vangelis Th. Paschos, Jérôme Monnot, Sophie Toulouse, 2003, Tech. Sci. Informatiques.

Evaluation of the Execution Cost of Recursive Definitions

Vangelis Th. Paschos, Andreas Stafylopatis, V. Paschos, 1992, Comput. J..

Differential approximation of the traveling salesman problem

Vangelis Th. Paschos, Jérôme Monnot, Sophie Toulouse, 2002 .

Max Edge Coloring of Trees pdf

Vangelis Th. Paschos, Ioannis Milis, Giorgio Lucarelli, 2009, ArXiv.

A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts

Vangelis Th. Paschos, Cécile Murat, Virginie Gabrel, 1997, Ann. Oper. Res..

Approximating MAX SAT by moderately exponential and parameterized algorithms

Vangelis Th. Paschos, Bruno Escoffier, Emeric Tourniaire, 2012, Theor. Comput. Sci..

The probabilistic longest path problem

Vangelis Th. Paschos, Cécile Murat, 1999, Networks.

Average-case complexity for the execution of recursive definitions on relational databases

Vangelis Th. Paschos, Andreas Stafylopatis, Wenceslas Fernandez de la Vega, 1998, Acta Informatica.

The max quasi-independent set Problem

Vangelis Th. Paschos, Ioannis Milis, Giorgio Lucarelli, 2010, CSR.

Laboratoire D'analyse Et Modélisation De Systèmes Pour L'aide À La Décision Cahier Du Lamsade 280 Efficient Approximation of Min Coloring by Moderately Exponential Algorithms Efficient Approximation of Min Coloring by Moderately Exponential Algorithms

Vangelis Th. Paschos, Bruno Escoffier, Nicolas Bourgeois, 2008 .

Reductions That Preserve Approximability

Vangelis Th. Paschos, Giorgio Ausiello, G. Ausiello, 2007, Handbook of Approximation Algorithms and Metaheuristics.

On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems

Vangelis Th. Paschos, Ferhan Pekergin, Vassilis Zissimopoulos, 1991, IEEE Trans. Computers.

Improved Approximations for Weighted and Unweighted Graph Problems

Vangelis Th. Paschos, Marc Demange, V. Paschos, 2005, Theory of Computing Systems.

Approximating the max-edge-coloring problem

Vangelis Th. Paschos, Ioannis Milis, Giorgio Lucarelli, 2010, Theor. Comput. Sci..

On-line vertex-covering

Vangelis Th. Paschos, Marc Demange, 2005, Theor. Comput. Sci..

Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems

Vangelis Th. Paschos, Rachid Saad, Wenceslas Fernandez de la Vega, 1995, Theor. Comput. Sci..

Dual parameterization and parameterized approximability of subset graph problems

Vangelis Th. Paschos, Édouard Bonnet, V. Paschos, 2017, RAIRO Oper. Res..

On the Performance of Congestion Games for Optimum Satisfiability Problems

Vangelis Th. Paschos, Jérôme Monnot, Laurent Gourvès, 2007, WINE.

A priori optimization for the probabilistic maximum independent set problem

Vangelis Th. Paschos, Cécile Murat, V. Paschos, 2002, Theor. Comput. Sci..

Probabilistic graph-coloring in bipartite and split graphs

Vangelis Th. Paschos, Federico Della Croce, Bruno Escoffier, 2009, J. Comb. Optim..

Proving completeness by logic

Vangelis Th. Paschos, Bruno Escoffier, 2005, Int. J. Comput. Math..

Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability

Vangelis Th. Paschos, Imed Kacem, I. Kacem, 2013, Discret. Optim..

Completeness in differential approximation classes

Vangelis Th. Paschos, Giorgio Ausiello, Marc Demange, 2003, Int. J. Found. Comput. Sci..

Weighted Coloring: further complexity and approximability results

Vangelis Th. Paschos, Jérôme Monnot, Bruno Escoffier, 2006, Inf. Process. Lett..

Optimization in dynamic environments

Vangelis Th. Paschos, Nicolas Boria, V. Paschos, 2011 .

Greedy Algorithms For On-Line Set-Covering

Vangelis Th. Paschos, Giorgio Ausiello, Aristotelis Giannakos, 2009, Algorithmic Oper. Res..

Weighted Coloring: Further Complexity and Approximability Results

Vangelis Th. Paschos, Jérôme Monnot, Bruno Escoffier, 2005, ICTCS.

Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms

Vangelis Th. Paschos, Bruno Escoffier, Nicolas Bourgeois, 2011, Discret. Appl. Math..

Differential Approximation of min sat, max sat and Related Problems

Vangelis Th. Paschos, Bruno Escoffier, 2005, ICCSA.

Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization

Vangelis Th. Paschos, Bruno Escoffier, Édouard Bonnet, 2014, Algorithmica.

Fast Algorithms for min independent dominating set pdf

Vangelis Th. Paschos, Bruno Escoffier, Nicolas Bourgeois, 2010, SIROCCO.

Fast Algorithms for max independent set

Vangelis Th. Paschos, Bruno Escoffier, Johan M. M. van Rooij, 2010, Algorithmica.

On the probabilistic minimum coloring and minimum k-coloring

Vangelis Th. Paschos, Cécile Murat, V. Paschos, 2006, Discret. Appl. Math..

The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems

Vangelis Th. Paschos, Marc Demange, V. Paschos, 1997, Comput. Optim. Appl..

An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs

Vangelis Th. Paschos, Bruno Escoffier, Nicolas Bourgeois, 2008, IWPEC.

Exact Algorithms for Dominating Clique Problems

Vangelis Th. Paschos, Federico Della Croce, Bruno Escoffier, 2009, ISAAC.

On the approximation of some spanning-arborescence problems

Vangelis Th. Paschos, Laurent Alfandari, 1998 .

On the complexity of an optimisation problem in relational databases

Vangelis Th. Paschos, 1990 .

Probabilistic optimization in graph-problems

Vangelis Th. Paschos, Cécile Murat, 2010, Algorithmic Oper. Res..

Multiparameterizations for max $k$-set cover and related satisfiability problems pdf

Vangelis Th. Paschos, Édouard Bonnet, Florian Sikora, 2013, ArXiv.

Upper Domination: Complexity and Approximation

Vangelis Th. Paschos, Klaus Jansen, Henning Fernau, 2016, IWOCA.

Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness

Vangelis Th. Paschos, Bruno Escoffier, Cristina Bazgan, 2005, Theor. Comput. Sci..

Exact and Approximation Algorithms for Densest k-Subgraph

Vangelis Th. Paschos, Ioannis Milis, Giorgio Lucarelli, 2013, WALCOM.

Greedy algorithms for on-line set-covering and related problems

Vangelis Th. Paschos, Giorgio Ausiello, Aristotelis Giannakos, 2006, CATS.

20. Algorithmic Games

Vangelis Th. Paschos, Aristotelis Giannakos and, 2013 .

Mission planning for observation satellites

Vangelis Th. Paschos, Cécile Murat, Virginie Gabrel, 2010 .

Playing with parameters: structural parameterization in graphs

Vangelis Th. Paschos, Marc Demange, Konrad K. Dabrowski, 2013 .

On-line maximum-order induced hereditary subgraph problems

Vangelis Th. Paschos, Marc Demange, Xavier Paradon, 2005, Int. Trans. Oper. Res..

Combinatorial Optimization and Theoretical Computer Science

Vangelis Th. Paschos, 2008 .

Concepts of combinatorial optimization

Vangelis Th. Paschos, 2014 .

Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem

Vangelis Th. Paschos, Federico Della Croce, Andrea Grosso, 2004, J. Sched..

Combinatorial Optimization Volume 1, Concepts of Combinatorial Optimization

Vangelis Th. Paschos, 2010 .

Summary of Volume 1: Concepts of Combinatorial Optimization

Vangelis Th. Paschos, 2014 .

Fast reoptimization for the minimum spanning tree problem

Vangelis Th. Paschos, Nicolas Boria, V. Paschos, 2010, J. Discrete Algorithms.

Polynomial Approximation and Graph-Coloring

Vangelis Th. Paschos, V. Paschos, 2003, Computing.

Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs

Vangelis Th. Paschos, Bruno Escoffier, Édouard Bonnet, 2018, Discret. Optim..

Summary of Volume 3: Applications of Combinatorial Optimization

Vangelis Th. Paschos, 2014 .

Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion

Vangelis Th. Paschos, Jérôme Monnot, Nicolas Boria, 2012, WALCOM.

Greedy Differential Approximations for Min Set Cover

Vangelis Th. Paschos, Jérôme Monnot, Cristina Bazgan, 2005, SOFSEM.

When polynomial approximation meets exact computation

Vangelis Th. Paschos, V. Paschos, 2018, Ann. Oper. Res..

Playing with Parameters: Cross-parameterization in Graphs pdf

Vangelis Th. Paschos, Konrad Dabrowski, Marc Demange, 2013, ArXiv.

Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation

Vangelis Th. Paschos, Dominique de Werra, Jérôme Monnot, 2004, ISAAC.

Weighted coloring on planar, bipartite and split graphs: Complexity and approximation

Vangelis Th. Paschos, Dominique de Werra, Jérôme Monnot, 2009, Discret. Appl. Math..

Online maximum k-coverage

Vangelis Th. Paschos, Giorgio Ausiello, Giorgio Lucarelli, 2012, Discret. Appl. Math..

Simple and Fast Reoptimizations for the Steiner Tree Problem

Vangelis Th. Paschos, Martin Milanic, Bruno Escoffier, 2009, Algorithmic Oper. Res..

Online maximum k-coverage∗

Vangelis Th. Paschos, Giorgio Ausiello, Giorgio Lucarelli, 2010 .

Reoptimization of minimum and maximum traveling salesman's tours

Vangelis Th. Paschos, Giorgio Ausiello, Jérôme Monnot, 2009, J. Discrete Algorithms.

Constructive - Non-constructive Approximation and Maximum Independent Set Problem

Vangelis Th. Paschos, Marc Demange, 1995, Combinatorics and Computer Science.

A hypocoloring model for batch scheduling

Vangelis Th. Paschos, Dominique de Werra, Jérôme Monnot, 2005, Discret. Appl. Math..

L'optimisation combinatoire probabiliste

Vangelis Th. Paschos, Cécile Murat, 2005 .

Algorithms and Models for the On-Line Vertex-Covering

Vangelis Th. Paschos, Marc Demange, 2002, WG.

Combinatorial Optimization and Theoretical Computer Science: Interfaces & Perspectives

Vangelis Th. Paschos, 2007 .

Algorithmic Aspects of Upper Domination pdf

Vangelis Th. Paschos, Klaus Jansen, Henning Fernau, 2015, ArXiv.

The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet

Vangelis Th. Paschos, Jérôme Monnot, Laurent Gourvès, 2021, WABI.

Circular Cutting Problem: A Simulated Annealing Approach

Vangelis Th. Paschos, Mhand Hifi, Vassilis Zissimopoulos, 1994 .

A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem☆

Vangelis Th. Paschos, Aristidis Likas, A. Likas, 2002 .

Approximability preserving reductions for NP-complete problems

Vangelis Th. Paschos, Laure Renotte, 1995 .

The probabilistic maximum independent set problem

Vangelis Th. Paschos, Cécile Murat, 1995 .

An emergency management model for a wireless sensor network problem

Vangelis Th. Paschos, Nicolas Boria, Cécile Murat, 2012 .

The Probabilistic Minimum Vertex‐covering Problem

Vangelis Th. Paschos, Cécile Murat, V. Paschos, 2002 .

Reoptimization of the minimum spanning tree

Vangelis Th. Paschos, Stratos A. Paschos, 2012 .

Laboratoire D'analyse Et Modélisation De Systèmes Pour L'aide À La Décision Cahier Du Lamsade 270 an Overview on Polynomial Approximation of Np-hard Problems

Vangelis Th. Paschos, V. Paschos, 2022 .

Probabilistic Combinatorial Optimization on Graphs

Vangelis Th. Paschos, Cécile Murat, V. Paschos, 2006 .

Efficient approximation by “low-complexity” exponential algorithms

Vangelis Th. Paschos, Bruno Escoffier, Nicolas Bourgeois, 2008 .

Probabilistic models for the Steiner Tree problem

Vangelis Th. Paschos, Vassilis Zissimopoulos, Orestis A. Telelis, 2010 .

A robust 2-stage version for the Steiner tree problem

Vangelis Th. Paschos, Vassilis Zissimopoulos, Orestis A. Telelis, 2007 .

Approximation of weighted hereditary induced subgraph maximization problems

Vangelis Th. Paschos, Marc Demange, 1999 .

Basic concepts in algorithms and complexity theory

Vangelis Th. Paschos, 2013 .

Probabilistic combinatorial optimization problems on graphs: A new domain in operational research

Vangelis Th. Paschos, Cécile Murat, Monia Bellalouna, 1995 .

A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios

Vangelis Th. Paschos, Marc Demange, 1997 .

Maximum-Weight Independent Set is as "Well-Approximated" as the Unweighted One

Vangelis Th. Paschos, Marc Demange, 1999 .

The probabilistic longest path problem

Vangelis Th. Paschos, Cécile Murat, V. Paschos, 1999, Networks.

Approximation Algorithms for Minimum Set Covering Problem: A Survey

Vangelis Th. Paschos, Marc Demange, 1994 .

Paradigms of combinatorial optimization : problems and new approaches

Vangelis Th. Paschos, V. Paschos, 2013 .