R. Chandrasekaran

From MaRDI portal
Person:584055

Available identifiers

zbMath Open chandrasekaran.ramaswamyWikidataQ102214306 ScholiaQ102214306MaRDI QIDQ584055

List of research outcomes

PublicationDate of PublicationType
Robust discrete spanning tree problem: local search algorithms2022-10-18Paper
Analyzing read-once cutting plane proofs in Horn systems2022-06-09Paper
Analyzing fractional Horn constraint systems2020-10-21Paper
Classification of textile fabrics using statistical multivariate techniques2020-10-21Paper
Restricted cutting plane proofs in Horn constraint systems2020-05-13Paper
Algorithms for optimal replica placement under correlated failure in hierarchical failure domains2020-01-29Paper
Lexico-minimum replica placement in multitrees2018-03-26Paper
On a generalization of Horn constraint systems2017-08-22Paper
On Replica Placement in High-Availability Storage Under Correlated Failure2016-02-05Paper
Integer Farkas Lemma2015-04-01Paper
A combinatorial algorithm for Horn programs2014-04-15Paper
https://portal.mardi4nfdi.de/entity/Q28658542013-12-11Paper
https://portal.mardi4nfdi.de/entity/Q28673692013-12-11Paper
https://portal.mardi4nfdi.de/entity/Q28476092013-09-11Paper
Isotonic Separation2012-06-18Paper
A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks2010-03-01Paper
A Combinatorial Algorithm for Horn Programs2009-12-17Paper
Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot2009-07-10Paper
Integer version of the multipath flow network synthesis problem2009-03-04Paper
Time-efficient distributed layer-2 auto-configuration for cognitive radio networks2008-03-11Paper
Geometric problems in automated manufacturing.2008-01-25Paper
The maximum residual flow problem: NP‐hardness with two‐arc destruction2008-01-07Paper
Flows over edge-disjoint mixed multipaths and applications2007-09-19Paper
Breast cancer prediction using the isotonic separation technique2007-04-19Paper
The multiroute maximum flow problem revisited2006-05-16Paper
Multiroute flows: cut-trees and realizability2006-01-09Paper
Multi-terminal multipath flows: synthesis2004-11-23Paper
Improved Bounds for the Online Scheduling Problem2003-06-19Paper
Parametric min-cuts analysis in a network.2003-06-10Paper
Parametric analysis of overall min-cuts and applications in undirected networks.2003-01-21Paper
Maximizing residual flow under an arc destruction2002-07-01Paper
A constrained least-squares algorithm with data-adaptive beamforming and equalization for cochannel TDMA signals.2000-10-26Paper
A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"1997-05-26Paper
Tessellation and \(g\)-tessellation of circulants, \(Q_ 6\), and \(Q_ 6^ t\)1997-02-27Paper
An extension of a theorem of Fulkerson and Gross1996-12-01Paper
A rounding algorithm for integer programs1995-05-01Paper
https://portal.mardi4nfdi.de/entity/Q39734071992-06-26Paper
A problem in vision that is polynomially solvable1991-01-01Paper
Algebraic optimization: The Fermat-Weber location problem1990-01-01Paper
On totally dual integral systems1990-01-01Paper
On the \(\epsilon\)-perturbation method for avoiding degeneracy1989-01-01Paper
Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem1989-01-01Paper
A note on the m-center problem with rectilinear distances1988-01-01Paper
Pseudomatroids1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37795691988-01-01Paper
Strongly polynomial algorithm for a class of combinatorial LCPs1987-01-01Paper
The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic1987-01-01Paper
Two counterexamples on the polynomial solvability of the linear complementarity problem1987-01-01Paper
Recognition of Gilmore-Gomory traveling salesman problem1986-01-01Paper
Optimal improvements in bottleneck systems1985-01-01Paper
Classes of linear programs with integral optimal solutions1985-01-01Paper
Linear complementarity problems solvable by a polynomially bounded pivoting algorithm1985-01-01Paper
Total weak unimodularity: Testing and applications1984-01-01Paper
On the integrality of an extreme solution to pluperfect graph and balanced systems1984-01-01Paper
Polynomial testing of the query Is \(a^ b\geq c^ d?\) with application to finding a minimal cost reliability ratio spanning tree1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33460901984-01-01Paper
Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games1984-01-01Paper
Production Planning in Assembly Line Systems1984-01-01Paper
Technical Note—Monotone Optimal Issuing Policies in a Deterministic Inventory Model1983-01-01Paper
The weighted Euclidean 1-center problem1982-01-01Paper
Some NP-complete problems in linear programming1982-01-01Paper
Polynomially bounded algorithms for locatingp-centers on a tree1982-01-01Paper
An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems1981-01-01Paper
Polynomial Algorithms for Totally Dual Integral Systems and Extensions1981-01-01Paper
Minimal Cost-Reliability Ratio Spanning Tree1981-01-01Paper
Location on Tree Networks: P-Centre and n-Dispersion Problems1981-01-01Paper
Weighted min-max location problems: Polynomially bounded algorithms1980-01-01Paper
An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree1980-01-01Paper
Computer recognition of printed Tamil characters1978-01-01Paper
Local unimodularity of matrix-vector pairs1978-01-01Paper
Minimal ratio spanning trees1977-01-01Paper
Technical Note—A Special Case of the Transportation Problem1977-01-01Paper
A Class of Sequential Games1971-01-01Paper
Total Unimodularity of Matrices1969-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: R. Chandrasekaran