-
Faster motif counting via succinct color coding and adaptive sampling
We address the problem of computing the distribution of induced connecte...
09/04/2020 ∙ by Marco Bressan, et al. ∙
0
∙
share
read it
-
Cutting Bamboo Down to Size
This paper studies the problem of programming a robotic panda gardener t...
05/01/2020 ∙ by Davide Bilò, et al. ∙
0
∙
share
read it
-
Motivo: fast motif counting via succinct color coding and adaptive sampling
The randomized technique of color coding is behind state-of-the-art algo...
06/04/2019 ∙ by Marco Bressan, et al. ∙
0
∙
share
read it
-
A Nearly Optimal Algorithm for Approximate Minimum Selection with Unreliable Comparisons
We consider the approximate minimum selection problem in presence of ind...
05/05/2018 ∙ by Stefano Leucci, et al. ∙
0
∙
share
read it
-
Optimal Sorting with Persistent Comparison Errors
We consider the problem of sorting n elements in the case of persistent ...
04/20/2018 ∙ by Barbara Geissmann, et al. ∙
0
∙
share
read it
-
Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem
Given an n-vertex non-negatively real-weighted graph G, whose vertices a...
01/31/2018 ∙ by Mattia D'Emidio, et al. ∙
0
∙
share
read it
-
No truthful mechanism can be better than n approximate for two natural problems
This work gives the first natural non-utilitarian problems for which the...
12/18/2017 ∙ by Stefano Leucci, et al. ∙
0
∙
share
read it
Stefano Leucci
is this you? claim profile
0
followers
Università degli Studi dell'Aquila
∙
Max Planck Society
∙
ETH Zurich
