Stephan Eidenbenz

	2009
60		Guanhua Yan, Stephan Eidenbenz, Emanuele Galli: SMS-Watchdog: Profiling Social Behaviors of SMS Users for Anomaly Detection. RAID 2009: 202-223
59		Guanhua Yan, Stephan Eidenbenz, Bo Sun: Mobi-watchdog: you can steal, but you can't run! WISEC 2009: 139-150
58		Guanhua Yan, Stephan Eidenbenz: Modeling Propagation Dynamics of Bluetooth Worms (Extended Version). IEEE Trans. Mob. Comput. 8(3): 353-368 (2009)
	2008
57		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
56		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
55		Guanhua Yan, Songqing Chen, Stephan Eidenbenz: Dynamic Balancing of Packet Filtering Workloads on Distributed Firewalls. IWQoS 2008: 209-218
54		Guanhua Yan, Zhen Xiao, Stephan Eidenbenz: Catching Instant Messaging Worms with Change-Point Detection Techniques. LEET 2008
53		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
52		Guanhua Yan, Stephan Eidenbenz: DDoS Mitigation in Non-cooperative Environments. Networking 2008: 599-611
51		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)
	2007
50		Luzi Anderegg, Stephan Eidenbenz, Leon Peeters, Peter Widmayer: Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol. ALGOSENSORS 2007: 58-70
49		Guanhua Yan, Hector D. Flores, Leticia Cuellar, Nicolas W. Hengartner, Stephan Eidenbenz, Vincent Vu: Bluetooth worm propagation: mobility pattern matters! ASIACCS 2007: 32-44
48		Venkatesh Ramaswamy, Leticia Cuellar, Stephan Eidenbenz, Nicolas W. Hengartner: Low Overhead Router-Based Congestion Control Techniques to Protect Responsive Traffic. GLOBECOM 2007: 2740-2745
47		Stephan Eidenbenz, Luzi Anderegg, Roger Wattenhofer: Incentive-Compatible, Energy-Optimal, and Efficient Ad Hoc Networking in a Selfish Milieu. HICSS 2007: 293
46		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
45		Guanhua Yan, Stephan Eidenbenz: Modeling Propagation Dynamics of Bluetooth Worms. ICDCS 2007: 42
44		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
43		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
42		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
41		Jangeun Jun, Mihail L. Sichitiu, Hector D. Flores, Stephan Eidenbenz: The Optimum Number of OSPF Areas for MANETs. SECON 2007: 451-460
	2006
40		Guanhua Yan, Stephan Eidenbenz: Bluetooth Worms: Models, Dynamics, and Defense Implications. ACSAC 2006: 245-256
39		Guanhua Yan, Stephan Eidenbenz: Sluggish Calendar Queues for Network Simulation. MASCOTS 2006: 127-136
38		Weizhao Wang, Xiang-Yang Li, Stephan Eidenbenz, Yu Wang: OURS: optimal unicast routing systems in non-cooperative wireless networks. MOBICOM 2006: 402-413
37		Karthikeyan Sundaresan, Weizhao Wang, Stephan Eidenbenz: Algorithmic aspects of communication in ad-hoc networks with smart antennas. MobiHoc 2006: 298-309
36		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
35		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
34		Stephan Eidenbenz: Finding minimum hidden guard sets in polygons - tight approximability results. Comput. Geom. 34(2): 49-57 (2006)
33		Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust: Equilibria in Topology Control Games for Ad Hoc Networks. MONET 11(2): 143-159 (2006)
	2005
32		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
31		Stephan Eidenbenz, Lukas Kroc, James P. Smith: Maneuverable Relays to Improve Energy Efficiency in Sensor Networks. PerCom Workshops 2005: 411-417
30		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
29		Stephan Eidenbenz: Los Alamos communication network simulation. Winter Simulation Conference 2005: 23
28		Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger: Complexity and Approximability of Double Digest. J. Bioinformatics and Computational Biology 3(2): 207-224 (2005)
27		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)
26		Mark Cieliebak, Stephan Eidenbenz, Paolo Penna: Partial Digest is hard to solve for erroneous input data. Theor. Comput. Sci. 349(3): 361-381 (2005)
	2004
25		Mark Cieliebak, Stephan Eidenbenz: Measurement Errors Make the Partial Digest Problem NP-Hard. LATIN 2004: 379-390
24		Stephan Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo: Preface. Theor. Comput. Sci. 312(1): 1-2 (2004)
	2003
23		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
22		Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger: Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. COCOON 2003: 519-527
21		Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust: Equilibria in topology control games for ad hoc networks. DIALM-POMC 2003: 2-11
20		Mark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis: Composing Equipotent Teams. FCT 2003: 98-108
19		Stephan Eidenbenz, Aris Pagourtzis, Peter Widmayer: Flexible Train Rostering. ISAAC 2003: 615-624
18		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
17		Mark Cieliebak, Stephan Eidenbenz, Paolo Penna: Noisy Data Make the Partial Digest Problem NP-hard. WABI 2003: 111-123
16		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
15		Stephan Eidenbenz, Peter Widmayer: An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee. SIAM J. Comput. 32(3): 654-670 (2003)
	2002
