Yue-Li Wang

According to our database1, Yue-Li Wang authored at least 114 papers between 1989 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
The Outer-Paired Domination of Graphs.
Int. J. Found. Comput. Sci., 2022

2021
A note on the geodetic number and the Steiner number of AT-free graphs.
Theor. Comput. Sci., 2021

2019
A simple algorithm for secure domination in proper interval graphs.
Discret. Appl. Math., 2019

2018
On retracts, absolute retracts, and foldings in cographs.
Optim. Lett., 2018

Cycle Embedding in Generalized Recursive Circulant Graphs.
IEICE Trans. Inf. Syst., 2018

2017
Construction independent spanning trees on locally twisted cubes in parallel.
J. Comb. Optim., 2017

A note on path embedding in crossed cubes with faulty vertices.
Inf. Process. Lett., 2017

On 2-rainbow domination in generalized Petersen graphs.
Int. J. Comput. Math. Comput. Syst. Theory, 2017

On efficient absorbant conjecture in generalized De Bruijn digraphs.
Int. J. Comput. Math., 2017

Efficient absorbants in generalized de Bruijn digraphs.
Discret. Optim., 2017

On the Orbits of Crossed Cubes.
CoRR, 2017

Geodetic Contraction Games on Trees.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

2016
The connected p-median problem on block graphs.
Optim. Lett., 2016

The Outer-connected Domination Number of Sierpiński-like Graphs.
Theory Comput. Syst., 2016

Corrigendum to "Incidence coloring of Cartesian product graphs" [Inf. Process. Lett. (2015) 765-768].
Inf. Process. Lett., 2016

On complexities of minus domination.
Discret. Optim., 2016

P_3-Games on Chordal Bipartite Graphs.
CoRR, 2016

2015
The hub number of co-comparability graphs.
Theor. Comput. Sci., 2015

Edge-clique covers of the tensor product.
Theor. Comput. Sci., 2015

On maximum independent set of categorical product and ultimate categorical ratios of graphs.
Theor. Comput. Sci., 2015

On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs.
J. Discrete Algorithms, 2015

Incidence coloring of Cartesian product graphs.
Inf. Process. Lett., 2015

Finding outer-connected dominating sets in interval graphs.
Inf. Process. Lett., 2015

Efficient twin domination in generalized De Bruijn digraphs.
Discret. Math., 2015

Convexities in Some Special Graph Classes - New Results in AT-free Graphs and Beyond.
CoRR, 2015

Constrained Longest Common Subsequences with Run-Length-Encoded Strings.
Comput. J., 2015

A Fast Parallel Algorithm for Constructing Independent Spanning Trees on Parity Cubes.
Appl. Math. Comput., 2015

Resequencing a Set of Strings Based on a Target String.
Algorithmica, 2015

2014
On the complexity of the black-and-white coloring problem on some classes of perfect graphs.
Theor. Comput. Sci., 2014

(n-3)-edge-fault-tolerant weak-pancyclicity of (n, k)-star graphs.
Theor. Comput. Sci., 2014

Hamiltonian cycles in hypercubes with faulty edges.
Inf. Sci., 2014

Queue Layouts of Toroidal Grids.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Circuits of Each Length in Tournaments.
Graphs Comb., 2014

Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

The Weighted Independent Domination Problem in Series-Parallel Graphs.
Proceedings of the Intelligent Systems and Applications, 2014

Parallel Construction of Independent Spanning Trees on Parity Cubes.
Proceedings of the 17th IEEE International Conference on Computational Science and Engineering, 2014

2013
Two spanning disjoint paths with required length in generalized hypercubes.
Theor. Comput. Sci., 2013

Global Strong Defensive Alliances of Sierpiński-Like Graphs.
Theory Comput. Syst., 2013

Power Domination in Honeycomb Meshes.
J. Inf. Sci. Eng., 2013

A tight upper bound for 2-rainbow domination in generalized Petersen graphs.
Discret. Appl. Math., 2013

Finding the edge ranking number through vertex partitions.
Discret. Appl. Math., 2013

Independent set in categorical products of cographs and splitgraphs
CoRR, 2013

On retracts and folds in cographs
CoRR, 2013

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

On Retracts, Absolute Retracts, and Folds in Cographs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

On Independence Domination.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

On Perfect Absorbants in De Bruijn Digraphs.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012
Generalized Recursive Circulant Graphs.
IEEE Trans. Parallel Distributed Syst., 2012

A New Subclass of Integer Linear Programming Problems and Its Applications.
IEEE Trans. Computers, 2012

A note on "Folding wheels and fans."
CoRR, 2012

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

Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs.
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.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
Amortized efficiency of generating planar paths in convex position.
Theor. Comput. Sci., 2011

The Hub Number of Sierpiński-Like Graphs.
Theory Comput. Syst., 2011

The minimum bandwidth required at each time slot of the fast broadcasting scheme.
Inf. Process. Lett., 2011

Ranking and Unranking of <i>t</i>-Ary Trees Using RD-Sequences.
IEICE Trans. Inf. Syst., 2011

