Chuan Yi Tang

Available identifiers

zbMath Open tang.chuan-yiMaRDI QIDQ286980

List of research outcomes

Publication	Date of Publication	Type
An efficient algorithm for the length-constrained heaviest path problem on a tree	2016-06-16	Paper
A linear-time algorithm for the weighted feedback vertex problem on interval graphs	2016-05-26	Paper
On the Full and Bottleneck Full Steiner Tree Problems	2011-03-18	Paper
An improved algorithm for sorting by block-interchanges based on permutation groups	2010-09-07	Paper
An improved algorithm for finding a length-constrained maximum-density subtree in a tree	2010-06-09	Paper
Efficient algorithms for regular expression constrained sequence alignment	2010-03-24	Paper
Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs	2010-01-29	Paper
An improved algorithm for the maximum agreement subtree problem	2009-12-04	Paper
A fast algorithm for the alpha-connected two-center decision problem	2009-03-23	Paper
The Bottleneck Tree Alignment Problems	2009-02-10	Paper
Constrained sequence alignment: A general model and the hardness results	2007-11-30	Paper
Efficient Algorithms for Regular Expression Constrained Sequence Alignment	2007-09-14	Paper
Computational Science and Its Applications – ICCSA 2004	2007-07-19	Paper
Approximation algorithms for somek-source shortest paths spanning tree problems	2006-06-06	Paper
Computational Science – ICCS 2005	2005-11-30	Paper
The full Steiner tree problem	2005-01-18	Paper
https://portal.mardi4nfdi.de/entity/Q4808628	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4472497	2004-08-04	Paper
Efficient minus and signed domination in graphs	2003-07-30	Paper
https://portal.mardi4nfdi.de/entity/Q4551373	2002-09-05	Paper
Perfect edge domination and efficient edge domination in graphs	2002-08-29	Paper
Guarding in a simple polygon	2002-07-25	Paper
An efficient external sorting algorithm	2002-07-25	Paper
Light graphs with small routing cost	2002-07-01	Paper
Weighted efficient domination problem on some perfect graphs	2002-05-15	Paper
Finding the shortest boundary guard of a simple polygon	2001-08-20	Paper
Embedding cycles and meshes onto incomplete hypercubes	2001-05-20	Paper
Approximation algorithms for the shortest total path length spanning tree problem	2001-02-27	Paper
Approximation algorithms for some optimum communication spanning tree problems	2000-11-27	Paper
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees	2000-08-27	Paper
https://portal.mardi4nfdi.de/entity/Q4953355	2000-05-09	Paper
https://portal.mardi4nfdi.de/entity/Q4250159	2000-02-09	Paper
Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices	1999-11-21	Paper
EFFICIENT EMULATIONS FOR X-TREES AND /w-ARY TREES*	1999-06-22	Paper
Solving the weighted efficient edge domination problem on bipartite permutation graphs	1999-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q4218433	1999-03-30	Paper
https://portal.mardi4nfdi.de/entity/Q4218431	1998-11-11	Paper
An average case analysis of a greedy algorithm for the on-line Steiner tree problem	1996-11-10	Paper
Randomized algorithms for the on-line minimum matching problem on euclidean space	1996-10-07	Paper
Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space	1996-02-26	Paper
Single step searching in weighted block graphs	1995-08-10	Paper
The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems	1994-05-19	Paper
The summation and bottleneck minimization for single-step searching on weighted graphs	1994-01-13	Paper
A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem	1993-10-17	Paper
https://portal.mardi4nfdi.de/entity/Q4201930	1993-09-06	Paper
An efficient algorithm for finding a maximum weight 2-independent set on interval graphs	1993-01-17	Paper
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs	1993-01-16	Paper
Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs	1992-09-27	Paper
Computing the optimal IO sequences of a protocol in polynomial time	1992-06-28	Paper
Solving the single step graph searching problem by solving the maximum two-independent set problem	1992-06-28	Paper
20‐relative neighborhood graphs are hamiltonian	1992-06-27	Paper
COVERING CONVEX RECTILINEAR POLYGONS IN LINEAR TIME	1992-06-27	Paper
An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs	1990-01-01	Paper
Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy	1984-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Chuan Yi Tang