Stephan Eidenbenz - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

CyberSim: Geographic, temporal, and organizational dynamics of malware propagationNandakishore Santhi, Guanhua Yan, Stephan Eidenbenz. wsc 2010: 2876-2887 [doi]

Criticality analysis of Internet infrastructureGuanhua Yan, Stephan Eidenbenz, Sunil Thulasidasan, Pallab Datta, Venkatesh Ramaswamy. cn, 54(7):1169-1182, 2010. [doi]

2009

Large-scale telephone network simulation: discrete event vs. steady stateRussell Bent, Stephan Eidenbenz, Sunil Thulasidasan. springsim 2009: [doi]

Incentive Compatible and Globally Efficient Position Based Routing for Selfish Reverse Multicast in Wireless Sensor NetworksStephan Eidenbenz, Gunes Ercal-Ozkaya, Adam Meyerson, Allon Percus, Sarvesh Kumar Varatharajan. algorithms, 2(4):1303-1326, 2009. [doi]

ActivitySim: large-scale agent-based activity generation for infrastructure simulationEmanuele Galli, Leticia Cuellar, Stephan Eidenbenz, Mary Ewers, Sue Mniszewski, Christof Teuscher. springsim 2009: [doi]

On the effectiveness of structural detection and defense against P2P-based botnetsDuc T. Ha, Guanhua Yan, Stephan Eidenbenz, Hung Q. Ngo. dsn 2009: 297-306 [doi]

SessionSim: Activity-Based Session Generation for Network SimulationLukas Kroc, Stephan Eidenbenz, James P. Smith. wsc 2009: 3169-3180 [doi]

Detecting Selfish Exploitation of Carrier Sensing in 802.11 NetworksKonstantinos Pelechrinis, Guanhua Yan, Stephan Eidenbenz, Srikanth V. Krishnamurthy. infocom 2009: 657-665 [doi]

Designing systems for large-scale, discrete-event simulations: Experiences with the FastTrans parallel microsimulatorSunil Thulasidasan, Shiva Kasiviswanathan, Stephan Eidenbenz, Emanuele Galli, Susan M. Mniszewski, Philip Romero. hipc 2009: 428-437 [doi]

Accelerating Traffic Microsimulations: A Parallel Discrete-event Queue-based Approach for Speed and ScaleSunil Thulasidasan, Stephan Eidenbenz. wsc 2009: 2457-2466 [doi]

Mobi-watchdog: you can steal, but you can t run!Guanhua Yan, Stephan Eidenbenz, Bo Sun. wisec 2009: 139-150 [doi]

Blue-Watchdog: Detecting Bluetooth worm propagation in public areasGuanhua Yan, Leticia Cuellar, Stephan Eidenbenz, Nicolas W. Hengartner. dsn 2009: 317-326 [doi]

SMS-Watchdog: Profiling Social Behaviors of SMS Users for Anomaly DetectionGuanhua Yan, Stephan Eidenbenz, Emanuele Galli. raid 2009: 202-223 [doi]

Modeling Propagation Dynamics of Bluetooth Worms (Extended Version)Guanhua Yan, Stephan Eidenbenz. tmc, 8(3):353-368, 2009. [doi]

2008

On the Complexity of Variations of Equal Sum SubsetsMark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis, Konrad Schlude. njc, 14(3):151-172, 2008.

The COMMIT Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish NodesStephan Eidenbenz, Giovanni Resta, Paolo Santi. tmc, 7(1):19-33, 2008. [doi]

On the Impact of Realism of Mobility Models for Wireless NetworksHector D. Flores, Rudolf H. Riedi, Stephan Eidenbenz, Nicolas W. Hengartner. globecom 2008: 784-789 [doi]

Link Positions Matter: A Noncommutative Routing Metric for Wireless Mesh NetworkGentian Jakllari, Stephan Eidenbenz, Nicolas W. Hengartner, Srikanth V. Krishnamurthy, Michalis Faloutsos. infocom 2008: 744-752 [doi]

FairCast: fair multi-media streaming in ad hoc networks through local congestion controlGustavo Marfia, Paolo Lutterotti, Stephan Eidenbenz, Giovanni Pau, Mario Gerla. mswim 2008: 2-9 [doi]

Catching Instant Messaging Worms with Change-Point Detection TechniquesGuanhua Yan, Zhen Xiao, Stephan Eidenbenz. nsdi 2008: [doi]

