Articles in Scholarly Journals [Incomplete List]

1. Theoretical Computer Science, vol. 378, no. 3, pp. 209–210, 2007
2. Genetic networks: processing data, regulatory network modelling and their analysis
   Optimization Methods and Software, vol. 22, no. 1, pp. 169–185, 2007
3. Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
   IEEE Transactions on Mobile Computing, vol. 6, no. 7, pp. 721–730, 2007
4. On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay
   IEEE Transactions on Mobile Computing, vol. 5, no. 10, pp. 1460–1470, 2006
5. Wireless Network Security
   EURASIP Journal on Wireless Communications and Networking, vol. 2006, Article ID 48374, 2 pages, 2006
6. New Construction for Transversal Design
   Journal of Computational Biology, vol. 13, no. 4, pp. 990–995, 2006
7. GeoSENS: geo-based sensor network secure communication protocol
   Computer Communications, vol. 29, no. 4, pp. 456–461, 2006
8. Optimal Relay Location for Resource-limited Energy-efficient Wireless Communication
   Journal of Global Optimization, vol. 36, no. 3, pp. 391–399, 2006
9. Recent advances in wirelessad hoc networks
   Wireless Communications and Mobile Computing, vol. 6, no. 2, pp. 147–149, 2006
10. Location management in mobile ad hoc wireless networks using quorums and clusters
    Wireless Communications and Mobile Computing, vol. 5, no. 7, pp. 793–803, 2005
11. On greedy construction of connected dominating sets in wireless networks
    Wireless Communications and Mobile Computing, vol. 5, no. 8, pp. 927–932, 2005
12. Improving Wireless Sensor Network Lifetime through Power Aware Organization
    Wireless Networks, vol. 11, no. 3, pp. 333–340, 2005
13. A combination of wireless multicast advantage and hitch-hiking
    IEEE Communications Letters, vol. 9, no. 12, pp. 1037–1039, 2005
14. Topology control of ad hoc wireless networks for energy efficiency
    IEEE Transactions on Computers, vol. 53, no. 12, pp. 1629–1635, 2004
15. An optimization model for placement of wavelength converters to minimize blocking probability in WDM networks
    Journal of Lightwave Technology, vol. 21, no. 3, pp. 684–694, 2003
16. On the optimal placement of wavelength converters in WDM networks
    Computer Communications, vol. 26, no. 9, pp. 986–995, 2003
17. Lower bounds on the minus domination and k-subdomination numbers
    Theoretical Computer Science, vol. 296, no. 1, pp. 89–98, 2003
18. Journal of Global Optimization, vol. 25, no. 1, pp. 43–54, 2003
19. Journal of Global Optimization, vol. 25, no. 1, pp. 91–111, 2003
20. A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
    Networks, vol. 42, no. 4, pp. 202–208, 2003
21. Rivest–Vuillemin conjecture is true for monotone boolean functions with twelve variables
    Discrete Mathematics, vol. 253, no. 1-3, pp. 19–34, 2002
22. On connectivity of consecutive-d digraphs
    Discrete Mathematics, vol. 257, no. 2-3, pp. 371–384, 2002
23. Approximations for a Bottleneck Steiner Tree Problem
    Algorithmica, vol. 32, no. 4, pp. 554–561, 2002
24. New bounds on a hypercube coloring problem
    Information Processing Letters, vol. 0, no. 3, p. 0, 2002
25. Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1
    SIAM Journal on Discrete Mathematics, vol. 15, no. 3, p. 305, 2002
26. Optimization of wavelength assignment for QoS multicast in WDM networks
    IEEE Transactions on Communications, vol. 49, no. 2, pp. 341–350, 2001
27. Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks
    Computer Communications, vol. 24, no. 14, pp. 1390–1399, 2001
28. Multirate multicast switching networks
    Theoretical Computer Science, vol. 261, no. 2, pp. 241–251, 2001
29. Approximations for Steiner trees with minimum number of Steiner points
    Theoretical Computer Science, vol. 262, no. 1-2, pp. 83–99, 2001
30. Journal of Optimization Theory and Applications, vol. 110, no. 3, pp. 545–556, 2001
31. Journal of Global Optimization, vol. 19, no. 1, pp. 51–60, 2001
32. Grade of Service Steiner Minimum Trees in the Euclidean Plane
    Algorithmica, vol. 31, no. 4, pp. 479–500, 2001
33. Placement of Data Replicas for Optimal Data Availability in Ring Networks
    Journal of Parallel and Distributed Computing, vol. 61, no. 10, pp. 1412–1424, 2001
34. Monotone Routing in Multirate Rearrangeable Clos Networks
    Journal of Parallel and Distributed Computing, vol. 61, no. 9, pp. 1382–1388, 2001
35. Journal of Global Optimization, vol. 18, no. 1, pp. 17–33, 2000
36. A coloring problem on the n-cube
    Discrete Applied Mathematics, vol. 103, no. 1-3, pp. 307–311, 2000
37. Performance of split routing algorithm for three-stage multicast networks
    IEEE/ACM Transactions on Networking, vol. 8, no. 4, pp. 526–534, 2000
