Guizhen Liu
2009
A researcher in the Science corpus: 2 papers; trusts 0 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Papers from Guizhen Liu's perspective
Ordered by how strongly the researchers Guizhen Liu trusts endorse each paper. Same corpus, a different order for every researcher.
- Paths, Trees, and Flowers
- The Complexity of Computing the Permanent
- Introduction to graph theory
- A Szemerédi-type regularity lemma in abelian groups, with applications
- The NP-Completeness Column: An Ongoing Guide
- A personal communication
- HOW GOOD IS THE SIMPLEX ALGORITHM
- A and V
- On the computational complexity of Ising spin glass models
- A dynamic programming approach to sequencing problems
Their papers
- Graph Factors and Matching Extensions (2009) — 104 citations
- Acyclic edge colorings of planar graphs and seriesparallel graphs (2009) — 52 citations