The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ming-Yang Kao: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tsan-sheng Hsu, Ming-Yang Kao
    Optimal Bi-Level Augmentation for Selectivity Enhancing Graph Connectivity with Applications. [Citation Graph (1, 0)][DBLP]
    COCOON, 1996, pp:169-178 [Conf]
  2. Tsan-sheng Hsu, Ming-Yang Kao
    Optimal Augmentation for Bipartite Componentwise Biconnectiviy in Linear Time (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    ISAAC, 1996, pp:213-222 [Conf]
  3. Tsan-sheng Hsu, Ming-Yang Kao
    Security Problems for Statistical Databases with General Cell Suppressions. [Citation Graph (1, 18)][DBLP]
    SSDBM, 1997, pp:155-164 [Conf]
  4. Alok Aggarwal, Richard J. Anderson, Ming-Yang Kao
    Parallel Depth-First Search in General Directed Graphs (Preliminary Version) [Citation Graph (1, 0)][DBLP]
    STOC, 1989, pp:297-308 [Conf]
  5. Ming-Yang Kao, Gregory E. Shannon
    Local Reorientation, Global Order, and Planar Topology (Preliminary Version) [Citation Graph (1, 0)][DBLP]
    STOC, 1989, pp:286-296 [Conf]
  6. Ming-Yang Kao
    Linear-Time Optimal Augmentation for Componentwise Bipartite-Completeness of Graphs. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:1, pp:59-63 [Journal]
  7. Ming-Yang Kao
    Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:231-242 [Journal]
  8. Ming-Yang Kao
    Data Security Equals Graph Connectivity. [Citation Graph (1, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:1, pp:87-100 [Journal]
  9. Ming-Yang Kao
    Algorithmic DNA Self-assembly. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:10- [Conf]
  10. Ming-Yang Kao
    Minimal Linear Invariants. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1995, pp:23-33 [Conf]
  11. Ming-Yang Kao
    All Graphs have Cycle Separators and Planar Directed Depth-First Search is in DNC. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:53-63 [Conf]
  12. Samuel Ieong, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu
    Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs. [Citation Graph (0, 0)][DBLP]
    BIBE, 2001, pp:183-190 [Conf]
  13. Ming-Yang Kao
    Tree Contractions and Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:299-310 [Conf]
  14. Ming-Yang Kao, Manan Sanghi
    An Approximation Algorithm for a Bottleneck Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:223-235 [Conf]
  15. Ming-Yang Kao, Junfeng Qi, Lei Tan
    Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:192-201 [Conf]
  16. Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
    A Faster and Unifying Algorithm for Comparing Trees. [Citation Graph (0, 0)][DBLP]
    CPM, 2000, pp:129-142 [Conf]
  17. S. Azhar, Greg J. Badros, A. Glodjo, Ming-Yang Kao, John H. Reif
    Data Compression Techniques for Stock Market Prediction. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1994, pp:72-82 [Conf]
  18. Karhan Akcoglu, Ming-Yang Kao, Shuba V. Raghavan
    Fast Pricing of European Asian Options with Provable Accuracy: Single-Stock and Basket Options. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:404-415 [Conf]
  19. Ting Chen, Ming-Yang Kao
    On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:248-256 [Conf]
  20. Xin He, Ming-Yang Kao, Hsueh-I Lu
    A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:540-549 [Conf]
  21. Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
    A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:438-449 [Conf]
  22. Baruch Awerbuch, Yossi Azar, Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter
    Load Balancing in the Lp Norm. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:383-391 [Conf]
  23. Xin He, Ming-Yang Kao
    Regular Edge Labelings and Drawings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:96-103 [Conf]
  24. Jia Wang, Ming-Yang Kao, Hai Zhou
    Address generation for nanowire decoders. [Citation Graph (0, 0)][DBLP]
    ACM Great Lakes Symposium on VLSI, 2007, pp:525-528 [Conf]
  25. Karhan Akcoglu, Petros Drineas, Ming-Yang Kao
    Fast Universalization of Investment Strategies with Provably Good Relative Returns. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:888-900 [Conf]
  26. Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu
    Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:118-129 [Conf]
  27. Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
    Randomized Fast Design of Short DNA Words. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1275-1286 [Conf]
  28. Ming-Yang Kao, Jie Wang
    Efficient Minimization of Numerical Summation Errors. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:375-386 [Conf]
  29. Jyh-Shing Roger Jang, Hong-Ru Lee, Ming-Yang Kao
    Content-based Music Retrieval Using Linear Scaling and Branch-and-bound Tree Search. [Citation Graph (0, 0)][DBLP]
    ICME, 2001, pp:- [Conf]
  30. Ching-Tien Ho, Ming-Yang Kao
    Optimal Broadcast in All-Port Wormhole-Routed Hypercubes. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1994, pp:167-171 [Conf]
  31. James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah
    A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:403-415 [Conf]
  32. Kiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
    A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:100-110 [Conf]
  33. Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu
    Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:84-95 [Conf]
  34. Xin He, Ming-Yang Kao
    Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:303-312 [Conf]
  35. Wing-Kai Hon, Ming-Yang Kao, Tak Wah Lam
    Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:527-538 [Conf]
  36. Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
    Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:479-490 [Conf]
  37. Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
    All-Cavity Maximum Matchings. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:364-373 [Conf]
  38. Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
    Average Case Analysis for Tree Labelling Schemes. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:136-145 [Conf]
  39. Ming-Yang Kao, Vijay Ramachandran
    DNA Self-Assembly For Constructing 3D Boxes. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:429-440 [Conf]
  40. Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
    Flexible Word Design and Graph Labeling. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:48-60 [Conf]
  41. Ming-Yang Kao, Shang-Hua Teng
    Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:451-459 [Conf]
  42. Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
    Towards truthful mechanisms for binary demand games: a general framework. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2005, pp:213-222 [Conf]
  43. Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang Kao, Robert T. Schweller
    Complexities for generalized models of self-assembly. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:880-889 [Conf]
  44. James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar
    Towards understanding the predictability of stock markets from the perspective of computational complexity. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:745-754 [Conf]
  45. Zhi-Zhong Chen, Xin He, Ming-Yang Kao
    Nonplanar Topological Inference and Political-Map Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:195-204 [Conf]
  46. Ting Chen, Ming-Yang Kao, Matthew Tepel, John Rush, George M. Church
    A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:389-398 [Conf]
  47. Miklós Csürös, Ming-Yang Kao
    Recovering Evolutionary Trees Through Harmonic Greedy Triplets. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:261-270 [Conf]
  48. Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin
    Optimal Constructions of Hybrid Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:372-381 [Conf]
  49. Ming-Yang Kao, John H. Reif, Stephen R. Tate
    Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:441-447 [Conf]
  50. Ming-Yang Kao, Robert T. Schweller
    Reducing tile complexity for self-assembly through temperature programming. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:571-580 [Conf]
  51. Ming-Yang Kao, Stephen R. Tate
    On-Line Difference Maximization. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:175-182 [Conf]
  52. Ming-Yang Kao, Stephen R. Tate
    Designing Proxies for Stock Market Indices is Computationally Hard. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:933-934 [Conf]
  53. Zhichun Li, Manan Sanghi, Yan Chen, Ming-Yang Kao, Brian Chavez
    Hamsa: Fast Signature Generation for Zero-day PolymorphicWorms with Provable Attack Resilience. [Citation Graph (0, 0)][DBLP]
    S&P, 2006, pp:32-47 [Conf]
  54. Martin Fürer, Xin He, Ming-Yang Kao, Balaji Raghavachari
    O(n log log n)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:410-419 [Conf]
  55. Ming-Yang Kao
    Total Protection of Analytic Invariant Information in Cross Tabulated Tables. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:723-734 [Conf]
  56. Ming-Yang Kao, Andrzej Lingas, Anna Östlin
    Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:184-196 [Conf]
  57. Zhi-Zhong Chen, Ming-Yang Kao
    Reducing Randomness via Irrational Numbers. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:200-209 [Conf]
  58. Gen-Huey Chen, Ming-Yang Kao, Yuh-Dauh Lyuu, Hsing-Kuo Wong
    Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:119-128 [Conf]
  59. Anja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng
    Optimal online scheduling of parallel jobs with dependencies. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:642-651 [Conf]
  60. Ming-Yang Kao, Philip N. Klein
    Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:181-192 [Conf]
  61. Ming-Yang Kao, Tak Wah Lam, Teresa M. Przytycka, Wing-Kin Sung, Hing-Fung Ting
    General Techniques for Comparing Unrooted Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:54-65 [Conf]
  62. Ming-Yang Kao, Andreas Nolte, Stephen R. Tate
    The risk profile problem for stock portfolio optimization (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:228-234 [Conf]
  63. Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
    Tight Approximability Results for Test Set Problems in Bioinformatics. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:39-50 [Conf]
  64. Ming-Yang Kao, Jared Samet, Wing-Kin Sung
    The Enhanced Double Digest Problem for DNA Physical Mapping. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:383-392 [Conf]
  65. Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
    Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:157-171 [Conf]
  66. Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder
    Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:419-433 [Conf]
  67. Man-yee Chan, Joseph Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao
    Linear-Time Haplotype Inference on Pedigrees Without Recombinations. [Citation Graph (0, 0)][DBLP]
    WABI, 2006, pp:56-67 [Conf]
  68. Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter
    Online Perfect Matching and Mobile Computing. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:194-205 [Conf]
  69. Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama
    Improved Parallel Depth-First Search in Undirected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:409-420 [Conf]
  70. Dan Gusfield, Ming-Yang Kao
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:25, n:2-3, pp:141- [Journal]
  71. Ming-Yang Kao, A. S. Kyle, P. Lakner
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:25, n:1, pp:1- [Journal]
  72. Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama
    An Optimal Parallel Algorithm for Planar Cycle Separators. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:5, pp:398-408 [Journal]
  73. Ming-Yang Kao, Vijay Ramachandran
    DNA Self-Assembly For Constructing 3D Boxes [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  74. James Aspnes, David F. Fischer, Michael J. Fischer, Ming-Yang Kao, Alok Kumar
    Towards Understanding the Predictability of Stock Markets from the Perspective of Computational Complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  75. Karhan Akcoglu, James Aspnes, Bhaskar DasGupta, Ming-Yang Kao
    Opportunity Cost Algorithms for Combinatorial Auctions [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  76. Ming-Yang Kao, Stephen R. Tate
    Designing Proxies for Stock Market Indices is Computationally Hard [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  77. Gen-Huey Chen, Ming-Yang Kao, Yuh-Dauh Lyuu, Hsing-Kuo Wong
    Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  78. Ming-Yang Kao, Junfeng Qi, Lei Tan
    Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  79. James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah
    Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  80. Ting Chen, Ming-Yang Kao, Matthew Tepel, John Rush, George M. Church
    A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  81. Ming-Yang Kao
    Tree Contractions and Evolutionary Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  82. Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
    Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  83. Karhan Akcoglu, Ming-Yang Kao, Shuba V. Raghavan
    Fast Pricing of European Asian Options with Provable Accuracy: Single-stock and Basket Options [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  84. Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu
    Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  85. Ming-Yang Kao, Jared Samet, Wing-Kin Sung
    The Enhanced Double Digest Problem for DNA Physical Mapping [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  86. Ming-Yang Kao, Andreas Nolte, Stephen R. Tate
    The Risk Profile Problem for Stock Portfolio Optimization [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  87. Samuel Ieong, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu
    Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  88. Karhan Akcoglu, Petros Drineas, Ming-Yang Kao
    Fast Universalization of Investment Strategies with Provably Good Relative Returns [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  89. Ming-Yang Kao
    Total Protection of Analytic Invariant Information in Cross Tabulated Tables [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  90. Ming-Yang Kao
    Data Security Equals Graph Connectivity [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  91. Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
    An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  92. Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin
    Optimal Constructions of Hybrid Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  93. Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
    A Decomposition Theorem for Maximum Weight Bipartite Matchings [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  94. Miklós Csürös, Ming-Yang Kao
    Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  95. Xin He, Ming-Yang Kao, Hsueh-I Lu
    A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  96. Ming-Yang Kao, Stephen R. Tate
    On-Line Difference Maximization [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  97. Xin He, Ming-Yang Kao, Hsueh-I Lu
    Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  98. Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu
    Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  99. Zhi-Zhong Chen, Xin He, Ming-Yang Kao
    Common-Face Embeddings of Planar Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  100. Tsan-sheng Hsu, Ming-Yang Kao
    Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  101. Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
    Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  102. Wing-Kai Hon, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu
    Improved Phylogeny Comparisons: Non-Shared Edges Nearest Neighbor Interchanges, and Subtree Transfers [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  103. Zhi-Zhong Chen, Ming-Yang Kao
    Reducing Randomness via Irrational Numbers [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  104. Ming-Yang Kao, Jie Wang
    Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  105. Ming-Yang Kao
    Multiple-Size Divide-and-Conquer Recurrences [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  106. Ming-Yang Kao, John H. Reif, Stephen R. Tate
    Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:131, n:1, pp:63-79 [Journal]
  107. Wing-Kai Hon, Tak Wah Lam, Siu-Ming Yiu, Ming-Yang Kao, Wing-Kin Sung
    Subtree Transfer Distance For Degree-D Phylogenies. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:6, pp:893-909 [Journal]
  108. Wing-Kai Hon, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu
    Non-shared edges and nearest neighbor interchanges revisited. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:3, pp:129-134 [Journal]
  109. Ming-Yang Kao, Stephen R. Tate
    Online Matching with Blocked Input. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:3, pp:113-116 [Journal]
  110. Ming-Yang Kao, Fang Wan
    Not all Planar Digraphs have Small Cycle Separators. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:2, pp:79-83 [Journal]
  111. Ching-Tien Ho, Ming-Yang Kao
    Efficient Submesh Permutations in Wormhole-routed meshes. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1998, v:107, n:1-4, pp:1-13 [Journal]
  112. Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
    An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:40, n:2, pp:212-233 [Journal]
  113. Ming-Yang Kao, Yuan Ma, Michael Sipser, Yiqun Lisa Yin
    Optimal Constructions of Hybrid Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:1, pp:142-164 [Journal]
  114. Ting Chen, Ming-Yang Kao, Matthew Tepel, John Rush, George M. Church
    A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2001, v:8, n:3, pp:325-337 [Journal]
  115. James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah
    A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2002, v:9, n:5, pp:721-742 [Journal]
  116. Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder
    Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:4, pp:766-785 [Journal]
  117. Samuel Ieong, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu
    Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2003, v:10, n:6, pp:981-995 [Journal]
  118. Anja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng
    Optimal On-Line Scheduling of Parallel Jobs with Dependencies. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:1, n:4, pp:393-411 [Journal]
  119. Tsan-sheng Hsu, Ming-Yang Kao
    A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:3, pp:237-256 [Journal]
  120. Ming-Yang Kao
    Efficient Detection and Protection of Information in Cross Tabulated Tables II: Minimal Linear Invariants. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1997, v:1, n:2, pp:187-202 [Journal]
  121. Ming-Yang Kao, Neill Occhiogrosso, Shang-Hua Teng
    Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:4, pp:351-359 [Journal]
  122. Ming-Yang Kao, Jared Samet, Wing-Kin Sung
    The Enhanced Double Digest Problem for DNA Physical Mapping. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2003, v:7, n:1, pp:69-78 [Journal]
  123. Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
    Tight approximability results for test set problems in bioinformatics. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:2, pp:145-162 [Journal]
  124. Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
    Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:2, pp:128-144 [Journal]
  125. Ming-Yang Kao, Philip N. Klein
    Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:47, n:3, pp:459-500 [Journal]
  126. Ching-Tien Ho, Ming-Yang Kao
    Efficient Broadcast on Hypercubes with Wormhole and E-Cube Routings. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1995, v:5, n:, pp:213-222 [Journal]
  127. Alok Aggarwal, Richard J. Anderson, Ming-Yang Kao
    Parallel Depth-First Search in General Directed Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:2, pp:397-409 [Journal]
  128. Karhan Akcoglu, Petros Drineas, Ming-Yang Kao
    Fast Universalization of Investment Strategies. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:1, pp:1-22 [Journal]
  129. Zhi-Zhong Chen, Xin He, Ming-Yang Kao
    Common-Face Embeddings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:2, pp:408-434 [Journal]
  130. Zhi-Zhong Chen, Ming-Yang Kao
    Reducing Randomness via Irrational Numbers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:4, pp:1247-1256 [Journal]
  131. Gen-Huey Chen, Ming-Yang Kao, Yuh-Dauh Lyuu, Hsing-Kuo Wong
    Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:447-459 [Journal]
  132. Joseph Cheriyan, Ming-Yang Kao, Ramakrishna Thurimella
    Scan-First Search and Sparse Certificates: An Improved Parallel Algorithms for k-Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:157-174 [Journal]
  133. Miklós Csürös, Ming-Yang Kao
    Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:306-322 [Journal]
  134. Xin He, Ming-Yang Kao, Hsueh-I Lu
    A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:3, pp:838-846 [Journal]
  135. Ming-Yang Kao
    Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:3, pp:431-459 [Journal]
  136. Ming-Yang Kao
    Planar Strong Connectivity Helps in Parallel Depth-First Search. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:1, pp:46-62 [Journal]
  137. Ming-Yang Kao
    Tree Contractions and Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:6, pp:1592-1616 [Journal]
  138. Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
    Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:2, pp:602-624 [Journal]
  139. Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting
    A Decomposition Theorem for Maximum Weight Bipartite Matchings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:18-26 [Journal]
  140. Ming-Yang Kao, Junfeng Qi, Lei Tan
    Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:3, pp:955-969 [Journal]
  141. Ming-Yang Kao, Gregory E. Shannon
    Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:3, pp:460-481 [Journal]
  142. Ming-Yang Kao, Jie Wang
    Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1568-1576 [Journal]
  143. Xin He, Ming-Yang Kao, Hsueh-I Lu
    Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:3, pp:317-325 [Journal]
  144. Ming-Yang Kao, Martin Fürer, Xin He, Balaji Raghavachari
    Optimal Parallel Algorithms forStraight-Line Grid Embeddings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:4, pp:632-646 [Journal]
  145. Ming-Yang Kao, Dan Gusfield
    Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:3, pp:460-476 [Journal]
  146. Ming-Yang Kao, Stephen R. Tate
    On-Line Difference Maximization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:1, pp:78-90 [Journal]
  147. Tsan-sheng Hsu, Ming-Yang Kao
    Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:2, pp:345-362 [Journal]
  148. Wen-Lian Hsu, Ming-Yang Kao
    Selected papers from COCOON 1998 - Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:261, n:2, pp:211- [Journal]
  149. Ming-Yang Kao, Jie Wang
    Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:101-115 [Journal]
  150. Ching-Tien Ho, Ming-Yang Kao
    Optimal Broadcast in All-Port Wormhole-Routed Hypercubes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1995, v:6, n:2, pp:200-204 [Journal]
  151. Robert T. Schweller, Zhichun Li, Yan Chen, Yan Gao, Ashish Gupta, Yin Zhang, Peter A. Dinda, Ming-Yang Kao, Gokhan Memik
    Reverse Hashing for High-Speed Network Monitoring: Algorithms, Evaluation, and Applications. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  152. Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
    Randomized Fast Design of Short DNA Words [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  153. Ming-Yang Kao, Robert T. Schweller
    Reducing Tile Complexity for Self-Assembly Through Temperature Programming [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  154. Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie Wang
    On constructing an optimal consensus clustering from multiple clusterings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:4, pp:137-145 [Journal]
  155. Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
    Average case analysis for tree labelling schemes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:378, n:3, pp:271-291 [Journal]

  156. Default-Sensitive PreProcessings for Finding Maxima. [Citation Graph (, )][DBLP]


  157. The Closest Pair Problem under the Hamming Metric. [Citation Graph (, )][DBLP]


  158. Randomized Self-assembly for Approximate Shapes. [Citation Graph (, )][DBLP]


  159. Using Nash Implementation to Achieve Better Frugality Ratios. [Citation Graph (, )][DBLP]


  160. Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract). [Citation Graph (, )][DBLP]


  161. Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences. [Citation Graph (, )][DBLP]


  162. Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability. [Citation Graph (, )][DBLP]


  163. Deterministic Polynomial-Time Algorithms for Designing Short DNA Words. [Citation Graph (, )][DBLP]


Search in 0.028secs, Finished in 0.033secs
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