BILO', DAVIDE
BILO', DAVIDE
Dipartimento di Ingegneria e scienze dell'informazione e matematica
Approximate Distance Sensitivity Oracles in Subquadratic Space
2024-01-01 Bilo', Davide; Chechik, Shiri; Choudhary, Keerti; Cohen, Sarel; Friedrich, Tobias; Krogmann, Simon; Schirneck, Martin
Temporal Queries for Dynamic Temporal Forests
2024-01-01 Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Straziota, Alessandro
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper)
2024-01-01 Bilo', D.; Colli, G.; Forlizzi, L.; Leucci, S.
Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard
2024-01-01 Bilo', Davide; DI DONATO, Luca; Gualà, Luciano; Leucci, Stefano
Graph Spanners for Group Steiner Distances
2024-01-01 Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Straziota, Alessandro
Swapping Mixed-Up Beers to Keep Them Cool
2024-01-01 Bilo', Davide; Fiusco, Maurizio; Gualà, Luciano; Leucci, Stefano
Blackout-tolerant temporal spanners
2024-01-01 Bilo, D.; D'Angelo, G.; Guala, L.; Leucci, S.; Rossi, M.
Geometric Network Creation Games
2024-01-01 Bilo', D.; Friedrich, T.; Lenzner, P.; Melnichenko, A.
New Algorithms for Steiner Tree Reoptimization
2024-01-01 Bilo', Davide
Improved Distance (Sensitivity) Oracles with Subquadratic Space
2024-01-01 Bilo', Davide.; Chechik, S.; Choudhary, K.; Cohen, S.; Friedrich, T.; Schirneck, M.
Fault-Tolerant ST-Diameter Oracles
2023-01-01 Bilo', Davide; Keerti, Choudhary; Sarel, Cohen; Tobias, Friedrich; Simon, Krogmann; Martin, Schirneck
Schelling Games with Continuous Types (short paper)
2023-01-01 Bilo', D.; Bilò, V.; Doring, M.; Lenzner, P.; Molitor, L.; Schmidt, J.
Approximate Distance Sensitivity Oracles in Subquadratic Space
2023-01-01 Bilo', D.; Chechik, S.; Choudhary, K.; Cohen, S.; Friedrich, T.; Krogmann, S.; Schirneck, M.
Compact Distance Oracles with Large Sensitivity and Low Stretch
2023-01-01 Bilo', Davide; Choudhary, Keerti; Cohen, Sarel; Friedrich, Tobias; Krogmann, Simon; Schirneck, Martin
Finding Diameter-Reducing Shortcuts in Trees
2023-01-01 Bilò, D.; Guala, L.; Leucci, S.; Sciarria, L. P.
Schelling Games with Continuous Types
2023-01-01 Bilo', D.; Bilò, V.; Doring, M.; Lenzner, P.; Molitor, L.; Schmidt, J.
Temporal Network Creation Games
2023-01-01 Bilo', D.; Cohen, S.; Friedrich, T.; Gawendowicz, H.; Klodt, N.; Lenzner, P.; Skretas, G.
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers
2022-01-01 Bilò, Davide; D'Angelo, Gianlorenzo; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko
Sparse Temporal Spanners with Low Stretch
2022-01-01 Bilo', D.; D'Angelo, G.; Guala', L.; Leucci, S.; Rossi, Mirko
Fixed-Parameter Sensitivity Oracles
2022-01-01 Bilò, Davide; Casel, K.; Choudhary, K.; Cohen, S.; Friedrich, T.; Lagodzinski, J. A. G.; Schirneck, M.; Wietheger, S.
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Approximate Distance Sensitivity Oracles in Subquadratic Space | 1-gen-2024 | Bilo', Davide; Chechik, Shiri; Choudhary, Keerti; Cohen, Sarel; Friedrich, Tobias; Krogmann, Simon; Schirneck, Martin | |
| Temporal Queries for Dynamic Temporal Forests | 1-gen-2024 | Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Straziota, Alessandro | |
| On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper) | 1-gen-2024 | Bilo', D.; Colli, G.; Forlizzi, L.; Leucci, S. | |
| Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard | 1-gen-2024 | Bilo', Davide; DI DONATO, Luca; Gualà, Luciano; Leucci, Stefano | |
| Graph Spanners for Group Steiner Distances | 1-gen-2024 | Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Straziota, Alessandro | |
| Swapping Mixed-Up Beers to Keep Them Cool | 1-gen-2024 | Bilo', Davide; Fiusco, Maurizio; Gualà, Luciano; Leucci, Stefano | |
| 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. | |
| New Algorithms for Steiner Tree Reoptimization | 1-gen-2024 | Bilo', Davide | |
| Improved Distance (Sensitivity) Oracles with Subquadratic Space | 1-gen-2024 | Bilo', Davide.; Chechik, S.; Choudhary, K.; Cohen, S.; Friedrich, T.; Schirneck, M. | |
| Fault-Tolerant ST-Diameter Oracles | 1-gen-2023 | Bilo', Davide; Keerti, Choudhary; Sarel, Cohen; Tobias, Friedrich; Simon, Krogmann; Martin, Schirneck | |
| Schelling Games with Continuous Types (short paper) | 1-gen-2023 | Bilo', D.; Bilò, V.; Doring, M.; Lenzner, P.; Molitor, L.; Schmidt, J. | |
| Approximate Distance Sensitivity Oracles in Subquadratic Space | 1-gen-2023 | Bilo', D.; Chechik, S.; Choudhary, K.; Cohen, S.; Friedrich, T.; Krogmann, S.; Schirneck, M. | |
| Compact Distance Oracles with Large Sensitivity and Low Stretch | 1-gen-2023 | Bilo', Davide; Choudhary, Keerti; Cohen, Sarel; Friedrich, Tobias; Krogmann, Simon; Schirneck, Martin | |
| Finding Diameter-Reducing Shortcuts in Trees | 1-gen-2023 | Bilò, D.; Guala, L.; Leucci, S.; Sciarria, L. P. | |
| Schelling Games with Continuous Types | 1-gen-2023 | Bilo', D.; Bilò, V.; Doring, M.; Lenzner, P.; Molitor, L.; Schmidt, J. | |
| Temporal Network Creation Games | 1-gen-2023 | Bilo', D.; Cohen, S.; Friedrich, T.; Gawendowicz, H.; Klodt, N.; Lenzner, P.; Skretas, G. | |
| Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers | 1-gen-2022 | Bilò, Davide; D'Angelo, Gianlorenzo; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Rossi, Mirko | |
| Sparse Temporal Spanners with Low Stretch | 1-gen-2022 | Bilo', D.; D'Angelo, G.; Guala', L.; Leucci, S.; Rossi, Mirko | |
| 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. |