Refereed Journal Publications Refereed Journal Publications

  1. S. Dobrev, M. Eftekhari, F. MacQuarrie, J. Manuch, O. Morales-Ponce, L. Narayanan, J. Opatrny and L. Stacho, Connectivity with Directional Antennas in the Symmetric Communication Model, Accepted to Comp. Geometry: Theory and Applications, February 2016.
  2. E. Kranakis, M. Eftekhari, D. Krizanc, O. Morales-Ponce, L. Narayanan, J. Opatrny, S. Shende. Distributed Algorithms for Barrier Coverage using Mobile Sensors. Accepted to Distributed Computing, February 2016.
  3. S. Ayoubi, K. Shaban, C. Assi, and L. Narayanan. Multicast Virtual Network Embed- ding in Cloud Data Centers with Delay Constraints. Accepted to IEEE Transactions on Communications, January 2015.
  4. M. Eftekhari, E. Kranakis, F. Macquarrie, O. Morales-Ponce, L. Narayanan. Strong connectivity of sensor networks with double antennae. Accepted to Theoretical Computer Science, February 2015.
  5. Stefan Dobrev; Stephane Durocher; Mohsen Eftekhari; Konstantinos Georgiou; Evangelos Kranakis; Danny Krizanc; Lata Narayanan; Jaroslav Opatrny; Sunil Shende; Jorge Urrutia. Complexity of Barrier Coverage with Relocatable Sensors in the Plane. Accepted to Theoretical Computer Science, February 2015.
  6. S. Dobrev, L. Narayanan, and J. Opatrny. Optimal sensor networks for monitoring a plane using rotating and beam sensors. Accepted to Theory of Computing Systems, 54(4): 622-639, 2014.
  7. A. Ganchev, L. Narayanan and S. Shende. A tight characterization of games that induce unique Nash equilibria. Accepted to Theoretical Computer Science, 481:37-50, 2013.
  8. E. Kranakis, D. Krizanc, I. Lambadaris, L. Narayanan, J. Opatrny. Optimizing Data Throughput in Client/Server Systems by Keeping Queue Sizes Balanced. Discrete Mathematics, Algorithms and Applications (DMAA), Vol. 4, No. 2, 2012.
  9. Stephane Durocher, Krishnam Raju Jampani, Anna Lubiw, and Lata Narayanan. Modelling gateway placement in wireless networks: Geometric k-Centres of unit disc graphs. Computational Geometry: Theory and Applications, 44(5):286-302. 2011.
  10. S. Durocher, E. Kranakis, D. Krizanc, and L. Narayanan. Balancing traffic load using one-turn rectilinear routing. Journal of Interconnection Networks, 10(1-2), pp. 93-120, 2009.
  11. A. Ganchev, L. Narayanan, and S. Shende. Games to induce specified equilibria. Theoretical Computer Science, vol. 409, pp. 341-350, 2008.
  12. S. Durocher, D. Kirkpatrick, and L. Narayanan. On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Networks. To appear in ACM Wireless Networks, 2008.
  13. L. Narayanan and J. Opatrny, Wavelength routing in all-optical rings, in Discrete Optimization, 2005.
  14. L. Barriere, P. Fraignaud, L. Narayanan, and J. Opatrny, Robust position-based routing in wireless ad hoc networks with irregular transmission ranges; Wireless Communications and Mobile Computing Journal , vol. 3/2, pp. 141-153, 2003
  15. Y. Tang and L. Narayanan, Worst case analysis of a dynamic channel assignment strategy ; Discrete Applied Mathematics .
  16. J. Janssen and L. Narayanan, Approximation algorithms for channel assignment with constraints ; Theoretical Computer Science.
  17. L. Narayanan and S. Shende, Static frequency assignment in cellular networks; Algorithmica.
  18. L. Narayanan, J.Opatrny, and D. Sotteau; All-to-all wavelength routing in optimal chordal rings of degree four; to appear in Algorithmica.
  19. J. Janssen, D. Krizanc, L. Narayanan and S. Shende, Distributed online frequency assignment in cellular networks ; in Journal of Algorithms, Vol. 36, pp. 119-151, 2000.
  20. L. Narayanan and J. Opatrny, Compact routing on chordal rings of degree four; Algorithmica, vol. 23, pages 72-96, 1999.
  21. L. Narayanan and S. Shende, Partial characterizations of networks supporting shortest path interval routing schemes; in Networks, Vol. 32(2), pp. 103-118, 1998.
  22. L. Narayanan and N. Nishimura, Interval routing on k-trees; Journal of Algorithms, Vol. 26, pp. 325-369, 1998.
  23. A. Condon and L. Narayanan, Upper and lower bounds for selection on the mesh; Algorithmica, Vol. 30, pp. 1-30, 1998.
  24. D. Krizanc, L. Narayanan, and R. Raman, Fast deterministic selection on mesh-connected processor arrays; Algorithmica vol. 16, pages 319-332, 1996.
  25. D. Krizanc and L. Narayanan, Zero-one sorting on the mesh; Parallel Processing Letters vol. 5, pages 149-155, 1995.

