Stephan Eidenbenz
 Team leader
Ph.D. (Computer Science), Swiss Federal Instittue of Technology, Zurich (ETHZ), Switzerland
, 2000
Bachelor of Business Administration, GSBA, 1999
Mailing address
Los Alamos National Laboratory
Discrete Simulation Sciences, CCS-5
P.0. Box 1663,
MS M997
Los Alamos, NM 87545
eidenben@lanl.gov
CV available upon request
Community
Service
Selected Technical Program Committee
Memberships:
2007: IEEE INFOCOM, IEEE MASS, IFIP
TC6 NETWORKING
2006: ACM MOBIHOC, IEEE MASS
2005: IEEE MOBIHOC, ACM DIALM-POMC
Publications
This list does not get updated very
frequently. Check scholar.google.com for most recent work and for
electronic copies of papers published after 2003. If you cannot find an
article on the web, send me an email.
Journal Articles
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
Journal 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, pp. 654 - 670, 2003
LA-UR:02-7641
[ [
pdf-file ] © Society for
Industrial and Applied Mathematics
Inapproximability of Finding Maximum Hidden Sets
on Polygons and Terrains
S. Eidenbenz
Computational Geometry: Theory and Applications (CGTA), Vol. 21, pp. 139
153, 2002
[ [
pdf-file ] © Elsevier-Science
Approximation algorithms for Terrain Guarding
S. Eidenbenz
Information Processing Letters (IPL), Vol. 82, pp. 99 105, 2002
[ [
pdf-file ] © Elsevier-Science
Inapproximability Results for Guarding Polygons
and Terrains
S. Eidenbenz, C. Stamm,
P. Widmayer
Algorithmica, Vol. 31, pp. 79 113, 2001
[ [
pdf-file ] © Springer-Verlag
Refereed Conference Proceedings
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 (ISAAC 2003), 2003
LA-UR:03-3758
Parametric Probabilistic Sensor Network Routing
C Barrett, S. Eidenbenz, L. Kroc, M. Marathe, J.P. Smith
Proceedings of The Second ACM International Workshop on Wireless Sensor
Networks and Applications (WSNA 2003), 2003
LA-UR:03-4170
[ [
pdf-file ] © ACM
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, 2003
LA-UR:03-3269
[ [
pdf-file ] © ACM
Ad hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad
hoc Networks with Selfish Agents
L. Anderegg, S. Eidenbenz
Proceedings of MOBICOM 2003, 2003
LA-UR:03-1404
[ [
pdf-file ] © ACM
Noisy Data Make the Partial Digest Problem NP-hard
M. Cieliebak, S. Eidenbenz,
P. Penna
Lecture Notes in Computer Science 2812 (WABI 2003), 2003
LA-UR:03-1157
[ [
pdf-file ] © Springer-Verlag
Composing Equipotent Teams
M. Cieliebak, S. Eidenbenz,
A. Pagourtzis
Lecture Notes in Computer Science 2751 (FCT 2003), 2003
LA-UR:03-1158
Preliminary Version
[ [
pdf-file ] © Springer-Verlag
Double Digest Revisited: Complexity and Approximability
in the Presence of Noisy Data
M. Cieliebak, S. Eidenbenz,
G. Woeginger
Lecture Notes in Computer Science 2697 (COCOON 2003), pp. 519 - 527 , 2003
LA-UR:03-0532
[ [
pdf-file ] © Springer-Verlag
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 ALENEX 2003
LA-UR:02-7640
[ [
pdf-file ]
Optimum Inapproximability Results for Finding
Minimum Hidden Guard Sets in Polygons and Terrains
S. Eidenbenz
Lecture Notes in Computer Science 2368 (SWAT 2002), pp. 60 - 68, 2002
[ [
pdf-file ] © Springer-Verlag
An Approximation Algorithm for Minimum Convex Cover with Logarithmic
Performance Guarantee
S. Eidenbenz, P. Widmayer
Lecture Notes in Computer Science 2161 (ESA 2001), pp. 333 343, 2001
[ [
pdf-file ] © Springer-Verlag
Maximum Clique and Minimum Clique Partition in Visibility Graphs
S. Eidenbenz, C. Stamm
Lecture Notes in Computer Science 1872 (IFIP TCS 2000), pp. 200 212, 2000
[ [
pdf-file ] © Springer-Verlag
How Many People Can Hide in a Terrain?
S. Eidenbenz
Lecture Notes in Computer Science 1741 (ISAAC'99), pp. 184 - 194, 1999
[ [
pdf-file ] © Springer-Verlag
Inapproximability Results for Guarding Polygons
without Holes
S. Eidenbenz
Lecture Notes in Computer Science 1533 (ISAAC'98), pp. 427 - 436, 1998
[ [
pdf-file ] © Springer-Verlag
Inapproximability of Some Art Gallery Problems
S. Eidenbenz, C. Stamm,
P. Widmayer
Proceedings 10th Canadian Conference on Computational Geometry, CCCG, 1998
[ [
ps-file ]
A Modified Longest Side Bisection Triangulation
S. Eidenbenz, C. Stamm
Proceedings 10th Canadian Conference on Computational Geometry, CCCG, 1998
[ [
ps-file ]
Positioning Guards at Fixed Height above a Terrain - an Optimum Inapproximability Result
S. Eidenbenz, C. Stamm,
P. Widmayer
Lecture Notes in Computer Science 1461 (ESA'98), 187-198, 1998
[ [
ps-file ] © Springer-Verlag
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
[ [
pdf-file ] © IEEE Computer Society
Editorial
Special issue devoted to the 29th International Colloquium on Automata,
Languages and Programming (ICALP 2002)
Stephan Eidenbenz, Matthew Hennessy, Rafael
Morales , Francisco Triguero, Peter Widmayer, Ricardo Conejo
(Guest editors)
Theoretical Computer Science, 2003 (to appear)
Proceedings ofthe 29th International Colloquium
on Automata, Languages and Programing (ICALP
2002)
Peter Widmayer, Francisco Triguero,
Rafael Morales, Matthew Hennessy, Stephan Eidenbenz,
Ricardo Conejo (Eds.)
Lecture Notes in Computer Science 2380, 2002
© Springer-Verlag
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, pp. 1- 128, North Holland,
30 September 2001
Part 1 (Selected papers from WG99)
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 1665, 1999
© Springer-Verlag
Misc
(In-)Approximability of Visibility Problems on
Polygons and Terrains
S. Eidenbenz
PhD thesis, Diss. ETH No. 13683, 2000
[ [
gzip-file (305 KB) ] [ [
ps-file (1.1 MB) ]
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, 1999
[ [
pdf-file ]
RA3DIO - Wellenausbreitung in 3D
S. Eidenbenz, C. Stamm,
P. Widmayer
Computerworld Schweiz, 1999
[ [
pdf-file ]
Technical Reports
Online Dominating Set and Variations on Restricted Graph Classes
S. Eidenbenz
Technical Report, No. 380, ETH Z, Dept. of Computer Science, 2002
[ [
pdf-file ]
|
