| 2008 |
| 44 | EE | Stephane Durocher,
Krishnam Raju Jampani,
Anna Lubiw,
Lata Narayanan:
Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs.
DIALM-POMC 2008: 79-86 |
| 43 | EE | Stephane Durocher,
David G. Kirkpatrick,
Lata Narayanan:
On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks.
ICDCN 2008: 546-557 |
| 42 | EE | Stephane Durocher,
Evangelos Kranakis,
Danny Krizanc,
Lata Narayanan:
Balancing Traffic Load Using One-Turn Rectilinear Routing.
TAMC 2008: 467-478 |
| 41 | EE | Antoniy Ganchev,
Lata Narayanan,
Sunil M. Shende:
Games to induce specified equilibria.
Theor. Comput. Sci. 409(3): 341-350 (2008) |
| 2007 |
| 40 | | Shahab Mihandoust,
Lata Narayanan:
Multiple Sink Positioning in Sensor Networks.
DIALM-POMC 2007 |
| 2006 |
| 39 | EE | Antoniy Ganchev,
Lata Narayanan,
Sunil M. Shende:
Mechanisms to Induce Random Choice.
WINE 2006: 124-135 |
| 2005 |
| 38 | EE | Sabeel Ansari,
Lata Narayanan,
Jaroslav Opatrny:
A Generalization of the Face Routing.
MobiQuitous 2005: 213-224 |
| 37 | EE | Lata Narayanan,
Jaroslav Opatrny:
Wavelength routing of uniform instances in all-optical rings.
Discrete Optimization 2(4): 335-347 (2005) |
| 2004 |
| 36 | EE | Thomas Fevens,
Israat Tanzeena Haque,
Lata Narayanan:
Randomized Routing Algorithms in Mobile Ad Hoc Networks.
MWCN 2004: 347-357 |
| 35 | EE | Sébastien Choplin,
Lata Narayanan,
Jaroslav Opatrny:
Two-Hop Virtual Path Layout in Tori.
SIROCCO 2004: 69-78 |
| 34 | EE | Lata Narayanan,
Yihui Tang:
Worst-case analysis of a dynamic channel assignment strategy.
Discrete Applied Mathematics 140(1-3): 115-141 (2004) |
| 2003 |
| 33 | EE | Lali Barrière,
Pierre Fraigniaud,
Lata Narayanan,
Jaroslav Opatrny:
Dynamic construction of Bluetooth scatternets of fixed degree and low diameter.
SODA 2003: 781-790 |
| 32 | EE | Lali Barrière,
Pierre Fraigniaud,
Lata Narayanan,
Jaroslav Opatrny:
Robust position-based routing in wireless ad hoc networks with irregular transmission ranges.
Wireless Communications and Mobile Computing 3(2): 141-153 (2003) |
| 2002 |
| 31 | EE | Lata Narayanan,
Sunil M. Shende:
Corrigendum: Static Frequency Assignment in Cellular Networks.
Algorithmica 32(4): 679 (2002) |
| 2001 |
| 30 | EE | Lali Barrière,
Pierre Fraigniaud,
Lata Narayanan:
Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges.
DIAL-M 2001: 19-27 |
| 29 | EE | Lata Narayanan,
Sunil M. Shende:
Static Frequency Assignment in Cellular Networks.
Algorithmica 29(3): 396-409 (2001) |
| 28 | EE | Lata Narayanan,
Jaroslav Opatrny,
Dominique Sotteau:
All-to-All Optical Routing in Chordal Rings of Degree 4.
Algorithmica 31(2): 155-178 (2001) |
| 27 | EE | Jeannette Janssen,
Lata Narayanan:
Approximation algorithms for channel assignment with constraints.
Theor. Comput. Sci. 262(1): 649-667 (2001) |
| 2000 |
| 26 | EE | Lata Narayanan,
Yihui Tang:
Worst-case analysis of a dynamic channel assignment strategy.
DIAL-M 2000: 8-17 |
| 25 | | Lata Narayanan,
Jaroslav Opatrny:
Wavelength Routing of Uniform Instances in Optical Rings.
ICALP Satellite Workshops 2000: 203-214 |
| 24 | EE | Francesc Comellas,
Margarida Mitjana,
Lata Narayanan,
Jaroslav Opatrny:
Optical Routing of Uniform Instances in Tori.
MFCS 2000: 285-294 |
| 23 | | Jeannette Janssen,
Danny Krizanc,
Lata Narayanan,
Sunil M. Shende:
Distributed Online Frequency Assignment in Cellular Networks.
J. Algorithms 36(2): 119-151 (2000) |
| 1999 |
| 22 | EE | Jeannette Janssen,
Lata Narayanan:
Approximation Algorithms for Channel Assignment with Constraints.
ISAAC 1999: 327-336 |
| 21 | EE | Lata Narayanan,
Jaroslav Opatrny,
Dominique Sotteau:
All-to-All Optical Routing in Optimal Chordal Rings of Degree Four.
SODA 1999: 695-703 |
| 20 | EE | Lata Narayanan,
Jaroslav Opatrny:
Compact Routing on Chordal Rings of Degree 4.
Algorithmica 23(1): 72-96 (1999) |
| 1998 |
| 19 | EE | Mark de Berg,
Prosenjit Bose,
David Bremner,
William S. Evans,
Lata Narayanan:
Recovering lines with fixed linear probes.
CCCG 1998 |
| 18 | | Lata Narayanan:
Randomized Algorithms on the Mesh.
IPPS/SPDP Workshops 1998: 408-417 |
| 17 | | Pilar de la Torre,
Lata Narayanan,
David Peleg:
Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper).
SIROCCO 1998: 214-228 |
| 16 | | Jeannette Janssen,
Danny Krizanc,
Lata Narayanan,
Sunil M. Shende:
Distributed Online Frequency Assignment in Cellular Networks.
STACS 1998: 3-13 |
| 15 | | Anne Condon,
Lata Narayanan:
Upper and Lower Bounds for Selection in the Mesh.
Algorithmica 20(1): 1-30 (1998) |
| 14 | | Lata Narayanan,
Naomi Nishimura:
Interval Routing on k-Trees.
J. Algorithms 26(2): 325-369 (1998) |
| 13 | EE | Lata Narayanan,
Sunil M. Shende:
Partial characterizations of networks supporting shortest path interval labeling schemes.
Networks 32(2): 103-113 (1998) |
| 1997 |
| 12 | | Lata Narayanan,
Jaroslav Opatrny:
Compact Routing on Chordal Rings.
SIROCCO 1997: 125-137 |
| 11 | | Lata Narayanan,
Sunil M. Shende:
Static Frequency Assignment in Cellular Networks.
SIROCCO 1997: 215-227 |
| 1996 |
| 10 | | Lata Narayanan,
Naomi Nishimura:
Interval Routing on k-trees.
SIROCCO 1996: 104-118 |
| 9 | | Lata Narayanan,
Sunil M. Shende:
Characterization of Networks Supporting Shortest-Path Interval Labeling Schemes.
SIROCCO 1996: 73-87 |
| 8 | | Danny Krizanc,
Lata Narayanan,
Rajeev Raman:
Fast Deterministic Selection on Mesh-Connected Processor Arrays.
Algorithmica 15(4): 319-331 (1996) |
| 1995 |
| 7 | | Danny Krizanc,
Lata Narayanan:
Zero-One Sorting on the Mesh.
Parallel Processing Letters 5: 149-155 (1995) |
| 1994 |
| 6 | | Danny Krizanc,
Lata Narayanan:
Sorting and Selection on Arrays with Diagonal Connections.
Canada-France Conference on Parallel and Distributed Computing 1994: 121-136 |
| 1993 |
| 5 | | Danny Krizanc,
Lata Narayanan:
Zero-One Sorting on the Mesh.
SPDP 1993: 641-649 |
| 1992 |
| 4 | | Danny Krizanc,
Lata Narayanan:
Multipacket Selection on Mesh-Connected Processor Arrays.
IPPS 1992: 602-605 |
| 3 | | Danny Krizanc,
Lata Narayanan:
Optimal Algorithms for Selection on a Mesh-Connected Processor Array.
SPDP 1992: 70-76 |
| 1991 |
| 2 | | Danny Krizanc,
Lata Narayanan,
Rajeev Raman:
Fast Deterministic Selection on Mesh-Connected Processor Arrays.
FSTTCS 1991: 336-346 |
| 1 | EE | Christos Kaklamanis,
Danny Krizanc,
Lata Narayanan,
Thanasis Tsantilas:
Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version).
SPAA 1991: 17-28 |