Davide Bilò | DeepAI

DeepAI AI Chat

Featured Co-authors

Tobias Friedrich
70 publications
Pascal Lenzner
25 publications
Gianlorenzo D'Angelo
17 publications
Sarel Cohen
17 publications
Katrin Casel
16 publications
Martin Schirneck
14 publications
Keerti Choudhary
13 publications
Louise Molitor
12 publications
Stefano Leucci
11 publications
Shiri Chechik
11 publications
Vittorio Bilò
9 publications

∙ 07/21/2023

Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs

Despite extensive research on distance oracles, there are still large ga...

0 Davide Bilò, et al. ∙

∙ 05/27/2023

Finding Diameter-Reducing Shortcuts in Trees

In the k-Diameter-Optimally Augmenting Tree Problem we are given a tree ...

0 Davide Bilò, et al. ∙

∙ 05/19/2023

Approximate Distance Sensitivity Oracles in Subquadratic Space

An f-edge fault-tolerant distance sensitive oracle (f-DSO) with stretch ...

0 Davide Bilò, et al. ∙

∙ 05/12/2023

Temporal Network Creation Games

Most networks are not static objects, but instead they change over time....

0 Davide Bilò, et al. ∙

∙ 05/11/2023

Schelling Games with Continuous Types

In most major cities and urban areas, residents form homogeneous neighbo...

0 Davide Bilò, et al. ∙

∙ 05/05/2023

Fault-Tolerant ST-Diameter Oracles

We study the problem of estimating the ST-diameter of a graph that is su...

0 Davide Bilò, et al. ∙

∙ 04/27/2023

Compact Distance Oracles with Large Sensitivity and Low Stretch

An f-edge fault-tolerant distance sensitive oracle (f-DSO) with stretch ...

0 Davide Bilò, et al. ∙

∙ 06/22/2022

Sparse Temporal Spanners with Low Stretch

A temporal graph is an undirected graph G=(V,E) along with a function th...

0 Davide Bilò, et al. ∙

∙ 04/26/2022

Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games

Residential segregation in metropolitan areas is a phenomenon that can b...

0 Davide Bilò, et al. ∙

∙ 04/22/2022

Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances

We construct data structures for extremal and pairwise distances in dire...

0 Davide Bilò, et al. ∙

∙ 12/06/2021

Fixed-Parameter Sensitivity Oracles

We combine ideas from distance sensitivity oracles (DSOs) and fixed-para...

0 Davide Bilò, et al. ∙

∙ 07/07/2021

Space-Efficient Fault-Tolerant Diameter Oracles

We design f-edge fault-tolerant diameter oracles (f-FDOs). We preprocess...

0 Davide Bilò, et al. ∙

∙ 06/29/2021

Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles

Given a graph with a source vertex s, the Single Source Replacement Path...

0 Davide Bilò, et al. ∙

∙ 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...

0 Davide Bilò, et al. ∙

∙ 12/11/2020

Selfish Creation of Social Networks

Understanding real-world networks has been a core research endeavor thro...

0 Davide Bilò, et al. ∙

∙ 09/23/2020

Fair Tree Connection Games with Topology-Dependent Edge Cost

How do rational agents self-organize when trying to connect to a common ...

0 Davide Bilò, et al. ∙

∙ 05/06/2020

Topological Influence and Locality in Swap Schelling Games

Residential segregation is a wide-spread phenomenon that can be observed...

0 Davide Bilò, et al. ∙

∙ 05/01/2020

Cutting Bamboo Down to Size

This paper studies the problem of programming a robotic panda gardener t...

0 Davide Bilò, et al. ∙

∙ 04/15/2019

Geometric Network Creation Games

Network Creation Games are a well-known approach for explaining and anal...

0 Davide Bilò, et al. ∙

∙ 09/24/2018

Almost optimal algorithms for diameter-optimally augmenting trees

We consider the problem of augmenting an n-vertex tree with one shortcu...

0 Davide Bilò, et al. ∙

∙ 07/09/2018

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...

0 Davide Bilò, et al. ∙

∙ 07/03/2018

A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners

Given a 2-edge connected undirected graph G with n vertices and m edges,...

0 Davide Bilò, et al. ∙

∙ 04/28/2018

New algorithms for Steiner tree reoptimization

Reoptimization is a setting in which we are given an (near) optimal sol...

0 Davide Bilò, et al. ∙

∙ 10/04/2017

On the Tree Conjecture for the Network Creation Game

Selfish Network Creation focuses on modeling real world networks from a ...

0 Davide Bilò, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world