Lata Narayanan

Orcid: 0000-0002-3875-0371

Affiliations:
  • Concordia University, Montreal, Canada


According to our database1, Lata Narayanan authored at least 115 papers between 1991 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Exploration of High-Dimensional Grids by Finite State Machines.
Algorithmica, May, 2024

The En Route Truck-Drone Delivery Problem.
CoRR, 2024

Renting Servers in the Cloud: Parameterized Analysis of FirstFit.
Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

2023
Diversity-seeking Jump Games in Networks.
CoRR, 2023

Diversity-Seeking Jump Games in Networks.
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

Topology Discovery in Autonomic Networks.
Proceedings of the NOMS 2023, 2023

2021
On synchronization and orientation in distributed barrier coverage with relocatable sensors.
Theor. Comput. Sci., 2021

Time-energy tradeoffs for evacuation by two robots in the wireless model.
Theor. Comput. Sci., 2021

Search on a Line by Byzantine Robots.
Int. J. Found. Comput. Sci., 2021

Renting Servers in the Cloud: The Case of Equal Duration Jobs.
CoRR, 2021

The Bike Sharing Problem.
Proceedings of the WALCOM: Algorithms and Computation, 2021

Graph Exploration by Energy-Sharing Mobile Agents.
Proceedings of the Structural Information and Communication Complexity, 2021

Group Evacuation on a Line by Agents with Different Communication Abilities.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Timetable-based Routing in Fixed Schedule Dynamic Networks.
Proceedings of the 30th International Conference on Computer Communications and Networks, 2021

2020
How to choose friends strategically.
Theor. Comput. Sci., 2020

Priority evacuation from a disk: The case of <i>n</i> ≥ 4.
Theor. Comput. Sci., 2020

Priority evacuation from a disk: The case of <i>n</i> = 1, 2, 3.
Theor. Comput. Sci., 2020

Whom to befriend to influence people.
Theor. Comput. Sci., 2020

Evacuating Robots from a Disk Using Face-to-Face Communication.
Discret. Math. Theor. Comput. Sci., 2020

Optimal online and offline algorithms for robot-assisted restoration of barrier coverage.
Discret. Appl. Math., 2020

Evacuating equilateral triangles and squares in the face-to-face model.
Comput. Geom., 2020

Weak Coverage of a Rectangular Barrier.
Algorithmica, 2020

2019
Search on a line with faulty robots.
Distributed Comput., 2019

Distributed Pattern Formation in a Ring.
Proceedings of the Structural Information and Communication Complexity, 2019

Exploration of High-Dimensional Grids by Finite Automata.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Energy Consumption of Group Search on a Line.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Evacuation of Equilateral Triangles by Mobile Agents of Limited Communication Range.
Proceedings of the Algorithms for Sensor Systems, 2019

2018
Optimum ConvergeCast Scheduling in Wireless Sensor Networks.
IEEE Trans. Commun., 2018

Priority Evacuation from a Disk Using Mobile Robots.
CoRR, 2018

Priority Evacuation from a Disk Using Mobile Robots - (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2018

Satisfying Neighbor Preferences on a Circle.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

God Save the Queen.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Editing Graphs to Satisfy Diversity Requirements.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
Optimal aggregated ConvergeCast scheduling with an SINR interference model.
Proceedings of the 13th IEEE International Conference on Wireless and Mobile Computing, 2017

Optimal Local Buffer Management for Information Gathering with Adversarial Traffic.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Evacuating an Equilateral Triangle in the Face-to-Face Model.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

True ConvergeCast scheduling in Wireless Sensor Networks.
Proceedings of the 2017 International Conference on Computing, 2017

Weak Coverage of a Rectangular Barrier.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Linear Search with Terrain-Dependent Speeds.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Community Detection in Evolving Networks.
Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017

2016
Strong connectivity of sensor networks with double antennae.
Theor. Comput. Sci., 2016

Optimal Polynomial Time Algorithm for Restoring Multicast Cloud Services.
IEEE Commun. Lett., 2016

Distributed algorithms for barrier coverage using relocatable sensors.
Distributed Comput., 2016

Connectivity with directional antennas in the symmetric communication model.
Comput. Geom., 2016

Whom to Befriend to Influence People.
Proceedings of the Structural Information and Communication Complexity, 2016

On TDMA scheduling in wireless sensor networks.
Proceedings of the 2016 IEEE Canadian Conference on Electrical and Computer Engineering, 2016

2015
Complexity of barrier coverage with relocatable sensors in the plane.
Theor. Comput. Sci., 2015

MINTED: Multicast VIrtual NeTwork Embedding in Cloud Data Centers With Delay Constraints.
IEEE Trans. Commun., 2015

Efficient scheduling for minimum latency aggregation in wireless sensor networks.
Proceedings of the 2015 IEEE Wireless Communications and Networking Conference, 2015

An efficient method to minimize TDMA frame length in wireless sensor networks.
Proceedings of the 2015 IEEE Wireless Communications and Networking Conference, 2015

Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract).
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Wireless Autonomous Robot Evacuation from Equilateral Triangles and Squares.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 14th International Conference, 2015

2014
Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors.
Theory Comput. Syst., 2014

Distributed Barrier Coverage with Relocatable Sensors.
Proceedings of the Structural Information and Communication Complexity, 2014

Minimum Latency Aggregation Scheduling in Wireless Sensor Networks.
Proceedings of the Algorithms for Sensor Systems, 2014

2013
A tight characterization of strategic games with a unique equilibrium.
Theor. Comput. Sci., 2013

Minimum energy broadcast in duty cycled wireless sensor networks.
Proceedings of the 2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013

Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstract.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

