default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKunhiraman Nair
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j27]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)
2000 – 2009
- 2009
- [j26]Santosh N. Kabadi, R. Chandrasekaran, K. P. K. Nair:
2-Commodity Integer Network Synthesis Problem. Algorithmic Oper. Res. 4(2): 117-132 (2009) - [c1]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 - 2008
- [j25]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) - [j24]Temel Öncan, Santosh N. Kabadi, K. P. K. Nair, Abraham P. Punnen:
VLSN search algorithms for partitioning problems using matching neighbourhoods. J. Oper. Res. Soc. 59(3): 388-398 (2008) - [j23]Santosh N. Kabadi, J. Yan, Donglei Du, K. P. K. Nair:
Integer Exact Network Synthesis Problem. SIAM J. Discret. Math. 23(1): 136-154 (2008) - 2007
- [j22]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) - 2005
- [j21]Santosh N. Kabadi, Ramaswamy Chandrasekaran, K. P. K. Nair:
Multiroute flows: Cut-trees and realizability. Discret. Optim. 2(3): 229-240 (2005) - [j20]Lushu Li, Santosh N. Kabadi, K. P. K. Nair:
Fuzzy disk for covering fuzzy points. Eur. J. Oper. Res. 160(2): 560-573 (2005) - 2004
- [j19]R. Chandrasekaran, Kunhiraman Nair, Yash P. Aneja, Santosh N. Kabadi:
Multi-terminal multipath flows: synthesis. Discret. Appl. Math. 143(1-3): 182-193 (2004) - [j18]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) - 2003
- [j17]Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair:
Parametric Min-cuts Analysis in a Network. Discret. Appl. Math. 127(3): 679-689 (2003) - [j16]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) - 2002
- [j15]Lushu Li, Santosh N. Kabadi, K. P. K. Nair:
Fuzzy versions of the covering circle problem. Eur. J. Oper. Res. 137(1): 93-109 (2002) - [j14]Lushu Li, Santosh N. Kabadi, Kunhiraman Nair:
Fuzzy models for single-period inventory problem. Fuzzy Sets Syst. 132(3): 273-289 (2002) - 2001
- [j13]Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair:
Maximizing residual flow under an arc destruction. Networks 38(4): 194-198 (2001)
1990 – 1999
- 1998
- [j12]L. Ganapathy, Kunhiraman Nair:
On capacitated stochastic chain problems in a network. Networks 31(1): 19-27 (1998) - 1996
- [j11]Abraham P. Punnen, K. P. K. Nair:
An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem. INFORMS J. Comput. 8(1): 41-44 (1996) - 1994
- [j10]Abraham P. Punnen, Kunhiraman Nair:
Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem. Discret. Appl. Math. 55(1): 91-93 (1994) - [j9]Abraham P. Punnen, Kunhiraman Nair:
A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem. Inf. Process. Lett. 50(5): 283-286 (1994) - 1993
- [j8]S. Geetha, K. P. K. Nair:
On stochastic spanning tree problem. Networks 23(8): 675-679 (1993) - 1991
- [j7]V. Rajendra Prasad, K. P. K. Nair, Yash P. Aneja:
Optimal Assignment of Components to Parallel-Series and Series-Parallel Systems. Oper. Res. 39(3): 407-414 (1991)
1980 – 1989
- 1983
- [j6]Yash P. Aneja, V. Aggarwal, K. P. K. Nair:
Shortest chain subject to side constraints. Networks 13(2): 295-302 (1983) - 1982
- [j5]V. Aggarwal, Yash P. Aneja, K. P. K. Nair:
Minimal spanning tree subject to a side constraint. Comput. Oper. Res. 9(4): 287-296 (1982) - 1980
- [j4]Yash P. Aneja, K. P. K. Nair:
Maximal expected flow in a network subject to arc failures. Networks 10(1): 45-57 (1980) - [j3]V. Aggarwal, R. Chandrasekaran, K. P. K. Nair:
Discounted Stochastic Ratio Games. SIAM J. Algebraic Discret. Methods 1(2): 201-210 (1980)
1960 – 1969
- 1966
- [j2]V. P. Marathe, K. P. K. Nair:
Letter to the Editor - On Multistage Replacement Strategies. Oper. Res. 14(3): 537-538 (1966) - [j1]V. P. Marathe, K. P. K. Nair:
Multistage Planned Replacement Strategies. Oper. Res. 14(5): 874-887 (1966)
Coauthor Index
aka: R. Chandrasekaran
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 2025-03-04 21:20 CET 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:
