R. Chandrasekaran

Publication Activity (10 Years)

Years Active: 1971-2022
Publications (10 Years): 12

Top Topics

Provably Correct

Advanced Database

Top Venues

Theor. Comput. Sci.

Discret. Optim.

Publications

Piotr Wojciechowski, K. Subramani, R. Chandrasekaran
Analyzing Read-Once Cutting Plane Proofs in Horn Systems. J. Autom. Reason. 66 (2) (2022)
T. R. Thamizhvani, K. F. Tanveer Ahmed, R. J. Hemalatha, A. Josephin Arockia Dhivya, R. Chandrasekaran
Enhancement of MRI images of hamstring avulsion injury using histogram based techniques. Multim. Tools Appl. 80 (8) (2021)
R. Chandrasekaran, S. Vijayaraj, G. R. Jothilakshmi
Investigation of Gastroparesis Using Multichannel Electro Gastro Gram - A Study. BIOMESIP (2021)
K. Alex Mills, R. Chandrasekaran, Neeraj Mittal
Algorithms for optimal replica placement under correlated failure in hierarchical failure domains. Theor. Comput. Sci. 809 (2020)
Piotr J. Wojciechowski, R. Chandrasekaran, K. Subramani
Analyzing fractional Horn constraint systems. Theor. Comput. Sci. 844 (2020)
Hans Kleine Büning, Piotr J. Wojciechowski, R. Chandrasekaran, K. Subramani
Restricted Cutting Plane Proofs in Horn Constraint Systems. FroCos (2019)
K. Alex Mills, R. Chandrasekaran, Neeraj Mittal
Lexico-Minimum Replica Placement in Multitrees. COCOA (2) (2017)
K. Alex Mills, R. Chandrasekaran, Neeraj Mittal
Lexico-minimum Replica Placement in Multitrees. CoRR (2017)
Yanyan Zeng, K. Alex Mills, Shreyas Gokhale, Neeraj Mittal, S. Venkatesan, R. Chandrasekaran
Robust neighbor discovery in multi-hop multi-channel heterogeneous wireless networks. J. Parallel Distributed Comput. 92 (2016)
K. Alex Mills, R. Chandrasekaran, Neeraj Mittal
Algorithms for Replica Placement in High-Availability Storage. CoRR (2015)
R. Chandrasekaran
Integer Farkas Lemma. IGTR 17 (1) (2015)
K. Alex Mills, R. Chandrasekaran, Neeraj Mittal
On Replica Placement in High-Availability Storage Under Correlated Failure. COCOA (2015)
R. Chandrasekaran, K. Subramani
A combinatorial algorithm for Horn programs. Discret. Optim. 10 (2) (2013)
Mehmet Baysan, Kamil Saraç, R. Chandrasekaran
Polynomial time solution to minimum forwarding set problem in wireless networks under disk coverage model. Ad Hoc Networks 10 (7) (2012)
Chanaka Liyana Arachchige, S. Venkatesan, R. Chandrasekaran, Neeraj Mittal
Minimal Time Broadcasting in Cognitive Radio Networks. ICDCN (2011)
Suhel Patel, Kamil Saraç, R. Chandrasekaran, Turgay Korkmaz, Neeraj Mittal
Relay Assignment in AMT-Based Multicast Content Distribution. CNSR (2011)
R. Chandrasekaran, Milind Dawande, Mehmet Baysan
On a labeling problem in graphs. Discret. Appl. Math. 159 (8) (2011)
Neeraj Mittal, Yanyan Zeng, S. Venkatesan, R. Chandrasekaran
Randomized Distributed Algorithms for Neighbor Discovery in Multi-hop Multi-channel Heterogeneous Wireless Networks. ICDCS (2011)
R. Chandrasekaran
Santosh Narayan Kabadi 1956-2010. Algorithmic Oper. Res. 5 (2) (2010)
Yanyan Zeng, Neeraj Mittal, S. Venkatesan, R. Chandrasekaran
Fast Neighbor Discovery with Lightweight Termination Detection in Heterogeneous Cognitive Radio Networks. ISPDC (2010)
R. Chandrasekaran, K. Subramani
A Combinatorial Algorithm for Horn Programs. ISAAC (2009)
Mehmet Baysan, Kamil Saraç, R. Chandrasekaran, Sergey Bereg
A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model. IEEE Trans. Parallel Distributed Syst. 20 (7) (2009)
Neeraj Mittal, Srinivasan Krishnamurthy, R. Chandrasekaran, Subbarayan Venkatesan, Yanyan Zeng
On neighbor discovery in cognitive radio networks. J. Parallel Distributed Comput. 69 (7) (2009)
Santosh N. Kabadi, R. Chandrasekaran, K. P. K. Nair
2-Commodity Integer Network Synthesis Problem. Algorithmic Oper. Res. 4 (2) (2009)
R. Chandrasekaran, Milind Dawande
Structural analysis of a fractional matching problem. Discret. Appl. Math. 157 (18) (2009)
Maulin Patel, S. Venkatesan, R. Chandrasekaran
A Network-flow based Integral Optimal Algorithm for Lexicographic Maximum Lifetime Routing in Wireless Sensor Networks. ICCCN (2007)
Young U. Ryu, R. Chandrasekaran, Varghese S. Jacob
Breast cancer prediction using the isotonic separation technique. Eur. J. Oper. Res. 181 (2) (2007)
Donglei Du, R. Chandrasekaran
-hardness with two-arc destruction. Networks 50 (3) (2007)
R. Chandrasekaran, Ahmed Tayeh, Vaishali Nagoore
Understanding Information System Outsourcing Failure: Lessons from a Case Study. AMCIS (2007)
Donglei Du, R. Chandrasekaran
The multiroute maximum flow problem revisited. Networks 47 (2) (2006)
Srinivasan Krishnamurthy, R. Chandrasekaran, Neeraj Mittal, Subbarayan Venkatesan
Brief Announcement: Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio Networks. DISC (2006)
Maulin Patel, S. Venkatesan, R. Chandrasekaran
Energy-efficient capacity-constrained routing in wireless sensor networks. Int. J. Pervasive Comput. Commun. 2 (2) (2006)
Mansi Ramakrishnan Thoppian, Subbarayan Venkatesan, Ravi Prakash, R. Chandrasekaran
MAC-Layer Scheduling in Cognitive Radio based Multi-Hop Wireless Networks. WOWMOM (2006)
Maulin Patel, R. Chandrasekaran, S. Venkatesan
Energy efficient sensor, relay and base station placements for coverage, connectivity and routing. IPCCC (2005)
Young U. Ryu, R. Chandrasekaran, Varghese S. Jacob
Prognosis Using an Isotonic Prediction Technique. Manag. Sci. 50 (6) (2004)
R. Chandrasekaran, Kunhiraman Nair, Yash P. Aneja, Santosh N. Kabadi
Multi-terminal multipath flows: synthesis. Discret. Appl. Math. 143 (1-3) (2004)
Maulin Patel, R. Chandrasekaran, S. Venkatesan
Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks. International Conference on Wireless Networks (2004)
Yash P. Aneja, R. Chandrasekaran, K. P. K. Nair
Minimal-cost system reliability with discrete-choice sets for components. IEEE Trans. Reliab. 53 (1) (2004)
Chei Lee, R. Chandrasekaran, Darrin Thomas
Examining IT Usage Across Different Hierarchical Levels in Organizations: A Study of Organizational, Environmental, and IT Factors. AMCIS (2003)
Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair
Parametric analysis of overall min-cuts and applications in undirected networks. Inf. Process. Lett. 85 (2) (2003)
John F. Rudin III, R. Chandrasekaran
Improved Bounds for the Online Scheduling Problem. SIAM J. Comput. 32 (3) (2003)
Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair
Parametric Min-cuts Analysis in a Network. Discret. Appl. Math. 127 (3) (2003)
Srinivasan Krishnamurthy, R. Chandrasekaran, S. Venkatesan, Milind Dawande
Highly efficient spare capacity planning for generalized link restoration. ICCCN (2003)
Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair
Maximizing residual flow under an arc destruction. Networks 38 (4) (2001)
R. Chandrasekaran, Santosh N. Kabadi, R. Sridhar
Integer Solution for Linear Complementarity Problem. Math. Oper. Res. 23 (2) (1998)
R. Chandrasekaran, Bo Chen, Gábor Galambos, P. R. Narayanan, André van Vliet
A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling". SIAM J. Comput. 26 (3) (1997)
Sambhavi Lakshminarayanan, R. Chandrasekaran
A rounding algorithm for integer programs. Discret. Appl. Math. 50 (3) (1994)
S. Sridhar, R. Chandrasekaran
Integer Solution to Synthesis of Communication Networks. Math. Oper. Res. 17 (3) (1992)
S. Sridhar, R. Chandrasekaran
Integer Solution to Synthesis of Communication Networks. IPCO (1990)
R. Chandrasekaran, Arie Tamir
Algebraic Optimization: The Fermat-Weber Location Problem. Math. Program. 46 (1990)
R. Chandrasekaran, Santosh N. Kabadi
Pseudomatroids. Discret. Math. 71 (3) (1988)
R. Chandrasekaran, Jong-Shi Pang, Richard E. Stone
Two counterexamples on the polynomial solvability of the linear complementarity problem. Math. Program. 39 (1) (1987)
Robert D. Plante, Timothy J. Lowe, R. Chandrasekaran
The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic. Oper. Res. 35 (5) (1987)
R. Chandrasekaran
Recognition of Gilmore-Gomory traveling salesman problem. Discret. Appl. Math. 14 (3) (1986)
R. Chandrasekaran, S. Shirali
Total weak unimodularity: testing and applications. Discret. Math. 51 (2) (1984)
R. Chandrasekaran, Arie Tamir
Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games. Math. Program. 30 (3) (1984)
Rick P. Millane, J. K. Walker, S. Arnott, R. Chandrasekaran, D. L. Birdsall, R. L. Ratliff
Structure of a pleiomeric form of poly d(AT): poly d(AT). Nucleic Acids Res. 12 (13) (1984)
Gift Siromoney, R. Chandrasekaran, M. Chandrasekaran
Machine recognition of Brahmi script. IEEE Trans. Syst. Man Cybern. 13 (4) (1983)
R. Chandrasekaran
Technical Note - Monotone Optimal Issuing Policies in a Deterministic Inventory Model. Oper. Res. 31 (3) (1983)
R. Chandrasekaran, Santosh N. Kabadi, Katta G. Murty
Some NP-complete problems in linear programming. Oper. Res. Lett. 1 (3) (1982)
R. Chandrasekaran
The weighted euclidean 1-center problem. Oper. Res. Lett. 1 (3) (1982)
R. Chandrasekaran, Arie Tamir
-centers on a tree. Math. Program. 22 (1) (1982)
Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran
n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. SIAM J. Comput. 10 (2) (1981)
R. Chandrasekaran, A. Daughety
-Dispersion Problems. Math. Oper. Res. 6 (1) (1981)
V. Aggarwal, R. Chandrasekaran, K. P. K. Nair
Discounted Stochastic Ratio Games. SIAM J. Algebraic Discret. Methods 1 (2) (1980)
Gift Siromoney, R. Chandrasekaran, M. Chandrasekaran
Computer recognition of printed Tamil characters. Pattern Recognit. 10 (4) (1978)
R. Chandrasekaran, S. Subba Rao
Technical Note - A Special Case of the Transportation Problem. Oper. Res. 25 (3) (1977)
R. Chandrasekaran
Minimal ratio spanning trees. Networks 7 (4) (1977)
David A. Kohler, R. Chandrasekaran
A Class of Sequential Games. Oper. Res. 19 (2) (1971)