dblp.uni-trier.dewww.uni-trier.de

Lata Narayanan Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
46EEJurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani: On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. ADHOC-NOW 2009: 194-212
2008
45EEStephane 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
44EEStephane Durocher, David G. Kirkpatrick, Lata Narayanan: On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks. ICDCN 2008: 546-557
43EEStephane Durocher, Evangelos Kranakis, Danny Krizanc, Lata Narayanan: Balancing Traffic Load Using One-Turn Rectilinear Routing. TAMC 2008: 467-478
42EEAntoniy Ganchev, Lata Narayanan, Sunil M. Shende: Games to induce specified equilibria. Theor. Comput. Sci. 409(3): 341-350 (2008)
2007
41 Shahab Mihandoust, Lata Narayanan: Multiple Sink Positioning in Sensor Networks. DIALM-POMC 2007
2006
40EEAntoniy Ganchev, Lata Narayanan, Sunil M. Shende: Mechanisms to Induce Random Choice. WINE 2006: 124-135
2005
39EESabeel Ansari, Lata Narayanan, Jaroslav Opatrny: A Generalization of the Face Routing. MobiQuitous 2005: 213-224
38EELata Narayanan, Jaroslav Opatrny: Wavelength routing of uniform instances in all-optical rings. Discrete Optimization 2(4): 335-347 (2005)
2004
37EEThomas Fevens, Israat Tanzeena Haque, Lata Narayanan: Randomized Routing Algorithms in Mobile Ad Hoc Networks. MWCN 2004: 347-357
36EESébastien Choplin, Lata Narayanan, Jaroslav Opatrny: Two-Hop Virtual Path Layout in Tori. SIROCCO 2004: 69-78
35EELata Narayanan, Yihui Tang: Worst-case analysis of a dynamic channel assignment strategy. Discrete Applied Mathematics 140(1-3): 115-141 (2004)
2003
34EELali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny: Dynamic construction of Bluetooth scatternets of fixed degree and low diameter. SODA 2003: 781-790
33EELali 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
32EELata Narayanan, Sunil M. Shende: Corrigendum: Static Frequency Assignment in Cellular Networks. Algorithmica 32(4): 679 (2002)
2001
31EELali Barrière, Pierre Fraigniaud, Lata Narayanan: Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges. DIAL-M 2001: 19-27
30EELata Narayanan, Sunil M. Shende: Static Frequency Assignment in Cellular Networks. Algorithmica 29(3): 396-409 (2001)
29EELata Narayanan, Jaroslav Opatrny, Dominique Sotteau: All-to-All Optical Routing in Chordal Rings of Degree 4. Algorithmica 31(2): 155-178 (2001)
28EEJeannette Janssen, Lata Narayanan: Approximation algorithms for channel assignment with constraints. Theor. Comput. Sci. 262(1): 649-667 (2001)
2000
27EELata Narayanan, Yihui Tang: Worst-case analysis of a dynamic channel assignment strategy. DIAL-M 2000: 8-17
26 Lata Narayanan, Jaroslav Opatrny: Wavelength Routing of Uniform Instances in Optical Rings. ICALP Satellite Workshops 2000: 203-214
25EEFrancesc Comellas, Margarida Mitjana, Lata Narayanan, Jaroslav Opatrny: Optical Routing of Uniform Instances in Tori. MFCS 2000: 285-294
24 Jeannette Janssen, Danny Krizanc, Lata Narayanan, Sunil M. Shende: Distributed Online Frequency Assignment in Cellular Networks. J. Algorithms 36(2): 119-151 (2000)
1999
23EEJeannette Janssen, Lata Narayanan: Approximation Algorithms for Channel Assignment with Constraints. ISAAC 1999: 327-336
22EELata Narayanan, Jaroslav Opatrny, Dominique Sotteau: All-to-All Optical Routing in Optimal Chordal Rings of Degree Four. SODA 1999: 695-703
21EELata Narayanan, Jaroslav Opatrny: Compact Routing on Chordal Rings of Degree 4. Algorithmica 23(1): 72-96 (1999)
1998
20EEMark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan: Recovering lines with fixed linear probes. CCCG 1998
19 Lata Narayanan: Randomized Algorithms on the Mesh. IPPS/SPDP Workshops 1998: 408-417
18 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
17EEJeannette Janssen, Danny Krizanc, Lata Narayanan, Sunil M. Shende: Distributed Online Frequency Assignment in Cellular Networks. STACS 1998: 3-13
16 Anne Condon, Lata Narayanan: Upper and Lower Bounds for Selection in the Mesh. Algorithmica 20(1): 1-30 (1998)
15 Lata Narayanan, Naomi Nishimura: Interval Routing on k-Trees. J. Algorithms 26(2): 325-369 (1998)
14EELata Narayanan, Sunil M. Shende: Partial characterizations of networks supporting shortest path interval labeling schemes. Networks 32(2): 103-113 (1998)
1997
13 Lata Narayanan, Jaroslav Opatrny: Compact Routing on Chordal Rings. SIROCCO 1997: 125-137
12 Lata Narayanan, Sunil M. Shende: Static Frequency Assignment in Cellular Networks. SIROCCO 1997: 215-227
1996
11 Lata Narayanan, Naomi Nishimura: Interval Routing on k-trees. SIROCCO 1996: 104-118
10 Lata Narayanan, Sunil M. Shende: Characterization of Networks Supporting Shortest-Path Interval Labeling Schemes. SIROCCO 1996: 73-87
9 Danny Krizanc, Lata Narayanan, Rajeev Raman: Fast Deterministic Selection on Mesh-Connected Processor Arrays. Algorithmica 15(4): 319-331 (1996)
1995
8 Danny Krizanc, Lata Narayanan: Zero-One Sorting on the Mesh. Parallel Processing Letters 5: 149-155 (1995)
1994
7 Danny Krizanc, Lata Narayanan: Sorting and Selection on Arrays with Diagonal Connections. Canada-France Conference on Parallel and Distributed Computing 1994: 121-136
1993
6 Danny Krizanc, Lata Narayanan: Zero-One Sorting on the Mesh. SPDP 1993: 641-649
1992
5 Danny Krizanc, Lata Narayanan: Multipacket Selection on Mesh-Connected Processor Arrays. IPPS 1992: 602-605
4 Danny Krizanc, Lata Narayanan: Optimal Algorithms for Selection on a Mesh-Connected Processor Array. SPDP 1992: 70-76
1991
3EEDanny Krizanc, Lata Narayanan, Rajeev Raman: Fast Deterministic Selection on Mesh-Connected Processor Arrays. FSTTCS 1991: 336-346
2EEChristos Kaklamanis, Danny Krizanc, Lata Narayanan, Thanasis Tsantilas: Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version). SPAA 1991: 17-28
1EEDanny Krizanc, Lata Narayanan: Off-line routing with small queues on a mesh-connected processor array. SPDP 1991: 301-304

