Amir Nayyeri


Assistant Professor
School of Electrical Engineering and Computer Science
Oregon State University
nayyeria@eecs.oregonstate.edu


I am interested in theoretical computer science and its applications, particularly computational geometry and topology. I got my PhD from the Computer Science Department of University of Illinois at Urbana Champaign under the supervision of Jeff Erickson. I spent about a year as a postdoctoral fellow in the Computer Science departemnt of Carnegie Mellon University, working with Gary Miller .

Students:


Program Comittee Member:


Teaching:


Publications:

[PDF] A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs.
Written with Benjamin Raichel
Submitted manuscript.
[PDF] On computing the Frechet distance between surfaces.
Written with Hanzhong Xu
Proceedings of the 32nd Annual Symposium on Computational Geometry (SoCG 2016).
[PDF] Minimum cycle and homology bases of surface embedded graphs.
Written with Glencora Borradaile , Erin Wolf Chambers and Kyle Fox
Proceedings of the 32nd Annual Symposium on Computational Geometry (SoCG 2016). Invited to special issue.
[PDF] All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs
Written with Glencora Borradaile , David Eppstein and Christian Wulff-Nilsen
Proceedings of the 32nd Annual Symposium on Computational Geometry (SoCG 2016).
[PDF] Reality Distortion: Exact and Approximate Algorithms for Embedding into the Line
Written with Benjamin Raichel
Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2015).
[PDF] Towards single face shortest vertex-disjoint paths in undirected planar graphs
Written with Glencora Borradaile and Farzad Zafarani
Proceedings of the 23rd Annual European Symposium on Algorithms (ESA 2015).
[PDF] Approximating Nearest Neighbor Distances
Written with Michael B. Cohen , Brittany Fasy , Gary Miller , Don Sheehy and Ameya Volingker
Algorithms and Data Structures Symposium (WADS 2015).
[PDF] Computing the Frechet distance between polygons with holes
Written with Anastasios Sidiropoulos
Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015).
[PDF] Testing Surface Area
Written with Pravesh Kothari , Ryan O'Donnell and Chenggang Wu
Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA 2014).
[PDF] Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball
Written with Michael B. Cohen , Brittany Fasy , Gary Miller , Richard Peng and Noel Walkington
Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA 2014).
[PDF] A pseudo-approximation for the genus of Hamiltonian graphs
Written with Yury Makarychev and Anastasios Sidiropoulos
Proceedings of the 16th International Workshop on Approximation Algorithms (APPROX 2014). Invited to special issue.
[PDF] Counting and Sampling Minimum Cuts in Genus g Graphs
Written with Erin Wolf Chambers and Kyle Fox
Proceedings of the 29th Annual Symposium on Computational Geometry (SoCG 2013). Invited to special issue.
[PDF] Tracing compressed curves in triangulated surfaces
Written with Jeff Erickson
Proceedings of the 28th Annual Symposium on Computational Geometry (SoCG 2012). Invited to special issue
[PDF] How to walk your dog in the mountains with no magic leash
Written with Sariel Har-Peled , Mohammad Salavatipour and Anastasios Sidiropoulos
Proceedings of the 28th Annual Symposium on Computational Geometry (SoCG 2012).
[PDF] Global minimum cuts in surface embedded graphs
Written with Kyle Fox and Jeff Erickson
Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012).
[PDF] Minimum cuts and shortest non-separating cycles via homology covers
Written with Jeff Erickson
Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011).
[PDF] Computing replacement paths in surface-embedded graphs
Written with Jeff Erickson
Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011).
[PDF] Shortest non-crossing walks in the plane
Written with Jeff Erickson
Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011).
[PDF] Minimum cuts and shortest homologous cycles
Written with Erin Wolf Chambers and Jeff Erickson
Proceedings of the 25th Annual Symposium on Computational Geometry (SoCG 2009).
[PDF] Homology flows, cohomology cuts
Written with Erin Wolf Chambers and Jeff Erickson
Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC 2009). Invited to special issue.
[PDF] Joint range assignment and routing to conserve energy in wireless ad hoc networks
Written with Sajjad Zarifzadeh, Nasser Yazdani, Ahmad Khonsari and Hamid Hajabdolali
Computer Networks, Volume 53, Issue 11, 2009.
[PDF] Load sensitive topology control: Towards minimum energy consumption in dense ad hoc sensor networks
Written with Sajjad Zarifzadeh, Nasser Yazdani, and Mohammad Mahmoody
Computer Networks, Volume 52, Issue 3, 2008.
[PDF] Efficient construction of network topology to conserve energy in wireless ad hoc networks
Written with Sajjad Zarifzadeh and Nasser Yazdani
Computer Communications, Volume 31, Issue 1, 2008.
[PDF] Energy Conserving Movement-Assisted Deployment of Ad hoc Sensor Networks
Written with Hamid Mousavi, Nasser Yazdani and Caro Lucas
IEEE Communications Letters, Volume 10, Number 4, 2006.

PhD Thesis:

[PDF] Combinatorial optimization on embedded curves.