The SCEAS System
| |||||||

## Search the dblp DataBase
Yash P. Aneja:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Yash P. Aneja, Arunita Jaekel, Subir Bandyopadhyay
**Approximation algorithms for traffic routing in wavelength routed WDM networks.**[Citation Graph (0, 0)][DBLP] BROADNETS, 2005, pp:25-32 [Conf] - Yash P. Aneja, Arunita Jaekel, Subir Bandyopadhyay
**An Improved ILP Formulation for Path Protection in WDM Networks.**[Citation Graph (0, 0)][DBLP] HSNMC, 2004, pp:903-911 [Conf] - Yash P. Aneja, Subir Bandyopadhyay, Arunita Jaekel, S. Dey
**An Efficient Algorithm for Routing in WDM Networks.**[Citation Graph (0, 0)][DBLP] ICW/ICHSN/ICMCS/SENET, 2005, pp:268-274 [Conf] - Subir Bandyopadhyay, Arunita Jaekel, Yash P. Aneja, S. Saha
**A Comparative Study of Schemes for Robust Logical Topology Design in Wavelength Routed WDM Networks.**[Citation Graph (0, 0)][DBLP] Wireless and Optical Communications, 2006, pp:230-236 [Conf] - Santosh N. Kabadi, Yash P. Aneja
**Equivalence of epsilon-Approximate Separation and Optimization in Fixed Dimensions.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:29, n:4, pp:582-594 [Journal] - Yash P. Aneja, Hichem Kamoun
**Scheduling of parts and robot activities in a two machine robotic cell.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1999, v:26, n:4, pp:297-312 [Journal] - V. Aggarwal, Yash P. Aneja, K. P. K. Nair
**Minimal spanning tree subject to a side constraint.**[Citation Graph (0, 0)][DBLP] Computers & OR, 1982, v:9, n:4, pp:287-296 [Journal] - Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair
**Parametric Min-cuts Analysis in a Network.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:127, n:3, pp:679-689 [Journal] - R. Chandrasekaran, Kunhiraman Nair, Yash P. Aneja, Santosh N. Kabadi
**Multi-terminal multipath flows: synthesis.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:182-193 [Journal] - Abraham P. Punnen, Yash P. Aneja
**Minimum Dispersion Problems.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:75, n:1, pp:93-102 [Journal] - Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair
**Parametric analysis of overall min-cuts and applications in undirected networks.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:85, n:2, pp:105-109 [Journal] - Santosh N. Kabadi, Yash P. Aneja
**An Efficient, Strongly Polynomial, epsilon-Approximation Schemes.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:64, n:4, pp:173-177 [Journal] - Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair
**Maximizing residual flow under an arc destruction.**[Citation Graph (0, 0)][DBLP] Networks, 2001, v:38, n:4, pp:194-198 [Journal] - Abraham P. Punnen, Yash P. Aneja
**Lexicographic balanced optimization problems.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2004, v:32, n:1, pp:27-30 [Journal] - Yash P. Aneja, Ramaswamy Chandrasekaran, Santosh N. Kabadi, K. P. K. Nair
**Flows over edge-disjoint mixed multipaths and applications.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:15, pp:1979-2000 [Journal] - Yash P. Aneja, R. Chandrasekaran, K. P. K. Nair
**Minimal-cost system reliability with discrete-choice sets for components.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Reliability, 2004, v:53, n:1, pp:71-76 [Journal] **Minimum Energy Strong Bidirectional Topology for Ad Hoc Wireless Sensor Networks.**[Citation Graph (, )][DBLP]**Path Protection in Translucent WDM Optical Networks.**[Citation Graph (, )][DBLP]**A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks.**[Citation Graph (, )][DBLP]**Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks.**[Citation Graph (, )][DBLP]**A new approach for designing fault-tolerant WDM networks.**[Citation Graph (, )][DBLP]**An ant colony optimization metaheuristic for machine-part cell formation problems.**[Citation Graph (, )][DBLP]**Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic.**[Citation Graph (, )][DBLP]**Integer version of the multipath flow network synthesis problem.**[Citation Graph (, )][DBLP]
Search in 0.065secs, Finished in 0.067secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |