10 citations · 17 across the 14 of their papers we have counts for
Showing 2025 · cs.LOShow all
2 papers · 2 filters
cs.LO2025
The memory of -regular and BC() objectives
Antonio Casares, Pierre Ohlmann
In the context of 2-player zero-sum infinite-duration games played on (potentially infinite) graphs, the memory of an objective is the smallest integer k such that in any game won…
cs.LO2025
Trees in graphs of large linear cliquewidth
Mikołaj Bojańczyk, Pierre Ohlmann
The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precise…