Dynamic Balancing of Packet Filtering Workloads on Distributed FirewallsGuanhua Yan, Songqing Chen, Stephan Eidenbenz. iwqos 2008: 209-218 [doi]

DDoS Mitigation in Non-cooperative EnvironmentsGuanhua Yan, Stephan Eidenbenz. networking 2008: 599-611 [doi]

2007

Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing ProtocolLuzi Anderegg, Stephan Eidenbenz, Leon Peeters, Peter Widmayer. algosensors 2008: 58-70 [doi]

Incentive-Compatible, Energy-Optimal, and Efficient Ad Hoc Networking in a Selfish MilieuStephan Eidenbenz, Luzi Anderegg, Roger Wattenhofer. hicss 2007: 293 [doi]

On a New Class of Load Balancing Network ProtocolsStephan Eidenbenz, Anders A. Hansson, Venkatesh Ramaswamy, Christian M. Reidys. advcs, 10(3):359-377, 2007. [doi]

Revisiting minimum cost reliable routing in wireless mesh networksGentian Jakllari, Stephan Eidenbenz, Nicolas W. Hengartner, Srikanth V. Krishnamurthy, Michalis Faloutsos. mobicom 2007: 302-305 [doi]

The Optimum Number of OSPF Areas for MANETsJangeun Jun, Mihail L. Sichitiu, Hector D. Flores, Stephan Eidenbenz. secon 2007: 451-460 [doi]

Scalable and Reliable Sensor Network Routing: Performance Study from Field DeploymentMatt S. Nassr, Jangeun Jun, Stephan Eidenbenz, Anders A. Hansson, Angela M. Mielke. infocom 2007: 670-678 [doi]

Light-Weight Control of Non-responsive Traffic with Low Buffer RequirementsVenkatesh Ramaswamy, Leticia Cuellar, Stephan Eidenbenz, Nicolas W. Hengartner, Christoph Ambühl, Birgitta Weber. networking 2007: 855-866 [doi]

COBRA - A Multi-path Adaptive Local Load Sensing Routing Protocol for Wireless Sensor NetworksVenkatesh Ramaswamy, Anders A. Hansson, Stephan Eidenbenz. wimob 2007: 62 [doi]

Low Overhead Router-Based Congestion Control Techniques to Protect Responsive TrafficVenkatesh Ramaswamy, Leticia Cuellar, Stephan Eidenbenz, Nicolas W. Hengartner. globecom 2007: 2740-2745 [doi]

Preventing Bandwidth Abuse at the Router through Sending Rate Estimate-Based Active Queue ManagementVenkatesh Ramaswamy, Leticia Cuellar, Stephan Eidenbenz, Nicolas W. Hengartner. icc 2007: 569-574 [doi]

Bluetooth worm propagation: mobility pattern matters!Guanhua Yan, Hector D. Flores, Leticia Cuellar, Nicolas W. Hengartner, Stephan Eidenbenz, Vincent Vu. ccs 2007: 32-44 [doi]

Modeling Propagation Dynamics of Bluetooth WormsGuanhua Yan, Stephan Eidenbenz. icdcs 2007: 42 [doi]

2006

Finding minimum hidden guard sets in polygons - tight approximability resultsStephan Eidenbenz. comgeo, 34(2):49-57, 2006. [doi]

Equilibria in Topology Control Games for Ad Hoc NetworksStephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust. monet, 11(2):143-159, 2006. [doi]

Describing MANETS: principal component analysis of sparse mobility tracesHector D. Flores, Stephan Eidenbenz, Rudolf H. Riedi, Nicolas W. Hengartner. pe-wasun 2006: 123-131 [doi]

Algorithmic aspects of communication in ad-hoc networks with smart antennasKarthikeyan Sundaresan, Weizhao Wang, Stephan Eidenbenz. mobihoc 2006: 298-309 [doi]

OURS: optimal unicast routing systems in non-cooperative wireless networksWeizhao Wang, Xiang-Yang Li, Stephan Eidenbenz, Yu Wang. mobicom 2006: 402-413 [doi]

Multi-scale integrated information and telecommunications system (MIITS): first results from a large-scale end-to-end network simulatorRoman Waupotitsch, Stephan Eidenbenz, James P. Smith, Lukas Kroc. wsc 2006: 2132-2139 [doi]

