1 code implementation • 1 May 2020 • Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Giacomo Scornavacca
As a computer scientist, you found out that this problem has already been formalized in [G\k{a}sieniec et al., SOFSEM'17] as the Bamboo Garden Trimming (BGT) problem, where the goal is that of computing a perpetual schedule (i. e., the sequence of bamboos to cut) for the robotic gardener to follow in order to minimize the makespan, i. e., the maximum height ever reached by a bamboo.
Data Structures and Algorithms
1 code implementation • 4 Jun 2019 • Marco Bressan, Stefano Leucci, Alessandro Panconesi
To give an idea of the improvements, in $40$ minutes Motivo counts $7$-nodes motifs on a graph with $65$M nodes and $1. 8$B edges; this is $30$ and $500$ times larger than the state of the art, respectively in terms of nodes and edges.
no code implementations • 2 Mar 2016 • Matteo Almanza, Stefano Leucci, Alessandro Panconesi
Recently, due to the widespread diffusion of smart-phones, mobile puzzle games have experienced a huge increase in their popularity.
Computational Complexity
