Остановите войну!
for scientists:
default search action
Ming-Yang Kao
- > Home > Persons > Ming-Yang Kao
Publications
- 2016
- [e4]Ming-Yang Kao:
Encyclopedia of Algorithms - 2016 Edition. Springer 2016, ISBN 978-1-4939-2863-7 [contents] - 2008
- [e3]Ming-Yang Kao:
Encyclopedia of Algorithms - 2008 Edition. Springer 2008, ISBN 978-0-387-30770-1 [contents] - 2006
- [c68]Ming-Yang Kao:
Algorithmic DNA Self-assembly. AAIM 2006: 10 - 2001
- [i27]Ming-Yang Kao:
Tree Contractions and Evolutionary Trees. CoRR cs.CE/0101030 (2001) - [i20]Ming-Yang Kao:
Total Protection of Analytic Invariant Information in Cross Tabulated Tables. CoRR cs.CR/0101032 (2001) - [i19]Ming-Yang Kao:
Data Security Equals Graph Connectivity. CoRR cs.CR/0101034 (2001) - [i10]Ming-Yang Kao:
Multiple-Size Divide-and-Conquer Recurrences. CoRR cs.GL/0101011 (2001) - 1998
- [j20]Ming-Yang Kao:
Tree Contractions and Evolutionary Trees. SIAM J. Comput. 27(6): 1592-1616 (1998) - 1997
- [j19]Ming-Yang Kao:
Efficient Detection and Protection of Information in Cross Tabulated Tables II: Minimal Linear Invariants. J. Comb. Optim. 1(2): 187-202 (1997) - [j18]Ming-Yang Kao:
Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables. SIAM J. Comput. 26(1): 231-242 (1997) - [j17]Ming-Yang Kao:
Multiple-size divide-and-conquer recurrences. SIGACT News 28(2): 67-69 (1997) - [c28]Ming-Yang Kao:
Tree Contractions and Evolutionary Trees. CIAC 1997: 299-310 - 1996
- [j15]Ming-Yang Kao:
Data Security Equals Graph Connectivity. SIAM J. Discret. Math. 9(1): 87-100 (1996) - 1995
- [j13]Ming-Yang Kao:
Linear-Time Optimal Augmentation for Componentwise Bipartite-Completeness of Graphs. Inf. Process. Lett. 54(1): 59-63 (1995) - [j11]Ming-Yang Kao:
Planar Strong Connectivity Helps in Parallel Depth-First Search. SIAM J. Comput. 24(1): 46-62 (1995) - [c19]Ming-Yang Kao:
Minimal Linear Invariants. ASIAN 1995: 23-33 - 1994
- [c10]Ming-Yang Kao:
Total Protection of Analytic Invariant Information in Cross Tabulated Tables. STACS 1994: 723-734 - 1993
- [j6]Ming-Yang Kao:
Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components. SIAM J. Comput. 22(3): 431-459 (1993) - 1988
- [c1]Ming-Yang Kao:
All Graphs have Cycle Separators and Planar Directed Depth-First Search is in DNC. AWOC 1988: 53-63
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-07 03:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint