Ramaswamy Chandrasekaran - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2017

On a Generalization of Horn Constraint SystemsPiotr J. Wojciechowski, Ramaswamy Chandrasekaran, K. Subramani. csr 2017: 323-336 [doi]

2016

Heuristics for 2-coverage multi point relay problem in wireless ad hoc and sensor networksPartha De, Kamil Saraç, Ramaswamy Chandrasekaran. wiopt 2016: 45-52 [doi]

2010

A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networksYash P. Aneja, Ramaswamy Chandrasekaran, Xiangyong Li, K. P. K. Nair. eor, 204(3):604-612, 2010. [doi]

2009

Minimum Energy Strong Bidirectional Topology for Ad Hoc Wireless Sensor NetworksYash P. Aneja, Ataul Bari, Arunita Jaekel, Ramaswamy Chandrasekaran, K. P. K. Nair. icc 2009: 1-5 [doi]

2008

2007

Flows over edge-disjoint mixed multipaths and applicationsYash P. Aneja, Ramaswamy Chandrasekaran, Santosh N. Kabadi, K. P. K. Nair. DAM, 155(15):1979-2000, 2007. [doi]

2005

2004

Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper RobotChelliah Sriskandarajah, Inna G. Drobouchevitch, Suresh P. Sethi, Ramaswamy Chandrasekaran. ior, 52(1):65-82, 2004. [doi]

2003

Network Design Subject to Facility LocationLaxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekaran. cccg 2003: 128-131

A comparative study of restoration schemes and spare capacity assignments in mesh networksMaulin Patel, Ramaswamy Chandrasekaran, Subbarayan Venkatesan. icccn 2003: 399-404 [doi]

1999

Filtering objectionable internet contentVarghese S. Jacob, Ramayya Krishnan, Young U. Ryu, Ramaswamy Chandrasekaran, Sungchul Hong. icisc 1999: 274-278 [doi]

1998

Constructing median constrained minimum spanning treeJoy Bhadury, Ramaswamy Chandrasekaran, Laxmi Gewali. cccg 1998: [doi]

1997

Art Gallery Problems for Convex Nested PolygonsJoy Bhadury, V. Chandru, A. Maheshwari, Ramaswamy Chandrasekaran. informs, 9(1):100-110, 1997. [doi]

1996

Finding the Set of All Minimal Nested Convex PolygonsJoy Bhadury, Ramaswamy Chandrasekaran. cccg 1996: 26-31

1990

On totally dual integral systemsSantosh N. Kabadi, Ramaswamy Chandrasekaran. DAM, 26(1):87-104, 1990. [doi]

Solvable Classes of Generalized Traveling Salesman PolytopeSantosh N. Kabadi, Ramaswamy Chandrasekaran. dimacs 1990: 49-60

1989

Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problemRamaswamy Chandrasekaran, Arie Tamir. mp, 44(1-3):293-295, 1989. [doi]

1984

d?" with application to finding a minimal cost reliability ratio spanning treeRamaswamy Chandrasekaran, Arie Tamir. DAM, 9(2):117-123, 1984. [doi]

1983

Computer dating of medieval inscriptions: South Indian TamilRamaswamy Chandrasekaran, M. Chandrasekaran, Gift Siromoney. lre, 17(4):199-208, 1983. [doi]

1980

2) Algorithm for the Continuous p-Center Problem on a TreeRamaswamy Chandrasekaran, Arie Tamir. siammax, 1(4):370-375, 1980. [doi]

Sign in or sign up to see more results.

runs on WebDSL