Refereed Journal Publications

1. S. Durocher, E. Kranakis, D. Krizanc, and L. Narayanan. Balancing traffic load using one-turn rectilinear routing. To appear in Journal of Interconnection Networks, 2009.
2. A. Ganchev, L. Narayanan, and S. Shende. Games to induce specified equilibria. Theoretical Computer Science, to appear, 2008.
3. 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.
4. L. Narayanan and J. Opatrny, Wavelength routing in all-optical rings, in Discrete Optimization, 2005.
5. 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
6. Y. Tang and L. Narayanan, Worst case analysis of a dynamic channel assignment strategy ; Discrete Applied Mathematics .
7. J. Janssen and L. Narayanan, Approximation algorithms for channel assignment with constraints ; Theoretical Computer Science.
8. L. Narayanan and S. Shende, Static frequency assignment in cellular networks; Algorithmica.
9. L. Narayanan, J.Opatrny, and D. Sotteau; All-to-all wavelength routing in optimal chordal rings of degree four; to appear in Algorithmica.
10. 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.
11. L. Narayanan and J. Opatrny, Compact routing on chordal rings of degree four; Algorithmica, vol. 23, pages 72-96, 1999.
12. L. Narayanan and S. Shende, Partial characterizations of networks supporting shortest path interval routing schemes; in Networks, Vol. 32(2), pp. 103-118, 1998.
13. L. Narayanan and N. Nishimura, Interval routing on k-trees; Journal of Algorithms, Vol. 26, pp. 325-369, 1998.
14. A. Condon and L. Narayanan, Upper and lower bounds for selection on the mesh; Algorithmica, Vol. 30, pp. 1-30, 1998.
15. D. Krizanc, L. Narayanan, and R. Raman, Fast deterministic selection on mesh-connected processor arrays; Algorithmica vol. 16, pages 319-332, 1996.
16. 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. 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.
2. E. Kranakis, D. Krizanc, L. Narayanan, and K. Xu. Inapproximability of the perimeter defense problem . In Proceedings of CCCG 2009. Full version
3. S. Durocher, E. Kranakis, D. Krizanc, and L. Narayanan. Balancing traffic load using one-turn rectilinear routing. Proceedings of TAMC 2008.
4. 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.
5. 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.
6. 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.
7. 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.
8. 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.
9. 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.
10. I. T. Haque, S. Fevens, and L. Narayanan: A class of randomized routing algorithms in mobile ad hoc networks, in Proceedings of ASWAN, 2004.
11. S. Choplin, L. Narayanan, and J. Opatrny; Two-hop virtual path layout in tori; in SIROCCO 2004.
12. 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 .
13. 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
14. 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.
15. 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.
16. L. Narayanan and J. Opatrny, Wavelength routing in all-optical rings, in Proceedings of ARACNE 2000, Carleton Scientific Press, pp. 203-214, 2000.
17. 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.
18. Narayanan and Y. Saintillan, Fair and Efficient Online Admission Control in High-Bandwidth Networks; in Proceedings of GLOBECOMM, pp. 1527-1534, 1999.
19. 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.
20. 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.
21. 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.
22. 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.
23. 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.
24. 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.
25. 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.
26. 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.
27. 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.
28. 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.
29. 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.
30. 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.
31. 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.
32. 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.
33. 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.
34. 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.
35. 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.