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="Peng, Sheng-Lung"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Characterizing and recognizing probe block graphs
Van Bang Le
,
Sheng-Lung Peng
Theoretical Computer Science
568
, 2015, pp. 97-102
Block-graph width
Maw-Shang Chang
,
Ling-Ju Hung
,
Ton Kloks
,
Sheng-Lung Peng
Theoretical Computer Science
412
(23), 2011, pp. 2496-2502
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
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
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
The PIGs full monty - A floor show of minimal separators
Gerard Jennhwa Chang
,
Antonius J.J. Kloks
,
Jiping Liu
,
Sheng-Lung Peng
Lecture Notes in Computer Science
3404
, 2005, pp. 521-532
Roman domination over some graph classes
Mathieu Liedloff
,
Ton Kloks
,
Jiping Liu
,
Sheng-Lung Peng
Lecture Notes in Computer Science
3787
, 2005, pp. 103-114
Efficient minus and signed domination in graphs
Chin Lung Lu
,
Sheng-Lung Peng
,
Chuan Yi Tang
Theoretical Computer Science
301
(1-3), 2003, pp. 381-397
Efficient minus and signed domination in graphs
Chin Lung Lu
,
Sheng-Lung Peng
,
Chuan Yi Tang
Lecture Notes in Computer Science
1969
, 2000, pp. 241-253
Edge and node searching problems on trees
Sheng-Lung Peng
,
Chin-Wen Ho
,
Tsan-sheng Hsu
,
Ming-Tat Ko
,
Chuan Yu Tang
Theoretical Computer Science
240
(2), 2000, pp. 429-446
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
A linear-time algorithm for constructing an optimal node-search strategy of a tree
Sheng-Lung Peng
,
Chin-Wen Ho
,
Tsan-sheng Hsu
,
Ming-Tat Ko
,
Chuan Yi Tang
Lecture Notes in Computer Science
1449
, 1998, pp. 279-288
Edge and node searching problems on trees
Sheng-Lung Peng
,
Chin-Wen Ho
,
Tsan-sheng Hsu
,
Ming-Tat Ko
,
Chuan-Yi Tang
Lecture Notes in Computer Science
1276
, 1997, pp. 284-293
Graph searching on chordal graphs
Sheng-Lung Peng
,
Ming-Tat Ko
,
Chin-Wen Ho
,
Tsan-sheng Hsu
,
Chuan-Yi Tang
Lecture Notes in Computer Science
1178
, 1996, pp. 156-165
Deferred query - An efficient approach for problems on interval and circular-arc graphs
Maw-Shang Chang
,
Sheng-Lung Peng
,
Jenn-Liang Liaw
Proceedings of the 3rd Workshop on Algorithms and Data Structures. WADS '93 (Montréal, Canada, August 1993)
LNCS 709
, 1993, pp. 222-233