38. Fault tolerance properties of pyramid networks
    IEEE Transactions on Computers, vol. 48, no. 1, pp. 88–93, 1999
39. The Rivest–Vuillemin Conjecture on Monotone Boolean Functions Is True for Ten Variables
    Journal of Complexity, vol. 15, no. 4, pp. 526–536, 1999
40. 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
41. Interconnecting Highways
    SIAM Journal on Discrete Mathematics, vol. 12, no. 2, p. 252, 1999
42. On Rearrangeability of Multirate Clos Networks
    SIAM Journal on Computing, vol. 28, no. 4, p. 1225, 1999
43. On Multirate Rearrangeable Clos Networks
    SIAM Journal on Computing, vol. 28, no. 2, p. 463, 1998
44. Thek-Steiner Ratio in the Rectilinear Plane
    Journal of Algorithms, vol. 29, no. 1, pp. 1–17, 1998
45. Real-Time Systems, vol. 15, no. 3, pp. 249–273, 1998
46. Super line-connectivity of consecutive-d digraphs
    Discrete Mathematics, vol. 183, no. 1-3, pp. 27–38, 1998
47. On 1-rate wide-sense nonblocking for 3-stage Clos networks
    Discrete Applied Mathematics, vol. 78, no. 1-3, pp. 75–87, 1997
48. A special case for subset interconnection designs
    Discrete Applied Mathematics, vol. 78, no. 1-3, pp. 51–60, 1997
49. A ? competitive algorithm for the counterfeit coin problem
    Discrete Mathematics, vol. 163, no. 1-3, pp. 173–200, 1997
50. The Steiner ratio for the dual normed plane
    Discrete Mathematics, vol. 171, no. 1-3, pp. 261–275, 1997
51. The k-Steiner Ratio in Graphs
    SIAM Journal on Computing, vol. 26, no. 3, p. 857, 1997
52. Disproofs of Generalized Gilbert–Pollak Conjecture on the Steiner Ratio in Three or More Dimensions
    Journal of Combinatorial Theory, Series A, vol. 74, no. 1, pp. 115–130, 1996
53. Convergence properties of optimization algorithms for the SAT problem
    IEEE Transactions on Computers, vol. 45, no. 2, pp. 209–219, 1996
54. On complexity of subset interconnection designs
    Journal of Global Optimization, vol. 6, no. 2, pp. 193–205, 1995
55. On greedy heuristics for steiner minimum trees
    Algorithmica, vol. 13, no. 4, pp. 381–386, 1995
56. A continuous version of a result of Du and Hwang
    Journal of Global Optimization, vol. 5, no. 2, pp. 127–129, 1994
57. SIAM Journal on Computing, vol. 23, no. 1, Article ID 0223007, 1994
58. SIAM Journal on Computing, vol. 23, no. 5, Article ID 0223063, 1994
59. A test problem generator for the Steiner problem in graphs
    ACM Transactions on Mathematical Software, vol. 19, no. 4, pp. 509–522, 1993
60. Minimum steiner trees in normed planes
    Discrete & Computational Geometry, vol. 9, no. 1, pp. 351–370, 1993
61. Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
    IEEE Transactions on Computers, vol. 42, no. 5, pp. 612–616, 1993
62. On better heuristics for Steiner minimum trees
    Mathematical Programming, vol. 57, no. 1-3, pp. 193–202, 1992
63. On Steiner minimal trees withL p distance
    Algorithmica, vol. 7, no. 1, pp. 179–191, 1992
64. On steiner ratio conjectures
    Annals of Operations Research, vol. 33, no. 6, pp. 437–449, 1991
65. Global convergence of Rosen's gradient projection method
    Mathematical Programming, vol. 44, no. 1-3, pp. 357–366, 1989
66. On inefficient special cases of NP-complete problems
    Theoretical Computer Science, vol. 63, no. 3, pp. 239–252, 1989
67. The structure of generalized complexity cores
    Theoretical Computer Science, vol. 61, no. 2-3, pp. 103–119, 1988
68. A direct algorithm for computing reliability of a consecutive-k cycle
    IEEE Transactions on Reliability, vol. 37, no. 1, pp. 70–72, 1988
69. On optimal routing trees
    IEEE Transactions on Circuits and Systems, vol. 35, no. 10, pp. 1335–1337, 1988
70. The existence and density of generalized complexity cores
    Journal of the ACM, vol. 34, no. 3, pp. 718–730, 1987
71. A convergence theorem of Rosen’s gradient projection method
    Mathematical Programming, vol. 36, no. 2, pp. 135–144, 1986
72. On a conjecture of trietsch and handler on the flow-dependent steiner ratio
    Networks, vol. 16, no. 1, pp. 47–50, 1986
73. An optimization problem on graphs
    Discrete Applied Mathematics, vol. 14, no. 1, pp. 101–104, 1986
74. Optimal consecutive-2 systems of lines and cycles
    Networks, vol. 15, no. 4, pp. 439–447, 1985
75. Doubly Linked Ring Networks
    IEEE Transactions on Computers, vol. C-34, no. 9, pp. 853–855, 1985