A Class of Sequential Games. - David A. Kohler; R. Chandrasekaran (Oper. Res., 1971)

Technical Note - A Special Case of the Transportation Problem. - R. Chandrasekaran; S. Subba Rao (Oper. Res., 1977)

Minimal ratio spanning trees. - R. Chandrasekaran (Networks, 1977)

Computer recognition of printed Tamil characters. - Gift Siromoney; R. Chandrasekaran; M. Chandrasekaran (Pattern Recognit., 1978)

Discounted Stochastic Ratio Games. - V. Aggarwal; R. Chandrasekaran; K. P. K. Nair (SIAM J. Algebraic Discret. Methods, 1980)

An O ((nlog p)2) Algorithm for the Continuous p-Center Problem on a Tree. - Ramaswamy Chandrasekaran; Arie Tamir (SIAM J. Algebraic Discret. Methods, 1980)

Location on Tree Networks: P-Centre and n-Dispersion Problems. - R. Chandrasekaran; A. Daughety (Math. Oper. Res., 1981)

An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. - Nimrod Megiddo; Arie Tamir; Eitan Zemel; R. Chandrasekaran (SIAM J. Comput., 1981)

Polynomially bounded algorithms for locating p-centers on a tree. - R. Chandrasekaran; Arie Tamir (Math. Program., 1982)

The weighted euclidean 1-center problem. - R. Chandrasekaran (Oper. Res. Lett., 1982)

Some NP-complete problems in linear programming. - R. Chandrasekaran; Santosh N. Kabadi; Katta G. Murty (Oper. Res. Lett., 1982)

Technical Note - Monotone Optimal Issuing Policies in a Deterministic Inventory Model. - R. Chandrasekaran (Oper. Res., 1983)

Computer dating of medieval inscriptions: South Indian Tamil. - Ramaswamy Chandrasekaran; M. Chandrasekaran; Gift Siromoney (Comput. Humanit., 1983)

Machine recognition of Brahmi script. - Gift Siromoney; R. Chandrasekaran; M. Chandrasekaran (IEEE Trans. Syst. Man Cybern., 1983)

Polynomial testing of the query "IS ab ≥ cd?" with application to finding a minimal cost reliability ratio spanning tree. - Ramaswamy Chandrasekaran; Arie Tamir (Discret. Appl. Math., 1984)

Total weak unimodularity: testing and applications. - R. Chandrasekaran; S. Shirali (Discret. Math., 1984)

Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games. - R. Chandrasekaran; Arie Tamir (Math. Program., 1984)

Structure of a pleiomeric form of poly d(AT): poly d(AT). - Rick P. Millane; J. K. Walker; S. Arnott; R. Chandrasekaran; D. L. Birdsall; R. L. Ratliff (Nucleic Acids Res., 1984)

Recognition of Gilmore-Gomory traveling salesman problem. - R. Chandrasekaran (Discret. Appl. Math., 1986)

The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic. - Robert D. Plante; Timothy J. Lowe; R. Chandrasekaran (Oper. Res., 1987)

Two counterexamples on the polynomial solvability of the linear complementarity problem. - R. Chandrasekaran; Jong-Shi Pang; Richard E. Stone (Math. Program., 1987)

Pseudomatroids. - R. Chandrasekaran; Santosh N. Kabadi (Discret. Math., 1988)

Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem. - Ramaswamy Chandrasekaran; Arie Tamir (Math. Program., 1989)

Solvable Classes of Generalized Traveling Salesman Polytope. - Santosh N. Kabadi; Ramaswamy Chandrasekaran (Polyhedral Combinatorics, 1990)

On totally dual integral systems. - Santosh N. Kabadi; Ramaswamy Chandrasekaran (Discret. Appl. Math., 1990)

Algebraic Optimization: The Fermat-Weber Location Problem. - R. Chandrasekaran; Arie Tamir (Math. Program., 1990)

Integer Solution to Synthesis of Communication Networks. - S. Sridhar; R. Chandrasekaran (Math. Oper. Res., 1992)

