default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHung-Lung Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Yun-Shan Lu, Hung-Lung Wang
:
A note on the Tuza constant ck for small k. Discret. Math. 347(2): 113756 (2024)- [j16]Yu-Lun Wu, Hung-Lung Wang:
Correcting matrix products over the ring of integers. Inf. Process. Lett. 186: 106496 (2024) - [j15]Min-Shu Jao, Hung-Lung Wang, Jou-Ming Chang, Chia-Wen Wu:
Determining the 2-Tuple Total Domination Number of a Harary Graph under Specific Degree Conditions. J. Inf. Sci. Eng. 40(2): 253-264 (2024) - 2023
- [c13]Wing-Kai Hon, Meng-Tsung Tsai, Hung-Lung Wang:
Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs. WADS 2023: 507-520 - [i8]Yu-Lun Wu, Hung-Lung Wang:
Correcting matrix products over the ring of integers. CoRR abs/2307.12513 (2023) - 2022
- [j14]Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang:
Complexity of paired domination in AT-free and planar graphs. Theor. Comput. Sci. 930: 53-62 (2022) - [c12]Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang:
Complexity of Paired Domination in AT-free and Planar Graphs. CALDAM 2022: 65-77 - [i7]Yun-Shan Lu, Hung-Lung Wang:
A note on the Tuza constant ck for small k. CoRR abs/2206.14376 (2022) - 2021
- [j13]Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang, Yue-Li Wang:
A note on the geodetic number and the Steiner number of AT-free graphs. Theor. Comput. Sci. 854: 131-135 (2021) - [i6]Vikash Tripathi, Ton Kloks, Arti Pandey, Kaustav Paul, Hung-Lung Wang:
Complexity of Paired Domination in AT-free and Planar Graphs. CoRR abs/2112.05486 (2021)
2010 – 2019
- 2019
- [c11]Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang:
The Complexity of Packing Edge-Disjoint Paths. IPEC 2019: 10:1-10:16 - [i5]Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang:
The Complexity of Packing Edge-Disjoint Paths. CoRR abs/1910.00440 (2019) - 2017
- [j12]Hung-Lung Wang:
An Optimal Algorithm for the Weighted Backup 2-Center Problem on a Tree. Algorithmica 77(2): 426-439 (2017) - [j11]Jou-Ming Chang, Hung-Yi Chang, Hung-Lung Wang, Kung-Jui Pai, Jinn-Shyong Yang:
Completely Independent Spanning Trees on 4-Regular Chordal Rings. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9): 1932-1935 (2017) - 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
- [j10]Hung-Lung Wang:
Maintaining centdians in a fully dynamic forest with top trees. Discret. Appl. Math. 181: 310-315 (2015) - [j9]Hung-Lung Wang, Chun-Yu Tseng, Jou-Ming Chang:
On the Structure of Locally Outerplanar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1212-1215 (2015) - [j8]Hung-Yi Chang, Hung-Lung Wang, Jinn-Shyong Yang, Jou-Ming Chang:
A Note on the Degree Condition of Completely Independent Spanning Trees. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(10): 2191-2193 (2015) - [j7]Bang Ye Wu, Hung-Lung Wang:
The next-to-shortest path problem on directed graphs with positive edge weights. Networks 65(3): 205-211 (2015) - [c9]Jou-Ming Chang, Ton Kloks, Hung-Lung Wang:
Gray Codes for AT-Free Orders via Antimatroids. IWOCA 2015: 77-87 - [c8]Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang:
Rainbow Domination and Related Problems on Some Classes of Perfect Graphs. TTCS 2015: 121-134 - [c7]Wei-Yin Lin, Yen-Wei Wu, Hung-Lung Wang, Kun-Mao Chao:
Forming Plurality at Minimum Cost. WALCOM 2015: 77-88 - [i4]Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang:
Rainbow domination and related problems on some classes of perfect graphs. CoRR abs/1502.07492 (2015) - [i3]Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang, Yue-Li Wang:
Convexities in Some Special Graph Classes - New Results in AT-free Graphs and Beyond. CoRR abs/1509.04944 (2015) - [i2]Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Hung-Lung Wang:
Flood-it on AT-Free Graphs. CoRR abs/1511.01806 (2015) - 2014
- [j6]Hung-Lung Wang, Kuan-Yu Chen:
One-dimensional approximate point set pattern matching with Lp-norm. Theor. Comput. Sci. 521: 42-50 (2014) - [c6]Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao:
The Generalized Popular Condensation Problem. ISAAC 2014: 606-617 - [i1]Hung-Lung Wang:
An optimal algorithm for the weighted backup 2-center problem on a tree. CoRR abs/1409.0098 (2014) - 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 - 2012
- [c3]Hung-Lung Wang, Wei-Ho Chung:
The generalized k-coverage under probabilistic sensing model in sensor networks. WCNC 2012: 1737-1742 - 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) - [c2]Hung-Lung Wang, Kuan-Yu Chen:
Approximate Point Set Pattern Matching with L p -Norm. SPIRE 2011: 81-86 - 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)
2000 – 2009
- 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)
Coauthor Index
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-10-23 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
