People

Stephan Eidenbenz
OfficeTA-3, Bldg 508, Room 109
Mail StopB-256
Phone(505) 667-3742
Fax(505) 667-9137
Emaileidenben@lanl.gov
More Info
Stephan is the deputy group leader in the Information Sciences group at Los Alamos National Laboratory (LANL), where he also leads a team whose focus is on Socio-technical Simulation. His technical work has components of basic long-term research as well as short-term deliverables for various US government agencies. Stephan's research background is in theoretical computer science (computational complexity, approximation algorithms, inapproximability, algorithmic game theory, computational geometry, and computational biology) and communication networks (selfish networking, validity of simulation results, efficient protocols, ad hoc networks, sensor networks), and cyber-security. Stephan obtained a PhD in computer science from the Swiss Federal Institute of Technology, Zurich in 2000. Stephan's team has built some of the largest distributed discrete event simulation environments that are run on LANL's supercomputers; in particular the communication network simulator MIITS and the vehicular transportation simulator FastTrans. His team has been a key contributor to the NISAC (National Infrastructure Simulation and Analysis Center) project, funded by DHS; Stephan is also a co-PI on the LANL-internally funded cyber project "Network-Scale Analysis and Defense for Cyber Systems".
Note to Prospective Summer Students and Postdocs The Socio-technical Simulation Team continuously accepts applications for summer internships (typical minimum duration 3 months) and postdocs (2 year appointments). If your research interests are in cyber security, communication networks, infrastructure modeling, large-scale modeling and simulation per se or with a focus on other application domains such as high-performance computing infrastructure, or other areas relevant to the team, please send Stephan an email with your cv. We usually have 5-10 students and 1-3 postdocs in the team spanning a range from very theoretical to very applied backgrounds mostly in computer science and engineering.

Technical Program Committee Memberships 2011: SimuTools (co-chair TPC), IEEE MILCOM (track chair Cyber Security and Network Management), IEEE/IFIP DSN 2011, IEEE WCNC 2011, SimulTech 2011, InfQ 2011 2010: ChinaCom 2010, ICDCN 2010, IEEE WCNC 2010, ACM-IEEE MSWiM 2010 2009: ACM-IEEE MSWiM 2009, ACM FOWANC 2009, IEEE MASS 2009, IEEE STPSA 2009, IEEE ChinaCom 2009, IEEE WiMesh 2009, SYNASC 2009, IEEE WiNA 2009, IEEE WIDA 2009 2008: IEEE SPTPSA 2008, IFIP NETWORKING 2008, IEEE SECON 2008, IEEE INFOCOM 2008, ACM-IEEE MSWiM 2008, ACM FOWANC 2008, ACM DIALM-POMC 2008, IEEE WIDA 2008 2007: ACM MOBICOM Student Posters 2007, MoVeNet 2007, ACM STaR_SEC 2007, IEEE INFOCOM 2007, IEEE MASS 2007, IFIP TC6 NETWORKING 2007, ICST Autonomics 2007, WTASA 2007 2006: ACM MobiHoc 2006, IEEE MASS 2006, SecPerU 2006 (IEEE ICPS workshop), IEEE SPTPSA 2006 2005: ACM MobiHoc 2005, ACM Dial M-POMC 2005, SecPerU 2005
Note on Publication List If history is any guide, this publications list may not see very frequent updates. Check out DBLP or Google Scholar to find copies and more recent publications. Contact Stephan by email if you have trouble finding an article online.