Book Chapters

  1. L. Narayanan, Channel assignment and graph multicoloring ; in Handbook of Wireless Networks and Mobile Computing, John Wiley and Sons, 2001.

  2. L. Narayanan, Randomized algorithms on the mesh; Chapter 4, Advances in Randomized Parallel Computing, pp. 67--84, Kluwer Academic Press, 1999.

Invited Papers

  1. L. Narayanan, Randomized algorithms on the mesh; invited paper for the Workshop on Randomization in Parallel Computation, Springer Verlag LNCS 1388, pp. 408-417, 1998.

Refereed Conference Publications

  1. M. Baskhi, M. Kaddour, B. Jaumard, and L. Narayanan. An efficient method to minimize TDMA frame length in wireless sensor networks. To appear in Proceedings of WCNC 2015.
  2. J. Gagnon and L. Narayanan. Efficient scheduling for Minimum Latency Aggregation in Wireless Sensor Networks. To appear in Proceedings of WCNC 2015.
  3. Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Lata Narayanan, Jarda Opatrny and Birgit Vogtenhuber. Evacuating Robots from a Disk Using Face-to-Face Communication. To appear in Proceedings of CIAC 2015.
  4. J. Gagnon and L. Narayanan. Minimum Latency Aggregation Convergecast in Wire- less Sensor Networks. To appear in Proceedings of Algosensors, 2014.
  5. J. Czyzowicz, E. Kranakis, D. Krizanc, I. Lambadaris, L. Narayanan. Robot-assisted Restoration of Barrier Coverage. To appear in Proceedings of Workshop on Approxi- mation and Online Algorithms (WAOA) 2014, Wroclaw, Poland.
  6. M. Eftekhari, P. Flocchini, L. Narayanan, J. Opatrny and N. Santoro. Distributed Barrier Coverage with Relocatable Sensors. In Proceedings of SIROCCO 2014, LNCS 8576, pages 235-249.
  7. S. Dobrev, M. Eftekhari, F. MacQuarrie, J. Manuch, O. Morales-Ponce, L. Narayanan, J. Opatrny and L. Stacho, Connectivity with Directional Antennas in the Symmetric Communication Model, Proc. of Mexican Conference on Discrete Math. and Comp. Geometry, pp. 89-100, 2013.
  8. M. Eftekhari, L. Narayanan, and J. Opatrny, On Multi-Round Sensor Deployment for Barrier Coverage, Proc. of 10th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE MASS), pp 310-318, 2013.
  9. E. Kranakis, M. Eftekhari, D. Krizanc, O. Morales-Ponce, L. Narayanan, J. Opatrny, S. Shende. Distributed Algorithms for Barrier Coverage using Mobile Sensors. In Proceedings of the ACM Symposium on Principles of Distributed Computing, pages 383-392, 2013.
  10. E. Kranakis, D. Krizanc, O. Morales-Ponce, L. Narayanan, J. Opatrny, S. Shende. Expected Sum and Maximum of Displacement of Random Sensors for Coverage of a Domain. In Proceedings of the ACM Symposium on Parallel Algorithms and Architec- tures, pages 73-82, 2013.
  11. S. Dobrev, S. Durocher, M. Eftekhari , K. Georgiou, E. Kranakis, D. Krizanc, L. Narayanan, J. Opatrny, S. Shende, J. Urrutia. Complexity of Barrier Coverage with Relocatable Sensors in the Plane. In Proceedings of International Conference on Algo- rithms and Complexity, LNCS 7878, pages 170-182, 2013.
  12. M. Jahan and L. Narayanan. Minimum energy broadcast in low duty cycle wireless networks. In Proceedings of IEEE WCNC, pages 980-985, 2013.
  13. L. Harutyunyan and L. Narayanan. Minimum 2-connected distance-k p-dominating set in wireless networks. In Proceedings of IEEE WiMob, pages 1-6, 2012.
  14. M. Eftekhari, E. Kranakis, F. MacQuarrie, O. Morales-Ponce, and L. Narayanan. Strong Connectivity of Sensor Networks with Double Antennae. In Proceedings of SIROCCO, LNCS 7355, pages 99-110, 2012. 5
  15. S. Dobrev, L. Narayanan, and J. Opatrny. Optimal sensor networks for monitoring a plane using rotating and beam sensors. In Proceedings of Fun with Algorithms, LNCS 7288, pages 94-106, 2012.
  16. A. Ganchev and L. Narayanan. Selfishness Detection for backoff algorithms in wireless networks. In Proceedings of STWiMob, 2011
  17. A. Ganchev, L. Narayanan, and C. Assi. Performance evaluation of backoff algorithms for medium access in wireless networks. In Proceedings of ICOST, 2011.
  18. M. Mehrandish, L. Narayanan, J. Opatrny, Minimizing the Number of Sensors Moved on Line Barriers, Proceedings of IEEE WCNC 2011, pp. 1464-1469, 2011
  19. M. Eftekhari Hesari, L. Narayanan, and J. Opatrny, New Routing Algorithms to Balance Traffic Load, Proceedings of IEEE WCNC 2011, pp. 1785-1790, 2011
  20. E. Kranakis, D. Krizanc, I. Lambadaris, L. Narayanan, J. Opatrny. Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations. In proceedings of 4th annual International Conference on Combinatorial Optimization and Applications (COCOA'10). Big Island, Hawaii, Dec 18-20, Springer LNCS.
  21. H. Kassaei, M. Mehran, L. Narayanan, J. Opatrny, Efficient Algorithms for Connected Dominating Sets in Ad Hoc Networks, Proceedings of IEEE Wireless Communications and Networking Conference, 2010
  22. J. Czyzowicz, E. Kranakis, D. Krizanc, I. Lambadaris, L. Narayanan, J. Opatrny, L. Stacho, J. Urrutia and M. Yazdani, On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment, Proceedings of AdhocNow conference, to appear, 2010
  23. M. Eftekhari Hesari, L. Narayanan, and J. Opatrny, On average and maximum load of greedy routing in wireless ad hoc networks Proceedings of WONS 2010, pp. 113-120, 2010.
  24. E. Kranakis, D. Krizanc, L. Narayanan, L. Stacho. Receiver Interference of Random Sensors on a Line. In proceedings of 17th SIROCCO (Colloquium on Structural Information and Communication Complexity) 2010. B. Patt-Shamir, T. Ekim (Eds.), Sirince, Turkey, June 7-11, 2010. LNCS 6058 Springer
  25. M. Keane, E. Kranakis, D. Krizanc, L. Narayanan. Routing on Delay Tolerant Sensor Networks. In proccedings of Algosensors, 5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks, July 11th 2009, Rhodes, Greece, LNCS 5804.
  26. H. Kassaei, M. Mehran, L. Narayanan, J. Opatrny, Local Algorithms for Backbone Formation in Ad Hoc Networks, ACM Proceedings of PE-WASUN conference, to appear, 2009
  27. J. Czyzowicz, E. Kranakis, D. Krizanc, I. Lambadaris, L. Narayanan, J. Opatrny, L. Stacho, J. Urrutia, M. Yazdani. On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. In proceedings of ADHOCNOW, LNCS 5793 pp. 194-212. (8th International Conference on Ad Hoc Networks and Wireless), September 22-25, 2009, Murcia Spain, SVLNCS.
  28. E. Kranakis, D. Krizanc, L. Narayanan, and K. Xu. Inapproximability of the perimeter defense problem . In Proceedings of CCCG 2009. Full version
  29. S. Durocher, E. Kranakis, D. Krizanc, and L. Narayanan. Balancing traffic load using one-turn rectilinear routing. Proceedings of TAMC 2008.
  30. S. Durocher, D. Kirkpatrick, and L. Narayanan. On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Networks. Winner of best paper award. Proceedings of the Ninth International Conference on Distributed Computing and Networking (ICDCN), Springer Lecture Notes in Computer Science, vol. 4904, pages 546-557, January 2008.
  31. S. Mihandoust and L. Narayanan. Multiple Sink Positioning in Wireless Sensor Networks. Proceedings of the Fourth ACM SIGACT-SIGOPS International Workshop on Foundations of Mobile Computing, (DIALM-POMC) June 2007.
  32. A. Ganchev, L, Narayanan, and S. Shende. Mechanisms to Induce RandomChoice. Proceedings of the Second International Workshop on Internet and Network Economics (WINE'06), Springer-Verlag Lecture Notes in Computer Science vol. 4286, pages 124--135, December 2006.
  33. E. Kranakis, D. Krizanc, L. Narayanan, A. Patnaik, and S. Shende. Routing with uncertainty in the position of the destination, Proceedings of the Second IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), 2006.
  34. S. Ansari, L. Narayanan, and J. Opatrny: A generalization of the face routing algorithm to a class of non-planar networks, in Proceedings of Mobiquitous, 2005.
  35. I. T. Haque, S. Fevens, and L. Narayanan: Randomized routing algorithms in mobile ad hoc networks, in Proceedings of Sixth IEEE International Conference on Mobile and Wireless Communication Networks, 2004.
  36. I. T. Haque, S. Fevens, and L. Narayanan: A class of randomized routing algorithms in mobile ad hoc networks, in Proceedings of ASWAN, 2004.
  37. S. Choplin, L. Narayanan, and J. Opatrny; Two-hop virtual path layout in tori; in SIROCCO 2004.
  38. L. Barriere, P. Fraignaud, L. Narayanan, and J. Opatrny; An algorithm for Bluetooth scatternet formation with fixed degree and low diameter; in Proceedings of SODA 2002 .
  39. L. Barriere, P. Fraignaud, L. Narayanan, and J. Opatrny; Robust position-based routing in wireless ad hoc networks with unstable transmission ranges; in Proceedings of the Fifth International Workshop on DialM for Mobility, 2001
  40. L. Narayanan and Y. Tang; Worst-case analysis of a dynamic channel assignment strategy; in Proceedings of The Fourth International Workshop on DIALM for Mobility, pp. 8-17, 2000.
  41. F. Comellas, M. Mitjana, L. Narayanan, and J. Opatrny; in Proceedings of Mathematical Foundations of Computer Science (MFCS2000), Springer Verlag LNCS 1893, pp. 285-294, 2000.
  42. L. Narayanan and J. Opatrny, Wavelength routing in all-optical rings, in Proceedings of ARACNE 2000, Carleton Scientific Press, pp. 203-214, 2000.
  43. J. Janssen and L. Narayanan, Approximation algorithms for channel assignment with constraints; in Proceedings of International Symposium on Algorithms and Computation, Springer-Verlag LNCS, pages 327-336, 1999.
  44. Narayanan and Y. Saintillan, Fair and Efficient Online Admission Control in High-Bandwidth Networks; in Proceedings of GLOBECOMM, pp. 1527-1534, 1999.
  45. L. Narayanan, J.Opatrny, and D. Sotteau; All-to-all wavelength routing in optimal chordal rings of degree four; in Proceedings of Symposium on Discrete Algorithms (SODA 99), pp. 695-703, 1999.
  46. P. de la Torre, L. Narayanan, and D. Peleg, Thy neighbor's interval is greener: A proposal for interval routing; in Proceedings of SIROCCO98 pp. 214-228, 1998.
  47. D. Bremner, J. Bose, M. de Berg, W. Evans, and L. Narayanan, Recovering lines with fixed linear probes; in Proceedings of the Tenth Canadian Conference on Computational Geometry, August 1998.
  48. J. Janssen, D. Krizanc, L. Narayanan and S. Shende, Distributed online frequency assignment in cellular networks; in Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS'98), Springer Verlag LNCS 1373, pp. 3-13, 1998.
  49. L. Narayanan and J. Opatrny, Compact routing in chordal rings; in Proceedings of the Fourth Colloquium on Structural Information and Communication Complexity, pp. 125-137, July 1997.
  50. L. Narayanan and S. Shende, Static frequency assignment in cellular networks; in Proceedings of the Fourth Colloquium on Structural Information and Communication Complexity, pp. 215-227, July 1997.
  51. T. Dachraoui and L. Narayanan, Fast deterministic sorting on large parallel machines; in Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing; October 1996, pages 273-280.
  52. L. Narayanan and N. Nishimura, Interval routing on k-trees; in Proceedings of the Third Colloquium on Structural Information and Communication Complexity, pages 104-118, 1996.
  53. L. Narayanan and S. Shende, Partial characterizations of networks supporting shortest path interval routing schemes; in Proceedings of the Third Colloquium on Structural Information and Communication Complexity, pages 73-87, 1996.
  54. D. Krizanc and L. Narayanan, Sorting and selection on meshes with diagonal connections; in Proceedings of the Canada-France Conference on Parallel Computing. (Vol. 805 of Lecture Notes in Computer Science), pages 121-136, 1994.
  55. A. Condon and L. Narayanan, Upper and lower bounds for selection on the mesh; in the Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, October 1994, pages 497-504.
  56. D. Krizanc and L. Narayanan, Zero-one sorting on the mesh; in Proceedings of the Fifth IEEE Symposium on Parallel and Distributing Processing, October 1993; pages 641-649.
  57. D. Krizanc and L. Narayanan Optimal algorithms for selection on mesh-connected processor arrays; in Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing; pages 70-76; December 1992.
  58. D. Krizanc and L. Narayanan, Multi-packet selection on mesh-connected processor arrays; Proceedings of the International Parallel Processing Symposium; pages 602-605; March 1992.
  59. D. Krizanc, L. Narayanan, and R. Raman, Fast deterministic selection on mesh-connected processor arrays; in Proceedings of the Eleventh Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 560 of Lecture Notes in Computer Science); pages 336-346; December 1991.
  60. D. Krizanc and L. Narayanan, Off-line routing with small queues on mesh-connected processor arrays; in Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing; pages 301-304; December 1991.
  61. C. Kaklamanis, D. Krizanc, L. Narayanan and T. Tsantilas, Randomized sorting and selection on mesh-connected processor arrays; in Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures; pages 17-28; July 1991.

Unpublished Contributions

  1. D. Krizanc, L. Narayanan, and R. Raman A lower bound for sorting on the mesh; Technical Report, Carleton University, School of Computing, 1994.
  2. L. Narayanan, Selection, sorting, and routing on mesh-connected processor arrays; Ph.D. Thesis, University of Rochester (1992); available as University of Rochester TR 433.

File translated from TEX by TTH, version 2.20.
On 28 Oct 2000, 16:13.