Showing 2026Show all
3 papers · 1 filter
cs.DM2026
The disjoint separators problem in graphs
Thomas Delépine, Florian Galliot, Yannick Mogge +2
We study the disjoint separators problem in graphs, an analogue of the famous disjoint paths problem. Given a graph and four pairwise disjoint subsets of vertices , ,…
cs.GT2026
A two-player version of the assignment problem
Florian Galliot, Nacim Oijid, Jonas Sénizergues
We introduce the competitive assignment problem, a two-player version of the well-known assignment problem. Given a set of tasks and a set of agents with different efficiencies for…
cs.DM2026
Token positional games
Guillaume Bagan, Quentin Deschamps, Florian Galliot +2
The classical Maker-Breaker positional game is played on a board which is a hypergraph , with two players, Maker and Breaker, alternately claiming vertices of $\mathca…