Yue-Li Wang

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

The Weighted Independent Domination Problem in Series-Parallel Graphs.

[BibT_eX]

[DOI]

Shun-Chieh Chang

Proceedings of the Intelligent Systems and Applications, 2014

Parallel Construction of Independent Spanning Trees on Parity Cubes.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE International Conference on Computational Science and Engineering, 2014

2013

Two spanning disjoint paths with required length in generalized hypercubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Global Strong Defensive Alliances of Sierpiński-Like Graphs.

[BibT_eX]

[DOI]

Chien-Hung Lin

Theory Comput. Syst., 2013

Power Domination in Honeycomb Meshes.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2013

A tight upper bound for 2-rainbow domination in generalized Petersen graphs.

[BibT_eX]

[DOI]

Kuo-Hua Wu

Discret. Appl. Math., 2013

Finding the edge ranking number through vertex partitions.

[BibT_eX]

[DOI]

Yo-Lin Lin

Justie Su-tzu Juan

Discret. Appl. Math., 2013

Independent set in categorical products of cographs and splitgraphs

[BibT_eX]

[DOI]

CoRR, 2013

On retracts and folds in cographs

[BibT_eX]

[DOI]

CoRR, 2013

Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio.

[BibT_eX]

[DOI]

CoRR, 2013

On Retracts, Absolute Retracts, and Folds in Cographs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

On Independence Domination.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

On Perfect Absorbants in De Bruijn Digraphs.

[BibT_eX]

[DOI]

Kuo-Hua Wu

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2013

2012

Generalized Recursive Circulant Graphs.

[BibT_eX]

[DOI]

Shyue-Ming Tang

Chien-Yi Li

IEEE Trans. Parallel Distributed Syst., 2012

A New Subclass of Integer Linear Programming Problems and Its Applications.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2012

A note on "Folding wheels and fans."

[BibT_eX]

[DOI]

CoRR, 2012

A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths

[BibT_eX]

[DOI]

Bang Ye Wu

Jun-Lin Guo

CoRR, 2012

Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Amortized efficiency of generating planar paths in convex position.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

The Hub Number of Sierpiński-Like Graphs.

[BibT_eX]

[DOI]

Chien-Hung Lin

William Chung-Kung Yen

Theory Comput. Syst., 2011

The minimum bandwidth required at each time slot of the fast broadcasting scheme.

[BibT_eX]

[DOI]

Chih-Jen Wu

Yu-Wei Chen

Inf. Process. Lett., 2011

Ranking and Unranking of t-Ary Trees Using RD-Sequences.

[BibT_eX]

[DOI]

Ro-Yu Wu

IEICE Trans. Inf. Syst., 2011

3-list-coloring planar graphs of girth 4.

[BibT_eX]

[DOI]

Jun-Lin Guo

Discret. Math., 2011

Unique intersectability of diamond-free graphs.

[BibT_eX]

[DOI]

Jun-Lin Guo

Tao-Ming Wang

Discret. Appl. Math., 2011

On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs

[BibT_eX]

[DOI]

Chin-Ting Ung

CoRR, 2011

A linear-time algorithm for the strong chromatic index of Halin graphs

[BibT_eX]

[DOI]

CoRR, 2011

An Optimal Rotation Distance Set.

[BibT_eX]

[DOI]

Yen-Ju Chen

Comput. J., 2011

A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2011

2010

Independent Spanning Trees on Multidimensional Torus Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2010

Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2M, 2).

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

Erratum to "A new upper bound on the queuenumber of hypercubes" [Discrete Mathematics 310 (2010) 935-939].

[BibT_eX]

[DOI]

Discret. Math., 2010

A new upper bound on the queuenumber of hypercubes.

[BibT_eX]

[DOI]

Discret. Math., 2010

Restricted power domination and fault-tolerant power domination on grids.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Loopless Generation of Non-regular Trees with a Prescribed Branching Sequence.

[BibT_eX]

[DOI]

Ro-Yu Wu

Comput. J., 2010

2009

On the independent spanning trees of recursive circulant graphs G(cdm, d) with d>2.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A fast algorithm for finding the positions of all squares in a run-length encoded string.

[BibT_eX]

[DOI]

Jia-Jie Liu

G. S. Huang

Theor. Comput. Sci., 2009

Upper bounds on the queuenumber of k-ary n-cubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Errata for "Faster index for property matching".

[BibT_eX]

[DOI]

M. T. Juan

Jia-Jie Liu

Inf. Process. Lett., 2009

The Interchange Graphs of Tournaments with Minimum Score Vectors Are Exactly Hypercubes.

[BibT_eX]

[DOI]

An-Hang Chen

Graphs Comb., 2009

Global defensive alliances in star graphs.

[BibT_eX]

[DOI]

Cheng-Ju Hsu

Fu-Hsing Wang

Discret. Appl. Math., 2009

Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2009

2008

Finding a longest common subsequence between a run-length-encoded string and an uncompressed string.

[BibT_eX]

[DOI]

Richard C. T. Lee

J. Complex., 2008

A Note on "An improved upper bound on the queuenumber of the hypercube".

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

The existence and uniqueness of strong kings in tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2008

Sequence Alignment Algorithms for Run-Length-Encoded Strings.

[BibT_eX]

[DOI]

