Citation: Ap. Punnen et Kpk. Nair, AN O(M-LOG-N) ALGORITHM FOR THE MAX PLUS SUM SPANNING TREE PROBLEM, European journal of operational research, 89(2), 1996, pp. 423-426
Citation: Ap. Punnen et Kpk. Nair, POLYNOMIAL ALGORITHMS FOR A CLASS OF DISCRETE MINMAX LINEAR-PROGRAMMING PROBLEMS, The Journal of the Operational Research Society, 46(4), 1995, pp. 499-506
Citation: Ap. Punnen et Kpk. Nair, IMPROVED COMPLEXITY BOUND FOR THE MAXIMUM CARDINALITY BOTTLENECK BIPARTITE MATCHING PROBLEM, Discrete applied mathematics, 55(1), 1994, pp. 91-93
Citation: S. Geetha et Kpk. Nair, A STOCHASTIC BOTTLENECK TRANSPORTATION PROBLEM, The Journal of the Operational Research Society, 45(5), 1994, pp. 583-588
Citation: Ap. Punnen et Kpk. Nair, A FAST AND SIMPLE ALGORITHM FOR THE BOTTLENECK BICONNECTED SPANNING SUBGRAPH PROBLEM, Information processing letters, 50(5), 1994, pp. 283-286
Citation: Kpk. Nair et al., EFFICIENT CHAINS IN A NETWORK WITH TIME COST TRADE-OFF FUNCTION ON EACH ARC, European journal of operational research, 66(3), 1993, pp. 392-402
Citation: Vr. Prasad et al., A GENERALIZED TIME-COST TRADE-OFF TRANSPORTATION PROBLEM, The Journal of the Operational Research Society, 44(12), 1993, pp. 1243-1248