Shuxin Nie

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:55/6892 · DBLP profile ↗

← Back

3ranked-venue papers

0as first author

0since 2021 · last 2008

0000-0002-1954-1267ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

2 papers

Graph algorithms and graph theory · 80% Computational complexity · 20%

Topics — the 5 heaviest of 5, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Graph algorithms and graph theory › graph algorithms › path and cycle problems cycle detection	0.1	1	2008	Finding a long directed cycle · ACM Trans. Algorithms 2008
Graph algorithms and graph theory › graph algorithms › graph search depth-first search	0.1	1	2008	Finding a long directed cycle · ACM Trans. Algorithms 2008
Graph algorithms and graph theory graph traversal	0.1	1	2008	Finding a long directed cycle · ACM Trans. Algorithms 2008
Computational complexity parameterized complexity	0.1	2	2008	Finding a long directed cycle · SODA 2004 Finding a long directed cycle · ACM Trans. Algorithms 2008
Graph algorithms and graph theory › directed graph directed cycles	0.0	1	2004	Finding a long directed cycle · SODA 2004

Methods — techniques the papers use, named apart from their topics

linear-time algorithm · 0.1depth-first search · 0.1graph algorithms · 0.0

Year	Publication	Venue	Position
2008	Finding Long Paths, Cycles and Circuits Harold N. Gabow, Shuxin Nie	ISAAC	2
2008	Finding a long directed cycle abstract Consider a digraph with n vertices. For any fixed value k , we present linear- and almost-linear-time algorithms to find a cycle of length ≥ k , if one exists. We also find a cycle that has length ≥ log n /log log n in polynomial time, if one exists. Under an appropriate complexity assumption it is known to be impossible to improve this guarantee by more than a log log n factor. Our approach is based on depth-first search. Harold N. Gabow, Shuxin Nie	ACM Trans. Algorithms	2
2004	Finding a long directed cycle Harold N. Gabow, Shuxin Nie	SODA	2