R. Chandrasekaran

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