A rounding algorithm for integer programs. - Sambhavi Lakshminarayanan; R. Chandrasekaran (Discret. Appl. Math., 1994)

Finding the Set of All Minimal Nested Convex Polygons. - Joy Bhadury; Ramaswamy Chandrasekaran (CCCG, 1996)

Art Gallery Problems for Convex Nested Polygons. - Joy Bhadury; V. Chandru; A. Maheshwari; Ramaswamy Chandrasekaran (INFORMS J. Comput., 1997)

A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling". - R. Chandrasekaran; Bo Chen 002; Gábor Galambos; P. R. Narayanan; André van Vliet (SIAM J. Comput., 1997)

Constructing median constrained minimum spanning tree. - Joy Bhadury; Ramaswamy Chandrasekaran; Laxmi P. Gewali (CCCG, 1998)

Integer Solution for Linear Complementarity Problem. - R. Chandrasekaran; Santosh N. Kabadi; R. Sridhar (Math. Oper. Res., 1998)

Filtering objectionable internet content. - Varghese S. Jacob; Ramayya Krishnan; Young U. Ryu; Ramaswamy Chandrasekaran; Sungchul Hong (ICIS, 1999)

Maximizing residual flow under an arc destruction. - Yash P. Aneja; R. Chandrasekaran; Kunhiraman Nair (Networks, 2001)

Examining IT Usage Across Different Hierarchical Levels in Organizations: A Study of Organizational, Environmental, and IT Factors. - Chei Lee; R. Chandrasekaran; Darrin Thomas (AMCIS, 2003)

Network Design Subject to Facility Location. - Laxmi P. Gewali; Joy Bhadury; Ramaswamy Chandrasekaran (CCCG, 2003)

Highly efficient spare capacity planning for generalized link restoration. - Srinivasan Krishnamurthy; R. Chandrasekaran; S. Venkatesan 001; Milind Dawande (ICCCN, 2003)

A comparative study of restoration schemes and spare capacity assignments in mesh networks. - Maulin Patel; Ramaswamy Chandrasekaran; Subbarayan Venkatesan (ICCCN, 2003)

Parametric Min-cuts Analysis in a Network. - Yash P. Aneja; R. Chandrasekaran; Kunhiraman Nair (Discret. Appl. Math., 2003)

Parametric analysis of overall min-cuts and applications in undirected networks. - Yash P. Aneja; R. Chandrasekaran; Kunhiraman Nair (Inf. Process. Lett., 2003)

Improved Bounds for the Online Scheduling Problem. - John F. Rudin III; R. Chandrasekaran (SIAM J. Comput., 2003)

Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks. - Maulin Patel; R. Chandrasekaran; S. Venkatesan 001 (International Conference on Wireless Networks, 2004)

Multi-terminal multipath flows: synthesis. - R. Chandrasekaran; Kunhiraman Nair; Yash P. Aneja; Santosh N. Kabadi (Discret. Appl. Math., 2004)

Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot. - Chelliah Sriskandarajah; Inna G. Drobouchevitch; Suresh P. Sethi; Ramaswamy Chandrasekaran (Oper. Res., 2004)

Prognosis Using an Isotonic Prediction Technique. - Young U. Ryu; R. Chandrasekaran; Varghese S. Jacob (Manag. Sci., 2004)

Minimal-cost system reliability with discrete-choice sets for components. - Yash P. Aneja; R. Chandrasekaran; K. P. K. Nair (IEEE Trans. Reliab., 2004)

Cutting Out Polygons. - Ramaswamy Chandrasekaran; Ovidiu Daescu; Jun Luo 008 (CCCG, 2005)

Energy efficient sensor, relay and base station placements for coverage, connectivity and routing. - Maulin Patel; R. Chandrasekaran; S. Venkatesan 001 (IPCCC, 2005)

Time-Efficient Layer-2 Auto-Configuration for Cognitive Radios. - Srinivasan Krishnamurthy; Mansi Ramakrishnan Thoppian; Srikant Kuppa; Subbarayan Venkatesan; Ramaswamy Chandrasekaran; Neeraj Mittal; Ravi Prakash 001 (IASTED PDCS, 2005)

