Ramaswamy Chandrasekaran
Orcid: 0000-0003-3975-3010Affiliations:
- University of Texas at Dallas, USA
According to our database1,
Ramaswamy Chandrasekaran
authored at least 91 papers
between 1971 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on utdallas.edu
On csauthors.net:
Bibliography
2022
2021
Enhancement of MRI images of hamstring avulsion injury using histogram based techniques.
Multim. Tools Appl., 2021
Proceedings of the Bioengineering and Biomedical Signal and Image Processing, 2021
2020
Algorithms for optimal replica placement under correlated failure in hierarchical failure domains.
Theor. Comput. Sci., 2020
2019
Proceedings of the Frontiers of Combining Systems - 12th International Symposium, 2019
2017
Proceedings of the Computer Science - Theory and Applications, 2017
Proceedings of the Combinatorial Optimization and Applications, 2017
2016
Robust neighbor discovery in multi-hop multi-channel heterogeneous wireless networks.
J. Parallel Distributed Comput., 2016
Heuristics for 2-coverage multi point relay problem in wireless ad hoc and sensor networks.
Proceedings of the 14th International Symposium on Modeling and Optimization in Mobile, 2016
2015
Proceedings of the Combinatorial Optimization and Applications, 2015
2013
2012
Polynomial time solution to minimum forwarding set problem in wireless networks under disk coverage model.
Ad Hoc Networks, 2012
2011
Randomized Distributed Algorithms for Neighbor Discovery in Multi-hop Multi-channel Heterogeneous Wireless Networks.
Proceedings of the 2011 International Conference on Distributed Computing Systems, 2011
Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011
Proceedings of the Ninth Annual Communication Networks and Services Research Conference, 2011
2010
A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks.
Eur. J. Oper. Res., 2010
Fast Neighbor Discovery with Lightweight Termination Detection in Heterogeneous Cognitive Radio Networks.
Proceedings of the Ninth International Symposium on Parallel and Distributed Computing, 2010
2009
A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model.
IEEE Trans. Parallel Distributed Syst., 2009
J. Parallel Distributed Comput., 2009
Proceedings of IEEE International Conference on Communications, 2009
2008
Discret. Appl. Math., 2008
Comput. Networks, 2008
2007
Networks, 2007
Eur. J. Oper. Res., 2007
Discret. Appl. Math., 2007
A Network-flow based Integral Optimal Algorithm for Lexicographic Maximum Lifetime Routing in Wireless Sensor Networks.
Proceedings of the 16th International Conference on Computer Communications and Networks, 2007
Proceedings of the Reaching New Heights. 13th Americas Conference on Information Systems, 2007
2006
Int. J. Pervasive Comput. Commun., 2006
Proceedings of the 2006 International Symposium on a World of Wireless, 2006
Brief Announcement: Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio Networks.
Proceedings of the Distributed Computing, 20th International Symposium, 2006
2005
Time-Efficient Layer-2 Auto-Configuration for Cognitive Radios.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005
Energy efficient sensor, relay and base station placements for coverage, connectivity and routing.
Proceedings of the 24th IEEE International Performance Computing and Communications Conference, 2005
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005
2004
IEEE Trans. Reliab., 2004
Oper. Res., 2004
Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks.
Proceedings of the International Conference on Wireless Networks, 2004
2003
Inf. Process. Lett., 2003
A comparative study of restoration schemes and spare capacity assignments in mesh networks.
Proceedings of the 12th International Conference on Computer Communications and Networks, 2003
Proceedings of the 12th International Conference on Computer Communications and Networks, 2003
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003
Examining IT Usage Across Different Hierarchical Levels in Organizations: A Study of Organizational, Environmental, and IT Factors.
Proceedings of the 9th Americas Conference on Information Systems, 2003
2001
1999
Proceedings of the Twentieth International Conference on Information Systems, 1999
1998
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
1997
A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling".
SIAM J. Comput., 1997
1996
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996
1994
1992
1990
Proceedings of the Polyhedral Combinatorics, 1990
1989
Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem.
Math. Program., 1989
1988
1987
Two counterexamples on the polynomial solvability of the linear complementarity problem.
Math. Program., 1987
The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic.
Oper. Res., 1987
1986
1984
Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games.
Math. Program., 1984
Polynomial testing of the query "IS a<sup>b</sup> ≥ c<sup>d</sup>?" with application to finding a minimal cost reliability ratio spanning tree.
Discret. Appl. Math., 1984
1983
Technical Note - Monotone Optimal Issuing Policies in a Deterministic Inventory Model.
Oper. Res., 1983
1982
Math. Program., 1982
1981
An O(n log<sup>2</sup> n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems.
SIAM J. Comput., 1981
Math. Oper. Res., 1981
1980
SIAM J. Algebraic Discret. Methods, 1980
1978
1977
1971