Sluggish Calendar Queues for Network SimulationGuanhua Yan, Stephan Eidenbenz. mascots 2006: 127-136 [doi]

Bluetooth Worms: Models, Dynamics, and Defense ImplicationsGuanhua Yan, Stephan Eidenbenz. acsac 2006: 245-256 [doi]

2005

Parametric Probabilistic Routing in Sensor NetworksChristopher L. Barrett, Stephan Eidenbenz, Lukas Kroc, Madhav V. Marathe, James P. Smith. monet, 10(4):529-544, 2005. [doi]

Probabilistic multi-path vs. deterministic single-path protocols for dynamic ad-hoc network scenariosChristopher L. Barrett, Stephan Eidenbenz, Lukas Kroc, Madhav V. Marathe, James P. Smith. SAC 2005: 1166-1173 [doi]

Complexity and Approximability of Double DigestMark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger. jbcb, 3(2):207-224, 2005. [doi]

Partial Digest is hard to solve for erroneous input dataMark Cieliebak, Stephan Eidenbenz, Paolo Penna. TCS, 349(3):361-381, 2005. [doi]

Maneuverable Relays to Improve Energy Efficiency in Sensor NetworksStephan Eidenbenz, Lukas Kroc, James P. Smith. percom 2005: 411-417 [doi]

Los Alamos communication network simulationStephan Eidenbenz. wsc 2005: 23 [doi]

COMMIT: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks with Selfish NodesStephan Eidenbenz, Giovanni Resta, Paolo Santi. ipps 2005: [doi]

2004

Measurement Errors Make the Partial Digest Problem NP-HardMark Cieliebak, Stephan Eidenbenz. latin 2004: 379-390 [doi]

PrefaceStephan Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo. TCS, 312(1):1-2, 2004. [doi]

2003

Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agentsLuzi Anderegg, Stephan Eidenbenz. mobicom 2003: 245-259 [doi]

Train Routing Algorithms: Concepts, Design Choises, and Practical ConsiderationsLuzi Anderegg, Stephan Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer. alenex 2003: 106-118

Parametric probabilistic sensor network routingChristopher L. Barrett, Stephan Eidenbenz, Lukas Kroc, Madhav V. Marathe, James P. Smith. wsna 2003: 122-131 [doi]

Composing Equipotent TeamsMark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis. fct 2003: 98-108 [doi]

Double Digest Revisited: Complexity and Approximability in the Presence of Noisy DataMark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger. cocoon 2003: 519-527 [doi]

Noisy Data Make the Partial Digest Problem NP-hardMark Cieliebak, Stephan Eidenbenz, Paolo Penna. wabi 2003: 111-123 [doi]

Equilibria in topology control games for ad hoc networksStephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust. dialm 2003: 2-11 [doi]

An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance GuaranteeStephan Eidenbenz, Peter Widmayer. siamcomp, 32(3):654-670, 2003. [doi]

Flexible Train RosteringStephan Eidenbenz, Aris Pagourtzis, Peter Widmayer. isaac 2003: 615-624 [doi]

2002

Inapproximability of finding maximum hidden sets on polygons and terrainsStephan Eidenbenz. comgeo, 21(3):139-153, 2002.

Approximation algorithms for terrain guardingStephan Eidenbenz. ipl, 82(2):99-105, 2002. [doi]

Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and TerrainsStephan Eidenbenz. swat 2002: 60-68 [doi]

Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, ProceedingsPeter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan Eidenbenz, Ricardo Conejo, editors, Volume 2380 of Lecture Notes in Computer Science, Springer, 2002.

2001

An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance GuaranteeStephan Eidenbenz, Peter Widmayer. esa 2001: 333-344 [doi]

Inapproximability Results for Guarding Polygons and TerrainsStephan Eidenbenz, Christoph Stamm, Peter Widmayer. algorithmica, 31(1):79-113, 2001. [doi]

2000

MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility GraphsStephan Eidenbenz, Christoph Stamm. ifipTCS 2000: 200-212 [doi]

1999

How Many People Can Hide in a Terrain?Stephan Eidenbenz. isaac 1999: 184-194 [doi]

Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG 99, Ascona, Switzerland, June 17-19, 1999, ProceedingsPeter Widmayer, Gabriele Neyer, Stephan Eidenbenz, editors, Volume 1665 of Lecture Notes in Computer Science, Springer, 1999.

1998