Davide Bilò

Citée par

	Toutes	Depuis 2018
Citations	775	415
indice h	16	11
indice i10	27	15

2006200720082009201020112012201320142015201620172018201920202021202220233 2 7 12 24 35 39 43 27 54 38 61 85 70 84 72 78 23

Accès public

Tout afficher

10 articles

4 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
Pascal LenznerResearcher, HPI PotsdamAdresse e-mail validée de hpi.de
Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyAdresse 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 of Mathematics, TU DarmstadtAdresse e-mail validée de mathematik.tu-darmstadt.de
Mirko RossiGran Sasso Science InstituteAdresse e-mail validée de gssi.it
Subhash SuriProfessor of Computer Science, University of California, Santa BarbaraAdresse e-mail validée de cs.ucsb.edu
Louise MolitorResearcher, Hasso Plattner InstitutAdresse e-mail validée de hpi.de
Vittorio BilòAssociate Professor in Computer Science, University of Salento, Lecce, ItalyAdresse e-mail validée de unisalento.it
Feliciano ColellaPhD Student @ GSSI - Gran Sasso Science InstituteAdresse e-mail validée de gssi.it
Anna MelnichenkoHasso Plattner Institute, University of PotsdamAdresse e-mail validée de hpi.de
Martin SchirneckTheory and Applications of Algorithms, University of Vienna, AustriaAdresse e-mail validée de univie.ac.at
Sarel CohenThe Academic College of Tel Aviv-YaffoAdresse e-mail validée de mta.ac.il
Juraj HromkovicProfessor der Informatik, ETH ZuerichAdresse e-mail validée de inf.ethz.ch
Dennis KommAssociate Professor of Computer Science, ETH ZurichAdresse e-mail validée de inf.ethz.ch
Fabrizio GrandoniProfessor, IDSIA, USI-SUPSI, SwitzerlandAdresse e-mail validée de idsia.ch

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	58	2008
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
Improved approximability and non-approximability results for graph diameter decreasing problems D Bilò, L Gualà, G Proietti Theoretical Computer Science 417, 12-22, 2012	46	2012
Improved approximability and non-approximability results for graph diameter decreasing problems D Bilò, L Gualà, G Proietti Theoretical Computer Science 417, 12-22, 2012	46	2012
On the complexity of minimizing interference in ad-hoc and sensor networks D Bilò, G Proietti Theoretical Computer Science 402 (1), 43-55, 2008	45	2008
On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks D Bilò, G Proietti	45	2007
Reoptimization of Weighted Graph and Covering Problems. D Bilò, P Widmayer, A Zych WAOA 5426, 201-213, 2008	43	2008
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	41	2015
Multiple-edge-fault-tolerant approximate shortest-path trees D Bilò, L Gualà, S Leucci, G Proietti arXiv preprint arXiv:1601.04169, 2016	31	2016
Bounded-distance network creation games D Bilò, L Gualà, G Proietti Internet and Network Economics, 72-85, 2012	31	2012
Locality-based network creation games D Bilò, L Gualà, S Leucci, G Proietti ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-26, 2016	27	2016
Fault-tolerant approximate shortest-path trees D Bilò, L Gualà, S Leucci, G Proietti Algorithms-ESA 2014: 22th Annual European Symposium, Wroclaw, Poland …, 2014	26	2014
On the tree conjecture for the network creation game D Bilò, P Lenzner Theory of Computing Systems 64, 422-443, 2020	20	2020
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	19	2022
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	17	2012
Compact and fast sensitivity oracles for single-source distances D Bilò, L Gualà, S Leucci, G Proietti arXiv preprint arXiv:1608.04769, 2016	16	2016
Network creation games with traceroute-based strategies D Bilò, L Gualà, S Leucci, G Proietti Structural Information and Communication Complexity: 21st International …, 2014	16	2014
New advances in reoptimizing the minimum Steiner tree problem D Bilò, A Zych Mathematical Foundations of Computer Science 2012: 37th International …, 2012	16	2012
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	16	2008
New reoptimization techniques applied to Steiner tree problem A Zych, D Bilò Electronic Notes in Discrete Mathematics 37, 387-392, 2011	14	2011

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