Amir Nayyeri

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 40

Top Topics

Highly Parallelizable

Bounded Treewidth

Exact And Approximate

Top Venues

Publications

Willow Barkan-Vered, Huck Bennett, Amir Nayyeri
Topological k-Metrics. SoCG (2024)
Emily Fox, Amir Nayyeri, Jonathan James Perry, Benjamin Raichel
Fréchet Edit Distance. SoCG (2024)
Mitchell Black, Lucy Lin, Amir Nayyeri, Weng-Keen Wong
Biharmonic Distance of Graphs and its Higher-Order Variants: Theoretical Properties with Applications to Centrality and Clustering. CoRR (2024)
Emily Fox, Amir Nayyeri, Jonathan James Perry, Benjamin Raichel
Fréchet Edit Distance. CoRR (2024)
Mitchell Black, Zhengchao Wan, Gal Mishne, Amir Nayyeri, Yusu Wang
Comparing Graph Transformers via Positional Encodings. CoRR (2024)
Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri
Minimum Cuts in Surface Graphs. SIAM J. Comput. 52 (1) (2023)
Mitchell Black, Amir Nayyeri, Zhengchao Wan, Yusu Wang
Understanding Oversquashing in GNNs through the Lens of Effective Resistance. CoRR (2023)
Willow Barkan-Vered, Huck Bennett, Amir Nayyeri
Topological k-metrics. CoRR (2023)
Mitchell Black, William Maxwell, Amir Nayyeri
An Incremental Span-Program-Based Algorithm and the Fine Print of Quantum Topological Data Analysis. CoRR (2023)
Mitchell Black, Zhengchao Wan, Amir Nayyeri, Yusu Wang
Understanding Oversquashing in GNNs through the Lens of Effective Resistance. ICML (2023)
Mitchell Black, Amir Nayyeri
Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes. ICALP (2022)
Mitchell Black, Nello Blaser, Amir Nayyeri, Erlend Raa Vågset
ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth. SoCG (2022)
Mitchell Black, William Maxwell, Amir Nayyeri, Eli Winkelman
Computational Topology in a Collapsing Universe: Laplacians, Homology, Cohomology. SODA (2022)
Mitchell Black, Amir Nayyeri
Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes. CoRR (2022)
Mitchell Black, Nello Blaser, Amir Nayyeri, Erlend Raa Vågset
ETH-tight algorithms for finding surfaces in simplicial complexes of bounded treewidth. CoRR (2022)
Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. SoCG (2022)
Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. CoRR (2022)
Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. WAFR (2021)
William Maxwell, Amir Nayyeri
Generalized Max-Flows and Min-Cuts in Simplicial Complexes. ESA (2021)
William Maxwell, Amir Nayyeri
Generalized max-flows and min-cuts in simplicial complexes. CoRR (2021)
Mitchell Black, Amir Nayyeri
Finding surfaces in simplicial complexes with bounded-treewidth 1-skeleton. CoRR (2021)
Glencora Borradaile, William Maxwell, Amir Nayyeri
Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes. SoCG (2020)
Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. CoRR (2020)
Glencora Borradaile, William Maxwell, Amir Nayyeri
Minimum bounded chains and minimum homologous chains in embedded simplicial complexes. CoRR (2020)
Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri
Low-stretch spanning trees of graphs with bounded width. CoRR (2020)
Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri
Low-Stretch Spanning Trees of Graphs with Bounded Width. SWAT (2020)
Amir Nayyeri, Benjamin Raichel
Viewing the Rings of a Tree: Minimum Distortion Embeddings into Trees. SODA (2019)
Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri
Minimum Cuts in Surface Graphs. CoRR (2019)
Yodsawalai Chodpathumwan, Ali Vakilian, Arash Termehchy, Amir Nayyeri
Cost-effective conceptual design using taxonomies. VLDB J. 27 (3) (2018)
Amir Nayyeri, Hanzhong Xu
On the Decidability of the Fréchet Distance between Surfaces. SODA (2018)
Yury Makarychev, Amir Nayyeri, Anastasios Sidiropoulos
A Pseudo-Approximation for the Genus of Hamiltonian Graphs. Theory Comput. 13 (1) (2017)
Ali Vakilian, Yodsawalai Chodpathumwan, Arash Termehchy, Amir Nayyeri
Cost-Effective Conceptual Design Over Taxonomies. WebDB (2017)
Amir Nayyeri, Benjamin Raichel
A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs. SODA (2017)
Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri
Minimum cycle and homology bases of surface-embedded graphs. J. Comput. Geom. 8 (2) (2017)
Sariel Har-Peled, Amir Nayyeri
A Simple Algorithm for Computing a Cycle Separator. CoRR (2017)
Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri
Minimum cycle and homology bases of surface embedded graphs. CoRR (2016)
Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri
Minimum Cycle and Homology Bases of Surface Embedded Graphs. SoCG (2016)
Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos
How to Walk Your Dog in the Mountains with No Magic Leash. Discret. Comput. Geom. 55 (1) (2016)
Amir Nayyeri, Hanzhong Xu
On Computing the Fréchet Distance Between Surfaces. SoCG (2016)
Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. SoCG (2016)
Glencora Borradaile, Amir Nayyeri, Farzad Zafarani
Towards single face shortest vertex-disjoint paths in undirected planar graphs. CoRR (2015)
Glencora Borradaile, Amir Nayyeri, Farzad Zafarani
Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs. ESA (2015)
Amir Nayyeri, Anastasios Sidiropoulos
Computing the Fréchet Distance Between Polygons with Holes. ICALP (1) (2015)
Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker
Approximating Nearest Neighbor Distances. CoRR (2015)
Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker
Approximating Nearest Neighbor Distances. WADS (2015)
Ali Vakilian, Yodsawalai Chodpathumwan, Arash Termehchy, Amir Nayyeri
Cost-Effective Conceptual Design Using Taxonomies. CoRR (2015)
Theodore Roman, Amir Nayyeri, Brittany Fasy, Russell Schwartz
A simplicial complex-based approach to unmixing tumor progression data. BMC Bioinform. 16 (2015)
Amir Nayyeri, Benjamin Raichel
Reality Distortion: Exact and Approximate Algorithms for Embedding into the Line. FOCS (2015)
Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. CoRR (2014)
Erin W. Chambers, Kyle Fox, Amir Nayyeri
Counting and Sampling Minimum Cuts in Genus $$g$$ g Graphs. Discret. Comput. Geom. 52 (3) (2014)
Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Richard Peng, Noel Walkington
Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball. SODA (2014)
Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos
How to Walk Your Dog in the Mountains with No Magic Leash. CoRR (2014)
Pravesh Kothari, Amir Nayyeri, Ryan O'Donnell, Chenggang Wu
Testing Surface Area. SODA (2014)
Jeff Erickson, Amir Nayyeri
Tracing Compressed Curves in Triangulated Surfaces. Discret. Comput. Geom. 49 (4) (2013)
Erin W. Chambers, Kyle Fox, Amir Nayyeri
Counting and sampling minimum cuts in genus g graphs. SoCG (2013)
Yury Makarychev, Amir Nayyeri, Anastasios Sidiropoulos
A Pseudo-approximation for the Genus of Hamiltonian Graphs. APPROX-RANDOM (2013)
Jeff Erickson, Amir Nayyeri
Tracing compressed curves in triangulated surfaces. SCG (2012)
Jeff Erickson, Kyle Fox, Amir Nayyeri
Global minimum cuts in surface embedded graphs. SODA (2012)
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
Homology Flows, Cohomology Cuts. SIAM J. Comput. 41 (6) (2012)
Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos
How to walk your dog in the mountains with no magic leash. SCG (2012)
Sajjad Zarifzadeh, Nasser Yazdani, Amir Nayyeri
Energy-efficient topology control in wireless ad hoc networks with selfish nodes. Comput. Networks 56 (2) (2012)
Jeff Erickson, Amir Nayyeri
Computing Replacement Paths in Surface Embedded Graphs. SODA (2011)
Jeff Erickson, Amir Nayyeri
Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers. SODA (2011)
Jeff Erickson, Amir Nayyeri
Shortest Non-Crossing Walks in the Plane. SODA (2011)
Hamid Hajabdolali Bazzaz, Sajjad Zarifzadeh, Ahmad Khonsari, Amir Nayyeri
On optimizing survivable multihoming. LCN (2009)
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
Homology flows, cohomology cuts. STOC (2009)
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
Minimum cuts and shortest homologous cycles. SCG (2009)
Sajjad Zarifzadeh, Amir Nayyeri, Nasser Yazdani, Ahmad Khonsari, Hamid Hajabdolali Bazzaz
Joint range assignment and routing to conserve energy in wireless ad hoc networks. Comput. Networks 53 (11) (2009)
Foroogh Anoosha, Reza Shokri, Nasser Yazdani, Amir Nayyeri
AntMig: A Novel Code Migration Method to Conserve Energy in Wireless Sensor Networks. WCNC (2008)
Amir Nayyeri, Sajjad Zarifzadeh, Nasser Yazdani, Mohammad Mahmoody-Ghidary
Load sensitive topology control: Towards minimum energy consumption in dense ad hoc sensor networks. Comput. Networks 52 (3) (2008)
Sajjad Zarifzadeh, Amir Nayyeri, Nasser Yazdani
Efficient construction of network topology to conserve energy in wireless ad hoc networks. Comput. Commun. 31 (1) (2008)
Maysam Yabandeh, Amir Nayyeri, Nasser Yazdani, Caro Lucas
A Sociological Perspective on the Reordering Problem in Multipath Routing. Cybern. Syst. 38 (3) (2007)
Reza Shokri, Amir Nayyeri, Nasser Yazdani, Panos Papadimitratos
Efficient and Adjustable Recipient Anonymity in Mobile Ad Hoc Networks. MASS (2007)
Amir Nayyeri, Sajjad Zarifzadeh, Nasser Yazdani
Load Sensitive Topology Control for Energy Conservation in Ad Hoc Sensor Networks. GLOBECOM (2006)
Amir Nayyeri, Farhad Oroumchian
FuFaIR: a Fuzzy Farsi Information Retrieval System. AICCSA (2006)
Sajjad Zarifzadeh, Amir Nayyeri, Nasser Yazdani, Caro Lucas
Consumer oriented state aggregation using reinforcement learning approach. CCNC (2006)
Hamid Mousavi, Amir Nayyeri, Nasser Yazdani, Caro Lucas
Energy conserving movement-assisted deployment of ad hoc sensor networks. IEEE Commun. Lett. 10 (4) (2006)
Sajjad Zarifzadeh, Amir Nayyeri, Nasser Yazdani
Joint Range and Load Considerations for Topology Control in Wireless Ad Hoc Networks. SECON (2006)