Concepedia

Y. Daniel Liang

YD

3

Publications

96

Citations

3

H-Index

1993

Active since

Affiliations

Indiana University – Purdue University Fort Wayne(Current)

Y. Daniel Liang is an author at Indiana University – Purdue University Fort Wayne specializing in combinatorial optimization, graph theory, and discrete mathematics.

ORCID

Top concepts

Publications per year

1993–1996

3

Publications

3

On the feedback vertex set problem in permutation graphs

Y. Daniel Liang · Information Processing Letters · 1994 · 62 citations

, , +7

An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph

Chongkye Rhee, Y. Daniel Liang, Sudarshan Dhall et al. · SIAM Journal on Computing · 1996 · 17 citations

, , +18

Finding a maximum matching in a circular-arc graph

Y. Daniel Liang, Chongkye Rhee · Information Processing Letters · 1993 · 17 citations

, , +4

Rows per page

1–3 of 3