The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sheng-Lung Peng: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
    Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:267-278 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:808-817 [Conf]
  3. Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang
    Edge and Node Searching Problems on Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:284-293 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:279-288 [Conf]
  5. Chin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang
    Efficient Minus and Signed Domination in Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:241-253 [Conf]
  6. Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu, Chuan Yi Tang
    Graph Searching on Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:156-165 [Conf]
  7. Sheng-Lung Peng, Ton Kloks, Chuan-Min Lee
    The Maximum Interval Graphs on Distance Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    JCIS, 2006, pp:- [Conf]
  8. Gerard Jennhwa Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
    The PIGs Full Monty - A Floor Show of Minimal Separators. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:521-532 [Conf]
  9. David B. Chandler, Maw-Shang Chang, Antonius J. J. Kloks, Jiping Liu, Sheng-Lung Peng
    On Probe Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:494-504 [Conf]
  10. Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw
    Deferred-Query - An Efficient Approach for Problems on interval and Circular-Arc Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:222-233 [Conf]
  11. David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
    Partitioned Probe Comparability Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:179-190 [Conf]
  12. Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng
    Roman Domination over Some Graph Classes. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:103-114 [Conf]
  13. Sheng-Lung Peng, Chuan Yi Tang, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu
    Graph Searching on Some Subclasses of Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:395-426 [Journal]
  14. Sheng-Lung Peng, Chi-Kang Chen
    On the interval completion of chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:6, pp:1003-1010 [Journal]
  15. Sheng-Lung Peng, Maw-Shang Chang
    A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:6, pp:297-300 [Journal]
  16. Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw
    Deferred-query: An efficient approach for some problems on interval graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:1, pp:1-10 [Journal]
  17. Chin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang
    Efficient minus and signed domination in graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:301, pp:381-397 [Journal]
  18. Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang
    Edge and node searching problems on trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:240, n:2, pp:429-446 [Journal]
  19. Sheng-Lung Peng, Yi-Chuan Yang
    On the Treewidth and Pathwidth of Biconvex Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:244-255 [Conf]
  20. Chung-Hsien Hsu, Sheng-Lung Peng, Chong-Hui Shi
    Constructing a minimum height elimination tree of a tree in linear time. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2007, v:177, n:12, pp:2473-2479 [Journal]

  21. Probe Ptolemaic Graphs. [Citation Graph (, )][DBLP]


  22. Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs. [Citation Graph (, )][DBLP]


  23. Probe Selection with Fault Tolerance. [Citation Graph (, )][DBLP]


  24. Protein Secondary Structure Prediction Based on Ramachandran Maps. [Citation Graph (, )][DBLP]


  25. Verification of Pathotyping by Quasispecies Model. [Citation Graph (, )][DBLP]


  26. CAPS Genomic Subtyping on Orthomyxoviridae. [Citation Graph (, )][DBLP]


  27. Measuring Protein Structural Similarity by Maximum Common Edge Subgraphs. [Citation Graph (, )][DBLP]


  28. Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs. [Citation Graph (, )][DBLP]


  29. Block-Graph Width. [Citation Graph (, )][DBLP]


  30. Efficient algorithms for Roman domination on some classes of graphs. [Citation Graph (, )][DBLP]


  31. On probe permutation graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002