Davide Bilò
Orcid: 0000-0003-3169-4300Affiliations:
- University of L'Aquila, Italy
According to our database1,
Davide Bilò
authored at least 82 papers
between 2004 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2005
2010
2015
2020
0
5
10
15
8
1
5
3
3
2
2
6
1
2
3
1
1
2
6
6
5
3
1
4
1
1
2
1
1
1
3
2
2
1
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
CoRR, 2024
CoRR, 2024
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper).
Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024
Proceedings of the 12th International Conference on Fun with Algorithms, 2024
Proceedings of the 12th International Conference on Fun with Algorithms, 2024
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
2023
Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs.
CoRR, 2023
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
2022
Theor. Comput. Sci., 2022
Theor. Comput. Sci., 2022
Auton. Agents Multi Agent Syst., 2022
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
2021
Finding single-source shortest p-disjoint paths: fast computation and sparse preservers.
CoRR, 2021
Algorithms, 2021
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
Algorithmica, 2020
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020
2018
An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs.
CoRR, 2018
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018
Proceedings of the 9th International Conference on Fun with Algorithms, 2018
Proceedings of the 9th International Conference on Fun with Algorithms, 2018
2017
Proceedings of the Structural Information and Communication Complexity, 2017
2016
Exact and approximate algorithms for movement problems on (special classes of) graphs.
Theor. Comput. Sci., 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
Theor. Comput. Sci., 2015
Theor. Comput. Sci., 2015
Algorithmica, 2015
Proceedings of the Structural Information and Communication Complexity, 2015
Proceedings of the Algorithms - ESA 2015, 2015
2014
Algorithmica, 2014
2013
Proceedings of the Algorithms for Sensor Systems, 2013
2012
Improved approximability and non-approximability results for graph diameter decreasing problems.
Theor. Comput. Sci., 2012
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012
2011
Electron. Notes Discret. Math., 2011
2010
Theor. Comput. Sci., 2010
2009
Proceedings of the Structural Information and Communication Complexity, 2009
2008
Theor. Comput. Sci., 2008
Internet Math., 2008
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008
2007
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007
2006
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem.
Proceedings of the Structural Information and Communication Complexity, 2006
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006
2005
Proceedings of the Structural Information and Communication Complexity, 2005
2004
A 5/4-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004