R. Chandrasekaran - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 67 from 67

2022

Analyzing Read-Once Cutting Plane Proofs in Horn SystemsPiotr J. Wojciechowski, K. Subramani, R. Chandrasekaran. JAR, 66(2):239-274, 2022. [doi]

2021

Investigation of Gastroparesis Using Multichannel Electro Gastro Gram - A StudyR. Chandrasekaran, S. Vijayaraj, G. R. Jothilakshmi. biomesip 2021: 121-129 [doi]

Enhancement of MRI images of hamstring avulsion injury using histogram based techniquesT. R. Thamizhvani, K. F. Tanveer Ahmed, R. J. Hemalatha, A. Josephin Arockia Dhivya, R. Chandrasekaran. mta, 80(8):12117-12134, 2021. [doi]

2020

Algorithms for optimal replica placement under correlated failure in hierarchical failure domainsK. Alex Mills, R. Chandrasekaran, Neeraj Mittal. TCS, 809:482-518, 2020. [doi]

Analyzing fractional Horn constraint systemsPiotr J. Wojciechowski, R. Chandrasekaran, K. Subramani. TCS, 844:142-153, 2020. [doi]

2019

Restricted Cutting Plane Proofs in Horn Constraint SystemsHans Kleine Büning, Piotr J. Wojciechowski, R. Chandrasekaran, K. Subramani. frocos 2019: 149-164 [doi]

2017

Lexico-Minimum Replica Placement in MultitreesK. Alex Mills, R. Chandrasekaran, Neeraj Mittal. cocoa 2017: 122-137 [doi]

2016

Robust neighbor discovery in multi-hop multi-channel heterogeneous wireless networksYanyan Zeng, K. Alex Mills, Shreyas Gokhale, Neeraj Mittal, S. Venkatesan, R. Chandrasekaran. jpdc, 92:15-34, 2016. [doi]

2015

Integer Farkas LemmaR. Chandrasekaran. igtr, 17(1), 2015. [doi]

On Replica Placement in High-Availability Storage Under Correlated FailureK. Alex Mills, R. Chandrasekaran, Neeraj Mittal. cocoa 2015: 348-363 [doi]

2013

A combinatorial algorithm for Horn programsR. Chandrasekaran, K. Subramani. disopt, 10(2):85-101, 2013. [doi]

2012

Polynomial time solution to minimum forwarding set problem in wireless networks under disk coverage modelMehmet Baysan, Kamil Saraç, R. Chandrasekaran. adhoc, 10(7):1253-1266, 2012. [doi]

2011

2010

Santosh Narayan Kabadi 1956-2010R. Chandrasekaran. aor, 5(2), 2010. [doi]

Fast Neighbor Discovery with Lightweight Termination Detection in Heterogeneous Cognitive Radio NetworksYanyan Zeng, Neeraj Mittal, S. Venkatesan, R. Chandrasekaran. ispdc 2010: 149-156 [doi]

2009

2007

2006

2005

Energy efficient sensor, relay and base station placements for coverage, connectivity and routingMaulin Patel, R. Chandrasekaran, S. Venkatesan. ipccc 2005: 581-586 [doi]

2004

2003

2001

Maximizing residual flow under an arc destructionYash P. Aneja, R. Chandrasekaran, Kunhiraman Nair. networks, 38(4):194-198, 2001. [doi]

1998

Integer Solution for Linear Complementarity ProblemR. Chandrasekaran, Santosh N. Kabadi, R. Sridhar. mor, 23(2):390-402, 1998. [doi]

1997

A Note on An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham s List Scheduling R. Chandrasekaran, Bo Chen, Gábor Galambos, P. R. Narayanan, André van Vliet. SICOMP, 26(3):870-872, 1997.

1994

A rounding algorithm for integer programsSambhavi Lakshminarayanan, R. Chandrasekaran. DAM, 50(3):267-282, 1994.

1992

Integer Solution to Synthesis of Communication NetworksS. Sridhar, R. Chandrasekaran. mor, 17(3):581-585, 1992. [doi]

1990

Algebraic Optimization: The Fermat-Weber Location ProblemR. Chandrasekaran, Arie Tamir. mp, 46:219-224, 1990.

Integer Solution to Synthesis of Communication NetworksS. Sridhar, R. Chandrasekaran. ipco 1990: 467-483

1988

PseudomatroidsR. Chandrasekaran, Santosh N. Kabadi. DM, 71(3):205-217, 1988. [doi]

1987

Two counterexamples on the polynomial solvability of the linear complementarity problemR. Chandrasekaran, Jong-Shi Pang, Richard E. Stone. mp, 39(1):21-25, 1987. [doi]

The Product Matrix Traveling Salesman Problem: An Application and Solution HeuristicRobert D. Plante, Timothy J. Lowe, R. Chandrasekaran. ior, 35(5):772-783, 1987. [doi]

1986

Recognition of Gilmore-Gomory traveling salesman problemR. Chandrasekaran. DAM, 14(3):231-238, 1986. [doi]

1984

Total weak unimodularity: testing and applicationsR. Chandrasekaran, S. Shirali. DM, 51(2):137-145, 1984. [doi]

Optimization problems with algebraic solutions: Quadratic fractional programs and ratio gamesR. Chandrasekaran, Arie Tamir. mp, 30(3):326-339, 1984. [doi]

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. nar, 12(13):5475-5493, 1984.

1983

Technical Note - Monotone Optimal Issuing Policies in a Deterministic Inventory ModelR. Chandrasekaran. ior, 31(3):591-595, 1983. [doi]

Machine recognition of Brahmi scriptGift Siromoney, R. Chandrasekaran, M. Chandrasekaran. tsmc, 13(4):648-654, 1983. [doi]

1982

p-centers on a treeR. Chandrasekaran, Arie Tamir. mp, 22(1):304-315, 1982. [doi]

The weighted euclidean 1-center problemR. Chandrasekaran. orl, 1(3):111-112, 1982. [doi]

Some NP-complete problems in linear programmingR. Chandrasekaran, Santosh N. Kabadi, Katta G. Murty. orl, 1(3):101-104, 1982. [doi]

1981

n-Dispersion ProblemsR. Chandrasekaran, A. Daughety. mor, 6(1):50-57, 1981. [doi]

An O(n log² n) Algorithm for the k-th Longest Path in a Tree with Applications to Location ProblemsNimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran. SICOMP, 10(2):328-337, 1981.

1980

Discounted Stochastic Ratio GamesV. Aggarwal, R. Chandrasekaran, K. P. K. Nair. siammax, 1(2):201-210, 1980. [doi]

1978

Computer recognition of printed Tamil charactersGift Siromoney, R. Chandrasekaran, M. Chandrasekaran. PR, 10(4):243-247, 1978. [doi]

1977

Minimal ratio spanning treesR. Chandrasekaran. networks, 7(4):335-342, 1977. [doi]

Technical Note - A Special Case of the Transportation ProblemR. Chandrasekaran, S. Subba Rao. ior, 25(3):525-528, 1977. [doi]

1971

A Class of Sequential GamesDavid A. Kohler, R. Chandrasekaran. ior, 19(2):270-277, 1971. [doi]

Sign in or sign up to see more results.

runs on WebDSL