2009 | ||
---|---|---|
57 | EE | Guanhua Yan, Stephan Eidenbenz, Bo Sun: Mobi-watchdog: you can steal, but you can't run! WISEC 2009: 139-150 |
2008 | ||
56 | EE | 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 |
55 | EE | 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 |
54 | EE | Guanhua Yan, Zhen Xiao, Stephan Eidenbenz: Catching Instant Messaging Worms with Change-Point Detection Techniques. LEET 2008 |
53 | EE | 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 | EE | Guanhua Yan, Stephan Eidenbenz: DDoS Mitigation in Non-cooperative Environments. Networking 2008: 599-611 |
51 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | Stephan Eidenbenz, Luzi Anderegg, Roger Wattenhofer: Incentive-Compatible, Energy-Optimal, and Efficient Ad Hoc Networking in a Selfish Milieu. HICSS 2007: 293 |
46 | EE | 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 | EE | Guanhua Yan, Stephan Eidenbenz: Modeling Propagation Dynamics of Bluetooth Worms. ICDCS 2007: 42 |
44 | EE | 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 | EE | 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 | EE | 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 | EE | Jangeun Jun, Mihail L. Sichitiu, Hector D. Flores, Stephan Eidenbenz: The Optimum Number of OSPF Areas for MANETs. SECON 2007: 451-460 |
2006 | ||
40 | EE | Guanhua Yan, Stephan Eidenbenz: Bluetooth Worms: Models, Dynamics, and Defense Implications. ACSAC 2006: 245-256 |
39 | EE | Guanhua Yan, Stephan Eidenbenz: Sluggish Calendar Queues for Network Simulation. MASCOTS 2006: 127-136 |
38 | EE | Weizhao Wang, Xiang-Yang Li, Stephan Eidenbenz, Yu Wang: OURS: optimal unicast routing systems in non-cooperative wireless networks. MOBICOM 2006: 402-413 |
37 | EE | Karthikeyan Sundaresan, Weizhao Wang, Stephan Eidenbenz: Algorithmic aspects of communication in ad-hoc networks with smart antennas. MobiHoc 2006: 298-309 |
36 | EE | 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 | EE | 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 | EE | Stephan Eidenbenz: Finding minimum hidden guard sets in polygons - tight approximability results. Comput. Geom. 34(2): 49-57 (2006) |
33 | EE | 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 | EE | 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 | EE | Stephan Eidenbenz, Lukas Kroc, James P. Smith: Maneuverable Relays to Improve Energy Efficiency in Sensor Networks. PerCom Workshops 2005: 411-417 |
30 | EE | 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 | EE | Stephan Eidenbenz: Los Alamos communication network simulation. Winter Simulation Conference 2005: 23 |
28 | EE | Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger: Complexity and Approximability of Double Digest. J. Bioinformatics and Computational Biology 3(2): 207-224 (2005) |
27 | EE | 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 | EE | 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 | EE | Mark Cieliebak, Stephan Eidenbenz: Measurement Errors Make the Partial Digest Problem NP-Hard. LATIN 2004: 379-390 |
24 | EE | 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 | EE | Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger: Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. COCOON 2003: 519-527 |
21 | EE | Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust: Equilibria in topology control games for ad hoc networks. DIALM-POMC 2003: 2-11 |
20 | EE | Mark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis: Composing Equipotent Teams. FCT 2003: 98-108 |
19 | EE | Stephan Eidenbenz, Aris Pagourtzis, Peter Widmayer: Flexible Train Rostering. ISAAC 2003: 615-624 |
18 | EE | 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 | EE | Mark Cieliebak, Stephan Eidenbenz, Paolo Penna: Noisy Data Make the Partial Digest Problem NP-hard. WABI 2003: 111-123 |
16 | EE | 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 | EE | 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 | EE | 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 | EE | Stephan Eidenbenz: Approximation algorithms for terrain guarding. Inf. Process. Lett. 82(2): 99-105 (2002) |
2001 | ||
10 | EE | Stephan Eidenbenz, Peter Widmayer: An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. ESA 2001: 333-344 |
9 | EE | Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Inapproximability Results for Guarding Polygons and Terrains. Algorithmica 31(1): 79-113 (2001) |
2000 | ||
8 | EE | 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 | EE | Stephan Eidenbenz: How Many People Can Hide in a Terrain? ISAAC 1999: 184-194 |
1998 | ||
5 | EE | Christoph Stamm, Stephan Eidenbenz, Renato Pajarola: A modified longest side bisection triangulation. CCCG 1998 |
4 | EE | Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Inapproximability of some art gallery problems. CCCG 1998 |
3 | EE | Christoph Stamm, Stephan Eidenbenz, Michael Beck, Peter Stucki, Peter Widmayer: A Prototype System for Light Propagation in Terrains. Computer Graphics International 1998: 103- |
2 | EE | Stephan Eidenbenz, Christoph Stamm, Peter Widmayer: Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result. ESA 1998: 187-198 |
1 | EE | Stephan Eidenbenz: Inapproximability Results for Guarding Polygons without Holes. ISAAC 1998: 427-436 |