On Multi-round Sensor Deployment for Barrier Coverage.
Proceedings of the IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems, 2013

2012
Optimizing Data Throughput in Client/Server Systems by keeping Queue Sizes Balanced.
Discret. Math. Algorithms Appl., 2012

Minimum 2-connected distance-k p-dominating set in wireless sensor networks.
Proceedings of the 8th IEEE International Conference on Wireless and Mobile Computing, 2012

2011
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs.
Comput. Geom., 2011

Selfishness detection for backoff algorithms in wireless networks.
Proceedings of the IEEE 7th International Conference on Wireless and Mobile Computing, 2011

Minimizing the number of sensors moved on line barriers.
Proceedings of the 2011 IEEE Wireless Communications and Networking Conference, 2011

New routing algorithms to balance traffic load.
Proceedings of the 2011 IEEE Wireless Communications and Networking Conference, 2011

2010
On routing with guaranteed delivery in three-dimensional ad hoc wireless networks.
Wirel. Networks, 2010

A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model
CoRR, 2010

A new algorithm for backbone formation in ad hoc wireless networks of nodes with different transmission ranges.
Proceedings of the IEEE 6th International Conference on Wireless and Mobile Computing, 2010

Efficient Algorithms for Connected Dominating Sets in Ad Hoc Networks.
Proceedings of the 2010 IEEE Wireless Communications and Networking Conference, 2010

Maximum Interference of Random Sensors on a Line.
Proceedings of the Structural Information and Communication Complexity, 2010

Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations.
Proceedings of the Combinatorial Optimization and Applications, 2010

On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment.
Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 9th International Conference, 2010

2009
Balancing Traffic Load Using One-Turn Rectilinear Routing.
J. Interconnect. Networks, 2009

A new local algorithm for backbone formation in ad hoc networks.
Proceedings of the 6th ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, 2009

A tight characterization of strategic games with a unique equlibrium.
Proceedings of the 1st International Conference on Game Theory for Networks, 2009

Inapproximability of the Perimeter Defense Problem.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Routing on Delay Tolerant Sensor Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment.
Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, 2009

2008
Games to induce specified equilibria.
Theor. Comput. Sci., 2008

2007
Multiple Sink Positioning in Sensor Networks.
Proceedings of the DIALM-POMC International Workshop on Foundations of Mobile Computing, 2007

2006
Mechanisms to Induce Random Choice.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Routing with uncertainty in the position of the destination.
Proceedings of the 2006 IEEE International Conference on Wireless and Mobile Computing, 2006

2005
Wavelength routing of uniform instances in all-optical rings.
Discret. Optim., 2005

A Generalization of the Face Routing Algorithm to a Class of Non-Planar Networks.
Proceedings of the 2nd Annual International Conference on Mobile and Ubiquitous Systems (MobiQuitous 2005), 2005

2004
Worst-case analysis of a dynamic channel assignment strategy.
Discret. Appl. Math., 2004

Two-Hop Virtual Path Layout in Tori.
Proceedings of the Structural Information and Communication Complexity, 2004

Randomized Routing Algorithms in Mobile Ad Hoc Networks.
Proceedings of the Mobile and Wireless Communication Networks, 2004

2003
Robust position-based routing in wireless ad hoc networks with irregular transmission ranges.
Wirel. Commun. Mob. Comput., 2003

Dynamic construction of Bluetooth scatternets of fixed degree and low diameter.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
Corrigendum: Static Frequency Assignment in Cellular Networks.
Algorithmica, 2002

2001
Approximation algorithms for channel assignment with constraints.
Theor. Comput. Sci., 2001

Static Frequency Assignment in Cellular Networks.
Algorithmica, 2001

All-to-All Optical Routing in Chordal Rings of Degree 4.
Algorithmica, 2001

Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges.
Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

2000
Distributed Online Frequency Assignment in Cellular Networks.
J. Algorithms, 2000

Optical Routing of Uniform Instances in Tori.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Wavelength Routing of Uniform Instances in Optical Rings.
Proceedings of the ICALP Workshops 2000, 2000

1999
Compact Routing on Chordal Rings of Degree 4.
Algorithmica, 1999

All-to-All Optical Routing in Optimal Chordal Rings of Degree Four.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Partial characterizations of networks supporting shortest path interval labeling schemes.
Networks, 1998

Interval Routing on <i>k</i>-Trees.
J. Algorithms, 1998

Upper and Lower Bounds for Selection in the Mesh.
Algorithmica, 1998

Thy Neighbor's Interval is Greener: A Proposal for Exploiting Interval Routing Schemes (Position paper).
Proceedings of the SIROCCO'98, 1998

Randomized Algorithms on the Mesh.
Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998

Recovering lines with fixed linear probes.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Compact Routing on Chordal Rings.
Proceedings of the SIROCCO'97, 1997

1996
Fast Deterministic Selection on Mesh-Connected Processor Arrays.
Algorithmica, 1996

Fast deterministic sorting on large parallel machines.
Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996

Characterization of Networks Supporting Shortest-Path Interval Labeling Schemes.
Proceedings of the SIROCCO'96, 1996

1995
Zero-One Sorting on the Mesh.
Parallel Process. Lett., 1995

1994
Sorting and Selection on Arrays with Diagonal Connections.
Proceedings of the Parallel and Distributed Computing, 1994

1992
Optimal Algorithms for Selection on a Mesh-Connected Processor Array.
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

Multipacket Selection on Mesh-Connected Processor Arrays.
Proceedings of the 6th International Parallel Processing Symposium, 1992

1991
Off-line routing with small queues on a mesh-connected processor array.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version).
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991


  Loading...