3-list-coloring planar graphs of girth 4.
Discret. Math., 2011

Unique intersectability of diamond-free graphs.
Discret. Appl. Math., 2011

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

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

An Optimal Rotation Distance Set.
Comput. J., 2011

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

2010
Independent Spanning Trees on Multidimensional Torus Networks.
IEEE Trans. Computers, 2010

Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2<sup>M</sup>, 2).
Int. J. Found. Comput. Sci., 2010

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

A new upper bound on the queuenumber of hypercubes.
Discret. Math., 2010

Restricted power domination and fault-tolerant power domination on grids.
Discret. Appl. Math., 2010

Loopless Generation of Non-regular Trees with a Prescribed Branching Sequence.
Comput. J., 2010

2009
On the independent spanning trees of recursive circulant graphs G(cd<sup>m</sup>, d) with d>2.
Theor. Comput. Sci., 2009

A fast algorithm for finding the positions of all squares in a run-length encoded string.
Theor. Comput. Sci., 2009

Upper bounds on the queuenumber of k-ary n-cubes.
Inf. Process. Lett., 2009

Errata for "Faster index for property matching".
Inf. Process. Lett., 2009

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

Global defensive alliances in star graphs.
Discret. Appl. Math., 2009

Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes.
Appl. Math. Comput., 2009

2008
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string.
J. Complex., 2008

A Note on "An improved upper bound on the queuenumber of the hypercube".
Inf. Process. Lett., 2008

The existence and uniqueness of strong kings in tournaments.
Discret. Math., 2008

Sequence Alignment Algorithms for Run-Length-Encoded Strings.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
Reducing the Height of Independent Spanning Trees in Chordal Rings.
IEEE Trans. Parallel Distributed Syst., 2007

Parallel construction of optimal independent spanning trees on hypercubes.
Parallel Comput., 2007

Seamless channel transition for slotted generalized fibonacci broadcasting.
Multim. Syst., 2007

Edit distance for a run-length-encoded string and an uncompressed string.
Inf. Process. Lett., 2007

Geodesic-pancyclic graphs.
Discret. Appl. Math., 2007

2006
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations.
Theor. Comput. Sci., 2006

The lower and upper forcing geodetic numbers of block-cactus graphs.
Eur. J. Oper. Res., 2006

2005
An efficient algorithm for estimating rotation distance between two binary trees.
Int. J. Comput. Math., 2005

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

Optimal Independent Spanning Trees on Hypercubes.
J. Inf. Sci. Eng., 2004

Feedback vertex sets in star graphs.
Inf. Process. Lett., 2004

The tree longest detour problem in a biconnected graph.
Eur. J. Oper. Res., 2004

2003
Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.
J. Parallel Distributed Comput., 2003

2001
An Optimal Fault-Tolerant Routing Algorithm for Double-Loop Networks.
IEEE Trans. Computers, 2001

An efficient algorithm for solving the homogeneous set sandwich problem.
Inf. Process. Lett., 2001

2000
An Efficient Algorithm for Generating Prüfer Codes from Labelled Trees.
Theory Comput. Syst., 2000

An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs.
Eur. J. Oper. Res., 2000

On the powers of graphs with bounded asteroidal number.
Discret. Math., 2000

1999
A Linear-Time Algorithm for Solving the Center Problem on Weighted Cactus Graphs.
Inf. Process. Lett., 1999

A Memory-Efficient and Fast Huffman Decoding Algorithm.
Inf. Process. Lett., 1999

1998
Optimal Algorithms for Interval Graphs.
J. Inf. Sci. Eng., 1998

1997
A Parallel Algorithm for Constructing a Labeled Tree.
IEEE Trans. Parallel Distributed Syst., 1997

Finding the Set of All Hinge Vertices for Strongly Chordal Graphs in Linear Time.
Inf. Sci., 1997

A Linear Time Algorithm for Finding Depth-First Spanning Trees on Trapezoid Graphs.
Inf. Process. Lett., 1997

1996
A Linear Time Algorithm for Finding all Hinge Vertices of a Permutation Graph.
Inf. Process. Lett., 1996

On the bondage number of a graph.
Discret. Math., 1996

1995
An O(1) time algorithms for computing histogram and Hough transform on a cross-bridge reconfigurable array of processors.
IEEE Trans. Syst. Man Cybern., 1995

Designing Efficient Parallel Algorithms on CRAP.
IEEE Trans. Parallel Distributed Syst., 1995

An O(log n) Parallel Algorithm for Constructing a Spanning Tree on Permutation Graphs.
Inf. Process. Lett., 1995

1994
A Sweepline Algorithm to Solve the Two-Center Problem.
Inf. Process. Lett., 1994

1993
A constant time algorithm for computing hough transform.
Pattern Recognit., 1993

1992
Computing the convex hull in a hammock.
Inf. Sci., 1992

1991
A Note on Optimal Multiway Split Trees.
BIT, 1991

1989
The Number of Intersections Between Two Rectangular Paths.
IEEE Trans. Computers, 1989


  Loading...