| 2008 |
|---|
| 20 | EE | Xiangyong Li,
Yash P. Aneja,
Fazle Baki:
Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks.
COCOA 2008: 235-245 |
| 19 | EE | Arunita Jaekel,
Subir Bandyopadhyay,
Yash P. Aneja:
A new approach for designing fault-tolerant WDM networks.
Computer Networks 52(18): 3421-3432 (2008) |
| 18 | EE | Santosh N. Kabadi,
Ramaswamy Chandrasekaran,
K. P. K. Nair,
Yash P. Aneja:
Integer version of the multipath flow network synthesis problem.
Discrete Applied Mathematics 156(18): 3376-3399 (2008) |
| 2007 |
|---|
| 17 | EE | Yash P. Aneja,
Ramaswamy Chandrasekaran,
Santosh N. Kabadi,
K. P. K. Nair:
Flows over edge-disjoint mixed multipaths and applications.
Discrete Applied Mathematics 155(15): 1979-2000 (2007) |
| 2006 |
|---|
| 16 | | Subir Bandyopadhyay,
Arunita Jaekel,
Yash P. Aneja,
S. Saha:
A Comparative Study of Schemes for Robust Logical Topology Design in Wavelength Routed WDM Networks.
Wireless and Optical Communications 2006: 230-236 |
| 15 | EE | Yash P. Aneja,
Subir Bandyopadhyay,
Arunita Jaekel:
On routing in large WDM networks.
Optical Switching and Networking 3(3-4): 219-232 (2006) |
| 2005 |
|---|
| 14 | | Yash P. Aneja,
Arunita Jaekel,
Subir Bandyopadhyay:
Approximation algorithms for traffic routing in wavelength routed WDM networks.
BROADNETS 2005: 25-32 |
| 13 | EE | Yash P. Aneja,
Subir Bandyopadhyay,
Arunita Jaekel,
S. Dey:
An Efficient Algorithm for Routing in WDM Networks.
ICW/ICHSN/ICMCS/SENET 2005: 268-274 |
| 2004 |
|---|
| 12 | EE | Yash P. Aneja,
Arunita Jaekel,
Subir Bandyopadhyay:
An Improved ILP Formulation for Path Protection in WDM Networks.
HSNMC 2004: 903-911 |
| 11 | EE | R. Chandrasekaran,
Kunhiraman Nair,
Yash P. Aneja,
Santosh N. Kabadi:
Multi-terminal multipath flows: synthesis.
Discrete Applied Mathematics 143(1-3): 182-193 (2004) |
| 10 | EE | Yash P. Aneja,
R. Chandrasekaran,
K. P. K. Nair:
Minimal-cost system reliability with discrete-choice sets for components.
IEEE Transactions on Reliability 53(1): 71-76 (2004) |
| 9 | EE | Abraham P. Punnen,
Yash P. Aneja:
Lexicographic balanced optimization problems.
Oper. Res. Lett. 32(1): 27-30 (2004) |
| 2003 |
|---|
| 8 | EE | Yash P. Aneja,
R. Chandrasekaran,
Kunhiraman Nair:
Parametric Min-cuts Analysis in a Network.
Discrete Applied Mathematics 127(3): 679-689 (2003) |
| 7 | EE | 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) |
| 2001 |
|---|
| 6 | EE | Santosh N. Kabadi,
Yash P. Aneja:
Equivalence of epsilon-Approximate Separation and Optimization in Fixed Dimensions.
Algorithmica 29(4): 582-594 (2001) |
| 5 | EE | Yash P. Aneja,
R. Chandrasekaran,
Kunhiraman Nair:
Maximizing residual flow under an arc destruction.
Networks 38(4): 194-198 (2001) |
| 1999 |
|---|
| 4 | EE | Yash P. Aneja,
Hichem Kamoun:
Scheduling of parts and robot activities in a two machine robotic cell.
Computers & OR 26(4): 297-312 (1999) |
| 1997 |
|---|
| 3 | EE | Abraham P. Punnen,
Yash P. Aneja:
Minimum Dispersion Problems.
Discrete Applied Mathematics 75(1): 93-102 (1997) |
| 2 | EE | Santosh N. Kabadi,
Yash P. Aneja:
An Efficient, Strongly Polynomial, epsilon-Approximation Schemes.
Inf. Process. Lett. 64(4): 173-177 (1997) |
| 1982 |
|---|
| 1 | EE | V. Aggarwal,
Yash P. Aneja,
K. P. K. Nair:
Minimal spanning tree subject to a side constraint.
Computers & OR 9(4): 287-296 (1982) |
