
SpaceEfficient FaultTolerant Diameter Oracles
We design fedge faulttolerant diameter oracles (fFDOs). We preprocess...
read it

NearOptimal Deterministic SingleSource Distance Sensitivity Oracles
Given a graph with a source vertex s, the Single Source Replacement Path...
read it

Finding singlesource shortest pdisjoint paths: fast computation and sparse preservers
Let G be a directed graph with n vertices, m edges, and nonnegative edg...
read it

Selfish Creation of Social Networks
Understanding realworld networks has been a core research endeavor thro...
read it

Fair Tree Connection Games with TopologyDependent Edge Cost
How do rational agents selforganize when trying to connect to a common ...
read it

Topological Influence and Locality in Swap Schelling Games
Residential segregation is a widespread phenomenon that can be observed...
read it

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

Geometric Network Creation Games
Network Creation Games are a wellknown approach for explaining and anal...
read it

Almost optimal algorithms for diameteroptimally augmenting trees
We consider the problem of augmenting an nvertex tree with one shortcu...
read it

An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs
In this draft we prove an interesting structural property related to the...
read it

A Novel Algorithm for the AllBestSwapEdge Problem on Tree Spanners
Given a 2edge connected undirected graph G with n vertices and m edges,...
read it

New algorithms for Steiner tree reoptimization
Reoptimization is a setting in which we are given an (near) optimal sol...
read it

On the Tree Conjecture for the Network Creation Game
Selfish Network Creation focuses on modeling real world networks from a ...
read it
Davide Bilò
is this you? claim profile