Coauthor Index

1Sabeel Ansari [39]
2Lali Barrière [31] [33] [34]
3Mark de Berg [20]
4Prosenjit Bose [20]
5David Bremner [20]
6Sébastien Choplin [36]
7Francesc Comellas [25]
8Anne Condon [16]
9Jurek Czyzowicz [46]
10Stephane Durocher [43] [44] [45]
11William S. Evans [20]
12Thomas Fevens [37]
13Pierre Fraigniaud [31] [33] [34]
14Antoniy Ganchev [40] [42]
15Israat Tanzeena Haque [37]
16Krishnam Raju Jampani [45]
17Jeannette C. M. Janssen (Jeannette Janssen) [17] [23] [24] [28]
18Christos Kaklamanis [2]
19David G. Kirkpatrick [44]
20Evangelos Kranakis [43] [46]
21Danny Krizanc [1] [2] [3] [4] [5] [6] [7] [8] [9] [17] [24] [43] [46]
22Ioannis Lambadaris [46]
23Anna Lubiw [45]
24Shahab Mihandoust [41]
25Margarida Mitjana [25]
26Naomi Nishimura [11] [15]
27Jaroslav Opatrny [13] [21] [22] [25] [26] [29] [33] [34] [36] [38] [39] [46]
28David Peleg [18]
29Rajeev Raman [3] [9]
30Sunil M. Shende [10] [12] [14] [17] [24] [30] [32] [40] [42]
31Dominique Sotteau [22] [29]
32Ladislav Stacho [46]
33Yihui Tang [27] [35]
34Pilar de la Torre [18]
35Thanasis Tsantilas [2]
36Jorge Urrutia [46]
37Mohammadreza Yazdani [46]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)