Search

Now showing items 1-10 of 243

Structural parameters, tight bounds, and approximation for (k,r)-center.

Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis (2019) Article accepté pour publication ou publié

Multistage Matchings.

Bampis, Evripidis; Escoffier, Bruno; Lampis, Michael; Paschos, Vangelis (2018) Communication / Conférence

Purely combinatorial approximation algorithms for maximum k -vertex cover in bipartite graphs.

Bonnet, Edouard; Escoffier, Bruno; Paschos, Vangelis; Stamoulis, Georgios (2018) Article accepté pour publication ou publié

The many facets of upper domination.

Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning; Jansen, Klaus; Klein, Kim-Manuel; Lampis, Michael; Liedloff, Mathieu; Monnot, Jérôme; Paschos, Vangelis (2018) Article accepté pour publication ou publié

Time-approximation trade-offs for inapproximable problems.

Bonnet, Édouard; Lampis, Michael; Paschos, Vangelis (2018) Article accepté pour publication ou publié

Structurally Parameterized d-Scattered Set.

Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis (2018) Communication / Conférence

Sparsification and subexponential approximation.

Bonnet, Édouard; Paschos, Vangelis (2018) Article accepté pour publication ou publié

The probabilistic minimum dominating set problem.

Boria, Nicolas; Murat, Cécile; Paschos, Vangelis (2018) Article accepté pour publication ou publié

Exact and superpolynomial approximation algorithms for the densest k-subgraph problem.

Bourgeois, Nicolas; Giannakos, Aristotelis; Lucarelli, Giorgio; Milis, Ioannis; Paschos, Vangelis (2017) Article accepté pour publication ou publié

A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs.

Bonnet, Edouard; Escoffier, Bruno; Paschos, Vangelis; Stamoulis, Giorgios (2016) Communication / Conférence

1
2
3
4
. . .
25