Davide Bilò

Citée par

	Toutes	Depuis 2019
Citations	972	528
indice h	17	12
indice i10	37	22

120

200820092010201120122013201420152016201720182019202020212022202320246 12 24 35 41 43 28 53 38 58 84 80 88 68 65 117 109

Accès public

Tout afficher

15 articles

6 articles

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Guido ProiettiProfessor of Computer Science, University of L'AquilaAdresse e-mail validée de univaq.it
Luciano GualàUniversità di Roma "Tor Vergata"Adresse e-mail validée de mat.uniroma2.it
Stefano LeucciDepartment of Information Engineering, Computer Science, and Mathematics - University of L'AquilaAdresse e-mail validée de univaq.it
Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyAdresse e-mail validée de hpi.de
Pascal LenznerResearcher, HPI PotsdamAdresse e-mail validée de hpi.de
Sarel CohenThe Academic College of Tel Aviv-YaffoAdresse e-mail validée de mta.ac.il
Martin SchirneckTheory and Applications of Algorithms, University of Vienna, AustriaAdresse e-mail validée de univie.ac.at
Mirko RossiGran Sasso Science InstituteAdresse e-mail validée de gssi.it
Vittorio BilòAssociate Professor in Computer Science, University of Salento, Lecce, ItalyAdresse e-mail validée de unisalento.it
Louise MolitorResearcher, Hasso Plattner InstitutAdresse e-mail validée de hpi.de
Matúš MihalákAssistant Professor, Department of Data Science and Knowledge Engineering, Maastricht UniversityAdresse e-mail validée de maastrichtuniversity.nl
Tobias MömkeProfessor, Computer Science, University of AugsburgAdresse e-mail validée de informatik.uni-augsburg.de
Hans-Joachim BöckenhauerDepartement Informatik, ETH ZürichAdresse e-mail validée de inf.ethz.ch
Yann DisserProfessor for Combinatorial Optimization, Department of Mathematics, TU DarmstadtAdresse e-mail validée de mathematik.tu-darmstadt.de
Gianlorenzo D'AngeloGran Sasso Science Institute (GSSI)Adresse e-mail validée de gssi.it
Anna MelnichenkoHasso Plattner Institute, University of PotsdamAdresse e-mail validée de hpi.de
Subhash SuriProfessor of Computer Science, University of California, Santa BarbaraAdresse e-mail validée de cs.ucsb.edu
Feliciano ColellaPhD Student @ GSSI - Gran Sasso Science InstituteAdresse e-mail validée de gssi.it
Guido DrovandiAdresse e-mail validée de dia.uniroma3.it
Evangelos BampasLISN, Université Paris-SaclayAdresse e-mail validée de lri.fr

Suivre

Davide Bilò

Associate Professor in C.S., Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica

Adresse e-mail validée de univaq.it

Design of exact and approximation algorithms Algorithmic Game Theory


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
Reoptimization of Steiner trees D Bilò, HJ Böckenhauer, J Hromkovič, R Královič, T Mömke, P Widmayer, ... Algorithm Theory–SWAT 2008: 11th Scandinavian Workshop on Algorithm Theory …, 2008	61	2008
Improved approximability and non-approximability results for graph diameter decreasing problems D Bilò, L Gualà, G Proietti Theoretical Computer Science 417, 12-22, 2012	55	2012
Reoptimization of the shortest common superstring problem D Bilò, HJ Böckenhauer, D Komm, R Královič, T Mömke, S Seibert, A Zych Algorithmica 61, 227-251, 2011	49	2011
On the complexity of minimizing interference in ad-hoc and sensor networks D Bilò, G Proietti Theoretical Computer Science 402 (1), 43-55, 2008	46	2008
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks D Bilò, G Proietti	46	2007
Reoptimization of weighted graph and covering problems D Bilò, P Widmayer, A Zych Approximation and Online Algorithms: 6th International Workshop, WAOA 2008 …, 2009	44	2009
Improved purely additive fault-tolerant spanners D Bilò, F Grandoni, L Gualà, S Leucci, G Proietti Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015	43	2015
Multiple-edge-fault-tolerant approximate shortest-path trees D Bilò, L Gualà, S Leucci, G Proietti arXiv preprint arXiv:1601.04169, 2016	36*	2016
Locality-based network creation games D Bilò, L Gualà, S Leucci, G Proietti ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-26, 2016	33	2016
Topological influence and locality in swap Schelling games D Bilò, V Bilò, P Lenzner, L Molitor Autonomous Agents and Multi-Agent Systems 36 (2), 47, 2022	32	2022
Bounded-distance network creation games D Bilò, L Gualà, G Proietti Internet and Network Economics, 72-85, 2012	32	2012
On the tree conjecture for the network creation game D Bilò, P Lenzner Theory of Computing Systems 64, 422-443, 2020	27	2020
Fault-tolerant approximate shortest-path trees D Bilò, L Gualà, S Leucci, G Proietti European Symposium on Algorithms, 137-148, 2014	26	2014
Network verification via routing table queries E Bampas, D Bilò, G Drovandi, L Gualà, R Klasing, G Proietti Journal of Computer and System Sciences 81 (1), 234-248, 2015	21	2015
Computational aspects of a 2-player Stackelberg shortest paths tree game D Bilò, L Gualà, G Proietti, P Widmayer Internet and Network Economics: 4th International Workshop, WINE 2008 …, 2008	20	2008
Compact and fast sensitivity oracles for single-source distances D Bilò, L Gualà, S Leucci, G Proietti arXiv preprint arXiv:1608.04769, 2016	19	2016
The max-distance network creation game on general host graphs D Bilò, L Gualà, S Leucci, G Proietti Internet and Network Economics, 392-405, 2012	19	2012
Network creation games with traceroute-based strategies D Bilò, L Gualà, S Leucci, G Proietti Structural Information and Communication Complexity: 21st International …, 2014	17	2014
New advances in reoptimizing the minimum Steiner tree problem D Bilò, A Zych International Symposium on Mathematical Foundations of Computer Science, 184-197, 2012	17	2012
Specializations and generalizations of the Stackelberg minimum spanning tree game D Bilò, L Gualà, S Leucci, G Proietti Theoretical Computer Science 562, 643-657, 2015	16	2015

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs