| 2013 | ||
|---|---|---|
| j21 | Md Sazzadur Rahman, Guanhua Yan, Harsha V. Madhyastha, Michalis Faloutsos, Stephan Eidenbenz, Mike Fisk: iDispatcher: A unified platform for secure planet-scale information dissemination. Peer-to-Peer Networking and Applications 6(1): 46-60 (2013) | |
| 2012 | ||
| j20 | Gentian Jakllari, Stephan Eidenbenz, Nicolas W. Hengartner, Srikanth V. Krishnamurthy, Michalis Faloutsos: Link Positions Matter: A Noncommutative Routing Metric for Wireless Mesh Networks. IEEE Trans. Mob. Comput. 11(1): 61-72 (2012) | |
| j19 | Konstantinos Pelechrinis, Guanhua Yan, Stephan Eidenbenz, Srikanth V. Krishnamurthy: Detection of Selfish Manipulation of Carrier Sensing in 802.11 Networks. IEEE Trans. Mob. Comput. 11(7): 1086-1101 (2012) | |
| c66 | Miguel A. Erazo, Ting Li, Jason Liu, Stephan Eidenbenz: Toward comprehensive and accurate simulation performance prediction of parallel file systems. DSN 2012: 1-12 | |
| c65 | Sunil Thulasidasan, Lukas Kroc, Stephan Eidenbenz: SimCore: A Library for Rapid Development of Large Scale Parallel Simulations. SIMULTECH 2012: 71-76 | |
| c64 | Nam P. Nguyen, Guanhua Yan, My T. Thai, Stephan Eidenbenz: Containment of misinformation spread in online social networks. WebSci 2012: 213-222 | |
| c63 | Vladimir Delengov, Yuan Li, Jennifer Thompson, Lukas Kroc, Nandakishore Santhi, Stephan Eidenbenz: Optimization principles for arithmetic functions in hardware-software co-design. Winter Simulation Conference 2012: 337 | |
| 2011 | ||
| j18 | Sandeep Kakumanu, Stephan Eidenbenz, Raghupathy Sivakumar: Lattice routing: A 4D routing scheme for multiradio multichannel ad hoc networks. Ad Hoc Networks 9(1): 95-107 (2011) | |
| j17 | Guanhua Yan, Duc T. Ha, Stephan Eidenbenz: AntBot: Anti-pollution peer-to-peer botnets. Computer Networks 55(8): 1941-1956 (2011) | |
| c62 | Guanhua Yan, Guanling Chen, Stephan Eidenbenz, Nan Li: Malware propagation in online social networks: nature, dynamics, and defense implications. ASIACCS 2011: 196-206 | |
| c61 | Shiva Prasad Kasiviswanathan, Stephan Eidenbenz, Guanhua Yan: Geography-based analysis of the Internet infrastructure. INFOCOM 2011: 131-135 | |
| c60 | Guanhua Yan, Songqing Chen, Stephan Eidenbenz: RatBot: Anti-enumeration Peer-to-Peer Botnets. ISC 2011: 135-151 | |
| c59 | Yuanyuan Zeng, Guanhua Yan, Stephan Eidenbenz, Kang G. Shin: Measuring the effectiveness of infrastructure-level detection of large-scale botnets. IWQoS 2011: 1-9 | |
| c58 | Adam Crume, Carlos Maltzahn, Jason Cope, Sam Lang, Robert B. Ross, Philip H. Carns, Christopher D. Carothers, Ning Liu, Curtis Janssen, John Bent, Stephan Eidenbenz, Meghan McClelland: Poster: FLAMBES: evolving fast performance models. SC Companion 2011: 31-32 | |
| e3 | Jason Liu, Francesco Quaglia, Stephan Eidenbenz, Stephen Gilmore (Eds.): 4th International ICST Conference on Simulation Tools and Techniques, SIMUTools '11, Barcelona, Spain, March 22 - 24, 2011. ICST/ACM 2011, isbn 978-1-936968-00-8 | |
| 2010 | ||
| j16 | Guanhua Yan, Stephan Eidenbenz, Sunil Thulasidasan, Pallab Datta, Venkatesh Ramaswamy: Criticality analysis of Internet infrastructure. Computer Networks 54(7): 1169-1182 (2010) | |
| c57 | Sunil Thulasidasan, Shiva Prasad Kasiviswanathan, Stephan Eidenbenz, Philip Romero: Explicit Spatial Scattering for Load Balancing in Conservatively Synchronized Parallel Discrete Event Simulations. PADS 2010: 150-157 | |
| c56 | Nandakishore Santhi, Guanhua Yan, Stephan Eidenbenz: CyberSim: Geographic, temporal, and organizational dynamics of malware propagation. Winter Simulation Conference 2010: 2876-2887 | |
| 2009 | ||
| j15 | Stephan Eidenbenz, Gunes Ercal-Ozkaya, Adam Meyerson, Allon G. Percus, Sarvesh Kumar Varatharajan: Incentive Compatible and Globally Efficient Position Based Routing for Selfish Reverse Multicast in Wireless Sensor Networks. Algorithms 2(4): 1303-1326 (2009) | |
| j14 | Guanhua Yan, Stephan Eidenbenz: Modeling Propagation Dynamics of Bluetooth Worms (Extended Version). IEEE Trans. Mob. Comput. 8(3): 353-368 (2009) | |
| c55 | Duc T. Ha, Guanhua Yan, Stephan Eidenbenz, Hung Q. Ngo: On the effectiveness of structural detection and defense against P2P-based botnets. DSN 2009: 297-306 | |
| c54 | Guanhua Yan, Leticia Cuellar, Stephan Eidenbenz, Nicolas W. Hengartner: Blue-Watchdog: Detecting Bluetooth worm propagation in public areas. DSN 2009: 317-326 | |
| c53 | Sunil Thulasidasan, Shiva Prasad Kasiviswanathan, Stephan Eidenbenz, Emanuele Galli, Susan M. Mniszewski, Philip Romero: Designing systems for large-scale, discrete-event simulations: Experiences with the FastTrans parallel microsimulator. HiPC 2009: 428-437 | |
| c52 | Konstantinos Pelechrinis, Guanhua Yan, Stephan Eidenbenz, Srikanth V. Krishnamurthy: Detecting Selfish Exploitation of Carrier Sensing in 802.11 Networks. INFOCOM 2009: 657-665 | |
| c51 | Guanhua Yan, Stephan Eidenbenz, Emanuele Galli: SMS-Watchdog: Profiling Social Behaviors of SMS Users for Anomaly Detection. RAID 2009: 202-223 | |
| c50 | Russell Bent, Stephan Eidenbenz, Sunil Thulasidasan: Large-scale telephone network simulation: discrete event vs. steady state. SpringSim 2009 | |
| c49 | Emanuele Galli, Leticia Cuellar, Stephan Eidenbenz, Mary Ewers, Sue Mniszewski, Christof Teuscher: ActivitySim: large-scale agent-based activity generation for infrastructure simulation. SpringSim 2009 | |
| c48 | Guanhua Yan, Stephan Eidenbenz, Bo Sun: Mobi-watchdog: you can steal, but you can't run! WISEC 2009: 139-150 | |
| c47 | Sunil Thulasidasan, Stephan Eidenbenz: Accelerating Traffic Microsimulations: A Parallel Discrete-event Queue-based Approach for Speed and Scale. Winter Simulation Conference 2009: 2457-2466 | |
| c46 | Lukas Kroc, Stephan Eidenbenz, James P. Smith: SessionSim: Activity-Based Session Generation for Network Simulation. Winter Simulation Conference 2009: 3169-3180 | |
| 2008 | ||
| j13 | Mark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis, Konrad Schlude: On the Complexity of Variations of Equal Sum Subsets. Nord. J. Comput. 14(3): 151-172 (2008) | |
| j12 | Stephan Eidenbenz, Giovanni Resta, Paolo Santi: The COMMIT Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish Nodes. IEEE Trans. Mob. Comput. 7(1): 19-33 (2008) | |
| c45 | Hector D. Flores, Rudolf H. Riedi, Stephan Eidenbenz, Nicolas W. Hengartner: On the Impact of Realism of Mobility Models for Wireless Networks. GLOBECOM 2008: 784-789 | |
| c44 | Gentian Jakllari, Stephan Eidenbenz, Nicolas W. Hengartner, Srikanth V. Krishnamurthy, Michalis Faloutsos: Link Positions Matter: A Noncommutative Routing Metric for Wireless Mesh Network. INFOCOM 2008: 744-752 | |
| c43 | Guanhua Yan, Songqing Chen, Stephan Eidenbenz: Dynamic Balancing of Packet Filtering Workloads on Distributed Firewalls. IWQoS 2008: 209-218 | |
| c42 | Gustavo Marfia, Paolo Lutterotti, Stephan Eidenbenz, Giovanni Pau, Mario Gerla: FairCast: fair multi-media streaming in ad hoc networks through local congestion control. MSWiM 2008: 2-9 | |
| c41 | Guanhua Yan, Stephan Eidenbenz: DDoS Mitigation in Non-cooperative Environments. Networking 2008: 599-611 | |
| c40 | Guanhua Yan, Zhen Xiao, Stephan Eidenbenz: Catching Instant Messaging Worms with Change-Point Detection Techniques. LEET 2008 | |
| 2007 | ||
| j11 | Stephan Eidenbenz, Anders A. Hansson, Venkatesh Ramaswamy, Christian M. Reidys: On a New Class of Load Balancing Network Protocols. Advances in Complex Systems 10(3): 359-377 (2007) | |
| c39 | Luzi Anderegg, Stephan Eidenbenz, Leon Peeters, Peter Widmayer: Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol. ALGOSENSORS 2007: 58-70 | |
| c38 | Guanhua Yan, Hector D. Flores, Leticia Cuellar, Nicolas W. Hengartner, Stephan Eidenbenz, Vincent Vu: Bluetooth worm propagation: mobility pattern matters! ASIACCS 2007: 32-44 | |
| c37 | Venkatesh Ramaswamy, Leticia Cuellar, Stephan Eidenbenz, Nicolas W. Hengartner: Low Overhead Router-Based Congestion Control Techniques to Protect Responsive Traffic. GLOBECOM 2007: 2740-2745 | |
| c36 | Stephan Eidenbenz, Luzi Anderegg, Roger Wattenhofer: Incentive-Compatible, Energy-Optimal, and Efficient Ad Hoc Networking in a Selfish Milieu. HICSS 2007: 293 | |
| c35 | Venkatesh Ramaswamy, Leticia Cuellar, Stephan Eidenbenz, Nicolas W. Hengartner: Preventing Bandwidth Abuse at the Router through Sending Rate Estimate-Based Active Queue Management. ICC 2007: 569-574 | |
| c34 | ||
| c33 | Matt S. Nassr, Jangeun Jun, Stephan Eidenbenz, Anders A. Hansson, Angela M. Mielke: Scalable and Reliable Sensor Network Routing: Performance Study from Field Deployment. INFOCOM 2007: 670-678 | |
| c32 | Gentian Jakllari, Stephan Eidenbenz, Nicolas W. Hengartner, Srikanth V. Krishnamurthy, Michalis Faloutsos: Revisiting minimum cost reliable routing in wireless mesh networks. MOBICOM 2007: 302-305 | |
| c31 | Venkatesh Ramaswamy, Leticia Cuellar, Stephan Eidenbenz, Nicolas W. Hengartner, Christoph Ambühl, Birgitta Weber: Light-Weight Control of Non-responsive Traffic with Low Buffer Requirements. Networking 2007: 855-866 | |
| c30 | Jangeun Jun, Mihail L. Sichitiu, Hector D. Flores, Stephan Eidenbenz: The Optimum Number of OSPF Areas for MANETs. SECON 2007: 451-460 | |
| c29 | Venkatesh Ramaswamy, Anders A. Hansson, Stephan Eidenbenz: COBRA - A Multi-path Adaptive Local Load Sensing Routing Protocol for Wireless Sensor Networks. WiMob 2007: 62 | |
| 2006 | ||
| j10 | Stephan Eidenbenz: Finding minimum hidden guard sets in polygons - tight approximability results. Comput. Geom. 34(2): 49-57 (2006) | |
| j9 | Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust: Equilibria in Topology Control Games for Ad Hoc Networks. MONET 11(2): 143-159 (2006) | |
| c28 | Guanhua Yan, Stephan Eidenbenz: Bluetooth Worms: Models, Dynamics, and Defense Implications. ACSAC 2006: 245-256 | |
| c27 | Guanhua Yan, Stephan Eidenbenz: Sluggish Calendar Queues for Network Simulation. MASCOTS 2006: 127-136 | |
| c26 | Weizhao Wang, Xiang-Yang Li, Stephan Eidenbenz, Yu Wang: OURS: optimal unicast routing systems in non-cooperative wireless networks. MOBICOM 2006: 402-413 | |
| c25 | Karthikeyan Sundaresan, Weizhao Wang, Stephan Eidenbenz: Algorithmic aspects of communication in ad-hoc networks with smart antennas. MobiHoc 2006: 298-309 | |
| c24 | Hector D. Flores, Stephan Eidenbenz, Rudolf H. Riedi, Nicolas W. Hengartner: Describing MANETS: principal component analysis of sparse mobility traces. PE-WASUN 2006: 123-131 | |
| c23 | Roman Waupotitsch, Stephan Eidenbenz, James P. Smith, Lukas Kroc: Multi-scale integrated information and telecommunications system (MIITS): first results from a large-scale end-to-end network simulator. Winter Simulation Conference 2006: 2132-2139 | |
| 2005 | ||
| j8 | Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger: Complexity and Approximability of Double Digest. J. Bioinformatics and Computational Biology 3(2): 207-224 (2005) | |
| j7 | Christopher L. Barrett, Stephan Eidenbenz, Lukas Kroc, Madhav V. Marathe, James P. Smith: Parametric Probabilistic Routing in Sensor Networks. MONET 10(4): 529-544 (2005) | |
| j6 | Mark Cieliebak, Stephan Eidenbenz, Paolo Penna: Partial Digest is hard to solve for erroneous input data. Theor. Comput. Sci. 349(3): 361-381 (2005) | |
| c22 | Stephan Eidenbenz, Giovanni Resta, Paolo Santi: COMMIT: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks with Selfish Nodes. IPDPS 2005 | |
| c21 | Stephan Eidenbenz, Lukas Kroc, James P. Smith: Maneuverable Relays to Improve Energy Efficiency in Sensor Networks. PerCom Workshops 2005: 411-417 | |
| c20 | Christopher L. Barrett, Stephan Eidenbenz, Lukas Kroc, Madhav V. Marathe, James P. Smith: Probabilistic multi-path vs. deterministic single-path protocols for dynamic ad-hoc network scenarios. SAC 2005: 1166-1173 | |
| c19 | Stephan Eidenbenz: Los Alamos communication network simulation. Winter Simulation Conference 2005: 23 | |
| 2004 | ||
| j5 | Stephan Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo: Preface. Theor. Comput. Sci. 312(1): 1-2 (2004) | |
| c18 | Mark Cieliebak, Stephan Eidenbenz: Measurement Errors Make the Partial Digest Problem NP-Hard. LATIN 2004: 379-390 | |
| 2003 | ||
| j4 | Stephan Eidenbenz, Peter Widmayer: An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee. SIAM J. Comput. 32(3): 654-670 (2003) | |
| c17 | Luzi Anderegg, Stephan Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer: Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations. ALENEX 2003: 106-118 | |
| c16 | Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger: Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. COCOON 2003: 519-527 | |
| c15 | Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust: Equilibria in topology control games for ad hoc networks. DIALM-POMC 2003: 2-11 | |
| c14 | ||
| c13 | ||
| c12 | Luzi Anderegg, Stephan Eidenbenz: Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. MOBICOM 2003: 245-259 | |
| c11 | Mark Cieliebak, Stephan Eidenbenz, Paolo Penna: Noisy Data Make the Partial Digest Problem NP-hard. WABI 2003: 111-123 | |
| c10 | Christopher L. Barrett, Stephan Eidenbenz, Lukas Kroc, Madhav V. Marathe, James P. Smith: Parametric probabilistic sensor network routing. Wireless Sensor Networks and Applications 2003: 122-131 | |
| 2002 | ||
| j3 | Stephan Eidenbenz: Inapproximability of finding maximum hidden sets on polygons and terrains. Comput. Geom. 21(3): 139-153 (2002) | |
| j2 | Stephan Eidenbenz: Approximation algorithms for terrain guarding. Inf. Process. Lett. 82(2): 99-105 (2002) | |
| c9 | Stephan Eidenbenz: Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains. SWAT 2002: 60-68 | |
| e2 | Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan Eidenbenz, Ricardo Conejo (Eds.): Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings. Lecture Notes in Computer Science 2380, Springer 2002, isbn 3-540-43864-5 | |
| 2001 | ||
| j1 | Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Inapproximability Results for Guarding Polygons and Terrains. Algorithmica 31(1): 79-113 (2001) | |
| c8 | Stephan Eidenbenz, Peter Widmayer: An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. ESA 2001: 333-344 | |
| 2000 | ||
| c7 | Stephan Eidenbenz, Christoph Stamm: MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs. IFIP TCS 2000: 200-212 | |
| 1999 | ||
| c6 | ||
| e1 | Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz (Eds.): Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings. Lecture Notes in Computer Science 1665, Springer 1999, isbn 3-540-66731-8 | |
| 1998 | ||
| c5 | Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Inapproximability of some art gallery problems. CCCG 1998 | |
| c4 | Christoph Stamm, Stephan Eidenbenz, Renato Pajarola: A modified longest side bisection triangulation. CCCG 1998 | |
| c3 | Christoph Stamm, Stephan Eidenbenz, Michael Beck, Peter Stucki, Peter Widmayer: A Prototype System for Light Propagation in Terrains. Computer Graphics International 1998: 103- | |
| c2 | Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result. ESA 1998: 187-198 | |
| c1 | Stephan Eidenbenz: Inapproximability Results for Guarding Polygons without Holes. ISAAC 1998: 427-436 | |
Colors in the list of coauthors
Last update Sun May 19 00:02:30 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page