Остановите войну!
for scientists:
default search action
Maw-Shang Chang
- > Home > Persons > Maw-Shang Chang
Publications
- 2018
- [j49]Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Yi-Zhi Liu, Peter Rossmanith, Somnath Sikdar:
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem. Discret. Appl. Math. 251: 114-125 (2018) - 2016
- [j48]Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Ping-Chen Su:
Fixed-parameter algorithms for vertex cover P3. Discret. Optim. 19: 12-22 (2016) - [j47]Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung:
An O∗(1.4366n)-time exact algorithm for maximum P2-packing in cubic graphs. J. Comb. Optim. 32(2): 594-607 (2016) - 2015
- [j45]Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung:
Moderately exponential time algorithms for the maximum induced matching problem. Optim. Lett. 9(5): 981-998 (2015) - 2014
- [j44]Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Guan-Han Wu:
Exact algorithms for problems related to the densest k-set problem. Inf. Process. Lett. 114(9): 510-513 (2014) - [c26]Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung:
An efficient exact algorithm for P2-packing in cubic graphs. ICS 2014: 11-21 - 2013
- [j43]Maw-Shang Chang, Ling-Ju Hung, Chih-Ren Lin, Ping-Chen Su:
Finding large k-clubs in undirected graphs. Computing 95(9): 739-758 (2013) - [j42]Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith:
Recognition of probe distance-hereditary graphs. Discret. Appl. Math. 161(3): 336-348 (2013) - 2012
- [i1]Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng:
On the threshold-width of graphs. CoRR abs/1210.8365 (2012) - 2011
- [j37]Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng:
On the threshold-width of graphs. J. Graph Algorithms Appl. 15(2): 253-268 (2011) - [j35]Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng:
Block-graph width. Theor. Comput. Sci. 412(23): 2496-2502 (2011) - 2010
- [c25]Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith:
Probe Distance-Hereditary Graphs. CATS 2010: 55-64 - [c23]Maw-Shang Chang, Ling-Ju Hung:
Recognition of Probe Ptolemaic Graphs - (Extended Abstract). IWOCA 2010: 286-290 - 2009
- [c22]Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng:
Block-Graph Width. TAMC 2009: 150-157 - 2005
- [j23]Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chia-Ben Shen, Chuan Yi Tang:
An improved algorithm for the maximum agreement subtree problem. Inf. Process. Lett. 94(5): 211-216 (2005) - 2004
- [c13]Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chuan Yi Tang:
An Improved Algorithm for the Maximum Agreement Subtree Problem. BIBE 2004: 533-536
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 2023-11-13 23:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint