Остановите войну!
for scientists:
default search action
Hung-Lung Wang
- > Home > Persons > Hung-Lung Wang
Publications
- 2016
- [c10]Albert Jhih-Heng Huang, Hung-Lung Wang, Kun-Mao Chao:
Computing the Line-Constrained k-center in the Plane for Small k. AAIM 2016: 197-208 - 2015
- [c7]Wei-Yin Lin, Yen-Wei Wu, Hung-Lung Wang, Kun-Mao Chao:
Forming Plurality at Minimum Cost. WALCOM 2015: 77-88 - 2014
- [c6]Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao:
The Generalized Popular Condensation Problem. ISAAC 2014: 606-617 - 2013
- [c5]Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao:
Computing Plurality Points and Condorcet Points in Euclidean Space. ISAAC 2013: 688-698 - [c4]Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao:
An Optimal Algorithm for the Popular Condensation Problem. IWOCA 2013: 412-422 - 2011
- [j5]Matthias Bernt, Kuan-Yu Chen, Ming-Chiang Chen, An-Chiang Chu, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf:
Finding all sorting tandem duplication random loss operations. J. Discrete Algorithms 9(1): 32-48 (2011) - 2010
- [j4]An-Chiang Chu, Bang Ye Wu, Hung-Lung Wang, Kun-Mao Chao:
A tight bound on the min-ratio edge-partitioning problem of a tree. Discret. Appl. Math. 158(14): 1471-1478 (2010) - 2009
- [j3]Hung-Lung Wang, Bang Ye Wu, Kun-Mao Chao:
The backup 2-center and backup 2-median problems on trees. Networks 53(1): 39-49 (2009) - [c1]Matthias Bernt, Ming-Chiang Chen, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf:
Finding All Sorting Tandem Duplication Random Loss Operations. CPM 2009: 301-313 - 2008
- [j2]Hung-Lung Wang, Kun-Mao Chao:
The 2-radius and 2-radiian problems on trees. Theor. Comput. Sci. 407(1-3): 524-531 (2008) - 2007
- [j1]Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao Chao:
On the uniform edge-partition of a tree. Discret. Appl. Math. 155(10): 1213-1223 (2007)
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-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint