Davide Bilò

751 total citations
43 papers, 167 citations indexed

About

Davide Bilò is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, Davide Bilò has authored 43 papers receiving a total of 167 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 19 papers in Computer Networks and Communications and 13 papers in Management Science and Operations Research. Recurrent topics in Davide Bilò's work include Complexity and Algorithms in Graphs (18 papers), Advanced Graph Theory Research (14 papers) and Game Theory and Applications (13 papers). Davide Bilò is often cited by papers focused on Complexity and Algorithms in Graphs (18 papers), Advanced Graph Theory Research (14 papers) and Game Theory and Applications (13 papers). Davide Bilò collaborates with scholars based in Italy, Switzerland and Germany. Davide Bilò's co-authors include Guido Proietti, Luciano Gualà, Stefano Leucci, Peter Widmayer, Matúš Mihaľák, Tobias Friedrich, Thomas Erlebach, Vittorio Bilò, Elias Vicari and Subhash Suri and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Davide Bilò

36 papers receiving 161 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Davide Bilò Italy	8	74	68	40	25	24	43	167
Luciano Gualà Italy	6	57 0.8×	45 0.7×	30 0.8×	15 0.6×	10 0.4×	34	109
Miloš Stojaković Serbia	9	143 1.9×	28 0.4×	37 0.9×	22 0.9×	8 0.3×	33	214
Pim van ’t Hof Norway	12	280 3.8×	122 1.8×	16 0.4×	10 0.4×	24 1.0×	40	327
Tamás Király Hungary	7	137 1.9×	54 0.8×	15 0.4×	20 0.8×	50 2.1×	36	193
Tasuku Soma Japan	7	100 1.4×	62 0.9×	21 0.5×	3 0.1×	6 0.3×	15	169
A. V. Karzanov Russia	7	143 1.9×	68 1.0×	33 0.8×	18 0.7×	12 0.5×	19	213
Eric Balkanski United States	8	85 1.1×	61 0.9×	48 1.2×	15 0.6×	4 0.2×	26	165
Euiwoong Lee United States	6	70 0.9×	50 0.7×	20 0.5×	14 0.6×	10 0.4×	42	122
Anna Philippou Cyprus	8	56 0.8×	40 0.6×	33 0.8×	10 0.4×	14 0.6×	28	160
Kshipra Bhawalkar United States	5	17 0.2×	51 0.8×	72 1.8×	30 1.2×	9 0.4×	6	165

Countries citing papers authored by Davide Bilò

Since Specialization

Citations

This map shows the geographic impact of Davide Bilò's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Davide Bilò with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Davide Bilò more than expected).

Fields of papers citing papers by Davide Bilò

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Davide Bilò. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Davide Bilò. The network helps show where Davide Bilò may publish in the future.

Co-authorship network of co-authors of Davide Bilò

This figure shows the co-authorship network connecting the top 25 collaborators of Davide Bilò. A scholar is included among the top collaborators of Davide Bilò based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Davide Bilò. Davide Bilò is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Bilò, Davide, et al.. (2024). Approximate Distance Sensitivity Oracles in Subquadratic Space. SHILAP Revista de lepidopterología. Volume 3.

Bilò, Davide, et al.. (2023). Schelling Games with Continuous Types. OPUS (Augsburg University). 2520–2527. 1 indexed citations

Bilò, Davide, et al.. (2023). Temporal Network Creation Games. OPUS (Augsburg University). 2511–2519. 1 indexed citations

Bilò, Davide, et al.. (2022). Cutting bamboo down to size. Cineca Institutional Research Information System (Tor Vergata University). 1 indexed citations

Bilò, Davide, Luciano Gualà, Stefano Leucci, & Guido Proietti. (2022). Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees. Cineca Institutional Research Information System (Tor Vergata University). 2 indexed citations

Bilò, Davide, et al.. (2022). Cutting bamboo down to size. Theoretical Computer Science. 909. 54–67. 1 indexed citations

Bilò, Davide, et al.. (2021). Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 17. 2 indexed citations

Bilò, Davide, et al.. (2021). Space-Efficient Fault-Tolerant Diameter Oracles. arXiv (Cornell University). 2 indexed citations

Bilò, Davide, et al.. (2020). An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. Cineca Institutional Research Information System (Tor Vergata University).

10.

Bilò, Davide, Luciano Gualà, Stefano Leucci, & Guido Proietti. (2018). Fault-Tolerant Approximate Shortest-Path Trees. Cineca Institutional Research Information System (Tor Vergata University). 3 indexed citations

11.

Bilò, Davide, et al.. (2018). On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 100. 15.

12.

Bilò, Davide, Luciano Gualà, Stefano Leucci, & Guido Proietti. (2016). Exact and approximate algorithms for movement problems on (special classes of) graphs. Theoretical Computer Science. 652. 86–101.

13.

Bilò, Davide, Luciano Gualà, Stefano Leucci, & Guido Proietti. (2015). The max-distance network creation game on general host graphs. Theoretical Computer Science. 573. 43–53. 2 indexed citations

14.

Bilò, Davide, Luciano Gualà, & Guido Proietti. (2015). Bounded-Distance Network Creation Games. Cineca Institutional Research Information System (Tor Vergata University). 3(3). 1–20. 5 indexed citations

15.

Bilò, Davide, et al.. (2014). Network verification via routing table queries. Journal of Computer and System Sciences. 81(1). 234–248. 13 indexed citations

16.

Bilò, Davide, Luciano Gualà, Stefano Leucci, & Guido Proietti. (2014). Specializations and generalizations of the Stackelberg minimum spanning tree game. Theoretical Computer Science. 562. 643–657. 7 indexed citations

17.

Bilò, Davide, Yann Disser, Matúš Mihaľák, et al.. (2012). Reconstructing visibility graphs with simple robots. Theoretical Computer Science. 444. 52–59. 9 indexed citations

18.

Bilò, Davide, Luciano Gualà, & Guido Proietti. (2011). Improved approximability and non-approximability results for graph diameter decreasing problems. Theoretical Computer Science. 417. 12–22. 26 indexed citations

19.

Bilò, Davide, et al.. (2011). New Reoptimization Techniques applied to Steiner Tree Problem. Electronic Notes in Discrete Mathematics. 37. 387–392. 4 indexed citations

20.

Bilò, Davide & Guido Proietti. (2008). On the complexity of minimizing interference in ad-hoc and sensor networks. Theoretical Computer Science. 402(1). 43–55. 16 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact