5 citations · 10 across the 9 of their papers we have counts for
10 papers
Emergency Vertex Cover
Eric Angel, Evangelos Bampas, Evripidis Bampis +4
The Minimum Vertex Cover problem is a fundamental combinatorial optimization problem, aiming to identify a minimum subset of vertices in a graph such that every edge is incident to…
A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graph with Bounded Tree-width
Eric Angel, Sébastien Morais, Damien Regnault
In this paper we study a scheduling problem arising from executing numerical simulations on HPC architectures. With a constant number of parallel machines, the objective is to mini…
Mechanism Design for Maximum Vectors
Eric Angel, Evripidis Bampis
We consider the Maximum Vectors problem in a strategic setting. In the classical setting this problem consists, given a set of -dimensional vectors, in computing the set of all…
Parameterized Power Vertex Cover
Eric Angel, Evripidis Bampis, Bruno Escoffier +1
We study a recently introduced generalization of the Vertex Cover (VC) problem, called Power Vertex Cover (PVC). In this problem, each edge of the input graph is supplied with a po…
Approximating k-Forest with Resource Augmentation: A Primal-Dual Approach
Eric Angel, Nguyen Kim Thang, Shikha Singh
In this paper, we study the -forest problem in the model of resource augmentation. In the -forest problem, given an edge-weighted graph , a parameter , and a set o…
Calibrations Scheduling Problem with Arbitrary Lengths and Activation Length
Eric Angel, Evripidis Bampis, Vincent Chau +1
Bender et al. (SPAA 2013) have proposed a theoretical framework for testing in contexts where safety mistakes must be avoided. Testing in such a context is made by machines that ne…