Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Yue-Li Wang
2010 – today
- 2013
[j60]Yo-Lin Lin, Justie Su-tzu Juan, Yue-Li Wang: Finding the edge ranking number through vertex partitions. Discrete Applied Mathematics 161(7-8): 1067-1071 (2013)
[j59]Yue-Li Wang, Kuo-Hua Wu: A tight upper bound for 2-rainbow domination in generalized Petersen graphs. Discrete Applied Mathematics 161(13-14): 2178-2188 (2013)
[c4]Yue-Li Wang, Kuo-Hua Wu, Ton Kloks: On Perfect Absorbants in De Bruijn Digraphs. FAW-AAIM 2013: 303-314
[i11]
[i10]Wing-Kai Hon, Ton Kloks, Hsiang Hsuan Liu, Sheung-Hung Poon, Yue-Li Wang: On independence domination. CoRR abs/1304.6450 (2013)
[i9]Wing-Kai Hon, Ton Kloks, S. Liu, Sheung-Hung Poon, Yue-Li Wang: Independent set in categorical products of cographs and splitgraphs. CoRR abs/1305.4237 (2013)- 2012
[j58]Yue-Li Wang, Cheng-Ju Hsu, Jia Jie Liu, Ming-Tat Ko, Fu-Hsing Wang: A New Subclass of Integer Linear Programming Problems and Its Applications. IEEE Trans. Computers 61(12): 1813-1822 (2012)
[j57]Shyue-Ming Tang, Yue-Li Wang, Chien-Yi Li: Generalized Recursive Circulant Graphs. IEEE Trans. Parallel Distrib. Syst. 23(1): 87-93 (2012)
[c3]Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai, Yue-Li Wang: The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs. FAW-AAIM 2012: 339-350
[c2]Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung, Yue-Li Wang: Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs. COCOON 2012: 157-168
[i8]Ton Kloks, Sheung-Hung Poon, Yue-Li Wang: The black-and-white coloring problem on circle graphs. CoRR abs/1202.1896 (2012)
[i7]Bang Ye Wu, Jun-Lin Guo, Yue-Li Wang: A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths. CoRR abs/1203.5235 (2012)
[i6]
[i5]- 2011
[j56]Kuo-Hua Kao, Jou-Ming Chang, Yue-Li Wang, Justie Su-tzu Juan: A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs. Algorithmica 61(2): 402-418 (2011)
[j55]Yen-Ju Chen, Jia Jie Liu, Yue-Li Wang: An Optimal Rotation Distance Set. Comput. J. 54(5): 824-830 (2011)
[j54]Jun-Lin Guo, Tao-Ming Wang, Yue-Li Wang: Unique intersectability of diamond-free graphs. Discrete Applied Mathematics 159(8): 774-778 (2011)
[j53]Jun-Lin Guo, Yue-Li Wang: 3-list-coloring planar graphs of girth 4. Discrete Mathematics 311(6): 413-417 (2011)
[j52]Ro-Yu Wu, Jou-Ming Chang, Yue-Li Wang: Ranking and Unranking of t-Ary Trees Using RD-Sequences. IEICE Transactions 94-D(2): 226-232 (2011)
[j51]Chih-Jen Wu, Yu-Wei Chen, Yue-Li Wang: The minimum bandwidth required at each time slot of the fast broadcasting scheme. Inf. Process. Lett. 111(20): 1014-1018 (2011)
[j50]Chien-Hung Lin, Jia Jie Liu, Yue-Li Wang, William Chung-Kung Yen: The Hub Number of Sierpiński-Like Graphs. Theory Comput. Syst. 49(3): 588-600 (2011)
[j49]Ro-Yu Wu, Jou-Ming Chang, Kung-Jui Pai, Yue-Li Wang: Amortized efficiency of generating planar paths in convex position. Theor. Comput. Sci. 412(35): 4504-4512 (2011)
[i4]Ton Kloks, Yue-Li Wang: A linear-time algorithm for the strong chromatic index of Halin graphs. CoRR abs/1109.3934 (2011)
[i3]Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung, Yue-Li Wang: Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs. CoRR abs/1110.0583 (2011)
[i2]Ton Kloks, Chin-Ting Ung, Yue-Li Wang: On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs. CoRR abs/1110.1693 (2011)
[i1]Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai, Yue-Li Wang: The black-and-white coloring problem on distance hereditary graphs and strongly chordal graphs. CoRR abs/1111.0867 (2011)- 2010
[j48]Ro-Yu Wu, Jou-Ming Chang, Yue-Li Wang: Loopless Generation of Non-regular Trees with a Prescribed Branching Sequence. Comput. J. 53(6): 661-666 (2010)
[j47]Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang: Restricted power domination and fault-tolerant power domination on grids. Discrete Applied Mathematics 158(10): 1079-1089 (2010)
[j46]Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang: A new upper bound on the queuenumber of hypercubes. Discrete Mathematics 310(4): 935-939 (2010)
[j45]Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang: Erratum to "A new upper bound on the queuenumber of hypercubes" [Discrete Mathematics 310 (2010) 935-939]. Discrete Mathematics 310(13-14): 2059 (2010)
[j44]Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang: Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2M, 2). Int. J. Found. Comput. Sci. 21(1): 73-90 (2010)
[j43]Shyue-Ming Tang, Jinn-Shyong Yang, Yue-Li Wang, Jou-Ming Chang: Independent Spanning Trees on Multidimensional Torus Networks. IEEE Trans. Computers 59(1): 93-102 (2010)
2000 – 2009
- 2009
[j42]Hung-Chang Chan, Jou-Ming Chang, Yue-Li Wang, Shi-Jinn Horng: Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes. Applied Mathematics and Computation 207(2): 333-339 (2009)
[j41]Cheng-Ju Hsu, Fu-Hsing Wang, Yue-Li Wang: Global defensive alliances in star graphs. Discrete Applied Mathematics 157(8): 1924-1931 (2009)
[j40]An-Hang Chen, Jou-Ming Chang, Yue-Li Wang: The Interchange Graphs of Tournaments with Minimum Score Vectors Are Exactly Hypercubes. Graphs and Combinatorics 25(1): 27-34 (2009)
[j39]Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang: Upper bounds on the queuenumber of k-ary n-cubes. Inf. Process. Lett. 110(2): 50-56 (2009)
[j38]Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang: On the independent spanning trees of recursive circulant graphs G(cdm, d) with d>2. Theor. Comput. Sci. 410(21-23): 2001-2010 (2009)- 2008
[j37]An-Hang Chen, Jou-Ming Chang, Yuwen Cheng, Yue-Li Wang: The existence and uniqueness of strong kings in tournaments. Discrete Mathematics 308(12): 2629-2633 (2008)
[j36]Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang: A Note on "An improved upper bound on the queuenumber of the hypercube". Inf. Process. Lett. 108(3): 107-109 (2008)
[j35]Jia Jie Liu, Yue-Li Wang, Richard C. T. Lee: Finding a longest common subsequence between a run-length-encoded string and an uncompressed string. J. Complexity 24(2): 173-184 (2008)
[c1]Guan-Shieng Huang, Jia Jie Liu, Yue-Li Wang: Sequence Alignment Algorithms for Run-Length-Encoded Strings. COCOON 2008: 319-330- 2007
[j34]Hung-Chang Chan, Jou-Ming Chang, Yue-Li Wang, Shi-Jinn Horng: Geodesic-pancyclic graphs. Discrete Applied Mathematics 155(15): 1971-1978 (2007)
[j33]Jia Jie Liu, Guan-Shieng Huang, Yue-Li Wang, Richard C. T. Lee: Edit distance for a run-length-encoded string and an uncompressed string. Inf. Process. Lett. 105(1): 12-16 (2007)
[j32]Chih-Jen Wu, Yu-Wei Chen, Jing-Ho Yan, Yue-Li Wang: Seamless channel transition for slotted generalized fibonacci broadcasting. Multimedia Syst. 13(3): 223-233 (2007)
[j31]Jinn-Shyong Yang, Shyue-Ming Tang, Jou-Ming Chang, Yue-Li Wang: Parallel construction of optimal independent spanning trees on hypercubes. Parallel Computing 33(1): 73-79 (2007)
[j30]Jinn-Shyong Yang, Jou-Ming Chang, Shyue-Ming Tang, Yue-Li Wang: Reducing the Height of Independent Spanning Trees in Chordal Rings. IEEE Trans. Parallel Distrib. Syst. 18(5): 644-657 (2007)- 2006
[j29]Fu-Hsing Wang, Yue-Li Wang, Jou-Ming Chang: The lower and upper forcing geodetic numbers of block-cactus graphs. European Journal of Operational Research 175(1): 238-245 (2006)
[j28]Ro-Yu Wu, Jou-Ming Chang, Yue-Li Wang: A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations. Theor. Comput. Sci. 355(3): 303-314 (2006)- 2005
[j27]Yen-Ju Chen, Jou-Ming Chang, Yue-Li Wang: An efficient algorithm for estimating rotation distance between two binary trees. Int. J. Comput. Math. 82(9): 1095-1106 (2005)- 2004
[j26]Fu-Long Yeh, Shyue-Ming Tang, Yue-Li Wang, Ting-Yem Ho: The tree longest detour problem in a biconnected graph. European Journal of Operational Research 155(3): 631-637 (2004)
[j25]Fu-Hsing Wang, Yue-Li Wang, Jou-Ming Chang: Feedback vertex sets in star graphs. Inf. Process. Lett. 89(4): 203-208 (2004)
[j24]Shyue-Ming Tang, Yue-Li Wang, Yung-Ho Leu: Optimal Independent Spanning Trees on Hypercubes. J. Inf. Sci. Eng. 20(1): 143-156 (2004)
[j23]Jou-Ming Chang, Jinn-Shyong Yang, Yue-Li Wang, Yuwen Cheng: Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs. Networks 44(4): 302-310 (2004)- 2003
[j22]Fu-Hsing Wang, Jou-Ming Chang, Yue-Li Wang, Sun-Jen Huang: Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars. J. Parallel Distrib. Comput. 63(4): 481-487 (2003)- 2001
[j21]Shyue-Ming Tang, Fu-Long Yeh, Yue-Li Wang: An efficient algorithm for solving the homogeneous set sandwich problem. Inf. Process. Lett. 77(1): 17-22 (2001)
[j20]Yu-Liang Liu, Yue-Li Wang, D. J. Guan: An Optimal Fault-Tolerant Routing Algorithm for Double-Loop Networks. IEEE Trans. Computers 50(5): 500-505 (2001)- 2000
[j19]Ting-Yem Ho, Jou-Ming Chang, Yue-Li Wang: On the powers of graphs with bounded asteroidal number. Discrete Mathematics 223(1-3): 125-133 (2000)
[j18]Yu-Feng Lan, Yue-Li Wang: An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs. European Journal of Operational Research 122(3): 602-610 (2000)
[j17]Hong-Chung Chen, Yue-Li Wang: An Efficient Algorithm for Generating Prüfer Codes from Labelled Trees. Theory Comput. Syst. 33(1): 97-105 (2000)
1990 – 1999
- 1999
[j16]Hong-Chung Chen, Yue-Li Wang, Yu-Feng Lan: A Memory-Efficient and Fast Huffman Decoding Algorithm. Inf. Process. Lett. 69(3): 119-122 (1999)
[j15]Yu-Feng Lan, Yue-Li Wang, Hitoshi Suzuki: A Linear-Time Algorithm for Solving the Center Problem on Weighted Cactus Graphs. Inf. Process. Lett. 71(5-6): 205-212 (1999)- 1998
[j14]Yue-Li Wang, Kuo-Ching Chiang, Ming-Shing Yu: Optimal Algorithms for Interval Graphs. J. Inf. Sci. Eng. 14(2): 449-459 (1998)- 1997
[j13]Hon-Chan Chen, Yue-Li Wang: A Linear Time Algorithm for Finding Depth-First Spanning Trees on Trapezoid Graphs. Inf. Process. Lett. 63(1): 13-18 (1997)
[j12]Jou-Ming Chang, Chiun-Chieh Hsu, Yue-Li Wang, Ting-Yem Ho: Finding the Set of All Hinge Vertices for Strongly Chordal Graphs in Linear Time. Inf. Sci. 99(3-4): 173-182 (1997)
[j11]Yue-Li Wang, Hon-Chan Chen, Wei-Kai Liu: A Parallel Algorithm for Constructing a Labeled Tree. IEEE Trans. Parallel Distrib. Syst. 8(12): 1236-1240 (1997)- 1996
[j10]
[j9]Ting-Yem Ho, Yue-Li Wang, Ming-Tsan Juan: A Linear Time Algorithm for Finding all Hinge Vertices of a Permutation Graph. Inf. Process. Lett. 59(2): 103-107 (1996)- 1995
[j8]Yue-Li Wang, Hon-Chan Chen, Chen-Yu Lee: An O(log n) Parallel Algorithm for Constructing a Spanning Tree on Permutation Graphs. Inf. Process. Lett. 56(2): 83-87 (1995)
[j7]Tzong-Wann Kao, Shi-Jinn Horng, Yue-Li Wang, Horng-Ren Tsai: Designing Efficient Parallel Algorithms on CRAP. IEEE Trans. Parallel Distrib. Syst. 6(5): 554-560 (1995)
[j6]Tzong-Wann Kao, Shi-Jinn Horng, Yue-Li Wang: An O(1) time algorithms for computing histogram and Hough transform on a cross-bridge reconfigurable array of processors. IEEE Transactions on Systems, Man, and Cybernetics 25(4): 681-687 (1995)- 1994
[j5]Nen-Fu Huang, Ching-Ho Huang, Yue-Li Wang: A Sweepline Algorithm to Solve the Two-Center Problem. Inf. Process. Lett. 49(4): 171-177 (1994)- 1993
[j4]Tzong-Wann Kao, Shi-Jinn Horng, Yue-Li Wang, Kuo-Liang Chung: A constant time algorithm for computing hough transform. Pattern Recognition 26(2): 277-286 (1993)- 1992
[j3]Yue-Li Wang, Richard C. T. Lee, Jyun-Sheng Chang: Computing the convex hull in a hammock. Inf. Sci. 59(1-2): 103-119 (1992)- 1991
[j2]Lung-Tien Liu, Gen-Huey Chen, Yue-Li Wang: A Note on Optimal Multiway Split Trees. BIT 31(2): 220-229 (1991)
1980 – 1989
- 1989
[j1]Yue-Li Wang, Richard C. T. Lee, Jyun-Sheng Chang: The Number of Intersections Between Two Rectangular Paths. IEEE Trans. Computers 38(11): 1564-1571 (1989)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-12 21:38 CEST by the dblp team