Selected Publications

    Journal Articles

  • Link Positions Matter: A Noncommutative Routing Metric for Wireless Mesh Networks, Gentian Jakllari, Stephan Eidenbenz, Nicolas Hengartner, Srikanth V. Krishnamurthy and Michalis Faloutsos, IEEE Transactions on Mobile Computing, 2011
  • Lattice Routing: A 4D Routing Scheme for Multiradio Multichannel Ad Hoc Networks, S. Kakumanu, S. Eidenbenz, R. Sivakumar, Ad Hoc Networks, Elsevier (2010), doi:10.1016/j.adhoc.2010.06.007
  • Criticality Analysis of Internet Infrastructure , Guanhua Yan, Pallab Datta, Stephan Eidenbenz, Sunil Thulasidasan, Venkatesh Ramaswamy, Computer Networks, Elsevier, 54(7), May 2010
  • Incentive Compatible and Globally Efficient Position Based Routing for Selfish Reverse Multicast in Wireless Sensor Networks, Stephan Eidenbenz, Gunes Ercal-Ozkaya, Adam Meyerson, Allon Percus and Sarvesh Varatharajan, Algorithms 2009, 2(4), 1303-1326; doi:10.3390/a2041303, 2009
  • Modeling Propagation Dynamics of Bluetooth Worms (Extended version), Guanhua Yan, Stephan Eidenbenz, IEEE Transactions on Mobile Computing, March 2008 (Vol. 8, no. 3) pp. 353 - 368
  • On the Complexity of Variations of Equal Sum Subsets, M. Cieliebak, S. Eidenbenz, A. Pagourtzis, K. Schlude, Nordic Journal of Computing (NJC), 2008
  • Analysis of Packet Dropping Behavior of Sending Rate Estimate Based Queue Management Schemes with Markovian Sources, V. Ramaswamy, L. Cuellar, S. Eidenbenz, N. Hengartner, ISAST Transactions on Communication and Networking, 2008
  • The COMMIT Protocol for Truthful and Energy-Efficient Routing in Ad Hoc Networks with Selfish Nodes, P. Santi, S. Eidenbenz, G. Resta, IEEE Transactions on Mobile Computing, Volume 7, Issue 1, Jan. 2008 Page(s):19 - 33
  • On a New Class of Load Balancing Network Protocols, S. Eidenbenz, A. Hansson, V. Ramaswamy, C. Reidys, Advances in Complex Systems, World Scientific, 2007
  • Equilibria in Topology Control Games for Ad Hoc Networks, S. Eidenbenz, V.S. A. Kumar, S. Zust, Mobile Networks and Applications (MONET), 2006, Springer Netherlands
  • Finding Minimum Hidden Guard Sets in Polygons - Tight Approximability Results, Stephan Eidenbenz, Computational Geometry: Theory and Applications (CGTA), Vol. 34, No. 2 (2006), 49-57
  • Parametric Probabilistic Routing in Sensor Networks, C. Barrett, S. Eidenbenz, L. Kroc, M. Marathe , J.P. Smith, Mobile Networks and Applications (MONET), Vol, 10, No. 4 (2005), 529 - 544, Springer Netherlands
  • Partial Digest is Hard to Solve for Erroneous Input Data, M. Cieliebak,S. Eidenbenz, P. Penna, Theoretical Computer Science (TCS), Vol. 349, No. 3 (2005), 361 - 381, Elsevier B.V.
  • Complexity and Approximability of Double Digest, M. Cieliebak, S. Eidenbenz, G.J. Woeginger, J ournal of Bioinformatics and Computational Biology (JBCB), Vol. 3, No. 2 (2005) 207 – 223, Imperial College Press
  • An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee, S. Eidenbenz, P. Widmayer, SIAM Journal on Computing (SICOMP), Vol. 32, No. 3 (2003), 654 - 670
  • Inapproximability of Finding Maximum Hidden Sets on Polygons and Terrains, S. Eidenbenz, Computational Geometry: Theory and Applications (CGTA), Vol. 21 (2002), 139 - 153
  • Approximation Algorithms for Terrain Guarding, S. Eidenbenz, Information Processing Letters (IPL), Vol. 82 (2002), pp. 99 - 105
  • Inapproximability Results for Guarding Polygons and Terrains, S. Eidenbenz, C. Stamm, P. Widmayer, Algorithmica, Vol. 31 (2001), 79 - 113
  • Worldview: A Virtual Reality Framework for the Design, Optimization and Management of Mobile Telematics Infrastructure, M. Beck, S. Eidenbenz, C. Stamm, P. Stucki, P. Widmayer, SI Informatik/Informatique, Nr. 3, Juni 1999
    Conference Proceedings (peer-reviewed)

  • Geography-Based Analysis of the Internet Infrastructure, Shiva Kasiviswanathan, Stephan Eidenbenz, Guanhua Yan, Proceedings of the 30th IEEE Conference on Computer Communications (INFOCOM'11), Mini Conference, April 2011
  • Malware Propagation in Online Social Networks: Nature, Dynamics, and Defense Implications, Guanhua Yan, Guanling Chen, Stephan Eidenbenz, Nan Li, Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security (ASIACCS'11), March 2011
  • CyberSim: Geographic, Temporal, And Organizational Dynamics Of Malware Propagation, N. Santhi, G. Yan, S. Eidenbenz, Proceedings of 2010 Winter Simulation Conference, Invited Paper
  • Designing Systems for Large-Scale, Discrete-Event Simulations: Experiences with the FastTrans Parallel Microsimulator, Sunil Thulasidasan, Shiva Kasiviswanathan, Stephan Eidenbenz, Emanuele Galli, Susan Mniszewski, Phil Romero, Proceedings of the 16th Annual International Conference on High Performance Computing (HiPC), 2009
  • SMS-Watchdog: Profiling Social Behaviors of SMS Users for Anomaly Detection, Guanhua Yan, Stephan Eidenbenz, Emanuele Galli, Proceedings of 12th International Symposium On Recent Advances in Intrusion Detection (RAID), 2009
  • Accelerating Traffic Microsimulations: A Parallel Discrete-Event Queue-Based Approach for Speed and Scale, Sunil Thulasidasan, Stephan Eidenbenz, Proceedings of the 2009 Winter Simulation Conference, Austin TX, Dec 13-16, 2009
  • Activity-Based Session Generation for Network Simulation, Lukas Kroc, Stephan Eidenbenz, James P. Smith, Proceedings of the 2009 Winter Simulation Conference, Austin TX, Dec 13-16, 2009
  • On the Effectiveness of Structural Detection and Defense Against P2P-based Botnets, D. Ha, G. Yan, S. Eidenbenz, H.Q. Ngo, Proceedings of the 39th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) 2009
  • BlueWard: Detecting Bluetooth Worm Propagation in Public Areas, G. Yan, L. Cuellar, S. Eidenbenz, N. Hengartner, Proceedings of the 39th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) 2009
  • On a Locally Minimum Cost Forwarding Game, S.Eidenbenz, G. Ercal-Ozkaya, A. Meyerson, A. Percus, Proceedings of 2nd ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing (FOWANC) 2009
  • Detecting Selfish Exploitation of Carrier Sensing in 802.11 WLANs, K. Pelechrinis, G. Yan, S. Eidenbenz, S. Krishnamurthy, Proceedings of IEEE INFOCOM 2009
  • Mobi-Watchdog: You Can Steal, But You Can’t Run, G. Yan, S. Eidenbenz, B. Sun, Proceedings of 2nd ACM Conference on Wireless Network Security 2009 (WiSec’09)
  • ActivitySim: Large-Scale Agent-Based Activity Generation for Infrastructure Simulation, E. Galli, S. Eidenbenz, S. Mniszewski, C. Teuscher, L. Cuellar, M. Ewers, Proceedings of SCS/ACM Agent-Directed Simulation Symposium 2009 (ADS’09)
  • Large-Scale Telephone Network Simulation: Discrete Event vs. Steady State, R. Bent, S. Eidenbenz, S. Thulasidasan, Proceedings of 12th SCS/ACM Communications and Networking Simulation Symposium (CNS’09), 2009
  • On the Impact of Realism of Mobility Models for Wireless Networks, H. Flores, R. Riedi, S. Eidenbenz, N. Hengartner, Proceedings of IEEE Global Communications Conference 2008 Ad Hoc, Sensor and Mesh Networking Symposium (GLOBECOM 2008 AHSN)
  • FairCast: Fair Multi-Media Streaming in Ad Hoc Networks through Local Congestion Control, G. Marfia, P. Lutterotti, S. Eidenbenz, M. Gerla, G. Pau, Proceedings of 11th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2008)
  • Catching Instant Messaging Worms with Change-Point Detection, G. Yan, Z. Xiao, S. Eidenbenz, Proceedings of Fist USENIX Workshop on Large-Scale Exploits and Emergent Threats (LEET’08), April 15, 2008
  • Dynamic Balancing of Packet Fitering Workloads on Distributed Firewalls, G. Yan, S. Chen, S. Eidenbenz, Proceedings of the 16th International Workshop on Quality of Service (IWQoS), 2008
  • DDoS Mitigation in Non-Cooperative Environments, G. Yan, S. Eidenbenz, Proceedings of IFIP NETWORKING 2008
  • Link Positions Matter: A Non-Commutative Routing Metric for Wireless Mesh Networks, G. Jakllari, S. Eidenbenz, M. Faloutsos, N. Hengartner, S. Krishnamurthy, Proceedings of IEEE INFOCOM 2008
  • Simulating the National Telephone Network: A Socio-technical Approach to Assessing Infrastructure Criticality, V. Ramaswamy, S. Thulasidasan, P. Romero, S. Eidenbenz, L. Cuellar, Proceedings of 2007 Mililtary Communications Conference (MILCOM), 2007
  • Low Overhead Router-Based Congestion Control Techniques to Protect Responsive Traffic, V. Ramaswamy, L. Cuellar, S. Eidenbenz, N. Hengartner, Proceedings of 50th IEEE GLOBECOM, 2007
  • Extended Abstract: Revisiting Minimum Cost Reliable Routing in Wireless Mesh Networks, G. Jakllari, S. Eidenbenz, M. Faloutsos, N. Hengartner, S. Krishnamurthy, Proceedings of ACM 13th Annual International Conference on Mobile Computing and Networking (MOBICOM), 2007
  • Optimal Placement of Ad-Hoc Devices under a VCG-Style Routing Protocol, L. Anderegg, S. Eidenbenz, L. Peeters, P. Widmayer, Proceedings of ALGOSENSORS 2007, Wroclaw, Poland, 2007
  • COBRA – A Multi-Path Adaptive Local Load Sensing Routing Protocol for Wireless Sensor Networks, A. Hansson, V. Ramaswamy, S. Eidenbenz, Proceedings of 3rd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), 2007
  • Modeling Propagation Dynamics of Bluetooth Worms, G. Yan, S. Eidenbenz, Proceedings of International Conference on Distributed Systems (ICDCS), 2007
  • The Optimum OSPF Area Number for MANETs, J. Jun, S. Eidenbenz, H. Flores, M. Sichitiu, Proceedings of Fourth Annual IEEE Communications Society Conference on Sensor, Mesh, and Ad Hoc Communications and Networks (SECON), 2007
  • Efficient Control of Non-Cooperative Traffic Using Queue Management Schemes with Low Buffer Requirements, V. Ramaswamy, C. Ambuehl, L. Cuellar, S. Eidenbenz, N. Hengartner, B. Weber, Proceedings of IFIP Networking 2007
  • Preventing Bandwidth Abuse at the Router through Sending-Rate Estimate-based Active Queue Management, V. Ramaswamy, L. Cuellar, S. Eidenbenz, N. Hengartner, Proceedings of IEEE ICC 2007
  • Bluetooth Worm Propagation: Mobility Pattern Matters , G. Yan, L. Cuellar, S. Eidenbenz, H. Flores, N. Hengartner, V. Wu, Proceedings of ACM AsiaCCS 2007
  • Scalable and Reliable Sensor Network Routing: Performance Study from Field Deployment, M. Nassr, J. Jun, S. Eidenbenz, A. Hansson, A. Mielke, Proceedings of IEEE INFOCOM 2007
  • Incentive-Compatible, Energy-Optimal, and Efficient Ad Hoc Networking in a Selfish Milieu, L. Anderegg, S. Eidenbenz, R. Wattenhofer, Proceedings of HICSS 2007, 2007
  • Development, Implementation, and Experimentation of Parametric Routing Protocol for Sensor Networks, M. Nassr, J. Jun, S. Eidenbenz, J. Frigo, A. Hansson, A. Mielke, M. Smith, Proceedings of SPIE Europe: Optics/Photonics in Security&Defence, Vol. 6394 Unmanned/Unattended Sensors and Sensor Networks III, 2006
  • Bluetooth Worms: Models, Dynamics, and Defense Implications, G. Yan, S. Eidenbenz, Proceedings of IEEE 2006 Annual Computer Security Applications Conference (ACSAC 2006)
  • A Framework for Incentive Compatible Topology Control in Non-Cooperative Wireless Multi-Hop Networks, P. Santi, S. Eidenbenz. G. Resta, Proceedings of DIWANS 2006, Mobicom workshop, 2006
  • Multi-Scale Integrated Information and Telecommunications System (MIITS): First Results from A Large-Scale End-to-End Network Simulator, R. Waupotitsch, S. Eidenbenz, L. Kroc, J.P. Smith, Proceedings of Winter Simulation Conference 2006
  • OURS: Optimal Unicast Routing Systems in Non-Cooperative Wireless Networks, W. Wang, S. Eidenbenz, Y. Wang, X.Y. Li , Proceedings of ACM 12th Annual International Conference on Mobile Computing and Networking (MOBICOM), 2006
  • Describing MANETS: Principal Component Analysis of Sparse Mobility Traces , S. Eidenbenz, H. Flores, N. Hengartner, R. Riedi, Proceedings of Third ACM International Workshop on Performance Evauluation of Wireless Ad Hoc Sensor, and Ubiquitous Networks (PE-WASUN), 2006
  • Sluggish Calendar Queues for Network Simulation, G. Yan, S. Eidenbenz, Proceedings of IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), 2006
  • Algorithmic Aspects of Communication in Ad-Hoc Networks with Smart Antennas, S. Eidenbenz, K. Sundaresan, W. Wang, Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC 2006)
  • Probabilistic Multi-path vs. Deterministic Single Path Protocols for Dynamic Ad Hoc Network Scenarios, C. Barrett, S. Eidenbenz, L. Kroc, M. Marathe, J.P. Smith, Proceedings of the 2005 ACM Symposium on Applied Computing (SAC 2005), 1166 - 1173
  • COMMIT: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks with Selfish Nodes, S. Eidenbenz, G. Resta, P. Santi, Proceedings IEEE Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN 2005)
  • Maneuverable Relays to Improve Energy Efficiency in Sensor Networks, S. Eidenbenz, L. Kroc, J.P. Smith, First International Workshop on Sensor Networks and Systems for Pervasive Computing (PerSeNS 2005), PerCom Workshop Proceedings (2005), 411 - 417
  • Measurement Errors Make the Partial Digest Problem NP-Hard, S. Eidenbenz, M. Cieliebak, Lecture Notes in Computer Science, Vol. 2976 (LATIN 2004), 379 - 390
  • Flexible Train Rostering, S. Eidenbenz, A. Pagourtzis, P Widmayer, Lecture Notes in Computer Science, Vol. 2906 (ISAAC 2003), 615 - 624
  • Parametric Probabilistic Sensor Network Routing, C. Barrett, S. Eidenbenz, L. Kroc, M. Marathe, J.P. Smith, Proceedings of the 2nd ACM International Workshop on Wireless Sensor Networks and Applications (WSNA 2003), 122 - 131
  • Equilibria in Topology Control Games for Ad Hoc Networks, S. Eidenbenz, V.S. A. Kumar, S. Zust, Proceedings of DIALM-POMC Joint Workshop on Foundations of Mobile Computing 2003, 2 - 11
  • 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 Ninth Annual International Conference on Mobile Computing and Networking (MOBICOM 2003), 245 - 259
  • Noisy Data Make the Partial Digest Problem NP-hard, M. Cieliebak, S. Eidenbenz, P. Penna, Lecture Notes in Computer Science, Vol. 2812 (WABI 2003), 111 - 123
  • Composing Equipotent Teams, M. Cieliebak, S. Eidenbenz, A. Pagourtzis, Lecture Notes in Computer Science,Vol. 2751 (FCT 2003), 98 - 108
  • Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data, M. Cieliebak, S. Eidenbenz, G. Woeginger, Lecture Notes in Computer Science, Vol. 2697 (COCOON 2003), 519 - 527
  • Train Routing Algorithms: Concepts, Design Choices, and Practical Considerations, L. Anderegg, S. Eidenbenz, M. Gantenbein, C. Stamm, D.S. Taylor, B. Weber, P. Widmayer, Proceedings of The Fifth Workshop on Algorithm Engineering and Experiments (ALENEX 2003), 106 - 118
  • Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains, S. Eidenbenz, Lecture Notes in Computer Science,Vol. 2368 (SWAT 2002), 60 - 68
  • An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee , S. Eidenbenz, P. Widmayer, Lecture Notes in Computer Science, Vol. 2161 (ESA 2001), 333 - 343
  • Maximum Clique and Minimum Clique Partition in Visibility Graphs , S. Eidenbenz, C. Stamm , Lecture Notes in Computer Science, Vol. 1872 (IFIP TCS 2000), 200 - 212
  • How Many People Can Hide in a Terrain? , S. Eidenbenz, Lecture Notes in Computer Science,Vol. 1741 (ISAAC 1999), 184 - 194
  • Inapproximability Results for Guarding Polygons without Holes , S. Eidenbenz, Lecture Notes in Computer Science, Vol. 1533 (ISAAC 1998), 427 - 436
  • Inapproximability of Some Art Gallery Problems , S. Eidenbenz, C. Stamm, P. Widmayer, Proceedings 10th Canadian Conference on Computational Geometry, CCCG, 1998
  • A Modified Longest Side Bisection Triangulation , S. Eidenbenz, R. Pajarola, C. Stamm, Proceedings 10th Canadian Conference on Computational Geometry, CCCG, 1998
  • Positioning Guards at Fixed Height above a Terrain - an Optimum Inapproximability Result , S. Eidenbenz, C. Stamm, P. Widmayer, Lecture Notes in Computer Science, Vol. 1461 (ESA'98), 187-198
  • A Prototype System for Light Propagation in Terrains , M. Beck, S. Eidenbenz, C. Stamm, P. Stucki, P. Widmayer, Invited Contribution to Computer Graphics International (CGI), 1998
    Editorial Contributions

  • Special issue 29th International Colloquium on Automata, Languages and Programming, Stephan Eidenbenz, Matthew Hennessy, Francisco Triguero, Rafael Morales, Peter Widmayer, Ricardo Conejo (Guest editors), Theoretical Computer Science (TCS), Vol. 312, No. 1 (2004)
  • Automata, Languages and Programing, Proceedings from the 29th International Colloquium (ICALP 2002), Peter Widmayer, Francisco Triguero, Rafael Morales, Matthew Hennessy, Stephan Eidenbenz, Ricardo Conejo (Eds.), Lecture Notes in Computer Science, Vol. 2380, 2002
  • Special issue 25th International Workshop on Graph-theoretic Concepts in Computer Science, Stephan Eidenbenz, Gabriele Neyer, Peter Widmayer (Guest editors), Discrete Applied Mathematics, Vol. 113, No. 1, 1- 128, North Holland, 30 September 2001
  • Part 1 (Selected papers from WG'99), Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz (Guest editors), International Journal of Foundations of Computer Science, Vol. 11, No. 3, September, 2000
  • Graph Theoretic Concepts in Computer Science, WG'99 , Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz (Eds.), Lecture Notes in Computer Science, Vol. 1665, 1999
    Other/Misc

  • Hierarchical Peta-Scale Simulation Framework for Stress Corrosion Cracking, P. Vashishta, R.K. Kalia, A. Nakano, E. Kaxiras, A, Grama, G. Lu, S. Eidenbenz, A. Voter, R.Q. Hood, J.A. Moriarty, Journal of Physics Conference Series, 125, 2008
  • Hierarchical Peta-Scale Simulation Framework for Stress Corrosion Cracking, P. Vashishta, R.K. Kalia, A. Nakano, E. Kaxiras, A, Grama, G. Lu, S. Eidenbenz, A. Voter, R.Q. Hood, J.A. Moriarty, L.J. Yang, Journal of Physics Conference Series, 78, U288 – U 294, 2007
  • A Probabilistic Congestion Aware Routing Protocol for Wireless Sensor Networks, V. Ramaswamy, A. Hansson, S. Eidenbenz, Invited Poster, Proceedings of International Conference on Distributed Computing in Sensor Systems (DCOSS), 2007
  • Los Alamos Communication Network Simulation, S. Eidenbenz, Winter Simulation Conference (WSC), 2005, page 23
  • (In-)Approximability of Visibility Problems on Polygons and Terrains , S. Eidenbenz , PhD thesis, Diss. ETH No. 13683, 2000
  • Optimum Inapproximability Results and the Class MaxSNP (in German), S. Eidenbenz, MSc thesis, ETH Switzerland, 1997
  • Online Dominating Set and Variations on Restricted Graph Classes, S. Eidenbenz, Technical Report, No. 380, ETH Zurich, Dept. of Computer Science, 2002