Vangélis Th. Paschos

activity

20092019

most citedFast Algorithms for Max Independent Set in Graphs of Small Average Degree

7 citations · 14 across the 4 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2015★ 2 cited

Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $G (n, p)$ random model

N. Bourgeois, R. Catellier, T. Denat +1

We study average-case complexity of branch-and-bound for maximum independent set in random graphs under the $G (n, p)$ distribution. In this model every pair $(u, v)$ of ver…

cs.CC2013★ 2 cited

Parameterized Exact and Approximation Algorithms for Maximum $k$ -Set Cover and Related Satisfiability Problems

Edouard Bonnet, Vangelis Th. Paschos, Florian Sikora

Given a family of subsets $S$ over a set of elements~ $X$ and two integers~ $p$ and~ $k$ , Max k-Set Cover consists of finding a subfamily~ $T \subseteq S$ of…

Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the G(n,p) random model

Parameterized Exact and Approximation Algorithms for Maximum k-Set Cover and Related Satisfiability Problems

Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $G (n, p)$ random model

Parameterized Exact and Approximation Algorithms for Maximum $k$ -Set Cover and Related Satisfiability Problems