| Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents L Anderegg, S Eidenbenz Proceedings of the 9th annual international conference on Mobile computing …, 2003 | 702 | 2003 |
| Containment of misinformation spread in online social networks NP Nguyen, G Yan, MT Thai, S Eidenbenz Proceedings of the 4th Annual ACM Web Science Conference, 213-222, 2012 | 192 | 2012 |
| Inapproximability results for guarding polygons and terrains S Eidenbenz, C Stamm, P Widmayer Algorithmica 31 (1), 79-113, 2001 | 158 | 2001 |
| Equilibria in topology control games for ad hoc networks S Eidenbenz, VSA Kumar, S Zust Mobile Networks and Applications 11 (2), 143-159, 2006 | 156 | 2006 |
| Parametric probabilistic sensor network routing CL Barrett, SJ Eidenbenz, L Kroc, M Marathe, JP Smith Proceedings of the 2nd ACM international conference on Wireless sensor …, 2003 | 153 | 2003 |
| Malware propagation in online social networks: nature, dynamics, and defense implications G Yan, G Chen, S Eidenbenz, N Li Proceedings of the 6th acm symposium on information, computer and …, 2011 | 125 | 2011 |
| Modeling propagation dynamics of bluetooth worms (extended version) G Yan, S Eidenbenz IEEE transactions on mobile computing 8 (3), 353-368, 2008 | 117 | 2008 |
| Commit: A sender-centric truthful and energy-efficient routing protocol for ad hoc networks with selfish nodes S Eidenbenz, G Resta, P Santi 19th IEEE International Parallel and Distributed Processing Symposium, 10 pp., 2005 | 108 | 2005 |
| OURS: optimal unicast routing systems in non-cooperative wireless networks W Wang, S Eidenbenz, Y Wang, XY Li Proceedings of the 12th annual international conference on Mobile computing …, 2006 | 101 | 2006 |
| Link positions matter: A noncommutative routing metric for wireless mesh networks G Jakllari, S Eidenbenz, N Hengartner, SV Krishnamurthy, M Faloutsos IEEE Transactions on Mobile Computing 11 (1), 61-72, 2011 | 97 | 2011 |
| Quantum algorithm implementations for beginners PJ Coles, S Eidenbenz, S Pakin, A Adedoyin, J Ambrosiano, P Anisimov, ... arXiv, arXiv: 1804.03719, 2018 | 90 | 2018 |
| The COMMIT protocol for truthful and cost-efficient routing in ad hoc networks with selfish nodes S Eidenbenz, G Resta, P Santi IEEE transactions on mobile computing 7 (1), 19-33, 2007 | 90 | 2007 |
| Bluetooth worm propagation: mobility pattern matters! G Yan, HD Flores, L Cuellar, N Hengartner, S Eidenbenz, V Vu Proceedings of the 2nd ACM symposium on Information, computer and …, 2007 | 84 | 2007 |
| Approximation algorithms for terrain guarding S Eidenbenz Information Processing Letters 82 (2), 99-105, 2002 | 75 | 2002 |
| Scalable and reliable sensor network routing: Performance study from field deployment MS Nassr, J Jun, SJ Eidenbenz, AA Hansson, AM Mielke IEEE INFOCOM 2007-26th IEEE International Conference on Computer …, 2007 | 61 | 2007 |
| Detecting selfish exploitation of carrier sensing in 802.11 networks K Pelechrinis, G Yan, S Eidenbenz, SV Krishnamurthy IEEE INFOCOM 2009, 657-665, 2009 | 58 | 2009 |
| Inapproximability results for guarding polygons without holes S Eidenbenz International Symposium on Algorithms and Computation, 427-437, 1998 | 57 | 1998 |
| On the effectiveness of structural detection and defense against P2P-based botnets DT Ha, G Yan, S Eidenbenz, HQ Ngo 2009 IEEE/IFIP International Conference on Dependable Systems & Networks …, 2009 | 53 | 2009 |
| Bluetooth worms: Models, dynamics, and defense implications G Yan, S Eidenbenz 2006 22nd Annual Computer Security Applications Conference (ACSAC'06), 245-256, 2006 | 49 | 2006 |
| Algorithmic aspects of communication in ad-hoc networks with smart antennas K Sundaresan, W Wang, S Eidenbenz Proceedings of the 7th ACM international symposium on Mobile ad hoc …, 2006 | 47 | 2006 |
Guanhua YanDepartment of Computer Science, Binghamton University, State University of New YorkE-mail confirmado em binghamton.edu
