2 citations · 3 across the 14 of their papers we have counts for
Showing 2026Show all
2 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 , ,…
math.CO2026
Stotting in positional games
Johannes Carmesin, Yannick Mogge
We introduce variants of the Maker-Breaker and Waiter-Client games, which we call \emph{stotting}, in which a player grants a slight advantage to the opponent. We prove that a winn…