12 citations · 31 across the 24 of their papers we have counts for
28 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…
Nonatomic Non-Cooperative Neighbourhood Balancing Games
David Auger, Johanne Cohen, Antoine Lobstein
We introduce a game where players selfishly choose a resource and endure a cost depending on the number of players choosing nearby resources. We model the influences among resource…
Acyclic colourings of graphs with obstructions
Quentin Chuet, Johanne Cohen, François Pirot
Given a graph , a colouring of is \emph{acyclic} if it is a proper colouring of and every cycle contains at least three colours. Its acyclic chromatic number is…
Designing Strategyproof Election Systems with Score Voting
Johanne Cohen, Daniel Cordeiro, Valentin Dardilhac +1
We focus on the strategyproofness of voting systems where voters must choose a number of options among several possibilities. These systems include those that are used for Particip…
Self-stabilization and byzantine tolerance for maximal independent
Johanne Cohen, Laurence Pilard, François Pirot +1
We analyze the impact of transient and Byzantine faults on the construction of a maximal independent set in a general network. We adapt the self-stabilizing algorithm presented by…
Making Self-Stabilizing any Locally Greedy Problem
Johanne Cohen, Laurence Pilard, Mikaël Rabie +1
We propose a way to transform synchronous distributed algorithms solving locally greedy and mendable problems into self-stabilizing algorithms in anonymous networks. Mendable probl…