5 citations · 6 across the 7 of their papers we have counts for
4 papers · 1 filter
The role of counting quantifiers in laminar set systems
Rutger Campbell, Noleen Köhler
Laminar set systems consist of non-crossing subsets of a universe with set inclusion essentially corresponding to the descendant relationship of a tree, the so-called laminar tree.…
CMSO-transductions for tree-like graph decompositions
Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté +2
We give -transductions that, given a graph , output its modular decomposition, its split decomposition and its bi-join decomposition. This improves results…
On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing
Isolde Adler, Noleen Köhler, Pan Peng
We study property testing of properties that are definable in first-order logic (FO) in the bounded-degree graph and relational structure models. We show that any FO property that…
On Testability of First-Order Properties in Bounded-Degree Graphs
Isolde Adler, Noleen Köhler, Pan Peng
We study property testing of properties that are definable in first-order logic (FO) in the bounded-degree graph and relational structure models. We show that any FO property that…