J
Jeff Erickson
Researcher at University of Illinois at Urbana–Champaign
Publications - 166
Citations - 5407
Jeff Erickson is an academic researcher from University of Illinois at Urbana–Champaign. The author has contributed to research in topics: Planar graph & Time complexity. The author has an hindex of 43, co-authored 166 publications receiving 5136 citations. Previous affiliations of Jeff Erickson include National Center for Supercomputing Applications & Eindhoven University of Technology.
Papers
More filters
Posted Content
Lower Bounds for Electrical Reduction on Surfaces
TL;DR: In this article, the authors improved the lower bound on the number of electrical transformations required to reduce an n-vertex graph on surface in the worst case to arbitrary surfaces with punctures.
Posted Content
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs
TL;DR: In particular, the O(log(n)/log log(n))-approximation algorithm for general graphs by Asadpour et al. as discussed by the authors achieves an approximation factor of O(f(g)) on graphs with genus g, where f(n) is the best approximation factor achievable in polynomial time on arbitrary n-vertex graphs.
Posted Content
Topologically Trivial Closed Walks in Directed Surface Graphs
Jeff Erickson,Yipu Wang +1 more
TL;DR: The complexity of detecting negative closed walks with trivial topology, when some edges of the input graph have negative weights is considered, and it is shown that negative bounding walks can be detected in polynomial time, by reduction to maximum flows.
Proceedings ArticleDOI
Topologically trivial closed walks in directed surface graphs
Jeff Erickson,Yipu Wang +1 more
TL;DR: In this paper, the authors consider the complexity of finding closed directed walks in directed graphs that are either contractible (trivial in homotopy) or bounding in integer homology in a given directed graph with n vertices and m edges, embedded on a surface S, possibly with boundary.
Journal ArticleDOI
Topologically Trivial Closed Walks in Directed Surface Graphs
Jeff Erickson,Yipu Wang +1 more
TL;DR: The complexity of detecting negative closed walks with trivial topology, when some edges of the input graph have negative weights is considered, and it is shown that negative bounding walks can be detected in polynomial time, by reduction to maximum flows.