research
∙
05/27/2023
Finding Diameter-Reducing Shortcuts in Trees
In the k-Diameter-Optimally Augmenting Tree Problem we are given a tree ...
share
research
∙
06/22/2022
Sparse Temporal Spanners with Low Stretch
A temporal graph is an undirected graph G=(V,E) along with a function th...
research
∙
09/20/2021
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
We study the problem of designing a resilient data structure maintaining...
research
∙
06/23/2021
Finding single-source shortest p-disjoint paths: fast computation and sparse preservers
Let G be a directed graph with n vertices, m edges, and non-negative edg...
research
∙
09/04/2020
Faster motif counting via succinct color coding and adaptive sampling
We address the problem of computing the distribution of induced connecte...
research
∙
05/01/2020
Cutting Bamboo Down to Size
This paper studies the problem of programming a robotic panda gardener t...
research
∙
06/04/2019
Motivo: fast motif counting via succinct color coding and adaptive sampling
The randomized technique of color coding is behind state-of-the-art algo...
research
∙
05/05/2018
A Nearly Optimal Algorithm for Approximate Minimum Selection with Unreliable Comparisons
We consider the approximate minimum selection problem in presence of ind...
research
∙
04/20/2018
Optimal Sorting with Persistent Comparison Errors
We consider the problem of sorting n elements in the case of persistent ...
research
∙
01/31/2018
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...
research
∙
12/18/2017