dblp.uni-trier.dewww.uni-trier.de

Sheng-Lung Peng Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
32EESheng-Lung Peng, Yu-Wei Tsay, Chich-Sheng Lin, Chuan Yi Tang: CAPS Genomic Subtyping on Orthomyxoviridae. ICIC (1) 2009: 130-137
31EESheng-Lung Peng, Yu-Wei Tsay: Verification of Pathotyping by Quasispecies Model. ICIC (1) 2009: 138-145
30EEMaw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng: Block-Graph Width. TAMC 2009: 150-157
29EERuei-Yuan Chang, Guanling Lee, Sheng-Lung Peng: Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs. TAMC 2009: 158-167
28EEDavid B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng: On probe permutation graphs. Discrete Applied Mathematics 157(12): 2611-2619 (2009)
2008
27EEDavid B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng: Probe Ptolemaic Graphs. COCOON 2008: 468-477
26EEYen-Ru Chen, Sheng-Lung Peng, Yu-Wei Tsay: Protein Secondary Structure Prediction Based on Ramachandran Maps. ICIC (1) 2008: 204-211
25EESheng-Lung Peng, Yu-Wei Tsay, Tai-Chun Wang, Chuan Yi Tang: Probe Selection with Fault Tolerance. ICIC (1) 2008: 212-219
24EERuei-Yuan Chang, Guanling Lee, Sheng-Lung Peng: Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs. ICIC (2) 2008: 758-765
23EEMathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng: Efficient algorithms for Roman domination on some classes of graphs. Discrete Applied Mathematics 156(18): 3400-3415 (2008)
22EEDavid 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)
2007
21EESheng-Lung Peng, Yi-Chuan Yang: On the Treewidth and Pathwidth of Biconvex Bipartite Graphs. TAMC 2007: 244-255
20EEChung-Hsien Hsu, Sheng-Lung Peng, Chong-Hui Shi: Constructing a minimum height elimination tree of a tree in linear time. Inf. Sci. 177(12): 2473-2479 (2007)
2006
19EEDavid 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
18EESheng-Lung Peng, Ton Kloks, Chuan-Min Lee: The Maximum Interval Graphs on Distance Hereditary Graphs. JCIS 2006
17EEDavid B. Chandler, Maw-Shang Chang, Antonius J. J. Kloks, Jiping Liu, Sheng-Lung Peng: On Probe Permutation Graphs. TAMC 2006: 494-504
16EEDavid B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng: Partitioned Probe Comparability Graphs. WG 2006: 179-190
15EESheng-Lung Peng, Chi-Kang Chen: On the interval completion of chordal graphs. Discrete Applied Mathematics 154(6): 1003-1010 (2006)
2005
14EEMaw-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
13EEGerard Jennhwa Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng: The PIGs Full Monty - A Floor Show of Minimal Separators. STACS 2005: 521-532
12EEMathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng: Roman Domination over Some Graph Classes. WG 2005: 103-114
11EEGerard Jennhwa Chang, Ton Kloks, Sheng-Lung Peng: Probe interval bigraphs. Electronic Notes in Discrete Mathematics 19: 195-201 (2005)
2003
10EEChin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang: Efficient minus and signed domination in graphs. Theor. Comput. Sci. 1-3(301): 381-397 (2003)
2000
9EEChin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang: Efficient Minus and Signed Domination in Graphs. ISAAC 2000: 241-253
8EESheng-Lung Peng, Chuan Yi Tang, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu: Graph Searching on Some Subclasses of Chordal Graphs. Algorithmica 27(3): 395-426 (2000)
7EESheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang: Edge and node searching problems on trees. Theor. Comput. Sci. 240(2): 429-446 (2000)
1999
6EEMaw-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
5EESheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang: A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree. COCOON 1998: 279-288
1997
4 Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang: Edge and Node Searching Problems on Trees. COCOON 1997: 284-293
1996
3EESheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu, Chuan Yi Tang: Graph Searching on Chordal Graphs. ISAAC 1996: 156-165
1993
2 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
1EESheng-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)

Coauthor Index

1David B. Chandler [16] [17] [19] [22] [27] [28]
2Gerard Jennhwa Chang [11] [13]
3Maw-Shang Chang [1] [2] [6] [14] [16] [17] [19] [22] [27] [28] [30]
4Ruei-Yuan Chang [24] [29]
5Chi-Kang Chen [15]
6Yen-Ru Chen [26]
7Chin-Wen Ho [3] [4] [5] [7] [8]
8Chung-Hsien Hsu [20]
9Tsan-sheng Hsu [3] [4] [5] [7] [8]
10Ling-Ju Hung [30]
11Ton Kloks (Antonius J. J. Kloks) [11] [12] [13] [14] [16] [17] [18] [19] [22] [23] [27] [28] [30]
12Ming-Tat Ko [3] [4] [5] [7] [8]
13Dieter Kratsch [14]
14Van Bang Le [27]
15Chuan-Min Lee [18]
16Guanling Lee [24] [29]
17Jenn-Liang Liaw [2] [6]
18Mathieu Liedloff [12] [23]
19Chich-Sheng Lin [32]
20Jiping Liu [12] [13] [14] [16] [17] [19] [22] [23] [28]
21Chin Lung Lu [9] [10]
22Chong-Hui Shi [20]
23Chuan Yi Tang [3] [4] [5] [7] [8] [9] [10] [25] [32]
24Yu-Wei Tsay [25] [26] [31] [32]
25Tai-Chun Wang [25]
26Yi-Chuan Yang [21]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)