#### Filter Results:

- Full text PDF available (15)

#### Publication Year

2011

2018

- This year (3)
- Last 5 years (15)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Hsien-Chih Chang, Jeff Erickson, Chao Xu
- SODA
- 2015

4 A closed curve in the plane is weakly simple if it is the limit (in the FrÃ©chet metric) 5 of a sequence of simple closed curves. We describe an algorithm to determine whether 6 a closed walk ofâ€¦ (More)

- Hsien-Chih Chang, Hsueh-I Lu
- COCOON
- 2011

The girth of a graph is the minimum weight of all simple cycles of the graph. We study the problem of determining the girth of an n-node unweighted undirected planar graph. The first non-trivialâ€¦ (More)

- Hsien-Chih Chang, Sariel Har-Peled, Benjamin Raichel
- Symposium on Computational Geometry
- 2015

- Hsien-Chih Chang, Hsueh-I Lu
- SODA
- 2012

We study the problem of determining whether an nnode m-edge graph has an even hole, i.e., an induced simple cycle consisting of an even number of nodes. Conforti, CornuÃ©jols, Kapoor, and VuÅ¡koviÄ‡â€¦ (More)

- Hsien-Chih Chang, Jeff Erickson
- Symposium on Computational Geometry
- 2016

Any generic closed curve in the plane can be transformed into a simple closed curve by a finite sequence of local transformations called homotopy moves. We prove that simplifying a planar closedâ€¦ (More)

- Hsien-Chih Chang, Jeff Erickson
- ArXiv
- 2015

We prove the first nontrivial worst-case lower bounds for two closely related problems. First, Î©(n3/2) degree-1 reductions, series-parallel reductions, and âˆ†Y transformations are required in theâ€¦ (More)

6 Given a set of disjoint horizontal line segments (call bars), the distance of two bars is the 7 minimum number of the other bars that a vertical line segment joining the two bars passes 8 through.â€¦ (More)

- Hsien-Chih Chang, Jeff Erickson, +5 authors Stephan Tillmann
- SODA
- 2018

We prove new upper and lower bounds on the number of homotopy moves required to tighten a closed curve on a compact orientable surface (with or without boundary) as much as possible. First, we proveâ€¦ (More)

- Hsien-Chih Chang, Jeff Erickson
- ArXiv
- 2017

We improve our earlier lower bounds on the number of electrical transformations required to reduce an n-vertex plane graph in the worst case [SOCG 2016] in two different directions. Our previousâ€¦ (More)

Given a graph G and a set of terminals T , a distance emulator of G is another graph H (not necessarily a subgraph of G) containing T , such that all the pairwise distances in G between vertices of Tâ€¦ (More)