The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Ruo-Wei Hung" ( http://dblp.L3S.de/Authors/Ruo-Wei_Hung )

  Author page on DBLP  Author page in RDF  Community of Ruo-Wei Hung in ASPL-2

Publication years (Num. hits)
2003-2012 (15)
Publication types (Num. hits)
article(14) inproceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 15 publication records. Showing 15 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Ruo-Wei Hung Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ruo-Wei Hung Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ruo-Wei Hung, Maw-Shang Chang An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ruo-Wei Hung, Maw-Shang Chang Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs. Search on Bibsonomy Appl. Math. Lett. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ruo-Wei Hung, Chih-Chia Yao Linear-time algorithm for the matched-domination problem in cographs. Search on Bibsonomy Int. J. Comput. Math. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ruo-Wei Hung Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Ruo-Wei Hung Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Ruo-Wei Hung, Maw-Shang Chang Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs. Search on Bibsonomy ICCSA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Chih-Chia Yao, Pao-Ta Yu, Ruo-Wei Hung Extractive Support Vector Algorithm on Support Vector Machines for Image Restoration. Search on Bibsonomy Fundam. Inform. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ruo-Wei Hung Optimal vertex ranking of block graphs. Search on Bibsonomy Inf. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Ruo-Wei Hung, Maw-Shang Chang Finding a minimum path cover of a distance-hereditary graph in polynomial time. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Ruo-Wei Hung Optimal edge ranking of complete bipartite graphs in polynomial time. Search on Bibsonomy Discussiones Mathematicae Graph Theory The full citation details ... 2006 DBLP  BibTeX  RDF
1Ruo-Wei Hung, Maw-Shang Chang Solving the path cover problem on circular-arc graphs by using an approximation algorithm. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Ruo-Wei Hung, Maw-Shang Chang Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, . Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Ruo-Wei Hung, Shaur-Ching Wu, Maw-Shang Chang Hamiltonian Cycle Problem on Distance-Hereditary Graphs. Search on Bibsonomy J. Inf. Sci. Eng. The full citation details ... 2003 DBLP  BibTeX  RDF
Displaying result #1 - #15 of 15 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.