The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Y. Daniel Liang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hong Zhang, Y. Daniel Liang
    Undergraduate computer graphics using Java 3D. [Citation Graph (0, 0)][DBLP]
    ACM Southeast Regional Conference (1), 2005, pp:12-13 [Conf]
  2. Y. Daniel Liang, Glenn K. Manacher
    An O(nlogn) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1993, pp:390-397 [Conf]
  3. Y. Daniel Liang, Chongkye Rhee
    Linear Algorithms for Two Independent Set Problems in Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1994, pp:90-93 [Conf]
  4. Y. Daniel Liang, Chongkye Rhee
    An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1995, pp:104-108 [Conf]
  5. Y. Daniel Liang, Raymond Greenlaw, Glenn K. Manacher
    NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Canada-France Conference on Parallel and Distributed Computing, 1994, pp:45-57 [Conf]
  6. Y. Daniel Liang, Chin Lung Lu, Chuan Yi Tang
    Effincient Domination of Permutation Graphs and Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:232-241 [Conf]
  7. Y. Daniel Liang
    Teaching dynamic programming techniques using permutation graphs. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1995, pp:56-60 [Conf]
  8. Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan
    Parallel algorithms for ranking of trees. [Citation Graph (0, 0)][DBLP]
    SPDP, 1990, pp:26-31 [Conf]
  9. Y. Daniel Liang, Maw-Shang Chang
    Minimum Feedback Vertex Sets in Comparability Graphs and Convex Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1997, v:34, n:5, pp:337-346 [Journal]
  10. Chongkye Rhee, Y. Daniel Liang
    Finding a Maximum Matching in a Permutation Graph [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1995, v:32, n:8, pp:779-792 [Journal]
  11. Y. Daniel Liang
    Parallel Algorithms for the Domination Problems in Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:74, n:3, pp:241-249 [Journal]
  12. Y. Daniel Liang
    On the Feedback Vertex Set Problem in Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:3, pp:123-129 [Journal]
  13. Y. Daniel Liang
    Dominations in Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:6, pp:309-315 [Journal]
  14. Y. Daniel Liang
    Steiner Set and Connected Domination in Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:2, pp:101-108 [Journal]
  15. Y. Daniel Liang, Norbert Blum
    Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:4, pp:215-219 [Journal]
  16. Y. Daniel Liang, Chongkye Rhee
    Finding a Maximum Matching in a Circular-Arc Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:4, pp:185-190 [Journal]
  17. Y. Daniel Liang, Chongkye Rhee
    Finding Biconnected Components in O(n) Time for a Class of Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:3, pp:159-163 [Journal]
  18. Y. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan
    A New Approach for the Domination Problem on Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:4, pp:219-224 [Journal]
  19. Chongkye Rhee, Y. Daniel Liang
    An NC Algorithm for the Clique Cover Problem in Cocomparability Graphs and its Application. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:5, pp:287-290 [Journal]
  20. Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan
    Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:1, pp:45-50 [Journal]
  21. Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan
    A New Class of Parallel Algorithms for Finding Connected Components on Machines with Bit-Vector Operations. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1994, v:76, n:3-4, pp:177-195 [Journal]
  22. Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan
    An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:2, pp:404-419 [Journal]

Search in 0.002secs, Finished in 0.003secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002