Ming-Yang Kao

From MaRDI portal
Person:321024

Available identifiers

zbMath Open kao.ming-yangWikidataQ102248279 ScholiaQ102248279MaRDI QIDQ321024

List of research outcomes

PublicationDate of PublicationType
Optimal bi-level augmentation for selective! enhancing graph connectivity with applications2024-01-29Paper
Optimal augmentation for bipartite componentwise biconnectivity in linear time2023-01-25Paper
Improved parallel depth-first search in undirected planar graphs2023-01-18Paper
Designing proxies for stock market indices is computationally hard*2019-01-14Paper
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis2017-02-22Paper
Optimal search for parameters in Monte Carlo simulation for derivative pricing2016-10-07Paper
Optimal buy-and-hold strategies for financial markets with bounded daily returns2016-09-29Paper
https://portal.mardi4nfdi.de/entity/Q55017942015-08-14Paper
https://portal.mardi4nfdi.de/entity/Q55013502015-08-03Paper
Optimal online scheduling of parallel jobs with dependencies2015-05-07Paper
Randomized fast design of short DNA words2014-11-18Paper
The risk profile problem for stock portfolio optimization (extended abstract)2014-09-26Paper
Discovering almost any hidden motif from multiple sequences2014-09-09Paper
Linear-time accurate lattice algorithms for tail conditional expectation2014-07-04Paper
Computing Minimum Tile Sets to Self-Assemble Color Patterns2014-01-14Paper
Deterministic polynomial-time algorithms for designing short DNA words2014-01-10Paper
https://portal.mardi4nfdi.de/entity/Q31052852012-01-05Paper
Optimizing Tile Concentrations to Minimize Errors and Time for DNA Tile Self-assembly Systems2011-01-28Paper
Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences2010-12-03Paper
Reducing tile complexity for self-assembly through temperature programming2010-08-16Paper
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words2010-06-17Paper
On constructing an optimal consensus clustering from multiple clusterings2010-03-24Paper
Fast Accurate Algorithms for Tail Conditional Expectation2010-01-22Paper
Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops2010-01-06Paper
Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)2009-12-17Paper
The Closest Pair Problem under the Hamming Metric2009-07-23Paper
Non-shared edges and nearest neighbor interchanges revisited2009-07-21Paper
An approximation algorithm for a bottleneck traveling salesman problem2009-06-24Paper
On approximating four covering and packing problems2009-06-08Paper
Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability2009-06-03Paper
Randomized Self-assembly for Approximate Shapes2008-08-28Paper
Using Nash Implementation to Achieve Better Frugality Ratios2008-05-27Paper
Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences2008-05-27Paper
Flexible Word Design and Graph Labeling2008-04-24Paper
A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees2008-04-24Paper
Algorithmic DNA Self-assembly2008-01-04Paper
Average case analysis for tree labelling schemes2007-07-09Paper
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem2007-05-02Paper
Algorithms and Computation2006-11-14Paper
Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time2006-06-01Paper
https://portal.mardi4nfdi.de/entity/Q33657392006-01-23Paper
Automata, Languages and Programming2006-01-10Paper
Complexities for Generalized Models of Self-Assembly2005-09-16Paper
Algorithm Theory - SWAT 20042005-09-07Paper
Tight approximability results for test set problems in bioinformatics2005-08-03Paper
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications2005-05-12Paper
SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES2005-02-28Paper
Fast Universalization of Investment Strategies2005-02-21Paper
https://portal.mardi4nfdi.de/entity/Q47372172004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44724822004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44725212004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44725252004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44741092004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44741112004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44598082004-05-18Paper
https://portal.mardi4nfdi.de/entity/Q44598262004-05-18Paper
The enhanced double digest problem for DNA physical mapping2003-10-27Paper
https://portal.mardi4nfdi.de/entity/Q44101252003-07-02Paper
https://portal.mardi4nfdi.de/entity/Q44101582003-07-02Paper
Common-Face Embeddings of Planar Graphs2003-06-19Paper
https://portal.mardi4nfdi.de/entity/Q47961912003-03-02Paper
https://portal.mardi4nfdi.de/entity/Q27683762002-07-22Paper
Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets2002-04-23Paper
Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns2002-04-23Paper
An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings2002-04-08Paper
Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27219962001-07-11Paper
https://portal.mardi4nfdi.de/entity/Q27239462001-07-08Paper
https://portal.mardi4nfdi.de/entity/Q49526442001-07-04Paper
A Decomposition Theorem for Maximum Weight Bipartite Matchings2001-06-21Paper
https://portal.mardi4nfdi.de/entity/Q45269702001-02-28Paper
https://portal.mardi4nfdi.de/entity/Q45269832001-02-28Paper
Simple efficient graph compression schemes for dense and complement graphs2001-02-09Paper
https://portal.mardi4nfdi.de/entity/Q45257352001-01-24Paper
Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees2000-10-18Paper
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs2000-10-18Paper
https://portal.mardi4nfdi.de/entity/Q45053982000-09-27Paper
https://portal.mardi4nfdi.de/entity/Q49533512000-05-09Paper
https://portal.mardi4nfdi.de/entity/Q49387792000-04-10Paper
https://portal.mardi4nfdi.de/entity/Q49387852000-03-27Paper
Reducing Randomness via Irrational Numbers2000-03-19Paper
Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors2000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q49426372000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q42510502000-01-19Paper
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings1999-11-23Paper
https://portal.mardi4nfdi.de/entity/Q42522891999-09-15Paper
Optimal Constructions of Hybrid Algorithms1999-08-23Paper
A unifying augmentation algorithm for two-edge connectivity and biconnectivity1999-07-21Paper
On-Line Difference Maximization1999-06-27Paper
https://portal.mardi4nfdi.de/entity/Q42522961999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42190331999-04-19Paper
Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions1999-02-22Paper
https://portal.mardi4nfdi.de/entity/Q42524171999-01-01Paper
Tree Contractions and Evolutionary Trees1998-09-21Paper
https://portal.mardi4nfdi.de/entity/Q43702111998-07-27Paper
Optimal on-line scheduling of parallel jobs with dependencies1998-04-13Paper
https://portal.mardi4nfdi.de/entity/Q31288981997-11-18Paper
Efficient detection and protection of information in cross tabulated tables. II: Minimal linear invariants1997-10-20Paper
Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables1997-09-07Paper
Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem1997-03-06Paper
Linear-time optimal augmentation for componentwise bipartite-completeness of graphs1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q43645891997-01-01Paper
Data Security Equals Graph Connectivity1996-07-02Paper
An optimal parallel algorithm for planar cycle separators1995-10-25Paper
Planar Strong Connectivity Helps in Parallel Depth-First Search1995-03-27Paper
Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs1994-12-20Paper
Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs1994-09-18Paper
https://portal.mardi4nfdi.de/entity/Q31404481993-12-15Paper
Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test1993-10-14Paper
Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components1993-09-01Paper
Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees1993-09-01Paper
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity1993-05-16Paper
Not all planar digraphs have small cycle separators1993-01-17Paper
Online matching with blocked input1992-06-26Paper
Parallel Depth-First Search in General Directed Graphs1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37982601988-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Ming-Yang Kao