Structurally Parameterized d-Scattered Set von Katsikarelis, Ioannis, Lampis, Michael, Th. Paschos, Vangelis

Volltext

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

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

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

Volltext

Applications of Combinatorial Optimization von Paschos, Vangelis Th

Volltext

Concepts of Combinatorial Optimization von Paschos, Vangelis Th

Volltext

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

Volltext

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

Volltext

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

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

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

Volltext

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

Volltext

Fast reoptimization for the minimum spanning tree problem von Boria, Nicolas, Paschos, Vangelis Th

Volltext

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

Volltext

Algorithms and Complexity: 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings von Paschos, Vangelis Th, Widmayer, Peter

Volltext

When polynomial approximation meets exact computation von Paschos, Vangelis Th

Volltext

Approximation of min coloring by moderately exponential algorithms von Bourgeois, Nicolas, Escoffier, Bruno, Paschos, Vangelis Th

Volltext

Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness von Bazgan, Cristina, Escoffier, Bruno, Paschos, Vangelis Th

Volltext

Average-case complexity of a branch-and-bound algorithm for Min Dominating Set von Denat, Tom, Harutyunyan, Ararat, Melissinos, Nikolaos, Paschos, Vangelis Th

Volltext

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

Volltext