Vangelis Th. Paschos
Affiliations:- PSL Research University, France
According to our database1,
Vangelis Th. Paschos
authored at least 161 papers
between 1991 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
0
5
10
15
2
2
1
1
3
1
4
6
2
2
8
5
8
6
2
7
10
1
4
7
9
5
6
3
1
1
3
2
3
1
1
1
2
1
1
1
4
3
3
3
2
3
2
1
4
3
1
2
1
1
1
3
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Discret. Appl. Math., March, 2024
2023
J. Graph Algorithms Appl., 2023
2022
Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation.
Theor. Comput. Sci., 2022
2021
Proceedings of the 21st International Workshop on Algorithms in Bioinformatics, 2021
2019
Discret. Appl. Math., 2019
A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs.
CoRR, 2019
CoRR, 2019
2018
Combinatorial approximation of maximum <i>k</i>-vertex cover in bipartite graphs within ratio 0.7.
RAIRO Oper. Res., 2018
J. Comput. Syst. Sci., 2018
Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs.
Discret. Optim., 2018
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
RAIRO Oper. Res., 2017
Exact and superpolynomial approximation algorithms for the densest k-subgraph problem.
Eur. J. Oper. Res., 2017
2016
Parameterized exact and approximation algorithms for maximum <i>k</i>-set cover and related satisfiability problems.
RAIRO Theor. Informatics Appl., 2016
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016
Proceedings of the Algorithmic Aspects in Information and Management, 2016
2015
New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set.
Theory Comput. Syst., 2015
Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio~0.7.
CoRR, 2015
Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n, p)$ random model.
CoRR, 2015
Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization.
Algorithmica, 2015
2014
Theor. Comput. Sci., 2014
Theor. Comput. Sci., 2014
2013
Theor. Comput. Sci., 2013
J. Discrete Algorithms, 2013
Reoptimization under Vertex Insertion: Max P<sub>K</sub>-Free Subgraph and Max Planar Subgraph.
Discret. Math. Algorithms Appl., 2013
Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability.
Discret. Optim., 2013
CoRR, 2013
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013
Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013
Proceedings of the Computer Science - Theory and Applications, 2013
2012
Subexponential and FPT-time Inapproximability of Independent Set and Related Problems
CoRR, 2012
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012
2011
RAIRO Oper. Res., 2011
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms.
Discret. Appl. Math., 2011
2010
J. Discrete Algorithms, 2010
Algorithmic Oper. Res., 2010
Maximum Independent Set in Graphs of Average Degree at Most Three in <i>O</i>(1.08537<sup><i>n</i></sup>){\mathcal O}(1.08537^n).
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010
Proceedings of the Algorithm Theory, 2010
Proceedings of the Structural Information and Communication Complexity, 2010
2009
Theor. Comput. Sci., 2009
J. Discrete Algorithms, 2009
Inf. Process. Lett., 2009
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation.
Discret. Appl. Math., 2009
Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2.
Discret. Appl. Math., 2009
Algorithmic Oper. Res., 2009
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
2008
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems.
Oper. Res., 2008
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008
Proceedings of the Combinatorial Optimization and Applications, 2008
Combinatorial Optimization and Theoretical Computer Science - Interfaces and Perspectives: 30th Anniversary of the LAMSADE.
Wiley, ISBN: 978-1-8482-1021-9, 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Oper. Res. Lett., 2007
Proceedings of the Internet and Network Economics, Third International Workshop, 2007
Proceedings of the Combinatorial Optimization and Applications, 2007
2006
Inf. Process. Lett., 2006
Jon Lee, A First Course in Combinatorial Optimization, Cambridge Texts in Applied Mathematics.
Eur. J. Oper. Res., 2006
Eur. J. Oper. Res., 2006
Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2.
Electron. Notes Discret. Math., 2006
Discret. Appl. Math., 2006
Proceedings of the Theory of Computing 2006, 2006
2005
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness.
Theor. Comput. Sci., 2005
Theory Comput. Syst., 2005
Int. Trans. Oper. Res., 2005
Int. J. Found. Comput. Sci., 2005
Polynomial approximation algorithms with performance guarantees: An introduction-by-example.
Eur. J. Oper. Res., 2005
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Proceedings of the Computational Science and Its Applications, 2005
Proceedings of the Computational Science and Its Applications, 2005
2004
Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem.
J. Sched., 2004
Inf. Process. Lett., 2004
Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation.
Int. J. Comput. Math., 2004
Eur. J. Oper. Res., 2004
The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
2003
Tech. Sci. Informatiques, 2003
Math. Methods Oper. Res., 2003
Differential approximation results for the traveling salesman problem with distances 1 and 2.
Eur. J. Oper. Res., 2003
Eur. J. Oper. Res., 2003
Appl. Math. Lett., 2003
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003
2002
Theor. Comput. Sci., 2002
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances.
RAIRO Oper. Res., 2002
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation.
RAIRO Oper. Res., 2002
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002
2001
2000
Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000
1999
Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems.
RAIRO Oper. Res., 1999
Oper. Res. Lett., 1999
1998
Theor. Comput. Sci., 1998
Average-Case Complexity for the Execution of Recursive Definitions on Relational Databases.
Acta Informatica, 1998
1997
ACM Comput. Surv., 1997
The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems.
Comput. Optim. Appl., 1997
A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts.
Ann. Oper. Res., 1997
1996
On an Approximation Measure Founded on the Links Between Optimization and Polynomial Approximation Theory.
Theor. Comput. Sci., 1996
1995
Theor. Comput. Sci., 1995
Proceedings of the Combinatorics and Computer Science, 1995
1994
Inf. Process. Lett., 1994
1992
Inf. Process. Lett., 1992
Evaluation of the Execution Cost of Recursive Definitions.
Comput. J., 1992
Proceedings of the LATIN '92, 1992
1991
On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems.
IEEE Trans. Computers, 1991
Proceedings of the MFDBS 91, 1991
On the Complexity of Some Hamiltonian and Eulerian Problems in Edge-Colored Complete Graphs.
Proceedings of the ISA '91 Algorithms, 1991
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991