2008 |
27 | EE | David B. Chandler,
Maw-Shang Chang,
Ton Kloks,
Van Bang Le,
Sheng-Lung Peng:
Probe Ptolemaic Graphs.
COCOON 2008: 468-477 |
26 | EE | Yen-Ru Chen,
Sheng-Lung Peng,
Yu-Wei Tsay:
Protein Secondary Structure Prediction Based on Ramachandran Maps.
ICIC (1) 2008: 204-211 |
25 | EE | Sheng-Lung Peng,
Yu-Wei Tsay,
Tai-Chun Wang,
Chuan Yi Tang:
Probe Selection with Fault Tolerance.
ICIC (1) 2008: 212-219 |
24 | EE | Ruei-Yuan Chang,
Guanling Lee,
Sheng-Lung Peng:
Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs.
ICIC (2) 2008: 758-765 |
23 | EE | Mathieu 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) |
22 | EE | 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) |
2007 |
21 | EE | Sheng-Lung Peng,
Yi-Chuan Yang:
On the Treewidth and Pathwidth of Biconvex Bipartite Graphs.
TAMC 2007: 244-255 |
20 | EE | Chung-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 |
19 | EE | 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 |
18 | EE | Sheng-Lung Peng,
Ton Kloks,
Chuan-Min Lee:
The Maximum Interval Graphs on Distance Hereditary Graphs.
JCIS 2006 |
17 | EE | David B. Chandler,
Maw-Shang Chang,
Antonius J. J. Kloks,
Jiping Liu,
Sheng-Lung Peng:
On Probe Permutation Graphs.
TAMC 2006: 494-504 |
16 | EE | David B. Chandler,
Maw-Shang Chang,
Ton Kloks,
Jiping Liu,
Sheng-Lung Peng:
Partitioned Probe Comparability Graphs.
WG 2006: 179-190 |
15 | EE | Sheng-Lung Peng,
Chi-Kang Chen:
On the interval completion of chordal graphs.
Discrete Applied Mathematics 154(6): 1003-1010 (2006) |
2005 |
14 | EE | 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 |
13 | EE | Gerard Jennhwa Chang,
Ton Kloks,
Jiping Liu,
Sheng-Lung Peng:
The PIGs Full Monty - A Floor Show of Minimal Separators.
STACS 2005: 521-532 |
12 | EE | Mathieu Liedloff,
Ton Kloks,
Jiping Liu,
Sheng-Lung Peng:
Roman Domination over Some Graph Classes.
WG 2005: 103-114 |
11 | EE | Gerard Jennhwa Chang,
Ton Kloks,
Sheng-Lung Peng:
Probe interval bigraphs.
Electronic Notes in Discrete Mathematics 19: 195-201 (2005) |
2003 |
10 | EE | Chin 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 |
9 | EE | Chin Lung Lu,
Sheng-Lung Peng,
Chuan Yi Tang:
Efficient Minus and Signed Domination in Graphs.
ISAAC 2000: 241-253 |
8 | EE | Sheng-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) |
7 | EE | Sheng-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 |
6 | EE | 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 |
5 | EE | Sheng-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 |
3 | | Sheng-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 |
1 | EE | 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) |