6 citations · 7 across the 2 of their papers we have counts for
3 papers
Online Multistage Subset Maximization Problems
Evripidis Bampis, Bruno Escoffier, Kevin Schewior +1
Numerous combinatorial optimization problems (knapsack, maximum-weight matching, etc.) can be expressed as \emph{subset maximization problems}: One is given a ground set $N=\{1,\do…
Subexponential and FPT-time Inapproximability of Independent Set and Related Problems
Bruno Escoffier, EunJung Kim, Vangelis Th. Paschos
Fixed-parameter algorithms, approximation algorithms and moderately exponential algorithms are three major approaches to algorithms design. While each of them being very active in…
Minimum regulation of uncoordinated matchings
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Due to the lack of coordination, it is unlikely that the selfish players of a strategic game reach a socially good state. A possible way to cope with selfishness is to compute a de…