The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ruo-Wei Hung: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ruo-Wei Hung, Maw-Shang Chang
    Solving the path cover problem on circular-arc graphs by using an approximation algorithm. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:1, pp:76-105 [Journal]
  2. Ruo-Wei Hung, Shaur-Ching Wu, Maw-Shang Chang
    Hamiltonian Cycle Problem on Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 2003, v:19, n:5, pp:827-838 [Journal]
  3. Ruo-Wei Hung, Maw-Shang Chang
    Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, . [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:341, n:1-3, pp:411-440 [Journal]
  4. Ruo-Wei Hung, Maw-Shang Chang
    Finding a minimum path cover of a distance-hereditary graph in polynomial time. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:17, pp:2242-2256 [Journal]

  5. Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs. [Citation Graph (, )][DBLP]


  6. Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.001secs
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