Vangelis Th. Paschos
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
41
Venues
20
Active years
1992–2021
Best venue rank
B
Where they publish
Papers
41 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2021 | CIAC | Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation. | Louis Dublois, Michael Lampis, Vangelis Th. Paschos |
| 2021 | WABI | The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet. | Nicolas Boria, Laurent Gourvs, Vangelis Th. Paschos, Jrme Monnot |
| 2019 | WAOA | Improved (In-)Approximability Bounds for d-Scattered Set. | Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos |
| 2018 | WG | Structurally Parameterized d-Scattered Set. | Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos |
| 2017 | ISAAC | Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. | Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos |
| 2016 | AAIM | Algorithmic Aspects of Upper Domination: A Parameterised Perspective. | Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jrme Monnot, Vangelis Th. Paschos |
| 2016 | IWOCA | Upper Domination: Complexity and Approximation. | Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jrme Monnot, Vangelis Th. Paschos |
| 2016 | LATIN | A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. | douard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis |
| 2016 | STACS | Time-Approximation Trade-offs for Inapproximable Problems. | douard Bonnet, Michael Lampis, Vangelis Th. Paschos |
| 2016 | STACS | Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse. | Dimitris Fotakis, Michael Lampis, Vangelis Th. Paschos |
| 2013 | CSR | The Probabilistic Min Dominating Set Problem. | Nicolas Boria, Ccile Murat, Vangelis Th. Paschos |
| 2013 | WALCOM | Exact and Approximation Algorithms for Densest | Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos |
| 2013 | WAOA | On the max min vertex cover Problem. | Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos |
| 2012 | LATIN | Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. | Nicolas Boria, Jrme Monnot, Vangelis Th. Paschos |
| 2012 | TAMC | Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms. | Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire |
| 2012 | WALCOM | Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. | Nicolas Boria, Jrme Monnot, Vangelis Th. Paschos |
| 2011 | FCT | Online Maximum k-Coverage. | Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos |
| 2010 | CSR | The max quasi-independent set Problem. | Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Potti |
| 2010 | SIROCCO | Fast Algorithms for min independent dominating set. | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
| 2010 | TAMC | Maximum Independent Set in Graphs of Average Degree at Most Three in | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij |
| 2009 | ISAAC | Exact Algorithms for Dominating Clique Problems. | Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos |
| 2009 | IWOCA | Approximating the Max Edge-Coloring Problem. | Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos |
| 2009 | WADS | Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
| 2008 | COCOA | Vertex-Uncertainty in Graph-Problems. | Ccile Murat, Vangelis Th. Paschos |
| 2008 | WAOA | On the Maximum Edge Coloring Problem. | Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos |
| 2007 | COCOA | Steiner Forests on Stochastic Metric Graphs. | Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos |
| 2005 | ICCSA | Probabilistic Coloring of Bipartite and Split Graphs. | Federico Della Croce, Bruno Escoffier, Ccile Murat, Vangelis Th. Paschos |
| 2005 | ICCSA | Differential Approximation of min sat, max sat and Related Problems. | Bruno Escoffier, Vangelis Th. Paschos |
| 2005 | ISAAC | Computing Optimal Solutions for the min 3-set covering Problem. | Federico Della Croce, Vangelis Th. Paschos |
| 2005 | SOFSEM | Greedy Differential Approximations for Min Set Cover. | Cristina Bazgan, Jrme Monnot, Vangelis Th. Paschos, Fabrice Serrire |
| 2004 | COCOON | Algorithms for the On-Line Quota Traveling Salesman Problem. | Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos |
| 2004 | ISAAC | Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. | Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos |
| 2004 | ISAAC | Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. | Jrme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier |
| 2004 | WG | The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. | Dominique de Werra, Marc Demange, Jrme Monnot, Vangelis Th. Paschos |
| 2003 | MFCS | Completeness in Differential Approximation Classes. | Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos |
| 2003 | WG | The Probabilistic Minimum Coloring Problem. | Ccile Murat, Vangelis Th. Paschos |
| 2002 | WG | Algorithms and Models for the On-Line Vertex-Covering. | Marc Demange, Vangelis Th. Paschos |
| 2002 | WG | Weighted Node Coloring: When Stable Sets Are Expensive. | Marc Demange, Dominique de Werra, Jrme Monnot, Vangelis Th. Paschos |
| 2001 | FCT | Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2. | Jrme Monnot, Vangelis Th. Paschos, Sophie Toulouse |
| 2000 | SOFSEM | On-Line Maximum-Order Induces Hereditary Subgraph Problems. | Marc Demange, Xavier Paradon, Vangelis Th. Paschos |
| 1992 | LATIN | Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem. | Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad |