research
∙
08/21/2023
Weakly synchronous systems with three machines are Turing powerful
Communicating finite-state machines (CFMs) are a Turing powerful model o...
share
research
∙
07/13/2023
Redicolouring digraphs: directed treewidth and cycle-degeneracy
Given a digraph D=(V,A) on n vertices and a vertex v∈ V, the cycle-degre...
research
∙
02/21/2023
Complexity of Maker-Breaker Games on Edge Sets of Graphs
We initiate the study of the algorithmic complexity of Maker-Breaker gam...
research
∙
01/09/2023
Digraph redicolouring
Given two k-dicolourings of a digraph D, we prove that it is PSPACE-comp...
research
∙
12/18/2022
Problems, proofs, and disproofs on the inversion number
The inversion of a set X of vertices in a digraph D consists in reversin...
research
∙
04/29/2022
Preferential attachment hypergraph with vertex deactivation
In the area of complex networks so far hypergraph models have received s...
research
∙
11/23/2017
Centroidal localization game
One important problem in a network is to locate an (invisible) moving en...
research
∙
10/09/2017
Computing metric hulls in graphs
We prove that, given a closure function the smallest preimage of a close...
research
∙
09/18/2017
Localization game on geometric and planar graphs
The main topic of this paper is motivated by a localization problem in c...
research
∙
12/08/2016
