default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRamaswamy Chandrasekaran
R. Chandrasekaran
Person information
- affiliation: University of Texas at Dallas, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j63]Piotr Wojciechowski
, K. Subramani, R. Chandrasekaran:
Analyzing Read-Once Cutting Plane Proofs in Horn Systems. J. Autom. Reason. 66(2): 239-274 (2022)- 2021
- [j62]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): 12117-12134 (2021) - [c29]R. Chandrasekaran, S. Vijayaraj, G. R. Jothilakshmi:
Investigation of Gastroparesis Using Multichannel Electro Gastro Gram - A Study. BIOMESIP 2021: 121-129 - 2020
- [j61]K. Alex Mills, R. Chandrasekaran, Neeraj Mittal:
Algorithms for optimal replica placement under correlated failure in hierarchical failure domains. Theor. Comput. Sci. 809: 482-518 (2020) - [j60]Piotr Wojciechowski, R. Chandrasekaran, K. Subramani:
Analyzing fractional Horn constraint systems. Theor. Comput. Sci. 844: 142-153 (2020)
2010 – 2019
- 2019
- [c28]Hans Kleine Büning, Piotr Wojciechowski, R. Chandrasekaran, K. Subramani:
Restricted Cutting Plane Proofs in Horn Constraint Systems. FroCos 2019: 149-164 - 2017
- [c27]K. Alex Mills, R. Chandrasekaran, Neeraj Mittal:
Lexico-Minimum Replica Placement in Multitrees. COCOA (2) 2017: 122-137 - [c26]Piotr Wojciechowski, Ramaswamy Chandrasekaran, K. Subramani:
On a Generalization of Horn Constraint Systems. CSR 2017: 323-336 - [i4]K. Alex Mills, Ramaswamy Chandrasekaran, Neeraj Mittal:
Algorithms for Optimal Replica Placement Under Correlated Failure in Hierarchical Failure Domains. CoRR abs/1701.01539 (2017) - [i3]K. Alex Mills, R. Chandrasekaran, Neeraj Mittal:
Lexico-minimum Replica Placement in Multitrees. CoRR abs/1709.05709 (2017) - 2016
- [j59]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: 15-34 (2016) - [c25]Partha De, Kamil Saraç, Ramaswamy Chandrasekaran:
Heuristics for 2-coverage multi point relay problem in wireless ad hoc and sensor networks. WiOpt 2016: 45-52 - 2015
- [j58]R. Chandrasekaran:
Integer Farkas Lemma. IGTR 17(1): 1540003:1-1540003:9 (2015) - [c24]K. Alex Mills, R. Chandrasekaran, Neeraj Mittal:
On Replica Placement in High-Availability Storage Under Correlated Failure. COCOA 2015: 348-363 - [i2]K. Alex Mills, R. Chandrasekaran, Neeraj Mittal:
Algorithms for Replica Placement in High-Availability Storage. CoRR abs/1503.02654 (2015) - [i1]Yanyan Zeng, K. Alex Mills, Shreyas Gokhale, Neeraj Mittal, S. Venkatesan, Ramaswamy Chandrasekaran:
Robust Neighbor Discovery in Multi-Hop Multi-Channel Heterogeneous Wireless Networks. CoRR abs/1505.00267 (2015) - 2013
- [j57]R. Chandrasekaran, K. Subramani:
A combinatorial algorithm for Horn programs. Discret. Optim. 10(2): 85-101 (2013) - 2012
- [j56]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): 1253-1266 (2012) - 2011
- [j55]R. Chandrasekaran, Milind Dawande, Mehmet Baysan:
On a labeling problem in graphs. Discret. Appl. Math. 159(8): 746-759 (2011) - [c23]Suhel Patel, Kamil Saraç, R. Chandrasekaran, Turgay Korkmaz, Neeraj Mittal:
Relay Assignment in AMT-Based Multicast Content Distribution. CNSR 2011: 263-270 - [c22]Chanaka Liyana Arachchige, S. Venkatesan, R. Chandrasekaran, Neeraj Mittal:
Minimal Time Broadcasting in Cognitive Radio Networks. ICDCN 2011: 364-375 - [c21]Neeraj Mittal, Yanyan Zeng, S. Venkatesan, R. Chandrasekaran:
Randomized Distributed Algorithms for Neighbor Discovery in Multi-hop Multi-channel Heterogeneous Wireless Networks. ICDCS 2011: 57-66 - 2010
- [j54]R. Chandrasekaran:
Santosh Narayan Kabadi 1956-2010. Algorithmic Oper. Res. 5(2) (2010) - [j53]Yash P. Aneja, Ramaswamy Chandrasekaran, Xiangyong Li, K. P. K. Nair:
A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks. Eur. J. Oper. Res. 204(3): 604-612 (2010) - [c20]Yanyan Zeng, Neeraj Mittal, S. Venkatesan, R. Chandrasekaran:
Fast Neighbor Discovery with Lightweight Termination Detection in Heterogeneous Cognitive Radio Networks. ISPDC 2010: 149-156
2000 – 2009
- 2009
- [j52]Santosh N. Kabadi, R. Chandrasekaran, K. P. K. Nair:
2-Commodity Integer Network Synthesis Problem. Algorithmic Oper. Res. 4(2): 117-132 (2009) - [j51]R. Chandrasekaran, Milind Dawande:
Structural analysis of a fractional matching problem. Discret. Appl. Math. 157(18): 3708-3720 (2009) - [j50]Neeraj Mittal, Srinivasan Krishnamurthy, R. Chandrasekaran, Subbarayan Venkatesan, Yanyan Zeng:
On neighbor discovery in cognitive radio networks. J. Parallel Distributed Comput. 69(7): 623-637 (2009) - [j49]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): 913-924 (2009) - [c19]Yash P. Aneja, Ataul Bari, Arunita Jaekel, Ramaswamy Chandrasekaran, K. P. K. Nair:
Minimum Energy Strong Bidirectional Topology for Ad Hoc Wireless Sensor Networks. ICC 2009: 1-5 - [c18]R. Chandrasekaran, K. Subramani:
A Combinatorial Algorithm for Horn Programs. ISAAC 2009: 1114-1123 - 2008
- [j48]Srinivasan Krishnamurthy, Mansi Ramakrishnan Thoppian, Srikant Kuppa, Ramaswamy Chandrasekaran, Neeraj Mittal, Subbarayan Venkatesan, Ravi Prakash:
Time-efficient distributed layer-2 auto-configuration for cognitive radio networks. Comput. Networks 52(4): 831-849 (2008) - [j47]Santosh N. Kabadi, Ramaswamy Chandrasekaran, K. P. K. Nair, Yash P. Aneja:
Integer version of the multipath flow network synthesis problem. Discret. Appl. Math. 156(18): 3376-3399 (2008) - [j46]Maulin Patel, Ramaswamy Chandrasekaran, Subbarayan Venkatesan:
Improved quasi-path restoration in mesh networks. IEEE/ACM Trans. Netw. 16(1): 144-156 (2008) - 2007
- [j45]Yash P. Aneja, Ramaswamy Chandrasekaran, Santosh N. Kabadi, K. P. K. Nair:
Flows over edge-disjoint mixed multipaths and applications. Discret. Appl. Math. 155(15): 1979-2000 (2007) - [j44]Young U. Ryu, R. Chandrasekaran, Varghese S. Jacob:
Breast cancer prediction using the isotonic separation technique. Eur. J. Oper. Res. 181(2): 842-854 (2007) - [j43]Donglei Du, R. Chandrasekaran:
The maximum residual flow problem: NP-hardness with two-arc destruction. Networks 50(3): 181-182 (2007) - [c17]R. Chandrasekaran, Ahmed Tayeh, Vaishali Nagoore:
Understanding Information System Outsourcing Failure: Lessons from a Case Study. AMCIS 2007: 144 - [c16]Maulin Patel, S. Venkatesan, R. Chandrasekaran:
A Network-flow based Integral Optimal Algorithm for Lexicographic Maximum Lifetime Routing in Wireless Sensor Networks. ICCCN 2007: 850-855 - 2006
- [j42]Maulin Patel, S. Venkatesan, R. Chandrasekaran:
Energy-efficient capacity-constrained routing in wireless sensor networks. Int. J. Pervasive Comput. Commun. 2(2): 69-80 (2006) - [j41]Donglei Du, R. Chandrasekaran:
The multiroute maximum flow problem revisited. Networks 47(2): 81-92 (2006) - [c15]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: 572-574 - [c14]Mansi Ramakrishnan Thoppian, Subbarayan Venkatesan, Ravi Prakash, R. Chandrasekaran:
MAC-Layer Scheduling in Cognitive Radio based Multi-Hop Wireless Networks. WOWMOM 2006: 191-202 - 2005
- [j40]Santosh N. Kabadi, Ramaswamy Chandrasekaran, K. P. K. Nair:
Multiroute flows: Cut-trees and realizability. Discret. Optim. 2(3): 229-240 (2005) - [j39]Ramaswamy Chandrasekaran, Young U. Ryu, Varghese S. Jacob, Sungchul Hong:
Isotonic Separation. INFORMS J. Comput. 17(4): 462-474 (2005) - [c13]Ramaswamy Chandrasekaran, Ovidiu Daescu, Jun Luo:
Cutting Out Polygons. CCCG 2005: 183-186 - [c12]Maulin Patel, R. Chandrasekaran, S. Venkatesan:
Energy efficient sensor, relay and base station placements for coverage, connectivity and routing. IPCCC 2005: 581-586 - [c11]Srinivasan Krishnamurthy, Mansi Ramakrishnan Thoppian, Srikant Kuppa, Subbarayan Venkatesan, Ramaswamy Chandrasekaran, Neeraj Mittal, Ravi Prakash:
Time-Efficient Layer-2 Auto-Configuration for Cognitive Radios. IASTED PDCS 2005: 459-464 - 2004
- [j38]R. Chandrasekaran, Kunhiraman Nair, Yash P. Aneja, Santosh N. Kabadi:
Multi-terminal multipath flows: synthesis. Discret. Appl. Math. 143(1-3): 182-193 (2004) - [j37]Chelliah Sriskandarajah, Inna G. Drobouchevitch, Suresh P. Sethi, Ramaswamy Chandrasekaran:
Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot. Oper. Res. 52(1): 65-82 (2004) - [j36]Young U. Ryu, R. Chandrasekaran, Varghese S. Jacob:
Prognosis Using an Isotonic Prediction Technique. Manag. Sci. 50(6): 777-785 (2004) - [j35]Yash P. Aneja, R. Chandrasekaran, K. P. K. Nair:
Minimal-cost system reliability with discrete-choice sets for components. IEEE Trans. Reliab. 53(1): 71-76 (2004) - [c10]Maulin Patel, R. Chandrasekaran, S. Venkatesan:
Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks. International Conference on Wireless Networks 2004: 447-453 - 2003
- [j34]Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair:
Parametric Min-cuts Analysis in a Network. Discret. Appl. Math. 127(3): 679-689 (2003) - [j33]Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair:
Parametric analysis of overall min-cuts and applications in undirected networks. Inf. Process. Lett. 85(2): 105-109 (2003) - [j32]John F. Rudin III, R. Chandrasekaran:
Improved Bounds for the Online Scheduling Problem. SIAM J. Comput. 32(3): 717-735 (2003) - [c9]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: 156 - [c8]Laxmi P. Gewali, Joy Bhadury, Ramaswamy Chandrasekaran:
Network Design Subject to Facility Location. CCCG 2003: 128-131 - [c7]Srinivasan Krishnamurthy, R. Chandrasekaran, S. Venkatesan, Milind Dawande:
Highly efficient spare capacity planning for generalized link restoration. ICCCN 2003: 47-52 - [c6]Maulin Patel, Ramaswamy Chandrasekaran, Subbarayan Venkatesan:
A comparative study of restoration schemes and spare capacity assignments in mesh networks. ICCCN 2003: 399-404 - 2001
- [j31]Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair:
Maximizing residual flow under an arc destruction. Networks 38(4): 194-198 (2001)
1990 – 1999
- 1999
- [c5]Varghese S. Jacob, Ramayya Krishnan, Young U. Ryu, Ramaswamy Chandrasekaran, Sungchul Hong:
Filtering objectionable internet content. ICIS 1999: 274-278 - 1998
- [j30]R. Chandrasekaran, Santosh N. Kabadi, R. Sridhar:
Integer Solution for Linear Complementarity Problem. Math. Oper. Res. 23(2): 390-402 (1998) - [c4]Joy Bhadury, Ramaswamy Chandrasekaran, Laxmi P. Gewali:
Constructing median constrained minimum spanning tree. CCCG 1998 - 1997
- [j29]Joy Bhadury, V. Chandru, A. Maheshwari, Ramaswamy Chandrasekaran:
Art Gallery Problems for Convex Nested Polygons. INFORMS J. Comput. 9(1): 100-110 (1997) - [j28]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): 870-872 (1997) - 1996
- [c3]Joy Bhadury, Ramaswamy Chandrasekaran:
Finding the Set of All Minimal Nested Convex Polygons. CCCG 1996: 26-31 - 1994
- [j27]Sambhavi Lakshminarayanan, R. Chandrasekaran:
A rounding algorithm for integer programs. Discret. Appl. Math. 50(3): 267-282 (1994) - 1992
- [j26]S. Sridhar, R. Chandrasekaran:
Integer Solution to Synthesis of Communication Networks. Math. Oper. Res. 17(3): 581-585 (1992) - 1990
- [j25]Santosh N. Kabadi, Ramaswamy Chandrasekaran:
On totally dual integral systems. Discret. Appl. Math. 26(1): 87-104 (1990) - [j24]R. Chandrasekaran, Arie Tamir:
Algebraic Optimization: The Fermat-Weber Location Problem. Math. Program. 46: 219-224 (1990) - [c2]Santosh N. Kabadi, Ramaswamy Chandrasekaran:
Solvable Classes of Generalized Traveling Salesman Polytope. Polyhedral Combinatorics 1990: 49-60 - [c1]S. Sridhar, R. Chandrasekaran:
Integer Solution to Synthesis of Communication Networks. IPCO 1990: 467-483
1980 – 1989
- 1989
- [j23]Ramaswamy Chandrasekaran, Arie Tamir:
Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem. Math. Program. 44(1-3): 293-295 (1989) - 1988
- [j22]R. Chandrasekaran, Santosh N. Kabadi:
Pseudomatroids. Discret. Math. 71(3): 205-217 (1988) - 1987
- [j21]Robert D. Plante, Timothy J. Lowe, R. Chandrasekaran:
The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic. Oper. Res. 35(5): 772-783 (1987) - [j20]R. Chandrasekaran, Jong-Shi Pang, Richard E. Stone:
Two counterexamples on the polynomial solvability of the linear complementarity problem. Math. Program. 39(1): 21-25 (1987) - 1986
- [j19]R. Chandrasekaran:
Recognition of Gilmore-Gomory traveling salesman problem. Discret. Appl. Math. 14(3): 231-238 (1986) - 1984
- [j18]Ramaswamy Chandrasekaran, Arie Tamir:
Polynomial testing of the query "IS ab ≥ cd?" with application to finding a minimal cost reliability ratio spanning tree. Discret. Appl. Math. 9(2): 117-123 (1984) - [j17]R. Chandrasekaran, S. Shirali:
Total weak unimodularity: testing and applications. Discret. Math. 51(2): 137-145 (1984) - [j16]R. Chandrasekaran, Arie Tamir:
Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games. Math. Program. 30(3): 326-339 (1984) - [j15]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): 5475-5493 (1984) - 1983
- [j14]R. Chandrasekaran:
Technical Note - Monotone Optimal Issuing Policies in a Deterministic Inventory Model. Oper. Res. 31(3): 591-595 (1983) - [j13]Ramaswamy Chandrasekaran, M. Chandrasekaran, Gift Siromoney:
Computer dating of medieval inscriptions: South Indian Tamil. Comput. Humanit. 17(4): 199-208 (1983) - [j12]Gift Siromoney, R. Chandrasekaran, M. Chandrasekaran:
Machine recognition of Brahmi script. IEEE Trans. Syst. Man Cybern. 13(4): 648-654 (1983) - 1982
- [j11]R. Chandrasekaran, Arie Tamir:
Polynomially bounded algorithms for locating p-centers on a tree. Math. Program. 22(1): 304-315 (1982) - [j10]R. Chandrasekaran, Santosh N. Kabadi, Katta G. Murty:
Some NP-complete problems in linear programming. Oper. Res. Lett. 1(3): 101-104 (1982) - [j9]R. Chandrasekaran:
The weighted euclidean 1-center problem. Oper. Res. Lett. 1(3): 111-112 (1982) - 1981
- [j8]R. Chandrasekaran, A. Daughety:
Location on Tree Networks: P-Centre and n-Dispersion Problems. Math. Oper. Res. 6(1): 50-57 (1981) - [j7]Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran:
An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. SIAM J. Comput. 10(2): 328-337 (1981) - 1980
- [j6]V. Aggarwal, R. Chandrasekaran, K. P. K. Nair:
Discounted Stochastic Ratio Games. SIAM J. Algebraic Discret. Methods 1(2): 201-210 (1980) - [j5]Ramaswamy Chandrasekaran, Arie Tamir:
An O ((nlog p)2) Algorithm for the Continuous p-Center Problem on a Tree. SIAM J. Algebraic Discret. Methods 1(4): 370-375 (1980)
1970 – 1979
- 1978
- [j4]Gift Siromoney, R. Chandrasekaran, M. Chandrasekaran:
Computer recognition of printed Tamil characters. Pattern Recognit. 10(4): 243-247 (1978) - 1977
- [j3]R. Chandrasekaran, S. Subba Rao:
Technical Note - A Special Case of the Transportation Problem. Oper. Res. 25(3): 525-528 (1977) - [j2]R. Chandrasekaran:
Minimal ratio spanning trees. Networks 7(4): 335-342 (1977) - 1971
- [j1]David A. Kohler, R. Chandrasekaran:
A Class of Sequential Games. Oper. Res. 19(2): 270-277 (1971)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
