13 citations · 46 across the 21 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CC2012★ 1 cited
On the computational complexity of a game of cops and robbers
Marcello Mamino
We study the computational complexity of a perfect-information two-player game proposed by Aigner and Fromme. The game takes place on an undirected graph where n simultaneously mov…
math.LO2012★ 8 cited
Discrete subgroups of locally definable groups
Alessandro Berarducci, Mário Edmundo, Marcello Mamino
We work in the category of locally definable groups in an o-minimal expansion of a field. Eleftheriou and Peterzil conjectured that every definably generated abelian connected grou…