Reductions, completeness and the hardness of approximability von Ausiello, G., Paschos, V.Th

Volltext

Time slot scheduling of compatible jobs von Demange, M, de Werra, D, Monnot, J, Paschos, V Th

Volltext

Polynomial approximation and graph-coloring von PASCHOS, V. Th

Volltext

Fast algorithms for min independent dominating set von Bourgeois, N., Della Croce, F., Escoffier, B., Paschos, V.Th

Volltext

Online maximum k-coverage von Ausiello, G., Boria, N., Giannakos, A., Lucarelli, G., Paschos, V.Th

Volltext

Weighted coloring on planar, bipartite and split graphs: Complexity and approximation von de Werra, D., Demange, M., Escoffier, B., Monnot, J., Paschos, V.Th

Volltext

Efficient approximation of min set cover by moderately exponential algorithms von Bourgeois, N., Escoffier, B., Paschos, V.Th

Volltext

Algorithms for dominating clique problems von Bourgeois, N., Della Croce, F., Escoffier, B., Paschos, V.Th

Volltext

Approximating the max-edge-coloring problem von Bourgeois, N., Lucarelli, G., Milis, I., Paschos, V.Th

Volltext

Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 von Baburin, A.E., Della Croce, F., Gimadi, E.K., Glazkov, Y.V., Paschos, V.Th

Volltext

An exact algorithm for MAX-CUT in sparse graphs von Della Croce, F., Kaminski, M.J., Paschos, V.Th

Volltext

A priori optimization for the probabilistic maximum independent set problem von Murat, Cécile, Paschos, Vangelis Th

Volltext

An O(1.0977n) Exact Algorithm for max independent set in Sparse Graphs von Bourgeois, Nicolas, Escoffier, Bruno, Paschos, Vangelis Th

Volltext

Probabilistic coloring of bipartite and split graphs von DELLA CROCE, F, ESCOFFIER, B, MURAT, C, PASCHOS, V. Th

Volltext

A hypocoloring model for batch scheduling von de Werra, D., Demange, M., Monnot, J., Paschos, V.Th

Volltext

Completeness in Differential Approximation Classes von Ausiello, G., Bazgan, C., Demange, M., Paschos, V. Th

Volltext

Differential approximation results for the Steiner tree problem von Demange, M, Monnot, J, Paschos, V.Th

Volltext

Probabilistic graph-coloring in bipartite and split graphs von Bourgeois, N., Della Croce, F., Escoffier, B., Murat, C., Paschos, V. Th

Volltext

A theorem on the approximation of set cover and vertex cover von Paschos, V. Th

Volltext

Bridging gap between standard and differential polynomial approximation: The case of bin-packing von Demange, M., Monnot, J., Paschos, V.Th

Volltext