We stand with Ukraine  

Kunhiraman Nair

According to our database1, Kunhiraman Nair authored at least 28 papers between 1966 and 2010.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks.
[BibTeX]
[DOI]
Yash P. Aneja
,
Ramaswamy Chandrasekaran
,
Xiangyong Li
,
K. P. K. Nair
Eur. J. Oper. Res., 2010

2009
2-Commodity Integer Network Synthesis Problem.
[BibTeX]
[DOI]
Santosh N. Kabadi
,
R. Chandrasekaran
,
K. P. K. Nair
Algorithmic Oper. Res., 2009

Minimum Energy Strong Bidirectional Topology for Ad Hoc Wireless Sensor Networks.
[BibTeX]
[DOI]
Yash P. Aneja
,
Ataul Bari
,
Arunita Jaekel
,
Ramaswamy Chandrasekaran
,
K. P. K. Nair
Proceedings of IEEE International Conference on Communications, 2009

2008
Integer Exact Network Synthesis Problem.
[BibTeX]
[DOI]
Santosh N. Kabadi
,
J. Yan
,
Donglei Du
,
K. P. K. Nair
SIAM J. Discret. Math., 2008

VLSN search algorithms for partitioning problems using matching neighbourhoods.
[BibTeX]
[DOI]
Temel Öncan
,
Santosh N. Kabadi
,
K. P. K. Nair
,
Abraham P. Punnen
J. Oper. Res. Soc., 2008

Integer version of the multipath flow network synthesis problem.
[BibTeX]
[DOI]
Santosh N. Kabadi
,
Ramaswamy Chandrasekaran
,
K. P. K. Nair
,
Yash P. Aneja
Discret. Appl. Math., 2008

2007
Flows over edge-disjoint mixed multipaths and applications.
[BibTeX]
[DOI]
Yash P. Aneja
,
Ramaswamy Chandrasekaran
,
Santosh N. Kabadi
,
K. P. K. Nair
Discret. Appl. Math., 2007

2005
Fuzzy disk for covering fuzzy points.
[BibTeX]
[DOI]
Lushu Li
,
Santosh N. Kabadi
,
K. P. K. Nair
Eur. J. Oper. Res., 2005

Multiroute flows: Cut-trees and realizability.
[BibTeX]
[DOI]
Santosh N. Kabadi
,
Ramaswamy Chandrasekaran
,
K. P. K. Nair
Discret. Optim., 2005

2004
Minimal-cost system reliability with discrete-choice sets for components.
[BibTeX]
[DOI]
Yash P. Aneja
,
R. Chandrasekaran
,
K. P. K. Nair
IEEE Trans. Reliab., 2004

Multi-terminal multipath flows: synthesis.
[BibTeX]
[DOI]
R. Chandrasekaran
,
Kunhiraman Nair
,
Yash P. Aneja
,
Santosh N. Kabadi
Discret. Appl. Math., 2004

2003
Parametric analysis of overall min-cuts and applications in undirected networks.
[BibTeX]
[DOI]
Yash P. Aneja
,
R. Chandrasekaran
,
Kunhiraman Nair
Inf. Process. Lett., 2003

Parametric Min-cuts Analysis in a Network.
[BibTeX]
[DOI]
Yash P. Aneja
,
R. Chandrasekaran
,
Kunhiraman Nair
Discret. Appl. Math., 2003

2002
Fuzzy models for single-period inventory problem.
[BibTeX]
[DOI]
Lushu Li
,
Santosh N. Kabadi
,
Kunhiraman Nair
Fuzzy Sets Syst., 2002

Fuzzy versions of the covering circle problem.
[BibTeX]
[DOI]
Lushu Li
,
Santosh N. Kabadi
,
K. P. K. Nair
Eur. J. Oper. Res., 2002

2001
Maximizing residual flow under an arc destruction.
[BibTeX]
[DOI]
Yash P. Aneja
,
R. Chandrasekaran
,
Kunhiraman Nair
Networks, 2001

1998
On capacitated stochastic chain problems in a network.
[BibTeX]
[DOI]
L. Ganapathy
,
Kunhiraman Nair
Networks, 1998

1996
An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem.
[BibTeX]
[DOI]
Abraham P. Punnen
,
K. P. K. Nair
INFORMS J. Comput., 1996

1994
A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem.
[BibTeX]
[DOI]
Abraham P. Punnen
,
Kunhiraman Nair
Inf. Process. Lett., 1994

Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem.
[BibTeX]
[DOI]
Abraham P. Punnen
,
Kunhiraman Nair
Discret. Appl. Math., 1994

1993
On stochastic spanning tree problem.
[BibTeX]
[DOI]
S. Geetha
,
K. P. K. Nair
Networks, 1993

1991
Optimal Assignment of Components to Parallel-Series and Series-Parallel Systems.
[BibTeX]
[DOI]
V. Rajendra Prasad
,
K. P. K. Nair
,
Yash P. Aneja
Oper. Res., 1991

1983
Shortest chain subject to side constraints.
[BibTeX]
[DOI]
Yash P. Aneja
,
V. Aggarwal
,
K. P. K. Nair
Networks, 1983

1982
Minimal spanning tree subject to a side constraint.
[BibTeX]
[DOI]
V. Aggarwal
,
Yash P. Aneja
,
K. P. K. Nair
Comput. Oper. Res., 1982

1980
Discounted Stochastic Ratio Games.
[BibTeX]
[DOI]
V. Aggarwal
,
R. Chandrasekaran
,
K. P. K. Nair
SIAM J. Algebraic Discret. Methods, 1980

Maximal expected flow in a network subject to arc failures.
[BibTeX]
[DOI]
Yash P. Aneja
,
K. P. K. Nair
Networks, 1980

1966
Multistage Planned Replacement Strategies.
[BibTeX]
[DOI]
V. P. Marathe
,
K. P. K. Nair
Oper. Res., 1966

Letter to the Editor - On Multistage Replacement Strategies.
[BibTeX]
[DOI]
V. P. Marathe
,
K. P. K. Nair
Oper. Res., 1966


  Loading...