
Faster motif counting via succinct color coding and adaptive sampling
We address the problem of computing the distribution of induced connecte...
read it

Cutting Bamboo Down to Size
This paper studies the problem of programming a robotic panda gardener t...
read it

Motivo: fast motif counting via succinct color coding and adaptive sampling
The randomized technique of color coding is behind stateoftheart algo...
read it

A Nearly Optimal Algorithm for Approximate Minimum Selection with Unreliable Comparisons
We consider the approximate minimum selection problem in presence of ind...
read it

Optimal Sorting with Persistent Comparison Errors
We consider the problem of sorting n elements in the case of persistent ...
read it

Hardness, Approximability, and FixedParameter Tractability of the Clustered ShortestPath Tree Problem
Given an nvertex nonnegatively realweighted graph G, whose vertices a...
read it

No truthful mechanism can be better than n approximate for two natural problems
This work gives the first natural nonutilitarian problems for which the...
read it
Stefano Leucci
is this you? claim profile