The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Frank K. Hwang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Frank K. Hwang, Wen-Dar Lin
    The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:204-212 [Conf]
  2. Ding-Zhu Du, Frank K. Hwang
    An Approach for Proving Lower Bounds: Solution of Gilbert-Pollak's Conjecture on Steiner Ratio [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:76-85 [Conf]
  3. Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang
    Minimal-Distance Routing for Kykios II. [Citation Graph (0, 0)][DBLP]
    ICPP, 1987, pp:546-549 [Conf]
  4. Frank K. Hwang, Wen-Dar Lin
    A General Construction for Nonblocking Crosstalk-Free Photonic Switching Networks. [Citation Graph (0, 0)][DBLP]
    ICPP Workshops, 2001, pp:297-301 [Conf]
  5. Amotz Bar-Noy, Ilan Kessler, Shay Kutten, Frank K. Hwang
    A New Competitive Algorithm for Group Testing. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1992, pp:786-793 [Conf]
  6. Miltos D. Grammatikakis, D. Frank Hsu, Frank K. Hwang
    Adaptive and Oblivious Algorithms for D-Cube Permutation Routing. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:167-175 [Conf]
  7. Miltos D. Grammatikakis, D. Frank Hsu, Frank K. Hwang
    Universality of D-Cube (D<8). [Citation Graph (0, 0)][DBLP]
    PARCO, 1993, pp:517-520 [Conf]
  8. Frank K. Hwang, S. K. Chen
    The 1.5-loop network and the mixed 1.5-loop network. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:297-306 [Conf]
  9. Frank K. Hwang, Shen Lin
    Optimal Merging of 2 Elements with n Elements [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1971, v:1, n:, pp:145-158 [Journal]
  10. Ding-Zhu Du, Frank K. Hwang
    A Proof of the Gilbert-Pollak Conjecture on the Steiner Ratio. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:2&3, pp:121-135 [Journal]
  11. Frank K. Hwang
    Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:2&3, pp:119-120 [Journal]
  12. Frank K. Hwang, Y. C. Yao
    Comments on Bern's Probabilistic Results on Rectilinear Steiner Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1990, v:5, n:4, pp:591-598 [Journal]
  13. Sailesh K. Rao, P. Sadayappan, Frank K. Hwang, Peter W. Shor
    The Rectilinear Steiner Arborescence Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:2&3, pp:277-288 [Journal]
  14. Amotz Bar-Noy, Frank K. Hwang, Ilan Kessler, Shay Kutten
    A New Competitive Algorithm for Group Testing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:52, n:1, pp:29-38 [Journal]
  15. Ding-Zhu Du, Frank K. Hwang
    Competitive Group Testing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:45, n:3, pp:221-232 [Journal]
  16. Peter C. Fishburn, Frank K. Hwang, Ding-Zhu Du, Biao Gao
    On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:75-87 [Journal]
  17. Frank K. Hwang, Wenan Zang
    Group testing and fault detection for replicated files. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:116, n:3, pp:231-242 [Journal]
  18. Xiao-Dong Hu, Frank K. Hwang
    An Improved Upper Bound for the Subarray Partial Concentrators. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:341-346 [Journal]
  19. Xiao-Dong Hu, Frank K. Hwang
    Cutting Numbers for the Forward Loop Backward Hop Network. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:48, n:2, pp:147-161 [Journal]
  20. Hua-Min Huang, Frank K. Hwang, Jian-Feng Ma
    Using transforming matrices to generate DNA clone grids. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:421-431 [Journal]
  21. Frank K. Hwang
    A competitive algorithm to find all defective edges in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:148, n:3, pp:273-277 [Journal]
  22. Frank K. Hwang
    The Time Complexity of Deterministic Broadcast Radio Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:219-222 [Journal]
  23. Frank K. Hwang, J. S. Lee
    Optimal quantitative group testing on cycles and paths. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:299-302 [Journal]
  24. Frank K. Hwang, J. S. Lee, Uriel G. Rothblum
    Permutation polytopes corresponding to strongly supermodular functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:142, n:1-3, pp:87-97 [Journal]
  25. Frank K. Hwang, Stavros G. Papastavridis
    Erratum: Binary Vectors with Exactly k Nonoverlapping m-Tuples of Consecutive ones. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:46, n:3, pp:283- [Journal]
  26. Frank K. Hwang, G. W. Richards
    The Capacity of the Subarray Partial Concentrators. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:39, n:3, pp:231-240 [Journal]
  27. Frank K. Hwang, Uriel G. Rothblum
    Constrained partitioning problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:50, n:1, pp:93-96 [Journal]
  28. Frank K. Hwang, Y. C. Yao, Miltos D. Grammatikakis
    A d-move Local Permutation Routing for the d-cube. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:72, n:3, pp:199-207 [Journal]
  29. Hung-Lin Fu, Frank K. Hwang
    A novel use of t-packings to construct d-disjunct matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:12, pp:1759-1762 [Journal]
  30. Hong-Bin Chen, Frank K. Hwang
    Exploring the missing link among d-separable, d_-separable and d-disjunct matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:5, pp:662-664 [Journal]
  31. Ting Chen, Frank K. Hwang
    A competitive algorithm in searching for many edges in a hypergraph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:4, pp:566-571 [Journal]
  32. Ding-Zhu Du, Frank K. Hwang, G. D. Song, G. Y. Ting
    Steiner Minimal Trees on Sets of Four Points. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:401-414 [Journal]
  33. Ding-Zhu Du, Frank K. Hwang, J. F. Weng
    Steiner Minimal Trees for Regular Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:65-84 [Journal]
  34. Frank K. Hwang, G. D. Song, G. Y. Ting, Ding-Zhu Du
    A Decomposition Theorem on Euclidean Steiner Minimal Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:367-382 [Journal]
  35. Chiuyuan Chen, Frank K. Hwang, J. S. Lee, S. J. Shih
    The existence of hyper-L triple-loop networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:287-291 [Journal]
  36. Ming-You Chen, Frank K. Hwang, Chih-Hung Yen
    Tessellating polyominos in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1139-1144 [Journal]
  37. Frank K. Hwang, J. S. Lee, Y. C. Liu, Uriel G. Rothblum
    Sortability of vector partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:129-142 [Journal]
  38. Frank K. Hwang, Xuding Zhu
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:253, n:1-3, pp:1-0 [Journal]
  39. Frank K. Hwang
    Extremal Permutations with Respect to Weak Majorizations. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:7, pp:637-645 [Journal]
  40. Frank K. Hwang, Gerard J. Chang
    Enumerating Consecutive and Nested Partitions for Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:1, pp:63-70 [Journal]
  41. Y. Cheng, Frank K. Hwang, Ian F. Akyildiz, D. Frank Hsu
    Routing Algorithms for Double Loop Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1992, v:3, n:3, pp:323-331 [Journal]
  42. J. Y. Guo, Frank K. Hwang
    An almost-linear time and linear space algorithm for the longest common subsequence problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:3, pp:131-135 [Journal]
  43. Xiao-Dong Hu, P. D. Chen, Frank K. Hwang
    A New Competitive Algorithm for the Counterfeit Coin Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:4, pp:213-218 [Journal]
  44. Frank K. Hwang, C. K. Pai
    Sequential construction of a circular consecutive-2 system. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:5, pp:231-235 [Journal]
  45. Frank K. Hwang
    An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:2, pp:177-182 [Journal]
  46. Frank K. Hwang, David N. Deutsch
    A Class of Merging Algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1973, v:20, n:1, pp:148-159 [Journal]
  47. Ying Cheng, Frank K. Hwang
    Diameters of Weighted Double Loop Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:3, pp:401-410 [Journal]
  48. Frank K. Hwang, J. F. Weng
    The Shortest Network under a Given Topology. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:3, pp:468-488 [Journal]
  49. Frank K. Hwang, Y. C. Liu
    Error-Tolerant Pooling Designs with Inhibitors. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2003, v:10, n:2, pp:231-236 [Journal]
  50. Hung-Lin Fu, Frank K. Hwang
    On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:9, n:3, pp:263-266 [Journal]
  51. Hsun-Wen Chang, Rong-Jaye Chen, Frank K. Hwang
    The Structural Birnbaum Importance of Consecutive-k Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2002, v:6, n:2, pp:183-197 [Journal]
  52. Gerard J. Chang, Fu-Loong Chen, Lingling Huang, Frank K. Hwang, Su-Tzu Nuan, Uriel G. Rothblum, I-Fan Sun, Jan-Wen Wang, Hong-Gwa Yeh
    Sortabilities of Partition Properties. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:4, pp:413-427 [Journal]
  53. Gerard J. Chang, Frank K. Hwang, Y. C. Yao
    Localizing Combinatorial Properties for Partitions on Block Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:4, pp:429-441 [Journal]
  54. Frank K. Hwang, Wen-Dar Lin
    The Incremental Group Testing Model for Gap Closing in Sequencing Long Molecules. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2003, v:7, n:4, pp:327-337 [Journal]
  55. Frank K. Hwang, Y. C. Liu
    Random Pooling Designs Under Various Structures. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2003, v:7, n:4, pp:339-352 [Journal]
  56. F. H. Chang, H. B. Chen, J. Y. Guo, Frank K. Hwang, Uriel G. Rothblum
    One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:11, n:3, pp:321-339 [Journal]
  57. Hong Gao, Frank K. Hwang, My T. Thai, Weili Wu, Taieb Znati
    Construction of d(H)-disjunct matrix for group testing in hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:12, n:3, pp:297-301 [Journal]
  58. Ding-Zhu Du, Frank K. Hwang
    A Multiplication Theorem for Balanced Howell Rotations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:37, n:2, pp:121-126 [Journal]
  59. Elwyn R. Berlekamp, Frank K. Hwang
    Constructions for Balanced Howell Rotations for Bridge Tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1972, v:12, n:2, pp:159-166 [Journal]
  60. Ding-Zhu Du, D. Frank Hsu, Frank K. Hwang, X. M. Zhang
    The Hamiltonian property of generalized de Bruijn digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:1-8 [Journal]
  61. Ding-Zhu Du, Frank K. Hwang, E. Y. Yao
    The Steiner Ratio Conjecture Is True for Five Points. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:38, n:2, pp:230-240 [Journal]
  62. Ding-Zhu Du, E. Y. Yao, Frank K. Hwang
    A Short Proof of a Result of Pollak on Steiner Minimal Trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:32, n:3, pp:396-400 [Journal]
  63. Frank K. Hwang
    New Constructions for Balanced Howell Rotations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:21, n:1, pp:44-51 [Journal]
  64. Frank K. Hwang
    New Classes of Complete Balanced Howell Rotations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:21, n:1, pp:86-92 [Journal]
  65. Frank K. Hwang
    Crisscross Latin Squares. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1979, v:27, n:3, pp:371-375 [Journal]
  66. Frank K. Hwang
    Selecting k Objects from a Cycle with p Pairs of Separation s. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:37, n:2, pp:197-199 [Journal]
  67. Frank K. Hwang, János Körner, V. K.-W. Wei
    Selecting Non-consecutive Balls Arranged in Many Lines. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:37, n:3, pp:327-336 [Journal]
  68. Frank K. Hwang, Qin De Kang, Jia En Yu
    Complete Balanced Howell Rotations for 16k + 12 Partnerships. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1984, v:36, n:1, pp:66-72 [Journal]
  69. Frank K. Hwang, Shen Lin
    A Direct Method to Construct Triple Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1974, v:17, n:1, pp:84-94 [Journal]
  70. Frank K. Hwang, S. Lin
    Neighbor Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1977, v:23, n:3, pp:302-313 [Journal]
  71. Frank K. Hwang, S. Lin
    Distribution of Integers into k-tuples with Prescribed Conditions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:25, n:2, pp:105-116 [Journal]
  72. Frank K. Hwang, Ko-Wei Lih
    Latin Squares and Superqueens. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1983, v:34, n:1, pp:110-114 [Journal]
  73. Frank K. Hwang, C. L. Mallows
    Enumerating Nested and Consecutive Partitions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:70, n:2, pp:323-333 [Journal]
  74. Jen-Chun Chang, Rong-Jaye Chen, Frank K. Hwang
    An Efficient Algorithm for the Reliability of Consecutive-k-n Networks. [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 2003, v:19, n:1, pp:159-166 [Journal]
  75. Chiuyuan Chen, Frank K. Hwang
    Equivalent L-Shapes of Double-Loop Networks for the Degenerate Case. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2000, v:1, n:1, pp:47-60 [Journal]
  76. S. K. Chen, Frank K. Hwang, Y. C. Liu
    Some Combinatorial Properties of Mixed Chordal Rings. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2003, v:4, n:1, pp:3-16 [Journal]
  77. Frank K. Hwang, B. C. Lin
    k-Diameters of the Hyper-L Shape Tile. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2002, v:3, n:3-4, pp:245-252 [Journal]
  78. Xiao-Dong Hu, Xiaohua Jia, Ding-Zhu Du, Frank K. Hwang
    Monotone Routing in Multirate Rearrangeable Clos Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:9, pp:1382-1388 [Journal]
  79. Frank K. Hwang, Y. C. Yao
    Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:1, pp:63-66 [Journal]
  80. Gerard J. Chang, Frank K. Hwang
    Optimality of consecutive and nested tree partitions. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:30, n:2, pp:75-80 [Journal]
  81. Gerard J. Chang, Frank K. Hwang, Li-Da Tong
    Characterizing bit permutation networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:4, pp:261-267 [Journal]
  82. Frank K. Hwang, Wen-Dar Lin
    A general construction for nonblocking crosstalk-free photonic switching networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:1, pp:20-25 [Journal]
  83. Frank K. Hwang, Paul E. Wright, Xiao-Dong Hu
    Exact reliabilities of most reliable double-loop networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:30, n:2, pp:81-90 [Journal]
  84. Frank K. Hwang, Chih-Hung Yen
    Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:1, pp:1-5 [Journal]
  85. Frank K. Hwang, Binwu Zhang
    Strict nonblockingness of reduced shuffle-exchange networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:1, pp:4-8 [Journal]
  86. G. W. Richards, Frank K. Hwang
    Extended generalized shuffle networks: Ssufficient conditions for strictly nonblocking operation. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:4, pp:269-291 [Journal]
  87. Chiuyuan Chen, Frank K. Hwang, James K. Lan
    Equivalence of buddy networks with arbitrary number of stages. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:46, n:4, pp:171-176 [Journal]
  88. Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum
    Linear-shaped partition problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:4, pp:159-163 [Journal]
  89. Frank K. Hwang, Tzai-Shunne Lin, Rong-Hong Jan
    A Permutation Routing Algorithm for Double Loop Networks. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1997, v:7, n:3, pp:259-265 [Journal]
  90. Ding-Zhu Du, Frank K. Hwang
    Reducing the Steiner Problem in a Normed Space. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:6, pp:1001-1007 [Journal]
  91. Ding-Zhu Du, Biao Gao, Frank K. Hwang, J. H. Kim
    On Multirate Rearrangeable Clos Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:463-470 [Journal]
  92. Frank K. Hwang
    Optimal Merging of 3 Elements with n Elements. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:2, pp:298-320 [Journal]
  93. Frank K. Hwang, Shen Lin
    A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1972, v:1, n:1, pp:31-39 [Journal]
  94. Ding-Zhu Du, Frank K. Hwang
    Optimal Assembly of an s-Stage k-OUT-OF-n System. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:3, pp:349-354 [Journal]
  95. Xian M. Chang, Frank K. Hwang, J. F. Weng
    Optimal Detection of Two Defectives with a Parity Check Device. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:1, pp:38-44 [Journal]
  96. W. R. Chen, Frank K. Hwang, Xuding Zhu
    Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:17, n:3, pp:446-452 [Journal]
  97. Ding-Zhu Du, Frank K. Hwang, Xiaohua Jia, Hung Q. Ngo
    Optimal Consecutive-k-out-of-n: G Cycle for n \leq 2k+1. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:3, pp:305-316 [Journal]
  98. Ding-Zhu Du, Frank K. Hwang, Guoliang Xue
    Interconnecting Highways. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:2, pp:252-261 [Journal]
  99. S. H. Huang, Frank K. Hwang
    When is Individual Testing Optimal for Nonadaptive Group Testing? [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:4, pp:540-548 [Journal]
  100. Frank K. Hwang
    Y. C. Yao: Cutoff Point and Monotonicity Properties for Multinomial Group Testing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:4, pp:500-507 [Journal]
  101. Frank K. Hwang, Uriel G. Rothblum, Larry A. Shepp
    Monotone Optimal Multipartitions Using Schur Convexity with Respect to Partial Orders. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:4, pp:533-547 [Journal]
  102. Y. C. Yao, Frank K. Hwang
    A Fundamental Monotonicity in Group Testing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:2, pp:256-259 [Journal]
  103. Chiuyuan Chen, Frank K. Hwang
    The Minimum Distance Diagram of Double-Loop Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2000, v:49, n:9, pp:977-979 [Journal]
  104. Ding-Zhu Du, D. Frank Hsu, Frank K. Hwang
    Doubly Linked Ring Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1985, v:34, n:9, pp:853-855 [Journal]
  105. M. R. Garey, Frank K. Hwang, David S. Johnson
    Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1977, v:26, n:4, pp:321-328 [Journal]
  106. Frank K. Hwang
    Comments on ``Reliable Loop Topologies for Large Local Computer Networks''. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1987, v:36, n:3, pp:383-384 [Journal]
  107. Frank K. Hwang
    Comments on "Network Resilience: A Measure of Network Fault Tolerance". [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:12, pp:1451-1452 [Journal]
  108. Frank K. Hwang
    A Modification to a Decomposition Algorithm of Gordon and Srikanthan. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1997, v:46, n:8, pp:958-960 [Journal]
  109. Frank K. Hwang, Paul E. Wright
    Survival Reliability of Some Double-Loop Networks and Chordal Rings. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1995, v:44, n:12, pp:1468-1471 [Journal]
  110. Frank K. Hwang, P. J. Wan
    Comparing File Copies with at Most Three Disagreeing Pages. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1997, v:46, n:6, pp:716-718 [Journal]
  111. Frank K. Hwang
    A unifying approach to determine the necessary and sufficient conditions for nonblocking multicast 3-stage Clos networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2005, v:53, n:9, pp:1581-1586 [Journal]
  112. Frank K. Hwang, Wen-Dar Lin
    Necessary and sufficient conditions for rearrangeable Log/sub d/(N, m, p). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2005, v:53, n:12, pp:2020-2023 [Journal]
  113. Xuewen Bao, Frank K. Hwang, Qiao Li
    Rearrangeability of bit permutation networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:352, n:1-3, pp:197-214 [Journal]
  114. F. H. Chang, J. Y. Guo, Frank K. Hwang
    Wide-sense nonblocking for multi-logdN networks under various routing strategies. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:352, n:1-3, pp:232-239 [Journal]
  115. F. H. Chang, J. Y. Guo, Frank K. Hwang, C. K. Lin
    Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:314, n:3, pp:375-386 [Journal]
  116. B. Gao, Frank K. Hwang
    Wide-Sense Nonblocking for Multirate 3-Stage Clos Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:182, n:1-2, pp:171-182 [Journal]
  117. Frank K. Hwang
    A complementary survey on double-loop networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:211-229 [Journal]
  118. Frank K. Hwang
    A survey on multi-loop networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:107-121 [Journal]
  119. Frank K. Hwang, Y. C. Yao, B. DasGupta
    Some permutation routing algorithms for low-dimensional hypercubes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:111-124 [Journal]
  120. Li-Da Tong, Frank K. Hwang, Gerard J. Chang
    Channel graphs of bit permutation networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:139-143 [Journal]
  121. Kuo-Hui Tsai, Da-Wei Wang, Frank K. Hwang
    Lower bounds for wide-sense nonblocking Clos network. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:261, n:2, pp:323-328 [Journal]
  122. Frank K. Hwang, Xian M. Chang
    Cutoff points for roll call protocols in multiple access systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:4, pp:577-581 [Journal]
  123. Frank K. Hwang, Lawrence A. Shepp
    Some inequalities concerning random subsets of a set. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:4, pp:596-0 [Journal]
  124. Frank K. Hwang, Y. C. Yao
    A generalization of the monotonicity theorem in group testing with applications to random multiaccess channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:3, pp:698-0 [Journal]
  125. Y. C. Yao, Frank K. Hwang
    On the cutoff point for pairwise enabling for infinite users in a multiaccess system. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:5, pp:1183-0 [Journal]
  126. Frank K. Hwang, Sheng-Chyang Liaw
    On nonblocking multicast three-stage Clos networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2000, v:8, n:4, pp:535-539 [Journal]
  127. Frank K. Hwang, Wen-Dar Lin, Vadim Lioubimov
    On noninterruptive rearrangeable networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2006, v:14, n:5, pp:1141-1149 [Journal]
  128. Frank K. Hwang, Wenan Zang
    Detecting Corrupted Pages in M Replicated Large Files. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:12, pp:1241-1245 [Journal]
  129. F. H. Chang, J. Y. Guo, Frank K. Hwang, J. S. Lee
    Counting disjoint 2-partitions for points in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2087-2092 [Journal]
  130. Peter C. Fishburn, Frank K. Hwang, Hikyu Lee
    Do local majorities force a global majority? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:165-179 [Journal]
  131. Frank K. Hwang, J. F. Weng
    Hexagonal coordinate systems and steiner minimal trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:1, pp:49-57 [Journal]
  132. F. K. Hwang, Victor K.-W. Wei
    A partition identity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:46, n:3, pp:323-326 [Journal]
  133. Frank K. Hwang, Jia Feng Weng, Ding-Zhu Du
    A class of full Steiner minimal trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:45, n:1, pp:107-112 [Journal]
  134. Frank K. Hwang, Uriel G. Rothblum, Yi-Ching Yao
    Localizing combinatorial properties of partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:160, n:1-3, pp:1-23 [Journal]
  135. H. B. Chen, Ding-Zhu Du, Frank K. Hwang
    An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:121-129 [Journal]
  136. Frank K. Hwang, F. H. Chang
    The identification of positive clones in a general inhibitor model. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:7, pp:1090-1094 [Journal]

  137. Sphere-separable partitions of multi-parameter elements. [Citation Graph (, )][DBLP]


  138. Equivalence of permutation polytopes corresponding to strictly supermodular functions. [Citation Graph (, )][DBLP]


  139. The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks. [Citation Graph (, )][DBLP]


Search in 0.035secs, Finished in 0.039secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002