Ruo-Wei Hung

	2012
15		Ruo-Wei Hung: Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs. Theory Comput. Syst. 50(4): 721-738 (2012)
	2011
14		Ruo-Wei Hung, Maw-Shang Chang: Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs. Appl. Math. Lett. 24(5): 648-652 (2011)
13		Ruo-Wei Hung, Chih-Chia Yao: Linear-time algorithm for the matched-domination problem in cographs. Int. J. Comput. Math. 88(10): 2042-2056 (2011)
12		Ruo-Wei Hung: Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes. Theor. Comput. Sci. 412(35): 4747-4753 (2011)
11		Ruo-Wei Hung, Maw-Shang Chang: An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs. Theor. Comput. Sci. 412(39): 5351-5373 (2011)
	2010
10		Ruo-Wei Hung, Maw-Shang Chang: Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs. ICCSA (2) 2010: 314-323
9		Ruo-Wei Hung: Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes CoRR abs/1006.3909: (2010)
8		Ruo-Wei Hung: Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes CoRR abs/1010.2466: (2010)
	2009
7		Chih-Chia Yao, Pao-Ta Yu, Ruo-Wei Hung: Extractive Support Vector Algorithm on Support Vector Machines for Image Restoration. Fundam. Inform. 90(1-2): 171-190 (2009)
	2008
6		Ruo-Wei Hung: Optimal vertex ranking of block graphs. Inf. Comput. 206(11): 1288-1302 (2008)
	2007
5		Ruo-Wei Hung, Maw-Shang Chang: Finding a minimum path cover of a distance-hereditary graph in polynomial time. Discrete Applied Mathematics 155(17): 2242-2256 (2007)
	2006
4		Ruo-Wei Hung, Maw-Shang Chang: Solving the path cover problem on circular-arc graphs by using an approximation algorithm. Discrete Applied Mathematics 154(1): 76-105 (2006)
3		Ruo-Wei Hung: Optimal edge ranking of complete bipartite graphs in polynomial time. Discussiones Mathematicae Graph Theory 26(1): 149-159 (2006)
	2005
2		Ruo-Wei Hung, Maw-Shang Chang: Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, . Theor. Comput. Sci. 341(1-3): 411-440 (2005)
	2003
1		Ruo-Wei Hung, Shaur-Ching Wu, Maw-Shang Chang: Hamiltonian Cycle Problem on Distance-Hereditary Graphs. J. Inf. Sci. Eng. 19(5): 827-838 (2003)

Coauthor Index

1	Maw-Shang Chang	[1] [2] [4] [5] [10] [11] [14]
2	Shaur-Ching Wu	[1]
3	Chih-Chia Yao	[7] [13]
4	Pao-Ta Yu	[7]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page