When polynomial approximation meets exact computation von Paschos, Vangelis Th

Volltext

Improved (In-)Approximability Bounds for d-Scattered Set von Katsikarelis, Ioannis, Lampis, Michael, Paschos, Vangelis

Volltext

Exact and superpolynomial approximation algorithms for the densest k-subgraph problem von Bourgeois, Nicolas, Giannakos, Aristotelis, Lucarelli, Giorgio, Milis, Ioannis, Paschos, Vangelis Th

Volltext

Applications of Combinatorial Optimization, 2nd Edition von Vangelis Th. Paschos

Volltext

Approximating MAX SAT by moderately exponential and parameterized algorithms von Escoffier, Bruno, Paschos, Vangelis Th, Tourniaire, Emeric

Volltext

New Algorithms for Mixed Dominating Set von Dublois, Louis, Lampis, Michael, Paschos, Vangelis Th

Volltext

Structurally parameterized d-scattered set von Katsikarelis, Ioannis, Lampis, Michael, Paschos, Vangelis Th

Volltext

New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set von Escoffier, Bruno, Monnot, Jérôme, Paschos, Vangelis Th, Xiao, Mingyu

Volltext

Paradigms of combinatorial optimization: problems and new approaches von Paschos, Vangelis Th

Volltext

Structural parameters, tight bounds, and approximation for (k,r)-center von Katsikarelis, Ioannis, Lampis, Michael, Paschos, Vangelis Th

Volltext

Combinatorial optimization and theoretical computer science: interfaces and perspectives von Paschos, Vangelis Th

Volltext

Efficient algorithms for the max  $$k$$ -vertex cover problem von Della Croce, Federico, Paschos, Vangelis Th

Volltext

A survey on combinatorial optimization in dynamic environments von Boria, Nicolas, Paschos, Vangelis T.

Volltext

Concepts of Combinatorial Optimization von Paschos, Vangelis Th

Volltext

Applications of Combinatorial Optimization von Paschos, Vangelis Th

Volltext

The many facets of upper domination von Bazgan, Cristina, Brankovic, Ljiljana, Casel, Katrin, Fernau, Henning, Jansen, Klaus, Klein, Kim-Manuel, Lampis, Michael, Liedloff, Mathieu, Monnot, Jérôme, Paschos, Vangelis Th

Volltext

Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation von Dublois, Louis, Lampis, Michael, Paschos, Vangelis Th

Volltext

Fast Algorithms for max independent set von Bourgeois, Nicolas, Escoffier, Bruno, Paschos, Vangelis T., van Rooij, Johan M. M.

Volltext

Exponential approximation schemata for some network design problems von Boria, Nicolas, Bourgeois, Nicolas, Escoffier, Bruno, Paschos, Vangelis Th

Volltext

Reoptimization of the minimum spanning tree von Paschos, Stratos A., Paschos, Vangelis Th

Volltext