Y. Daniel Liang

MaRDI QIDQ1209982zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Dominations in trapezoid graphs Information Processing Letters	2000-06-21	Paper
scientific article; zbMATH DE number 1151797 (Why is no real title available?)	1998-10-19	Paper
Parallel algorithms for the domination problems in trapezoid graphs Discrete Applied Mathematics	1997-11-25	Paper
Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs Acta Informatica	1997-06-19	Paper
Finding biconnected components in O(n) time for a class of graphs Information Processing Letters	1997-02-27	Paper
Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits Information Processing Letters	1997-02-27	Paper
An NC algorithm for the clique cover problem in cocomparability graphs and its application Information Processing Letters	1997-02-27	Paper
An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph SIAM Journal on Computing	1996-11-10	Paper
Finding a maximum matching in a permutation graph Acta Informatica	1995-11-20	Paper
On the feedback vertex set problem in permutation graphs Information Processing Letters	1995-10-09	Paper
Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs Information Processing Letters	1994-01-01	Paper
Finding a maximum matching in a circular-arc graph Information Processing Letters	1993-05-16	Paper

Research outcomes over time

This page was built for person: Y. Daniel Liang