#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2008

2018

- This year (4)
- Last 5 years (18)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Marcello Mamino
- Theor. Comput. Sci.
- 2013

We study the computational complexity of a perfect-information twoplayer game proposed by Aigner and Fromme in [AF–84]. The game takes place on an undirected graph where n simultaneously moving cops… (More)

It is known that a definably compact group G is an extension of a compact Lie group L by a divisible torsion-free normal subgroup. We show that the o-minimal higher homotopy groups of G are… (More)

There is a complex relation between the mechanism of preferential attachment, scale-free degree distributions and hyperbolicity in complex networks. In fact, both preferential attachment and hidden… (More)

- Marcello Mamino, Giovanni Viglietta
- CCCG
- 2016

A fundamental problem in Distributed Computing is the Pattern Formation problem, where some independent mobile entities, called robots, have to rearrange themselves in such a way as to form a given… (More)

- Alessandro Berarducci, Marcello Mamino
- J. London Math. Society
- 2011

We consider definably compact groups in an o-minimal expansion of a real closed field. It is known that to each such group G is associated a natural exact sequence 1 → G → G → G/G → 1 where G is the… (More)

- Marcello Mamino
- J. Symb. Log.
- 2011

An argument of A. Borel [Bor–61, Proposition 3.1] shows that every compact connected Lie group is homeomorphic to the Cartesian product of its derived subgroup and a torus. We prove a parallel result… (More)

- Manuel Bodirsky, Marcello Mamino
- Theory of Computing Systems
- 2017

A semilinear relation S⊆ℚn$S \subseteq {\mathbb {Q}}^{n}$ is max-closed if it is preserved by taking the componentwise maximum. The constraint satisfaction problem for max-closed semilinear… (More)

- Manuel Bodirsky, Marcello Mamino
- CSR
- 2016

A semilinear relation S ⊆ Qn is max-closed if it is preserved by taking the componentwise maximum. The constraint satisfaction problem for max-closed semilinear constraints is at least as hard as… (More)