FuFaIR: a Fuzzy Farsi Information Retrieval System. - Amir Nayyeri; Farhad Oroumchian (AICCSA, 2006)

Consumer oriented state aggregation using reinforcement learning approach. - Sajjad Zarifzadeh; Amir Nayyeri; Nasser Yazdani; Caro Lucas (CCNC, 2006)

Load Sensitive Topology Control for Energy Conservation in Ad Hoc Sensor Networks. - Amir Nayyeri; Sajjad Zarifzadeh; Nasser Yazdani (GLOBECOM, 2006)

Joint Range and Load Considerations for Topology Control in Wireless Ad Hoc Networks. - Sajjad Zarifzadeh; Amir Nayyeri; Nasser Yazdani (SECON, 2006)

Energy conserving movement-assisted deployment of ad hoc sensor networks. - Hamid Mousavi; Amir Nayyeri; Nasser Yazdani; Caro Lucas (IEEE Commun. Lett., 2006)

Efficient and Adjustable Recipient Anonymity in Mobile Ad Hoc Networks. - Reza Shokri; Amir Nayyeri; Nasser Yazdani; Panos Papadimitratos (MASS, 2007)

A Sociological Perspective on the Reordering Problem in Multipath Routing. - Maysam Yabandeh; Amir Nayyeri; Nasser Yazdani; Caro Lucas (Cybern. Syst., 2007)

AntMig: A Novel Code Migration Method to Conserve Energy in Wireless Sensor Networks. - Foroogh Anoosha; Reza Shokri; Nasser Yazdani; Amir Nayyeri (WCNC, 2008)

Load sensitive topology control: Towards minimum energy consumption in dense ad hoc sensor networks. - Amir Nayyeri; Sajjad Zarifzadeh; Nasser Yazdani; Mohammad Mahmoody-Ghidary (Comput. Networks, 2008)

Efficient construction of network topology to conserve energy in wireless ad hoc networks. - Sajjad Zarifzadeh; Amir Nayyeri; Nasser Yazdani (Comput. Commun., 2008)

Minimum cuts and shortest homologous cycles. - Erin W. Chambers; Jeff Erickson 001; Amir Nayyeri (SCG, 2009)

On optimizing survivable multihoming. - Hamid Hajabdolali Bazzaz; Sajjad Zarifzadeh; Ahmad Khonsari; Amir Nayyeri (LCN, 2009)

Joint range assignment and routing to conserve energy in wireless ad hoc networks. - Sajjad Zarifzadeh; Amir Nayyeri; Nasser Yazdani; Ahmad Khonsari; Hamid Hajabdolali Bazzaz (Comput. Networks, 2009)

Shortest Non-Crossing Walks in the Plane. - Jeff Erickson 001; Amir Nayyeri (SODA, 2011)

Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers. - Jeff Erickson 001; Amir Nayyeri (SODA, 2011)

Computing Replacement Paths in Surface Embedded Graphs. - Jeff Erickson 001; Amir Nayyeri (SODA, 2011)

Global minimum cuts in surface embedded graphs. - Jeff Erickson 001; Kyle Fox; Amir Nayyeri (SODA, 2012)

Energy-efficient topology control in wireless ad hoc networks with selfish nodes. - Sajjad Zarifzadeh; Nasser Yazdani; Amir Nayyeri (Comput. Networks, 2012)

Homology Flows, Cohomology Cuts. - Erin W. Chambers; Jeff Erickson 001; Amir Nayyeri (SIAM J. Comput., 2012)

Combinatorial optimization on embedded curves - Amir Nayyeri (2012)

Counting and sampling minimum cuts in genus g graphs. - Erin W. Chambers; Kyle Fox; Amir Nayyeri (SoCG, 2013)

Tracing Compressed Curves in Triangulated Surfaces. - Jeff Erickson 001; Amir Nayyeri (Discret. Comput. Geom., 2013)

Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball. - Michael B. Cohen; Brittany Terese Fasy; Gary L. Miller; Amir Nayyeri; Richard Peng; Noel Walkington (SODA, 2014)

Testing Surface Area. - Pravesh Kothari; Amir Nayyeri; Ryan O'Donnell; Chenggang Wu 003 (SODA, 2014)

Counting and Sampling Minimum Cuts in Genus $$g$$ g Graphs. - Erin W. Chambers; Kyle Fox; Amir Nayyeri (Discret. Comput. Geom., 2014)

Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs. - Glencora Borradaile; Amir Nayyeri; Farzad Zafarani (ESA, 2015)

Reality Distortion: Exact and Approximate Algorithms for Embedding into the Line. - Amir Nayyeri; Benjamin Raichel (FOCS, 2015)

Computing the Fréchet Distance Between Polygons with Holes. - Amir Nayyeri; Anastasios Sidiropoulos (ICALP (1), 2015)

Approximating Nearest Neighbor Distances. - Michael B. Cohen; Brittany Terese Fasy; Gary L. Miller; Amir Nayyeri; Donald R. Sheehy; Ameya Velingker (WADS, 2015)

A simplicial complex-based approach to unmixing tumor progression data. - Theodore Roman; Amir Nayyeri; Brittany Terese Fasy; Russell Schwartz (BMC Bioinform., 2015)

All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. - Glencora Borradaile; David Eppstein; Amir Nayyeri; Christian Wulff-Nilsen (SoCG, 2016)

On Computing the Fréchet Distance Between Surfaces. - Amir Nayyeri; Hanzhong Xu (SoCG, 2016)

How to Walk Your Dog in the Mountains with No Magic Leash. - Sariel Har-Peled; Amir Nayyeri; Mohammad R. Salavatipour; Anastasios Sidiropoulos (Discret. Comput. Geom., 2016)

Global Minimum Cuts in Surface-Embedded Graphs. - Erin W. Chambers; Jeff Erickson 001; Kyle Fox; Amir Nayyeri (Encyclopedia of Algorithms, 2016)

A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs. - Amir Nayyeri; Benjamin Raichel (SODA, 2017)

Cost-Effective Conceptual Design Over Taxonomies. - Ali Vakilian; Yodsawalai Chodpathumwan; Arash Termehchy; Amir Nayyeri (WebDB, 2017)

A Simple Algorithm for Computing a Cycle Separator. - Sariel Har-Peled; Amir Nayyeri (CoRR, 2017)

Minimum cycle and homology bases of surface-embedded graphs. - Glencora Borradaile; Erin Wolf Chambers; Kyle Fox; Amir Nayyeri (J. Comput. Geom., 2017)

A Pseudo-Approximation for the Genus of Hamiltonian Graphs. - Yury Makarychev; Amir Nayyeri; Anastasios Sidiropoulos (Theory Comput., 2017)

On the Decidability of the Fréchet Distance between Surfaces. - Amir Nayyeri; Hanzhong Xu (SODA, 2018)

Cost-effective conceptual design using taxonomies. - Yodsawalai Chodpathumwan; Ali Vakilian; Arash Termehchy; Amir Nayyeri (VLDB J., 2018)

Viewing the Rings of a Tree: Minimum Distortion Embeddings into Trees. - Amir Nayyeri; Benjamin Raichel (SODA, 2019)

Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes. - Glencora Borradaile; William Maxwell; Amir Nayyeri (SoCG, 2020)

Low-Stretch Spanning Trees of Graphs with Bounded Width. - Glencora Borradaile; Erin Wolf Chambers; David Eppstein; William Maxwell; Amir Nayyeri (SWAT, 2020)

Generalized Max-Flows and Min-Cuts in Simplicial Complexes. - William Maxwell; Amir Nayyeri (ESA, 2021)

Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. - Peyman Afshani; Mark de Berg; Kevin Buchin; Jie Gao 001; Maarten Löffler; Amir Nayyeri; Benjamin Raichel; Rik Sarkar; Haotian Wang 002; Hao-Tsung Yang (WAFR, 2021)

Finding surfaces in simplicial complexes with bounded-treewidth 1-skeleton. - Mitchell Black 002; Amir Nayyeri (CoRR, 2021)

On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. - Peyman Afshani; Mark de Berg; Kevin Buchin; Jie Gao 001; Maarten Löffler; Amir Nayyeri; Benjamin Raichel; Rik Sarkar; Haotian Wang 002; Hao-Tsung Yang (SoCG, 2022)

ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth. - Mitchell Black 002; Nello Blaser; Amir Nayyeri; Erlend Raa Vågset (SoCG, 2022)

Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes. - Mitchell Black 002; Amir Nayyeri (ICALP, 2022)

Computational Topology in a Collapsing Universe: Laplacians, Homology, Cohomology. - Mitchell Black 002; William Maxwell; Amir Nayyeri; Eli Winkelman (SODA, 2022)

Understanding Oversquashing in GNNs through the Lens of Effective Resistance. - Mitchell Black 002; Zhengchao Wan; Amir Nayyeri; Yusu Wang 001 (ICML, 2023)

An Incremental Span-Program-Based Algorithm and the Fine Print of Quantum Topological Data Analysis. - Mitchell Black 002; William Maxwell; Amir Nayyeri (CoRR, 2023)

Minimum Cuts in Surface Graphs. - Erin W. Chambers; Jeff Erickson 001; Kyle Fox; Amir Nayyeri (SIAM J. Comput., 2023)

Topological k-Metrics. - Willow Barkan-Vered; Huck Bennett; Amir Nayyeri (SoCG, 2024)

Fréchet Edit Distance. - Emily Fox; Amir Nayyeri; Jonathan James Perry; Benjamin Raichel (SoCG, 2024)

Biharmonic Distance of Graphs and its Higher-Order Variants: Theoretical Properties with Applications to Centrality and Clustering. - Mitchell Black 002; Lucy Lin; Weng-Keen Wong; Amir Nayyeri (ICML, 2024)

Comparing Graph Transformers via Positional Encodings. - Mitchell Black 002; Zhengchao Wan; Gal Mishne; Amir Nayyeri; Yusu Wang 001 (ICML, 2024)

Graph Inference with Effective Resistance Queries. - Huck Bennett; Mitchell Black 002; Amir Nayyeri; Philip G. Warton (CoRR, 2025)