Guan-Shieng Huang

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

Reducing the Height of Independent Spanning Trees in Chordal Rings.

[BibT_eX]

IEEE Trans. Parallel Distributed Syst., 2007

Parallel construction of optimal independent spanning trees on hypercubes.

[BibT_eX]

[DOI]

Parallel Comput., 2007

Seamless channel transition for slotted generalized fibonacci broadcasting.

[BibT_eX]

[DOI]

Multim. Syst., 2007

Edit distance for a run-length-encoded string and an uncompressed string.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Geodesic-pancyclic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations.

[BibT_eX]

[DOI]

Ro-Yu Wu

Theor. Comput. Sci., 2006

The lower and upper forcing geodetic numbers of block-cactus graphs.

[BibT_eX]

[DOI]

Fu-Hsing Wang

Eur. J. Oper. Res., 2006

2005

An efficient algorithm for estimating rotation distance between two binary trees.

[BibT_eX]

[DOI]

Yen-Ju Chen

Int. J. Comput. Math., 2005

2004

Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs.

[BibT_eX]

[DOI]

Networks, 2004

Optimal Independent Spanning Trees on Hypercubes.

[BibT_eX]

[DOI]

Shyue-Ming Tang

Yung-Ho Leu

J. Inf. Sci. Eng., 2004

Feedback vertex sets in star graphs.

[BibT_eX]

[DOI]

Fu-Hsing Wang

Inf. Process. Lett., 2004

The tree longest detour problem in a biconnected graph.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2004

2003

Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2003

2001

An Optimal Fault-Tolerant Routing Algorithm for Double-Loop Networks.

[BibT_eX]

[DOI]

Yu-Liang Liu

D. J. Guan

IEEE Trans. Computers, 2001

An efficient algorithm for solving the homogeneous set sandwich problem.

[BibT_eX]

[DOI]

Shyue-Ming Tang

Fu-Long Yeh

Inf. Process. Lett., 2001

2000

An Efficient Algorithm for Generating Prüfer Codes from Labelled Trees.

[BibT_eX]

[DOI]

Hong-Chung Chen

Theory Comput. Syst., 2000

An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs.

[BibT_eX]

[DOI]

Yu-Feng Lan

Eur. J. Oper. Res., 2000

On the powers of graphs with bounded asteroidal number.

[BibT_eX]

[DOI]

Ting-Yem Ho

Discret. Math., 2000

1999

A Linear-Time Algorithm for Solving the Center Problem on Weighted Cactus Graphs.

[BibT_eX]

[DOI]

Yu-Feng Lan

Hitoshi Suzuki

Inf. Process. Lett., 1999

A Memory-Efficient and Fast Huffman Decoding Algorithm.

[BibT_eX]

[DOI]

Hong-Chung Chen

Yu-Feng Lan

Inf. Process. Lett., 1999

1998

Optimal Algorithms for Interval Graphs.

[BibT_eX]

[DOI]

Kuo-Ching Chiang

Ming-Shing Yu

J. Inf. Sci. Eng., 1998

1997

A Parallel Algorithm for Constructing a Labeled Tree.

[BibT_eX]

[DOI]

Hon-Chan Chen

Wei-Kai Liu

IEEE Trans. Parallel Distributed Syst., 1997

Finding the Set of All Hinge Vertices for Strongly Chordal Graphs in Linear Time.

[BibT_eX]

[DOI]

Inf. Sci., 1997

A Linear Time Algorithm for Finding Depth-First Spanning Trees on Trapezoid Graphs.

[BibT_eX]

[DOI]

Hon-Chan Chen

Inf. Process. Lett., 1997

1996

A Linear Time Algorithm for Finding all Hinge Vertices of a Permutation Graph.

[BibT_eX]

[DOI]

Ting-Yem Ho

Ming-Tsan Juan

Inf. Process. Lett., 1996

On the bondage number of a graph.

[BibT_eX]

[DOI]

Discret. Math., 1996

1995

An O(1) time algorithms for computing histogram and Hough transform on a cross-bridge reconfigurable array of processors.

[BibT_eX]

[DOI]

Tzong-Wann Kao

Shi-Jinn Horng

IEEE Trans. Syst. Man Cybern., 1995

Designing Efficient Parallel Algorithms on CRAP.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1995

An O(log n) Parallel Algorithm for Constructing a Spanning Tree on Permutation Graphs.

[BibT_eX]

[DOI]

Hon-Chan Chen

Chen-Yu Lee

Inf. Process. Lett., 1995

1994

A Sweepline Algorithm to Solve the Two-Center Problem.

[BibT_eX]

[DOI]

Nen-Fu Huang

Ching-Ho Huang

Inf. Process. Lett., 1994

1993

A constant time algorithm for computing hough transform.

[BibT_eX]

[DOI]

Pattern Recognit., 1993

1992

Computing the convex hull in a hammock.

[BibT_eX]

[DOI]

Richard C. T. Lee

Jyun-Sheng Chang

Inf. Sci., 1992

1991

A Note on Optimal Multiway Split Trees.

[BibT_eX]

[DOI]

Lung-Tien Liu

Gen-Huey Chen

BIT, 1991

1989

The Number of Intersections Between Two Rectangular Paths.

[BibT_eX]

[DOI]