Follow
Stephan Eidenbenz
Stephan Eidenbenz
Verified email at lanl.gov
Title
Cited by
Cited by
Year
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
7492003
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
3022012
Inapproximability results for guarding polygons and terrains
S Eidenbenz, C Stamm, P Widmayer
Algorithmica 31, 79-113, 2001
1802001
Equilibria in topology control games for ad hoc networks
S Eidenbenz, VSA Kumar, S Zust
Proceedings of the 2003 joint workshop on Foundations of mobile computing, 2-11, 2003
1772003
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
1632003
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
1482011
Quantum algorithm implementations for beginners
PJ Coles, S Eidenbenz, S Pakin, A Adedoyin, J Ambrosiano, P Anisimov, ...
arXiv, arXiv: 1804.03719, 2018
1412018
Quantum algorithm implementations for beginners
A Adedoyin, J Ambrosiano, P Anisimov, W Casper, G Chennupati, ...
arXiv preprint arXiv:1804.03719, 2018
1292018
Modeling propagation dynamics of bluetooth worms (extended version)
G Yan, S Eidenbenz
IEEE transactions on mobile computing 8 (3), 353-368, 2008
1162008
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
1122005
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
1072011
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
1052006
Deterministic preparation of Dicke states
A Bärtschi, S Eidenbenz
International Symposium on Fundamentals of Computation Theory, 126-139, 2019
972019
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
962007
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
912007
Grover mixers for QAOA: Shifting complexity from mixer design to state preparation
A Bärtschi, S Eidenbenz
2020 IEEE International Conference on Quantum Computing and Engineering (QCE …, 2020
872020
Approximation algorithms for terrain guarding
S Eidenbenz
Information Processing Letters 82 (2), 99-105, 2002
822002
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
742007
The quantum alternating operator ansatz on maximum k-vertex cover
J Cook, S Eidenbenz, A Bärtschi
2020 IEEE International Conference on Quantum Computing and Engineering (QCE …, 2020
69*2020
Inapproximability results for guarding polygons without holes
S Eidenbenz
International Symposium on Algorithms and Computation, 427-437, 1998
681998
The system can't perform the operation now. Try again later.
Articles 1–20