Multiroute flows: Cut-trees and realizability. - Santosh N. Kabadi; Ramaswamy Chandrasekaran; K. P. K. Nair (Discret. Optim., 2005)

Isotonic Separation. - Ramaswamy Chandrasekaran; Young U. Ryu; Varghese S. Jacob; Sungchul Hong (INFORMS J. Comput., 2005)

Brief Announcement: Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio Networks. - Srinivasan Krishnamurthy; R. Chandrasekaran; Neeraj Mittal; Subbarayan Venkatesan (DISC, 2006)

MAC-Layer Scheduling in Cognitive Radio based Multi-Hop Wireless Networks. - Mansi Ramakrishnan Thoppian; Subbarayan Venkatesan; Ravi Prakash 001; R. Chandrasekaran (WOWMOM, 2006)

Energy-efficient capacity-constrained routing in wireless sensor networks. - Maulin Patel; S. Venkatesan 001; R. Chandrasekaran (Int. J. Pervasive Comput. Commun., 2006)

The multiroute maximum flow problem revisited. - Donglei Du; R. Chandrasekaran (Networks, 2006)

Understanding Information System Outsourcing Failure: Lessons from a Case Study. - R. Chandrasekaran; Ahmed Tayeh; Vaishali Nagoore (AMCIS, 2007)

A Network-flow based Integral Optimal Algorithm for Lexicographic Maximum Lifetime Routing in Wireless Sensor Networks. - Maulin Patel; S. Venkatesan 001; R. Chandrasekaran (ICCCN, 2007)

Flows over edge-disjoint mixed multipaths and applications. - Yash P. Aneja; Ramaswamy Chandrasekaran; Santosh N. Kabadi; K. P. K. Nair (Discret. Appl. Math., 2007)

Breast cancer prediction using the isotonic separation technique. - Young U. Ryu; R. Chandrasekaran; Varghese S. Jacob (Eur. J. Oper. Res., 2007)

The maximum residual flow problem: NP-hardness with two-arc destruction. - Donglei Du; R. Chandrasekaran (Networks, 2007)

Time-efficient distributed layer-2 auto-configuration for cognitive radio networks. - Srinivasan Krishnamurthy; Mansi Ramakrishnan Thoppian; Srikant Kuppa; Ramaswamy Chandrasekaran; Neeraj Mittal; Subbarayan Venkatesan; Ravi Prakash 001 (Comput. Networks, 2008)

Integer version of the multipath flow network synthesis problem. - Santosh N. Kabadi; Ramaswamy Chandrasekaran; K. P. K. Nair; Yash P. Aneja (Discret. Appl. Math., 2008)

Improved quasi-path restoration in mesh networks. - Maulin Patel; Ramaswamy Chandrasekaran; Subbarayan Venkatesan (IEEE/ACM Trans. Netw., 2008)

Minimum Energy Strong Bidirectional Topology for Ad Hoc Wireless Sensor Networks. - Yash P. Aneja; Ataul Bari; Arunita Jaekel; Ramaswamy Chandrasekaran; K. P. K. Nair (ICC, 2009)

2-Commodity Integer Network Synthesis Problem. - Santosh N. Kabadi; R. Chandrasekaran; K. P. K. Nair (Algorithmic Oper. Res., 2009)

Structural analysis of a fractional matching problem. - R. Chandrasekaran; Milind Dawande (Discret. Appl. Math., 2009)

On neighbor discovery in cognitive radio networks. - Neeraj Mittal; Srinivasan Krishnamurthy; R. Chandrasekaran; Subbarayan Venkatesan; Yanyan Zeng (J. Parallel Distributed Comput., 2009)

A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model. - Mehmet Baysan; Kamil Saraç; R. Chandrasekaran; Sergey Bereg (IEEE Trans. Parallel Distributed Syst., 2009)

Fast Neighbor Discovery with Lightweight Termination Detection in Heterogeneous Cognitive Radio Networks. - Yanyan Zeng; Neeraj Mittal; S. Venkatesan 001; R. Chandrasekaran (ISPDC, 2010)

