Personal Home Page

http://optimization.asu.edu

Articles in Scholarly Journals [Incomplete List]

1. Finding a Path Subject to Many Additive QoS Constraints
   IEEE/ACM Transactions on Networking, vol. 15, no. 1, pp. 201–211, 2007
2. Modelling gene functional linkages using yeast microarray data
   International Journal of Bioinformatics Research and Applications, vol. 3, no. 2, p. 170, 2007
3. Link Scheduling With Power Control for Throughput Enhancement in Multihop Wireless Networks
   IEEE Transactions on Vehicular Technology, vol. 55, no. 3, pp. 733–742, 2006
4. Constrained Shortest Link-Disjoint Paths Selection: A Network Programming Based Approach
   IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 53, no. 5, pp. 1174–1187, 2006
5. QoS Routing in Communication Networks: Approximation Algorithms Based on the Primal Simplex Method of Linear Programming
   IEEE Transactions on Computers, vol. 55, no. 7, pp. 815–829, 2006
6. On current areas of interest in wireless sensor networks designs
   Computer Communications, vol. 29, no. 4, pp. 409–412, 2006
7. A cost-minimization algorithm for fast location tracking in mobile wireless networks
   Computer Networks, vol. 50, no. 15, pp. 2713–2726, 2006
8. Reliable Ad Hoc Routing Based on Mobility Prediction
   Journal of Combinatorial Optimization, vol. 11, no. 1, pp. 71–85, 2006
9. Interference-aware routing and bandwidth allocation for QoS provisioning in multihop wireless networks
   Wireless Communications and Mobile Computing, vol. 5, no. 8, pp. 933–943, 2005
10. A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology
    Algorithmica , vol. 41, no. 1, pp. 53–72, 2004
11. Optimal multichannel data transmission in computer networks
    Computer Communications, vol. 26, no. 7, pp. 759–765, 2003
12. A PTAS for weight constrained Steiner trees in series–parallel graphs
    Theoretical Computer Science, vol. 304, no. 1-3, pp. 237–247, 2003
13. Minimum-cost QoS multicast and unicast routing in communication networks
    IEEE Transactions on Communications, vol. 51, no. 5, pp. 817–824, 2003
14. Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees
    IEEE Journal on Selected Areas in Communications, vol. 21, no. 8, pp. 1332–1345, 2003
15. Server cost minimization in a distributed servers architecture for on-demand video services
    IEEE Communications Letters, vol. 7, no. 2, pp. 52–54, 2003
16. Guest editorial - 50th anniversary of clos networks
    IEEE Communications Magazine, vol. 41, no. 10, pp. 26–27, 2003
17. An improved random walk model for PCS networks
    IEEE Transactions on Communications, vol. 50, no. 8, pp. 1224–1226, 2002
18. On the terminal Steiner tree problem
    Information Processing Letters, vol. 84, no. 2, pp. 103–107, 2002
19. Fast evaluation of potential and force field in particle systems using a fair-split tree spatial structure
    Optimization Methods and Software, vol. 14, no. 4, pp. 245–265, 2001
20. Grade of Service Steiner Minimum Trees in the Euclidean Plane
    Algorithmica, vol. 31, no. 4, pp. 479–500, 2001
21. Reducing the Steiner problem in four uniform orientations
    Networks, vol. 35, no. 4, pp. 287–301, 2000
22. Journal of Global Optimization, vol. 18, no. 1, pp. 17–33, 2000
23. Journal of Combinatorial Optimization, vol. 4, no. 2, pp. 217–233, 2000
24. An Efficient Algorithm for Minimizing a Sum of p-Norms
    SIAM Journal on Optimization, vol. 10, no. 2, p. 551, 2000
25. Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources
    SIAM Journal on Optimization, vol. 10, no. 1, p. 22, 1999
26. On Rearrangeability of Multirate Clos Networks
    SIAM Journal on Computing, vol. 28, no. 4, p. 1225, 1999
27. Interconnecting Highways
    SIAM Journal on Discrete Mathematics, vol. 12, no. 2, p. 252, 1999
28. Optimal multicast trees in communication systems with channel capacities and channel reliabilities
    IEEE Transactions on Communications, vol. 47, no. 5, pp. 662–663, 1999
29. Journal of Global Optimization, vol. 14, no. 3, pp. 299–312, 1999
30. Steiner tree problem with minimum number of Steiner points and bounded edge-length
    Information Processing Letters, vol. 69, no. 2, pp. 53–57, 1999
31. Algorithms for a Class of Isotonic Regression Problems
    Algorithmica, vol. 23, no. 3, pp. 211–222, 1999
32. An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology
    Algorithmica, vol. 23, no. 4, pp. 354–362, 1999
33. Fast data transmission and maximal dynamic flow
    Information Processing Letters, vol. 66, no. 3, pp. 127–132, 1998
34. A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges
    Theoretical Computer Science, vol. 209, no. 1-2, pp. 331–345, 1998
35. An O(n) time hierarchical tree algorithm for computing force field in n-body simulations
    Theoretical Computer Science, vol. 197, no. 1-2, pp. 157–169, 1998
36. End-to-end data paths: quickest or most reliable?
    IEEE Communications Letters, vol. 2, no. 6, pp. 156–158, 1998
37. Journal of Global Optimization, vol. 11, no. 1, pp. 55–68, 1997
38. Journal of Global Optimization, vol. 11, no. 1, pp. 83–90, 1997
39. Linear time algorithms for computing the most reliable source on an unreliable tree network
    Networks, vol. 30, no. 1, pp. 37–45, 1997
40. An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
    SIAM Journal on Optimization, vol. 7, no. 4, p. 1017, 1997
41. A polynomial time dual algorithm for the Euclidean multifacility location problem
    Operations Research Letters, vol. 18, no. 4, pp. 201–204, 1996
42. SIAM Journal on Computing, vol. 23, no. 1, Article ID 0223007, 1994