Ling-Ju Hung

	2011
10		Ling-Ju Hung, Ton Kloks: k-Cographs are Kruskalian. Chicago J. Theor. Comput. Sci. 2011: (2011)
9		Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng: On the threshold-width of graphs. J. Graph Algorithms Appl. 15(2): 253-268 (2011)
8		Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng: Block-graph width. Theor. Comput. Sci. 412(23): 2496-2502 (2011)
	2010
7		Ling-Ju Hung, Ton Kloks: Classifying Rankwidth k-DH-Graphs. CSR 2010: 195-203
6		Maw-Shang Chang, Ling-Ju Hung: Recognition of Probe Ptolemaic Graphs - (Extended Abstract). IWOCA 2010: 286-290
5		Ling-Ju Hung, Ton Kloks: On Some Simple Widths. WALCOM 2010: 204-215
	2009
4		Ling-Ju Hung, Ton Kloks, Chuan-Min Lee: Trivially-Perfect Width. IWOCA 2009: 301-311
3		Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng: Block-Graph Width. TAMC 2009: 150-157
	2005
2		Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chia-Ben Shen, Chuan Yi Tang: An improved algorithm for the maximum agreement subtree problem. Inf. Process. Lett. 94(5): 211-216 (2005)
	2004
1		Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chuan Yi Tang: An Improved Algorithm for the Maximum Agreement Subtree Problem. BIBE 2004: 533-536

Coauthor Index

1	Maw-Shang Chang	[1] [2] [3] [6] [8] [9]
2	Ton Kloks (Antonius J. J. Kloks)	[3] [4] [5] [7] [8] [9] [10]
3	Chuan-Min Lee	[1] [2] [4]
4	Sheng-Lung Peng	[3] [8] [9]
5	Chia-Ben Shen	[2]
6	Chuan Yi Tang	[1] [2]

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