Abdolah Sepahvand
Papers
1
Total Citations
6
H-Index
1
About
Abdolah Sepahvand is a computational geometer whose research lies at the intersection of algorithm design, complexity theory, and geometric optimization. His most cited work, "Time complexity of two disjoint simple paths" (2017, 6 citations), tackles a foundational geometric problem introduced by Jeff Erickson: finding two disjoint simple paths between two given sets of points. By presenting a reduction from the planar Hamiltonian path problem, Sepahvand establishes the inherent computational hardness of this seemingly geometric task, with direct implications for robot motion planning, polygon generation, and spatial routing. This contribution not only clarifies the problem’s complexity class but also provides a critical framework for future algorithmic approaches. While his citation count reflects a focused, emerging career, the depth of his reduction work signals a researcher unafraid to confront hard problems at the boundary of geometry and computation. Sepahvand’s achievements demonstrate a commitment to rigorous theoretical foundations, making his research valuable for students and scholars exploring the limits of geometric algorithms and their real-world applications in automation and design.
Research Focus
Key Achievements
Top Papers
- 1Time complexity of two disjoint simple paths6 citations · 2017