Santosh Narayan Kabadi 1956-2010. - R. Chandrasekaran (Algorithmic Oper. Res., 2010)

A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks. - Yash P. Aneja; Ramaswamy Chandrasekaran; Xiangyong Li; K. P. K. Nair (Eur. J. Oper. Res., 2010)

Relay Assignment in AMT-Based Multicast Content Distribution. - Suhel Patel; Kamil Saraç; R. Chandrasekaran; Turgay Korkmaz; Neeraj Mittal (CNSR, 2011)

Minimal Time Broadcasting in Cognitive Radio Networks. - Chanaka Liyana Arachchige; S. Venkatesan 001; R. Chandrasekaran; Neeraj Mittal (ICDCN, 2011)

Randomized Distributed Algorithms for Neighbor Discovery in Multi-hop Multi-channel Heterogeneous Wireless Networks. - Neeraj Mittal; Yanyan Zeng; S. Venkatesan 001; R. Chandrasekaran (ICDCS, 2011)

On a labeling problem in graphs. - R. Chandrasekaran; Milind Dawande; Mehmet Baysan (Discret. Appl. Math., 2011)

Polynomial time solution to minimum forwarding set problem in wireless networks under disk coverage model. - Mehmet Baysan; Kamil Saraç; R. Chandrasekaran (Ad Hoc Networks, 2012)

A combinatorial algorithm for Horn programs. - R. Chandrasekaran; K. Subramani 001 (Discret. Optim., 2013)

On Replica Placement in High-Availability Storage Under Correlated Failure. - K. Alex Mills; R. Chandrasekaran; Neeraj Mittal (COCOA, 2015)

Algorithms for Replica Placement in High-Availability Storage. - K. Alex Mills; R. Chandrasekaran; Neeraj Mittal (CoRR, 2015)

Integer Farkas Lemma. - R. Chandrasekaran (IGTR, 2015)

Heuristics for 2-coverage multi point relay problem in wireless ad hoc and sensor networks. - Partha De; Kamil Saraç; Ramaswamy Chandrasekaran (WiOpt, 2016)

Robust neighbor discovery in multi-hop multi-channel heterogeneous wireless networks. - Yanyan Zeng; K. Alex Mills; Shreyas Gokhale; Neeraj Mittal; S. Venkatesan 001; R. Chandrasekaran (J. Parallel Distributed Comput., 2016)

Lexico-Minimum Replica Placement in Multitrees. - K. Alex Mills; R. Chandrasekaran; Neeraj Mittal (COCOA (2), 2017)

On a Generalization of Horn Constraint Systems. - Piotr Wojciechowski 002; Ramaswamy Chandrasekaran; K. Subramani 001 (CSR, 2017)

Restricted Cutting Plane Proofs in Horn Constraint Systems. - Hans Kleine Büning; Piotr Wojciechowski 002; R. Chandrasekaran; K. Subramani 001 (FroCos, 2019)

Algorithms for optimal replica placement under correlated failure in hierarchical failure domains. - K. Alex Mills; R. Chandrasekaran; Neeraj Mittal (Theor. Comput. Sci., 2020)

Analyzing fractional Horn constraint systems. - Piotr Wojciechowski 002; R. Chandrasekaran; K. Subramani 001 (Theor. Comput. Sci., 2020)

Investigation of Gastroparesis Using Multichannel Electro Gastro Gram - A Study. - R. Chandrasekaran; S. Vijayaraj; G. R. Jothilakshmi (BIOMESIP, 2021)

Enhancement of MRI images of hamstring avulsion injury using histogram based techniques. - T. R. Thamizhvani; K. F. Tanveer Ahmed; R. J. Hemalatha; A. Josephin Arockia Dhivya; R. Chandrasekaran (Multim. Tools Appl., 2021)

Analyzing Read-Once Cutting Plane Proofs in Horn Systems. - Piotr Wojciechowski 002; K. Subramani 001; R. Chandrasekaran (J. Autom. Reason., 2022)