Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Chang, Maw-Shang"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Exact algorithms for problems related to the densest
k
-set problem
Maw-Shang Chang
,
Li-Hsuan Chen
,
Ling-Ju Hung
,
Peter Rossmanith
,
Guan-Han Wu
Information Processing Letters
114
(9), 2014, pp. 510-513
Testing consistency of quartet topologies: A parameterized approach
Maw-Shang Chang
,
Chuang-Chieh Lin
,
Peter Rossmanith
Information Processing Letters
113
(22-24), 2013, pp. 852-857
Block-graph width
Maw-Shang Chang
,
Ling-Ju Hung
,
Ton Kloks
,
Sheng-Lung Peng
Theoretical Computer Science
412
(23), 2011, pp. 2496-2502
A property tester for tree-likeness of quartet topologies
Maw-Shang Chang
,
Chuang-Chieh Lin
,
Peter Rossmanith
Theory of Computing Systems
49
(3), 2011, pp. 576-587
An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs
Ruo-Wei Hung
,
Maw-Shang Chang
Theoretical Computer Science
412
(39), 2011, pp. 5351-5373
An improved algorithm for the red-blue hitting set problem with the consecutive ones property
Maw-Shang Chang
,
Hsiao-Han Chung
,
Chuang-Chieh Lin
Information Processing Letters
110
(20), 2010, pp. 845-848
New fixed-parameter algorithms for the minimum quartet inconsistency problem
Maw-Shang Chang
,
Chuang-Chieh Lin
,
Peter Rossmanith
Theory of Computing Systems
47
(2), 2010, pp. 342-367
Signed and minus clique-transversal functions on graphs
Chuan-Min Lee
,
Maw-Shang Chang
Information Processing Letters
109
(8), 2009, pp. 414-417
Probe ptolemaic graphs
David B. Chandler
,
Maw-Shang Chang
,
Ton Kloks
,
Van Bang Le
,
Sheng-Lung Peng
Lecture Notes in Computer Science
5092
, 2008, pp. 468-477
Probe ptolemaic graphs
David B. Chandler
,
Maw-Shang Chang
,
Ton Kloks
,
Van Bang Le
,
Sheng-Lung Peng
Lecture Notes in Computer Science
5092
, 2008, pp. 468-477
Partitioned probe comparability graphs
David B. Chandler
,
Maw-Shang Chang
,
Ton Kloks
,
Jiping Liu
,
Sheng-Lung Peng
Theoretical Computer Science
396
(1-3), 2008, pp. 212-222
The 3-Steiner root problem
Maw-Shang Chang
,
Ming-Tat Ko
Lecture Notes in Computer Science
4769
, 2007, pp. 109-120
Partitioned probe comparability graphs
David B. Chandler
,
Maw-Shang Chang
,
Ton Kloks
,
Jiping Liu
,
Sheng-Lung Peng
Lecture Notes in Computer Science
4271
, 2006, pp. 179-190
Linear-time algorithms for tree root problems
Maw-Shang Chang
,
Ming-Tat Ko
,
Hsueh-I Lu
Lecture Notes in Computer Science
4059
, 2006, pp. 411-422
On the recognition of probe graphs of some self-complementary classes of perfect graphs
Maw-Shang Chang
,
Ton Kloks
,
Dieter Kratsch
,
Jiping Liu
,
Sheng-Lung Peng
Lecture Notes in Computer Science
3595
, 2005, pp. 808-817
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
Ruo-Wei Hung
,
Maw-Shang Chang
Theoretical Computer Science
341
(1-3), 2005, pp. 411-440
An improved algorithm for the maximum agreement subtree problem
Chuan-Min Lee
,
Ling-Ju Hung
,
Maw-Shang Chang
,
Chia-Ben Shen
,
Chuan-Yi Tang
Information Processing Letters
94
(5), 2005, pp. 211-216
New upper bounds on feedback vertex numbers in butterflies
Maw-Shang Chang
,
Chin-Hua Lin
,
Chuan-Min Lee
Information Processing Letters
90
(6), 2004, pp. 279-285
An efficient exact algorithm for the minimum ultrametric tree problem
Hsin-Fu Chen
,
Maw-Shang Chang
Lecture Notes in Computer Science
3341
, 2004, pp. 282-293
Domination in distance-hereditary graphs
Maw-Shang Chang
,
Shaur-Ching Wu
,
Gerard J. Chang
,
Hong-Gwa Yeh
Discrete Applied Mathematics
116
(1-2), 2002, pp. 103-113
Maximum clique transversals
Maw-Shang Chang
,
Ton Kloks
,
Chuan-Min Lee
Lecture Notes in Computer Science
2204
, 2001, pp. 32-43
On the tree-degree of graphs
Maw-Shang Chang
,
Haiko Müller
Lecture Notes in Computer Science
2204
, 2001, pp. 44-54
Deferrred-query: An efficient approach for some problems on interval graphs
Maw-Shang Chang
,
Sheng-Lung Peng
,
Jenn-Liang Liaw
Networks
34
(1), 1999, pp. 1-10
Weighted irredundance of interval graphs
Maw-Shang Chang
,
P. Nagavamsi
,
C. Pandu Rangan
Information Processing Letters
66
(2), 1998, pp. 65-70
Efficient algorithms for the domination problems on interval and circular-arc graphs
Maw-Shang Chang
SIAM Journal on Computing
27
(6), 1998, pp. 1671-1694
Seiten 1
2
>