BILO', DAVIDE

BILO', DAVIDE  

Dipartimento di Ingegneria e scienze dell'informazione e matematica  

Mostra records
Risultati 1 - 20 di 98 (tempo di esecuzione: 0.024 secondi).
Titolo Data di pubblicazione Autore(i) File
Blackout-tolerant temporal spanners 1-gen-2024 Bilo, D.; D'Angelo, G.; Guala, L.; Leucci, S.; Rossi, M.
Geometric Network Creation Games 1-gen-2024 Bilo', D.; Friedrich, T.; Lenzner, P.; Melnichenko, A.
Compact Distance Oracles with Large Sensitivity and Low Stretch 1-gen-2023 Bilo', Davide; Choudhary, Keerti; Cohen, Sarel; Friedrich, Tobias; Krogmann, Simon; Schirneck, Martin
Schelling Games with Continuous Types (short paper) 1-gen-2023 Bilo', D.; Bilò, V.; Doring, M.; Lenzner, P.; Molitor, L.; Schmidt, J.
Fault-Tolerant ST-Diameter Oracles 1-gen-2023 Bilo', Davide; Keerti, Choudhary; Sarel, Cohen; Tobias, Friedrich; Simon, Krogmann; Martin, Schirneck
Temporal Network Creation Games 1-gen-2023 Bilo', D.; Cohen, S.; Friedrich, T.; Gawendowicz, H.; Klodt, N.; Lenzner, P.; Skretas, G.
Schelling Games with Continuous Types 1-gen-2023 Bilo', D.; Bilò, V.; Doring, M.; Lenzner, P.; Molitor, L.; Schmidt, J.
Finding Diameter-Reducing Shortcuts in Trees 1-gen-2023 Bilò, D.; Guala, L.; Leucci, S.; Sciarria, L. P.
Approximate Distance Sensitivity Oracles in Subquadratic Space 1-gen-2023 Bilo', D.; Chechik, S.; Choudhary, K.; Cohen, S.; Friedrich, T.; Krogmann, S.; Schirneck, M.
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances 1-gen-2022 Bilo', D.; Choudhary, K.; Cohen, S.; Friedrich, T.; Schirneck, M.
Almost optimal algorithms for diameter-optimally augmenting trees 1-gen-2022 Bilo', D.
Fixed-Parameter Sensitivity Oracles 1-gen-2022 Bilò, Davide; Casel, K.; Choudhary, K.; Cohen, S.; Friedrich, T.; Lagodzinski, J. A. G.; Schirneck, M.; Wietheger, S.
Tolerance is Necessary for Stability: Single-Peaked Swap Schelling Games 1-gen-2022 Bilo', D.; Bilo', V.; Lenzner, P.; Molitor, L.
Sparse Temporal Spanners with Low Stretch 1-gen-2022 Bilo', D.; D'Angelo, G.; Guala', L.; Leucci, S.; Rossi, Mirko
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 1-gen-2022 Bilo', Davide; D'Angelo, Gianlorenzo; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 1-gen-2022 Bilò, Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido
Cutting bamboo down to size 1-gen-2022 Bilò, Davide; Gualà, L.; Leucci, S.; Proietti, G.; Scornavacca, G.
New approximation algorithms for the heterogeneous weighted delivery problem 1-gen-2022 Bilo', Davide; Guala', Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko
Topological influence and locality in swap schelling games 1-gen-2022 Bilo', D.; Bilo', V.; Lenzner, P.; Molitor, L.
Blackout-Tolerant Temporal Spanners 1-gen-2022 Bilo', D.; D'Angelo, G.; Guala', L.; Leucci, S.; Rossi, Mirko