14		Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan Eidenbenz, Ricardo Conejo: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings Springer 2002
13		Stephan Eidenbenz: Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains. SWAT 2002: 60-68
12		Stephan Eidenbenz: Inapproximability of finding maximum hidden sets on polygons and terrains. Comput. Geom. 21(3): 139-153 (2002)
11		Stephan Eidenbenz: Approximation algorithms for terrain guarding. Inf. Process. Lett. 82(2): 99-105 (2002)
	2001
10		Stephan Eidenbenz, Peter Widmayer: An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. ESA 2001: 333-344
9		Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Inapproximability Results for Guarding Polygons and Terrains. Algorithmica 31(1): 79-113 (2001)
	2000
8		Stephan Eidenbenz, Christoph Stamm: MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs. IFIP TCS 2000: 200-212
	1999
7		Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings Springer 1999
6		Stephan Eidenbenz: How Many People Can Hide in a Terrain? ISAAC 1999: 184-194
	1998
5		Christoph Stamm, Stephan Eidenbenz, Renato Pajarola: A modified longest side bisection triangulation. CCCG 1998
4		Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Inapproximability of some art gallery problems. CCCG 1998
3		Christoph Stamm, Stephan Eidenbenz, Michael Beck, Peter Stucki, Peter Widmayer: A Prototype System for Light Propagation in Terrains. Computer Graphics International 1998: 103-
2		Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result. ESA 1998: 187-198
1		Stephan Eidenbenz: Inapproximability Results for Guarding Polygons without Holes. ISAAC 1998: 427-436

Coauthor Index

1	Christoph Ambühl	[42]
2	Luzi Anderegg	[18] [23] [47] [50]
3	Christopher L. Barrett	[16] [27] [30]
4	Michael Beck	[3]
5	Rafael Morales Bueno	[14] [24]
6	Songqing Chen	[55]
7	Mark Cieliebak	[17] [20] [22] [25] [26] [28]
8	Ricardo Conejo	[14] [24]
9	Leticia Cuellar	[42] [46] [48] [49]
10	Michalis Faloutsos	[43] [56]
11	Hector D. Flores	[36] [41] [49] [57]
12	Emanuele Galli	[60]
13	Martin Gantenbein	[23]
14	Mario Gerla	[53]
15	Anders A. Hansson	[44]
16	Nicolas W. Hengartner	[36] [42] [43] [46] [48] [49] [56] [57]
17	Matthew Hennessy	[14] [24]
18	Gentian Jakllari	[43] [56]
19	Jangeun Jun	[41] [44]
20	Srikanth V. Krishnamurthy	[43] [56]
21	Lukas Kroc	[16] [27] [30] [31] [35]
22	V. S. Anil Kumar	[21] [33]
23	Xiang-Yang Li	[38]
24	Paolo Lutterotti	[53]
25	Madhav V. Marathe	[16] [27] [30]
26	Gustavo Marfia	[53]
27	Angela M. Mielke	[44]
28	Matt S. Nassr	[44]
29	Gabriele Neyer	[7]
30	Aris Pagourtzis	[19] [20]
31	Renato Pajarola	[5]
32	Giovanni Pau	[53]
33	Leon Peeters	[50]
34	Paolo Penna	[17] [26]
35	Venkatesh Ramaswamy	[42] [46] [48]
36	Giovanni Resta	[32] [51]
37	Rudolf H. Riedi	[36] [57]
38	Francisco Triguero Ruiz	[14] [24]
39	Paolo Santi	[32] [51]
40	Mihail L. Sichitiu	[41]
41	James P. Smith	[16] [27] [30] [31] [35]
42	Christoph Stamm	[2] [3] [4] [5] [8] [9] [23]
43	Peter Stucki	[3]
44	Bo Sun	[59]
45	Karthikeyan Sundaresan	[37]
46	David Scot Taylor	[23]
47	Vincent Vu	[49]
48	Weizhao Wang	[37] [38]
49	Yu Wang	[38]
50	Roger Wattenhofer	[47]
51	Roman Waupotitsch	[35]
52	Birgitta Weber	[23] [42]
53	Peter Widmayer	[2] [3] [4] [7] [9] [10] [14] [15] [19] [23] [24] [50]
54	Gerhard J. Woeginger	[22] [28]
55	Zhen Xiao	[54]
56	Guanhua Yan	[39] [40] [45] [49] [52] [54] [55] [58] [59] [60]
57	Sibylle Zust	[21] [33]

Colors in the list of coauthors