The SCEAS System
Navigation Menu

Search the dblp DataBase


Stephan Eidenbenz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Luzi Anderegg, Stephan Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer
    Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:106-118 [Conf]
  2. Stephan Eidenbenz, Christoph Stamm, Peter Widmayer
    Inapproximability of some art gallery problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  3. Christoph Stamm, Stephan Eidenbenz, Renato Pajarola
    A modified longest side bisection triangulation. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  4. Guanhua Yan, Hector D. Flores, Leticia Cuellar, Nicolas Hengartner, Stephan Eidenbenz, Vincent Vu
    Bluetooth worm propagation: mobility pattern matters! [Citation Graph (0, 0)][DBLP]
    ASIACCS, 2007, pp:32-44 [Conf]
  5. Christoph Stamm, Stephan Eidenbenz, Michael Beck, Peter Stucki, Peter Widmayer
    A Prototype System for Light Propagation in Terrains. [Citation Graph (0, 0)][DBLP]
    Computer Graphics International, 1998, pp:103-0 [Conf]
  6. Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger
    Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:519-527 [Conf]
  7. Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
    Equilibria in topology control games for ad hoc networks. [Citation Graph (0, 0)][DBLP]
    DIALM-POMC, 2003, pp:2-11 [Conf]
  8. Stephan Eidenbenz, Christoph Stamm, Peter Widmayer
    Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:187-198 [Conf]
  9. Stephan Eidenbenz, Peter Widmayer
    An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:333-344 [Conf]
  10. Mark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis
    Composing Equipotent Teams. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:98-108 [Conf]
  11. Stephan Eidenbenz, Luzi Anderegg, Roger Wattenhofer
    Incentive-Compatible, Energy-Optimal, and Efficient Ad Hoc Networking in a Selfish Milieu. [Citation Graph (0, 0)][DBLP]
    HICSS, 2007, pp:293- [Conf]
  12. Stephan Eidenbenz, Christoph Stamm
    MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:200-212 [Conf]
  13. Stephan Eidenbenz, Giovanni Resta, Paolo Santi
    COMMIT: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks with Selfish Nodes. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  14. Stephan Eidenbenz
    Inapproximability Results for Guarding Polygons without Holes. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:427-436 [Conf]
  15. Stephan Eidenbenz
    How Many People Can Hide in a Terrain? [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:184-194 [Conf]
  16. Stephan Eidenbenz, Aris Pagourtzis, Peter Widmayer
    Flexible Train Rostering. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:615-624 [Conf]
  17. Mark Cieliebak, Stephan Eidenbenz
    Measurement Errors Make the Partial Digest Problem NP-Hard. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:379-390 [Conf]
  18. Guanhua Yan, Stephan Eidenbenz
    Sluggish Calendar Queues for Network Simulation. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2006, pp:127-136 [Conf]
  19. Luzi Anderegg, Stephan Eidenbenz
    Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 2003, pp:245-259 [Conf]
  20. Weizhao Wang, Xiang-Yang Li, Stephan Eidenbenz, Yu Wang
    OURS: optimal unicast routing systems in non-cooperative wireless networks. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 2006, pp:402-413 [Conf]
  21. Karthikeyan Sundaresan, Weizhao Wang, Stephan Eidenbenz
    Algorithmic aspects of communication in ad-hoc networks with smart antennas. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2006, pp:298-309 [Conf]
  22. Hector D. Flores, Stephan Eidenbenz, Rudolf H. Riedi, Nicolas Hengartner
    Describing MANETS: principal component analysis of sparse mobility traces. [Citation Graph (0, 0)][DBLP]
    PE-WASUN, 2006, pp:123-131 [Conf]
  23. Stephan Eidenbenz, Lukas Kroc, James P. Smith
    Maneuverable Relays to Improve Energy Efficiency in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    PerCom Workshops, 2005, pp:411-417 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    SAC, 2005, pp:1166-1173 [Conf]
  25. Stephan Eidenbenz
    Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:60-68 [Conf]
  26. Mark Cieliebak, Stephan Eidenbenz, Paolo Penna
    Noisy Data Make the Partial Digest Problem NP-hard. [Citation Graph (0, 0)][DBLP]
    WABI, 2003, pp:111-123 [Conf]
  27. Stephan Eidenbenz
    Los Alamos communication network simulation. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 2005, pp:23- [Conf]
  28. 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. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 2006, pp:2132-2139 [Conf]
  29. Stephan Eidenbenz, Christoph Stamm, Peter Widmayer
    Inapproximability Results for Guarding Polygons and Terrains. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:1, pp:79-113 [Journal]
  30. Stephan Eidenbenz
    Inapproximability of finding maximum hidden sets on polygons and terrains. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:21, n:3, pp:139-153 [Journal]
  31. Stephan Eidenbenz
    Finding minimum hidden guard sets in polygons - tight approximability results. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:2, pp:49-57 [Journal]
  32. Stephan Eidenbenz
    Approximation algorithms for terrain guarding. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:82, n:2, pp:99-105 [Journal]
  33. Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger
    Complexity and Approximability of Double Digest. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2005, v:3, n:2, pp:207-224 [Journal]
  34. Christopher L. Barrett, Stephan Eidenbenz, Lukas Kroc, Madhav V. Marathe, James P. Smith
    Parametric Probabilistic Routing in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    MONET, 2005, v:10, n:4, pp:529-544 [Journal]
  35. Stephan Eidenbenz, V. Anil Kumar, Sibylle Zust
    Equilibria in Topology Control Games for Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    MONET, 2006, v:11, n:2, pp:143-159 [Journal]
  36. Stephan Eidenbenz, Peter Widmayer
    An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:3, pp:654-670 [Journal]
  37. Mark Cieliebak, Stephan Eidenbenz, Paolo Penna
    Partial Digest is hard to solve for erroneous input data. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:3, pp:361-381 [Journal]
  38. Stephan Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:1, pp:1-2 [Journal]
  39. Guanhua Yan, Stephan Eidenbenz
    Bluetooth Worms: Models, Dynamics, and Defense Implications. [Citation Graph (0, 0)][DBLP]
    ACSAC, 2006, pp:245-256 [Conf]
  40. Guanhua Yan, Stephan Eidenbenz
    Modeling Propagation Dynamics of Bluetooth Worms. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2007, pp:42- [Conf]
  41. Matt S. Nassr, Jangeun Jun, Stephan Eidenbenz, Anders A. Hansson, Angela M. Mielke
    Scalable and Reliable Sensor Network Routing: Performance Study from Field Deployment. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:670-678 [Conf]

  42. Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol. [Citation Graph (, )][DBLP]

  43. On the effectiveness of structural detection and defense against P2P-based botnets. [Citation Graph (, )][DBLP]

  44. Blue-Watchdog: Detecting Bluetooth worm propagation in public areas. [Citation Graph (, )][DBLP]

  45. Designing systems for large-scale, discrete-event simulations: Experiences with the FastTrans parallel microsimulator. [Citation Graph (, )][DBLP]

  46. Preventing Bandwidth Abuse at the Router through Sending Rate Estimate-Based Active Queue Management. [Citation Graph (, )][DBLP]

  47. Link Positions Matter: A Noncommutative Routing Metric for Wireless Mesh Network. [Citation Graph (, )][DBLP]

  48. Detecting Selfish Exploitation of Carrier Sensing in 802.11 Networks. [Citation Graph (, )][DBLP]

  49. Dynamic Balancing of Packet Filtering Workloads on Distributed Firewalls. [Citation Graph (, )][DBLP]

  50. Revisiting minimum cost reliable routing in wireless mesh networks. [Citation Graph (, )][DBLP]

  51. FairCast: fair multi-media streaming in ad hoc networks through local congestion control. [Citation Graph (, )][DBLP]

  52. Light-Weight Control of Non-responsive Traffic with Low Buffer Requirements. [Citation Graph (, )][DBLP]

  53. DDoS Mitigation in Non-cooperative Environments. [Citation Graph (, )][DBLP]

  54. Catching Instant Messaging Worms with Change-Point Detection Techniques. [Citation Graph (, )][DBLP]

  55. SMS-Watchdog: Profiling Social Behaviors of SMS Users for Anomaly Detection. [Citation Graph (, )][DBLP]

  56. Accelerating Traffic Microsimulations: A Parallel Discrete-event Queue-based Approach for Speed and Scale. [Citation Graph (, )][DBLP]

  57. SessionSim: Activity-Based Session Generation for Network Simulation. [Citation Graph (, )][DBLP]

  58. Low Overhead Router-Based Congestion Control Techniques to Protect Responsive Traffic. [Citation Graph (, )][DBLP]

  59. On the Impact of Realism of Mobility Models for Wireless Networks. [Citation Graph (, )][DBLP]

  60. Parametric probabilistic sensor network routing. [Citation Graph (, )][DBLP]

  61. Mobi-watchdog: you can steal, but you can't run! [Citation Graph (, )][DBLP]

  62. ActivitySim: large-scale agent-based activity generation for infrastructure simulation. [Citation Graph (, )][DBLP]

  63. Large-scale telephone network simulation: discrete event vs. steady state. [Citation Graph (, )][DBLP]

  64. The Optimum Number of OSPF Areas for MANETs. [Citation Graph (, )][DBLP]

  65. COBRA - A Multi-path Adaptive Local Load Sensing Routing Protocol for Wireless Sensor Networks. [Citation Graph (, )][DBLP]

  66. Lattice routing: A 4D routing scheme for multiradio multichannel ad hoc networks. [Citation Graph (, )][DBLP]

  67. Criticality analysis of Internet infrastructure. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.005secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002