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
∙
05/01/2020
Cutting Bamboo Down to Size
This paper studies the problem of programming a robotic panda gardener t...
research
∙
10/22/2018
Coalition Resilient Outcomes in Max k-Cut Games
We investigate strong Nash equilibria in the max k-cut game, where we ar...
research
∙
07/15/2018