RESEARCHER PROFILE

Evangelos Kranakis

← Back to Carleton University

E

Carleton University

Complexity and Algorithms in GraphsOptimization and Search ProblemsComputational Geometry and Mesh GenerationRobotic Path Planning AlgorithmsMobile Ad Hoc Networks

Evangelos Kranakis works in Complexity and Algorithms in Graphs, Optimization and Search Problems, Computational Geometry and Mesh Generation, Robotic Path Planning Algorithms, Mobile Ad Hoc Networks. Recorded institutional associations include Carleton University.

591Publications
9,522Citations
44H-index

Inclusion identifies researchers whose recorded research contributions may inform their university’s understanding of its research community. It does not rank individual research quality or establish current employment.

Selected research works

Up to 100 highly cited works; DOI links open the original research. Counts reflect the collected record, not real-time citation totals.

  1. Compass routing on geometric networks.

    1999 · 837 citations
  2. Power consumption in packet radio networks

    2000 · 422 citations
  3. Structural RNA has lower folding energy than random RNA of the same dinucleotide frequency

    2005 · 215 citations
  4. Proceedings of the 8th Canadian Conference on Computational Geometry

    1996 · 207 citations
  5. DETECTION OF TRANSIENT IN RADIO FREQUENCY FINGERPRINTING USING SIGNAL PHASE

    2003 · 205 citations
  6. On the false-positive rate of Bloom filters

    2008 · 178 citations
  7. Enhancing intrusion detection in wireless networks using radio frequency fingerprinting.

    2004 · 169 citations
  8. Approximating the unsatisfiability threshold of random formulas

    1998 · 162 citations
  9. Asynchronous deterministic rendezvous in graphs

    2006 · 160 citations
  10. Mobile agent rendezvous in a ring

    2004 · 142 citations
  11. Tree exploration with little memory

    2004 · 138 citations
  12. Detecting rogue devices in bluetooth networks using radio frequency fingerprinting

    2006 · 117 citations
  13. On interdomain routing security and pretty secure BGP (psBGP)

    2007 · 116 citations
  14. DNS-based Detection of Scanning Worms in an Enterprise Network.

    2005 · 114 citations
  15. Random constraint satisfaction: A more accurate picture

    1997 · 113 citations
  16. Boolean Functions and Computation Models

    2002 · 111 citations
  17. Efficient Routing in Networks with Long Range Contacts

    2001 · 107 citations
  18. Optimal movement of mobile sensors for barrier coverage of a planar region

    2009 · 105 citations
  19. Pretty Secure BGP (psBGP)

    2005 · 103 citations
  20. Primality and Cryptography

    1986 · 94 citations
  21. Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds

    2011 · 91 citations
  22. Detecting Impersonation Attacks in Future Wireless and Mobile Networks

    2006 · 88 citations
  23. Principles of Ad Hoc Networking

    2007 · 88 citations
  24. Multiple Mobile Agent Rendezvous in a Ring

    2004 · 85 citations
  25. On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment

    2009 · 83 citations

← Return to the university profile