default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaw-Shang Chang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 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
- [j46]Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu:
Linear-Time Algorithms for Tree Root Problems. Algorithmica 71(2): 471-495 (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) - [j41]Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith:
Testing consistency of quartet topologies: a parameterized approach. Inf. Process. Lett. 113(22-24): 852-857 (2013) - [j40]Li-Hsuan Chen, Maw-Shang Chang, Chun-Chieh Wang, Bang Ye Wu:
On the Min-Max 2-Cluster Editing Problem. J. Inf. Sci. Eng. 29(6): 1109-1120 (2013) - 2012
- [i4]Maw-Shang Chang, Ton Kloks, Ching-Hao Liu:
Edge-clique graphs of cocktail parties have unbounded rankwidth. CoRR abs/1205.2483 (2012) - [i3]Maw-Shang Chang, Ton Kloks, Ching-Hao Liu:
Independent sets in edge-clique graphs. CoRR abs/1206.1993 (2012) - [i2]Ching-Hao Liu, Maw-Shang Chang, Ton Kloks, Sheung-Hung Poon:
Independent sets in edge-clique graphs II. CoRR abs/1206.5082 (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
- [j39]Ruo-Wei Hung, Maw-Shang Chang:
Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs. Appl. Math. Lett. 24(5): 648-652 (2011) - [j38]Wu Hsiung Wu, Feng Sheng Wang, Maw-Shang Chang:
Multi-objective optimization of enzyme manipulations in metabolic networks considering resilience effects. BMC Syst. Biol. 5: 145 (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) - [j36]Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith:
A Property Tester for Tree-Likeness of Quartet Topologies. Theory Comput. Syst. 49(3): 576-587 (2011) - [j35]Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng:
Block-graph width. Theor. Comput. Sci. 412(23): 2496-2502 (2011) - [j34]Ruo-Wei Hung, Maw-Shang Chang:
An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs. Theor. Comput. Sci. 412(39): 5351-5373 (2011) - 2010
- [j33]Maw-Shang Chang, Hsiao-Han Chung, Chuang-Chieh Lin:
An improved algorithm for the red-blue hitting set problem with the consecutive ones property. Inf. Process. Lett. 110(20): 845-848 (2010) - [j32]Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith:
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. Theory Comput. Syst. 47(2): 342-367 (2010) - [c25]Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith:
Probe Distance-Hereditary Graphs. CATS 2010: 55-64 - [c24]Ruo-Wei Hung, Maw-Shang Chang:
Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs. ICCSA (2) 2010: 314-323 - [c23]Maw-Shang Chang, Ling-Ju Hung:
Recognition of Probe Ptolemaic Graphs - (Extended Abstract). IWOCA 2010: 286-290
2000 – 2009
- 2009
- [j31]David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
On probe permutation graphs. Discret. Appl. Math. 157(12): 2611-2619 (2009) - [j30]Chuan-Min Lee, Maw-Shang Chang:
Signed and minus clique-transversal functions on graphs. Inf. Process. Lett. 109(8): 414-417 (2009) - [c22]Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng:
Block-Graph Width. TAMC 2009: 150-157 - 2008
- [j29]Wu Hsiung Wu, Feng Sheng Wang, Maw-Shang Chang:
Dynamic sensitivity analysis of biological systems. BMC Bioinform. 9(S-12) (2008) - [j28]Chuan-Min Lee, Maw-Shang Chang:
Variations of Y-dominating functions on graphs. Discret. Math. 308(18): 4185-4204 (2008) - [j27]David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
Partitioned probe comparability graphs. Theor. Comput. Sci. 396(1-3): 212-222 (2008) - [c21]David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng:
Probe Ptolemaic Graphs. COCOON 2008: 468-477 - [c20]Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith:
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. IWPEC 2008: 66-77 - 2007
- [j26]Ruo-Wei Hung, Maw-Shang Chang:
Finding a minimum path cover of a distance-hereditary graph in polynomial time. Discret. Appl. Math. 155(17): 2242-2256 (2007) - [c19]Maw-Shang Chang, Ming-Tat Ko:
The 3-Steiner Root Problem. WG 2007: 109-120 - 2006
- [j25]Ruo-Wei Hung, Maw-Shang Chang:
Solving the path cover problem on circular-arc graphs by using an approximation algorithm. Discret. Appl. Math. 154(1): 76-105 (2006) - [j24]Chuan-Min Lee, Maw-Shang Chang:
Distance-hereditary graphs are clique-perfect. Discret. Appl. Math. 154(3): 525-536 (2006) - [c18]David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs. AAIM 2006: 267-278 - [c17]Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu:
Linear-Time Algorithms for Tree Root Problems. SWAT 2006: 411-422 - [c16]David B. Chandler, Maw-Shang Chang, Antonius J. J. Kloks, Jiping Liu, Sheng-Lung Peng:
On Probe Permutation Graphs. TAMC 2006: 494-504 - [c15]David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
Partitioned Probe Comparability Graphs. WG 2006: 179-190 - 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) - [j22]Ruo-Wei Hung, Maw-Shang Chang:
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, . Theor. Comput. Sci. 341(1-3): 411-440 (2005) - [c14]Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng:
On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs. COCOON 2005: 808-817 - 2004
- [j21]Maw-Shang Chang, Ruo-Wei Hung:
A simple linear algorithm for the connected domination problem in circular-arc graphs. Discuss. Math. Graph Theory 24(1): 137-145 (2004) - [j20]Maw-Shang Chang, Chin-Hua Lin, Chuan-Min Lee:
New upper bounds on feedback vertex numbers in butterflies. Inf. Process. Lett. 90(6): 279-285 (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 - [c12]Hsin-Fu Chen, Maw-Shang Chang:
An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem. ISAAC 2004: 282-293 - 2003
- [j19]Ruo-Wei Hung, Shaur-Ching Wu, Maw-Shang Chang:
Hamiltonian Cycle Problem on Distance-Hereditary Graphs. J. Inf. Sci. Eng. 19(5): 827-838 (2003) - 2002
- [j18]Maw-Shang Chang, Shaur-Ching Wu, Gerard J. Chang, Hong-Gwa Yeh:
Domination in distance-hereditary graphs. Discret. Appl. Math. 116(1-2): 103-113 (2002) - 2001
- [j17]Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong:
The Kr-Packing Problem. Computing 66(1): 79-89 (2001) - [c11]Maw-Shang Chang, Ton Kloks, Chuan-Min Lee:
Maximum Clique Transversals. WG 2001: 32-43 - [c10]Maw-Shang Chang, Haiko Müller:
On the Tree-Degree of Graphs. WG 2001: 44-54
1990 – 1999
- 1999
- [j16]Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw:
Deferred-query: An efficient approach for some problems on interval graphs. Networks 34(1): 1-10 (1999) - 1998
- [j15]Maw-Shang Chang, P. Nagavamsi, C. Pandu Rangan:
Weighted Irredundance of Interval Graphs. Inf. Process. Lett. 66(2): 65-70 (1998) - [j14]Maw-Shang Chang:
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs. SIAM J. Comput. 27(6): 1671-1694 (1998) - [c9]Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong:
The Vertex-Disjoint Triangles Problem. WG 1998: 26-37 - 1997
- [j13]Y. Daniel Liang, Maw-Shang Chang:
Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs. Acta Informatica 34(5): 337-346 (1997) - [j12]Maw-Shang Chang, Chung-Chang Hsu:
On Minimum Intersection of Two Minimum Dominating Sets of Interval Graphs. Discret. Appl. Math. 78(1-3): 41-50 (1997) - [j11]Maw-Shang Chang:
Weighted Domination of Cocomparability Graphs. Discret. Appl. Math. 80(2-3): 135-148 (1997) - [c8]Maw-Shang Chang, Sun-Yuan Hsieh, Gen-Huey Chen:
Dynamic Programming on Distance-Hereditary Graphs. ISAAC 1997: 344-353 - 1996
- [j10]Maw-Shang Chang, Yi-Hua Chen, Gerard J. Chang, Jing-Ho Yan:
Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs. Discret. Appl. Math. 66(3): 189-203 (1996) - [c7]Maw-Shang Chang:
Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs. ISAAC 1996: 146-155 - 1995
- [j9]Anand Srinivasan, K. Madhukar, P. Nagavamsi, C. Pandu Rangan, Maw-Shang Chang:
Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs. Inf. Process. Lett. 56(3): 165-171 (1995) - [c6]Maw-Shang Chang:
Weighted Domination on Cocomparability Graphs. ISAAC 1995: 122-131 - 1994
- [j8]Maw-Shang Chang, Yi-Chang Liu:
Polynomial Algorithms for Weighted Perfect Domination Problems on Interval and Circular-Arc Graphs. J. Inf. Sci. Eng. 10(4): 549-568 (1994) - [c5]C. Pandu Rangan, Maw-Shang Chang:
Weighted Irredundance of Interval Graphs. ISAAC 1994: 567-574 - 1993
- [j7]Maw-Shang Chang, Yi-Chang Liu:
Polynomial Algorithms for the Weighted Perfect Domination Problems on Chordal Graphs and Split Graphs. Inf. Process. Lett. 48(4): 205-210 (1993) - [c4]Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw:
Deferred-Query - An Efficient Approach for Problems on interval and Circular-Arc Graphs (Extended Abstract). WADS 1993: 222-233 - 1992
- [j6]Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee:
Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs. Algorithmica 8(3): 177-194 (1992) - [j5]Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee:
Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs. Discret. Appl. Math. 39(1): 1-12 (1992) - [j4]Maw-Shang Chang, Fu-Hsing Wang:
Efficient Algorithms for the Maximum Weight Clique and Maximum Weight Independent Set Problems on Permutation Graphs. Inf. Process. Lett. 43(6): 293-295 (1992) - [j3]Sheng-Lung Peng, Maw-Shang Chang:
A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal Graphs. Inf. Process. Lett. 43(6): 297-300 (1992) - [c3]Maw-Shang Chang:
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs. IFIP Congress (1) 1992: 402-408 - 1991
- [j2]Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee:
20-relative neighborhood graphs are hamiltonian. J. Graph Theory 15(5): 543-557 (1991) - [c2]Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee:
A unified approach for solving bottleneck k-bipartition problems. ACM Conference on Computer Science 1991: 39-47 - 1990
- [j1]Maw-Shang Chang, Nen-Fu Huang, Chuan Yi Tang:
An Optimal Algorithm for Constructing Oriented Voronoi Diagrams and Geographic Neighborhood Graphs. Inf. Process. Lett. 35(5): 255-260 (1990) - [c1]Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee:
20-Relative Neighborhood Graphs Are Hamiltonian. SIGAL International Symposium on Algorithms 1990: 53-65
Coauthor Index
aka: Antonius J. J. Kloks
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-07 22:23 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:
