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

Students:
Program Comittee Member:
Teaching:
Publications:
Viewing the Rings of a Tree: Minimum Distortion Embeddings into Trees.
Written with Benjamin Raichel Proceedings of the 30th ACMSIAM Symposium on Discrete Algorithms (SODA 2019). To appear.  
On the Decidability of the Frechet Distance between Surfaces.
Written with Hanzhong Xu Proceedings of the 29th ACMSIAM Symposium on Discrete Algorithms (SODA 2018).  
A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs.
Written with Benjamin Raichel Proceedings of the 28th ACMSIAM Symposium on Discrete Algorithms (SODA 2017).  
On computing the Frechet distance between surfaces.
Written with Hanzhong Xu Proceedings of the 32nd Annual Symposium on Computational Geometry (SoCG 2016).  
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.  
AllPairs Minimum Cuts in NearLinear Time for SurfaceEmbedded Graphs
Written with Glencora Borradaile , David Eppstein and Christian WulffNilsen Proceedings of the 32nd Annual Symposium on Computational Geometry (SoCG 2016).  
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).  
Towards single face shortest vertexdisjoint paths in undirected planar graphs
Written with Glencora Borradaile and Farzad Zafarani Proceedings of the 23rd Annual European Symposium on Algorithms (ESA 2015).  
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).  
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).  
Testing Surface Area
Written with Pravesh Kothari , Ryan O'Donnell and Chenggang Wu Proceedings of the 25th ACMSIAM Symposium on Discrete Algorithms (SODA 2014).  
Solving 1Laplacians 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 ACMSIAM Symposium on Discrete Algorithms (SODA 2014).  
A pseudoapproximation 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.  
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.  
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  
How to walk your dog in the mountains with no magic leash
Written with Sariel HarPeled , Mohammad Salavatipour and Anastasios Sidiropoulos Proceedings of the 28th Annual Symposium on Computational Geometry (SoCG 2012).  
Global minimum cuts in surface embedded graphs
Written with Kyle Fox and Jeff Erickson Proceedings of the 23rd Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2012).  
Minimum cuts and shortest nonseparating cycles via homology covers
Written with Jeff Erickson Proceedings of the 22nd Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2011).  
Computing replacement paths in surfaceembedded graphs
Written with Jeff Erickson Proceedings of the 22nd Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2011).  
Shortest noncrossing walks in the plane
Written with Jeff Erickson Proceedings of the 22nd Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2011).  
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).  
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.  
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.  
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.  
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.  
Energy Conserving MovementAssisted 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: