BILO', DAVIDE
BILO', DAVIDE
Dipartimento di Ingegneria e scienze dell'informazione e matematica
Almost Tight Oracles for Fastest-Path Queries on Temporal Trees
2025-01-01 Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Straziota, Alessandro
On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
2025-01-01 Bilo', D.; Colli, G.; Forlizzi, L.; Leucci, S.
Finding diameter-reducing shortcuts in trees
2025-01-01 Bilo', Davide; Gualà, L.; Leucci, S.; Pepè Sciarria, L.
On the Approximability of Graph Visibility Problems
2025-01-01 Bilo', Davide; Di Fonso, A.; Di Stefano, G.; Leucci, S.
Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
2025-01-01 Bilo', Davide; Choudhary, K.; Cohen, S.; Friedrich, T.; Schirneck, M.
Uniform-budget solo chess with only rooks or only knights is hard
2025-01-01 Bilo', Davide; Di Donato, Luca; Gualà, Luciano; Leucci, Stefano
Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard
2024-01-01 Bilo', Davide; DI DONATO, Luca; Gualà, Luciano; Leucci, Stefano
Approximate Distance Sensitivity Oracles in Subquadratic Space
2024-01-01 Bilo', Davide; Chechik, Shiri; Choudhary, Keerti; Cohen, Sarel; Friedrich, Tobias; Krogmann, Simon; Schirneck, Martin
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper)
2024-01-01 Bilo', D.; Colli, G.; Forlizzi, L.; Leucci, S.
Blackout-tolerant temporal spanners
2024-01-01 Bilo, D.; D'Angelo, G.; Guala, L.; Leucci, S.; Rossi, M.
Swapping Mixed-Up Beers to Keep Them Cool
2024-01-01 Bilo', Davide; Fiusco, Maurizio; Gualà, Luciano; Leucci, Stefano
Geometric Network Creation Games
2024-01-01 Bilo', D.; Friedrich, T.; Lenzner, P.; Melnichenko, A.
Temporal Queries for Dynamic Temporal Forests
2024-01-01 Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Straziota, Alessandro
Graph Spanners for Group Steiner Distances
2024-01-01 Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Straziota, Alessandro
Improved Distance (Sensitivity) Oracles with Subquadratic Space
2024-01-01 Bilo', Davide.; Chechik, S.; Choudhary, K.; Cohen, S.; Friedrich, T.; Schirneck, M.
New Algorithms for Steiner Tree Reoptimization
2024-01-01 Bilo', Davide
Fault-Tolerant ST-Diameter Oracles
2023-01-01 Bilo', Davide; Keerti, Choudhary; Sarel, Cohen; Tobias, Friedrich; Simon, Krogmann; Martin, Schirneck
Finding Diameter-Reducing Shortcuts in Trees
2023-01-01 Bilò, D.; Guala, L.; Leucci, S.; Sciarria, L. P.
Approximate Distance Sensitivity Oracles in Subquadratic Space
2023-01-01 Bilo', D.; Chechik, S.; Choudhary, K.; Cohen, S.; Friedrich, T.; Krogmann, S.; Schirneck, M.
Schelling Games with Continuous Types
2023-01-01 Bilo', D.; Bilò, V.; Doring, M.; Lenzner, P.; Molitor, L.; Schmidt, J.
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| Almost Tight Oracles for Fastest-Path Queries on Temporal Trees | 1-gen-2025 | Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Straziota, Alessandro | |
| On the (In)Approximability of the Monitoring Edge Geodetic Set Problem | 1-gen-2025 | Bilo', D.; Colli, G.; Forlizzi, L.; Leucci, S. | |
| Finding diameter-reducing shortcuts in trees | 1-gen-2025 | Bilo', Davide; Gualà, L.; Leucci, S.; Pepè Sciarria, L. | |
| On the Approximability of Graph Visibility Problems | 1-gen-2025 | Bilo', Davide; Di Fonso, A.; Di Stefano, G.; Leucci, S. | |
| Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks | 1-gen-2025 | Bilo', Davide; Choudhary, K.; Cohen, S.; Friedrich, T.; Schirneck, M. | |
| Uniform-budget solo chess with only rooks or only knights is hard | 1-gen-2025 | Bilo', Davide; Di Donato, Luca; Gualà, Luciano; Leucci, Stefano | |
| Uniform-Budget Solo Chess with Only Rooks or Only Knights Is Hard | 1-gen-2024 | Bilo', Davide; DI DONATO, Luca; Gualà, Luciano; Leucci, Stefano | |
| Approximate Distance Sensitivity Oracles in Subquadratic Space | 1-gen-2024 | Bilo', Davide; Chechik, Shiri; Choudhary, Keerti; Cohen, Sarel; Friedrich, Tobias; Krogmann, Simon; Schirneck, Martin | |
| On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper) | 1-gen-2024 | Bilo', D.; Colli, G.; Forlizzi, L.; Leucci, S. | |
| Blackout-tolerant temporal spanners | 1-gen-2024 | Bilo, D.; D'Angelo, G.; Guala, L.; Leucci, S.; Rossi, M. | |
| Swapping Mixed-Up Beers to Keep Them Cool | 1-gen-2024 | Bilo', Davide; Fiusco, Maurizio; Gualà, Luciano; Leucci, Stefano | |
| Geometric Network Creation Games | 1-gen-2024 | Bilo', D.; Friedrich, T.; Lenzner, P.; Melnichenko, A. | |
| Temporal Queries for Dynamic Temporal Forests | 1-gen-2024 | Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Proietti, Guido; Straziota, Alessandro | |
| Graph Spanners for Group Steiner Distances | 1-gen-2024 | Bilo', Davide; Gualà, Luciano; Leucci, Stefano; Straziota, Alessandro | |
| Improved Distance (Sensitivity) Oracles with Subquadratic Space | 1-gen-2024 | Bilo', Davide.; Chechik, S.; Choudhary, K.; Cohen, S.; Friedrich, T.; Schirneck, M. | |
| New Algorithms for Steiner Tree Reoptimization | 1-gen-2024 | Bilo', Davide | |
| Fault-Tolerant ST-Diameter Oracles | 1-gen-2023 | Bilo', Davide; Keerti, Choudhary; Sarel, Cohen; Tobias, Friedrich; Simon, Krogmann; Martin, Schirneck | |
| 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. | |
| Schelling Games with Continuous Types | 1-gen-2023 | Bilo', D.; Bilò, V.; Doring, M.; Lenzner, P.; Molitor, L.; Schmidt, J. |