8 citations · 66 across the 52 of their papers we have counts for
4 papers · 2 filters
Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery
Hanno von Bergen, Larissa Fastenau, Enna Gerhard +8
We study solution discovery, where the goal is to obtain a feasible solution to a problem from an initial configuration by a bounded sequence of local moves. In many applications,…
On merge-models
Hector Buffière, Yuquan Lin, Jaroslav Nešet{ř}il +2
Tree-ordered weakly sparse models have recently emerged as a robust framework for representing structures in an ``almost sparse'' way, while allowing the structure to be reconstruc…
Characterizations of monadically dependent tree-ordered weakly sparse structures
Hector Buffière, Yuquan Lin, Jaroslav Nešetřil +2
A class of structures is monadically dependent if one cannot interpret all graphs in colored expansions from the class using a fixed first-order formula. A tree-ordered -structu…
Existential Positive Transductions of Sparse Graphs
Nikolas Mählmann, Sebastian Siebertz
Monadic stability generalizes many tameness notions from structural graph theory such as planarity, bounded degree, bounded tree-width, and nowhere density. The sparsification conj…