2 papers
cs.DS2026
Nemesis, an Escape Game in Graphs
Pierre Bergé, Antoine Dailly, Yan Gerard
We define a new escape game in graphs that we call Nemesis. The game is played on a graph having a subset of vertices labeled as exits and the goal of one of the two players, calle…
math.CO2025
Reconstructing graphs with subgraph compositions
Antoine Dailly, Tuomo Lehtilä
We generalize the problem of reconstructing strings from their substring compositions first introduced by Acharya et al. in 2015 motivated by polymer-based advanced data storage sy…