Yan Liang

Publications

299

Citations

H-Index

1991

Active since

Affiliations

Indiana University – Purdue University Fort Wayne(Current)

University of Oklahoma

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

ORCID

Top concepts

Combinatorial OptimizationEngineeringGraph TheoryNetwork AnalysisDiscrete MathematicsEducationNetwork ScienceComputer ScienceComputational ComplexityMathematical Programming

Publications per year

1991–2022

Publications

Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs

Yan Liang, Maw‐Shang Chang · Acta Informatica · 1997 · 68 citations

Mathematical Programming, Cocomparability Graphs, Network Science +14

Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits

Yan Liang, Norbert Blüm · Information Processing Letters · 1995 · 38 citations

Mathematical Programming, Engineering, Graph Theory +8

Blockchained supply chain management based on IoT tracking and machine learning

Zhongping Dong, Wei Liang, Yan Liang et al. · EURASIP Journal on Wireless Communications and Networking · 2022 · 34 citations · Full text

Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs

Chongkye Rhee, Yan Liang, Sudarshan Dhall et al. · Information Processing Letters · 1994 · 26 citations

Engineering, Graph Theory, Data Science +15

Reliable resource allocation for optically interconnected distributed clouds

Yi Zhu, Yan Liang, Qiong Zhang et al. · 2014 · 26 citations

Cluster Computing, Engineering, Dynamic Resource Allocation +19

Rows per page

1–5 of 11