Davide Bilò

About Davide Bilò

Davide Bilò, With an exceptional h-index of 16 and a recent h-index of 11 (since 2020), a distinguished researcher at Università degli Studi di Sassari, specializes in the field of Design of exact and approximation algorithms, Algorithmic Game Theory.

His recent articles reflect a diverse array of research interests and contributions to the field:

Geometric Network Creation Games

Temporal network creation games

Schelling games with continuous types

Fault-Tolerant ST-Diameter Oracles

Finding Diameter-Reducing Shortcuts in Trees

Compact Distance Oracles with Large Sensitivity and Low Stretch

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

Approximate distance sensitivity oracles in subquadratic space

Davide Bilò Information

University

Position

Associate Professor in C.S. Dipartimento di Scienze Umanistiche e Sociali

Citations(all)

878

Citations(since 2020)

429

Cited By

661

hIndex(all)

16

hIndex(since 2020)

11

i10Index(all)

34

i10Index(since 2020)

16

Email

University Profile Page

Google Scholar

Davide Bilò Skills & Research Interests

Design of exact and approximation algorithms

Algorithmic Game Theory

Top articles of Davide Bilò

Geometric Network Creation Games

SIAM Journal on Discrete Mathematics

2024/3/31

Davide Bilò
Davide Bilò

H-Index: 11

Tobias Friedrich
Tobias Friedrich

H-Index: 17

Temporal network creation games

arXiv preprint arXiv:2305.07494

2023/5/12

Davide Bilò
Davide Bilò

H-Index: 11

Tobias Friedrich
Tobias Friedrich

H-Index: 17

Schelling games with continuous types

arXiv preprint arXiv:2305.06819

2023/5/11

Fault-Tolerant ST-Diameter Oracles

arXiv preprint arXiv:2305.03697

2023/5/5

Davide Bilò
Davide Bilò

H-Index: 11

Tobias Friedrich
Tobias Friedrich

H-Index: 17

Finding Diameter-Reducing Shortcuts in Trees

2023/7/28

Compact Distance Oracles with Large Sensitivity and Low Stretch

2023/7/28

Davide Bilò
Davide Bilò

H-Index: 11

Tobias Friedrich
Tobias Friedrich

H-Index: 17

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

arXiv preprint arXiv:2307.11677

2023/7/21

Approximate distance sensitivity oracles in subquadratic space

2023/6/2

Topological influence and locality in swap Schelling games

Autonomous Agents and Multi-Agent Systems

2022/10

Davide Bilò
Davide Bilò

H-Index: 11

Vittorio Bilò
Vittorio Bilò

H-Index: 15

Blackout-tolerant temporal spanners

2022/9/8

Sparse temporal spanners with low stretch

arXiv preprint arXiv:2206.11113

2022/6/22

Tolerance is necessary for stability: Single-peaked swap schelling games

arXiv preprint arXiv:2204.12599

2022/4/26

Davide Bilò
Davide Bilò

H-Index: 11

Vittorio Bilò
Vittorio Bilò

H-Index: 15

Deterministic sensitivity oracles for diameter, eccentricities and all pairs distances

arXiv preprint arXiv:2204.10679

2022/4/22

Davide Bilò
Davide Bilò

H-Index: 11

Tobias Friedrich
Tobias Friedrich

H-Index: 17

Cutting bamboo down to size

Theoretical Computer Science

2022/3/28

Schelling Games with Continuous Types (short paper)

2022

Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers

2022

Fixed-parameter sensitivity oracles

arXiv preprint arXiv:2112.03059

2021/12/6

Davide Bilò
Davide Bilò

H-Index: 11

Tobias Friedrich
Tobias Friedrich

H-Index: 17

Space-efficient fault-tolerant diameter oracles

arXiv preprint arXiv:2107.03485

2021/7/7

Davide Bilò
Davide Bilò

H-Index: 11

Tobias Friedrich
Tobias Friedrich

H-Index: 17

Near-optimal deterministic single-source distance sensitivity oracles

arXiv preprint arXiv:2106.15731

2021/6/29

Davide Bilò
Davide Bilò

H-Index: 11

Tobias Friedrich
Tobias Friedrich

H-Index: 17

Finding single-source shortest -disjoint paths: fast computation and sparse preservers

arXiv preprint arXiv:2106.12293

2021/6/23

See List of Professors in Davide Bilò University(Università degli Studi di Sassari)

Co-Authors

academic-engine