default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmir Nayyeri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c43]Willow Barkan-Vered, Huck Bennett, Amir Nayyeri:
Topological k-Metrics. SoCG 2024: 13:1-13:13- [c42]Emily Fox, Amir Nayyeri, Jonathan James Perry, Benjamin Raichel:
Fréchet Edit Distance. SoCG 2024: 58:1-58:15 - [c41]Mitchell Black, Lucy Lin, Weng-Keen Wong, Amir Nayyeri:
Biharmonic Distance of Graphs and its Higher-Order Variants: Theoretical Properties with Applications to Centrality and Clustering. ICML 2024 - [c40]Mitchell Black, Zhengchao Wan, Gal Mishne, Amir Nayyeri, Yusu Wang:
Comparing Graph Transformers via Positional Encodings. ICML 2024 - [i22]Mitchell Black, Zhengchao Wan, Gal Mishne, Amir Nayyeri, Yusu Wang:
Comparing Graph Transformers via Positional Encodings. CoRR abs/2402.14202 (2024) - [i21]Emily Fox, Amir Nayyeri, Jonathan James Perry, Benjamin Raichel:
Fréchet Edit Distance. CoRR abs/2403.12878 (2024) - [i20]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 abs/2406.07574 (2024) - 2023
- [j15]Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Minimum Cuts in Surface Graphs. SIAM J. Comput. 52(1): 156-195 (2023) - [c39]Mitchell Black, Zhengchao Wan, Amir Nayyeri, Yusu Wang:
Understanding Oversquashing in GNNs through the Lens of Effective Resistance. ICML 2023: 2528-2547 - [i19]Mitchell Black, Amir Nayyeri, Zhengchao Wan, Yusu Wang:
Understanding Oversquashing in GNNs through the Lens of Effective Resistance. CoRR abs/2302.06835 (2023) - [i18]Mitchell Black, William Maxwell, Amir Nayyeri:
An Incremental Span-Program-Based Algorithm and the Fine Print of Quantum Topological Data Analysis. CoRR abs/2307.07073 (2023) - [i17]Willow Barkan-Vered, Huck Bennett, Amir Nayyeri:
Topological k-metrics. CoRR abs/2308.04609 (2023) - 2022
- [c38]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: 2:1-2:14 - [c37]Mitchell Black, Nello Blaser, Amir Nayyeri, Erlend Raa Vågset:
ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth. SoCG 2022: 17:1-17:16 - [c36]Mitchell Black, Amir Nayyeri:
Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes. ICALP 2022: 23:1-23:17 - [c35]Mitchell Black, William Maxwell, Amir Nayyeri, Eli Winkelman:
Computational Topology in a Collapsing Universe: Laplacians, Homology, Cohomology. SODA 2022: 226-251 - [i16]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 abs/2203.07280 (2022) - [i15]Mitchell Black, Nello Blaser, Amir Nayyeri, Erlend Raa Vågset:
ETH-tight algorithms for finding surfaces in simplicial complexes of bounded treewidth. CoRR abs/2203.07566 (2022) - [i14]Mitchell Black, Amir Nayyeri:
Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes. CoRR abs/2205.02134 (2022) - 2021
- [c34]William Maxwell, Amir Nayyeri:
Generalized Max-Flows and Min-Cuts in Simplicial Complexes. ESA 2021: 69:1-69:16 - [c33]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: 107-123 - [i13]William Maxwell, Amir Nayyeri:
Generalized max-flows and min-cuts in simplicial complexes. CoRR abs/2106.14116 (2021) - [i12]Mitchell Black, Amir Nayyeri:
Finding surfaces in simplicial complexes with bounded-treewidth 1-skeleton. CoRR abs/2107.10339 (2021) - 2020
- [c32]Glencora Borradaile, William Maxwell, Amir Nayyeri:
Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes. SoCG 2020: 21:1-21:15 - [c31]Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri:
Low-Stretch Spanning Trees of Graphs with Bounded Width. SWAT 2020: 15:1-15:19 - [i11]Glencora Borradaile, William Maxwell, Amir Nayyeri:
Minimum bounded chains and minimum homologous chains in embedded simplicial complexes. CoRR abs/2003.02801 (2020) - [i10]Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri:
Low-stretch spanning trees of graphs with bounded width. CoRR abs/2004.08375 (2020) - [i9]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 abs/2005.02530 (2020)
2010 – 2019
- 2019
- [c30]Amir Nayyeri, Benjamin Raichel:
Viewing the Rings of a Tree: Minimum Distortion Embeddings into Trees. SODA 2019: 2380-2399 - [i8]Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Minimum Cuts in Surface Graphs. CoRR abs/1910.04278 (2019) - 2018
- [j14]Yodsawalai Chodpathumwan, Ali Vakilian, Arash Termehchy, Amir Nayyeri:
Cost-effective conceptual design using taxonomies. VLDB J. 27(3): 369-394 (2018) - [c29]Amir Nayyeri, Hanzhong Xu:
On the Decidability of the Fréchet Distance between Surfaces. SODA 2018: 1109-1120 - 2017
- [j13]Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri:
Minimum cycle and homology bases of surface-embedded graphs. J. Comput. Geom. 8(2): 58-79 (2017) - [j12]Yury Makarychev, Amir Nayyeri, Anastasios Sidiropoulos:
A Pseudo-Approximation for the Genus of Hamiltonian Graphs. Theory Comput. 13(1): 1-47 (2017) - [c28]Amir Nayyeri, Benjamin Raichel:
A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs. SODA 2017: 724-736 - [c27]Ali Vakilian, Yodsawalai Chodpathumwan, Arash Termehchy, Amir Nayyeri:
Cost-Effective Conceptual Design Over Taxonomies. WebDB 2017: 35-40 - [i7]Sariel Har-Peled, Amir Nayyeri:
A Simple Algorithm for Computing a Cycle Separator. CoRR abs/1709.08122 (2017) - 2016
- [j11]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): 39-73 (2016) - [c26]Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen:
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. SoCG 2016: 22:1-22:16 - [c25]Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri:
Minimum Cycle and Homology Bases of Surface Embedded Graphs. SoCG 2016: 23:1-23:15 - [c24]Amir Nayyeri, Hanzhong Xu:
On Computing the Fréchet Distance Between Surfaces. SoCG 2016: 55:1-55:15 - [r1]Erin W. Chambers, Jeff Erickson, Kyle Fox, Amir Nayyeri:
Global Minimum Cuts in Surface-Embedded Graphs. Encyclopedia of Algorithms 2016: 852-856 - [i6]Glencora Borradaile, Erin Wolf Chambers, Kyle Fox, Amir Nayyeri:
Minimum cycle and homology bases of surface embedded graphs. CoRR abs/1607.05112 (2016) - 2015
- [j10]Theodore Roman, Amir Nayyeri, Brittany Fasy, Russell Schwartz:
A simplicial complex-based approach to unmixing tumor progression data. BMC Bioinform. 16: 254:1-254:17 (2015) - [c23]Glencora Borradaile, Amir Nayyeri, Farzad Zafarani:
Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs. ESA 2015: 227-238 - [c22]Amir Nayyeri, Benjamin Raichel:
Reality Distortion: Exact and Approximate Algorithms for Embedding into the Line. FOCS 2015: 729-747 - [c21]Amir Nayyeri, Anastasios Sidiropoulos:
Computing the Fréchet Distance Between Polygons with Holes. ICALP (1) 2015: 997-1009 - [c20]Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker:
Approximating Nearest Neighbor Distances. WADS 2015: 200-211 - [i5]Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker:
Approximating Nearest Neighbor Distances. CoRR abs/1502.08048 (2015) - [i4]Ali Vakilian, Yodsawalai Chodpathumwan, Arash Termehchy, Amir Nayyeri:
Cost-Effective Conceptual Design Using Taxonomies. CoRR abs/1503.05656 (2015) - [i3]Glencora Borradaile, Amir Nayyeri, Farzad Zafarani:
Towards single face shortest vertex-disjoint paths in undirected planar graphs. CoRR abs/1507.05980 (2015) - 2014
- [j9]Erin W. Chambers, Kyle Fox, Amir Nayyeri:
Counting and Sampling Minimum Cuts in Genus $$g$$ g Graphs. Discret. Comput. Geom. 52(3): 450-475 (2014) - [c19]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: 204-216 - [c18]Pravesh Kothari, Amir Nayyeri, Ryan O'Donnell, Chenggang Wu:
Testing Surface Area. SODA 2014: 1204-1214 - [i2]Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos:
How to Walk Your Dog in the Mountains with No Magic Leash. CoRR abs/1401.7042 (2014) - [i1]Glencora Borradaile, David Eppstein, Amir Nayyeri, Christian Wulff-Nilsen:
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs. CoRR abs/1411.7055 (2014) - 2013
- [j8]Jeff Erickson, Amir Nayyeri:
Tracing Compressed Curves in Triangulated Surfaces. Discret. Comput. Geom. 49(4): 823-863 (2013) - [c17]Yury Makarychev, Amir Nayyeri, Anastasios Sidiropoulos:
A Pseudo-approximation for the Genus of Hamiltonian Graphs. APPROX-RANDOM 2013: 244-259 - [c16]Erin W. Chambers, Kyle Fox, Amir Nayyeri:
Counting and sampling minimum cuts in genus g graphs. SoCG 2013: 249-258 - 2012
- [b1]Amir Nayyeri:
Combinatorial optimization on embedded curves. University of Illinois Urbana-Champaign, USA, 2012 - [j7]Sajjad Zarifzadeh, Nasser Yazdani, Amir Nayyeri:
Energy-efficient topology control in wireless ad hoc networks with selfish nodes. Comput. Networks 56(2): 902-914 (2012) - [j6]Erin W. Chambers, Jeff Erickson, Amir Nayyeri:
Homology Flows, Cohomology Cuts. SIAM J. Comput. 41(6): 1605-1634 (2012) - [c15]Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos:
How to walk your dog in the mountains with no magic leash. SCG 2012: 121-130 - [c14]Jeff Erickson, Amir Nayyeri:
Tracing compressed curves in triangulated surfaces. SCG 2012: 131-140 - [c13]Jeff Erickson, Kyle Fox, Amir Nayyeri:
Global minimum cuts in surface embedded graphs. SODA 2012: 1309-1318 - 2011
- [c12]Jeff Erickson, Amir Nayyeri:
Shortest Non-Crossing Walks in the Plane. SODA 2011: 297-208 - [c11]Jeff Erickson, Amir Nayyeri:
Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers. SODA 2011: 1166-1176 - [c10]Jeff Erickson, Amir Nayyeri:
Computing Replacement Paths in Surface Embedded Graphs. SODA 2011: 1347-1354
2000 – 2009
- 2009
- [j5]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): 1812-1829 (2009) - [c9]Erin W. Chambers, Jeff Erickson, Amir Nayyeri:
Minimum cuts and shortest homologous cycles. SCG 2009: 377-385 - [c8]Hamid Hajabdolali Bazzaz, Sajjad Zarifzadeh, Ahmad Khonsari, Amir Nayyeri:
On optimizing survivable multihoming. LCN 2009: 201-204 - [c7]Erin W. Chambers, Jeff Erickson, Amir Nayyeri:
Homology flows, cohomology cuts. STOC 2009: 273-282 - 2008
- [j4]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): 493-513 (2008) - [j3]Sajjad Zarifzadeh, Amir Nayyeri, Nasser Yazdani:
Efficient construction of network topology to conserve energy in wireless ad hoc networks. Comput. Commun. 31(1): 160-173 (2008) - [c6]Foroogh Anoosha, Reza Shokri, Nasser Yazdani, Amir Nayyeri:
AntMig: A Novel Code Migration Method to Conserve Energy in Wireless Sensor Networks. WCNC 2008: 2123-2128 - 2007
- [j2]Maysam Yabandeh, Amir Nayyeri, Nasser Yazdani, Caro Lucas:
A Sociological Perspective on the Reordering Problem in Multipath Routing. Cybern. Syst. 38(3): 275-288 (2007) - [c5]Reza Shokri, Amir Nayyeri, Nasser Yazdani, Panos Papadimitratos:
Efficient and Adjustable Recipient Anonymity in Mobile Ad Hoc Networks. MASS 2007: 1-3 - 2006
- [j1]Hamid Mousavi, Amir Nayyeri, Nasser Yazdani, Caro Lucas:
Energy conserving movement-assisted deployment of ad hoc sensor networks. IEEE Commun. Lett. 10(4): 269-271 (2006) - [c4]Amir Nayyeri, Farhad Oroumchian:
FuFaIR: a Fuzzy Farsi Information Retrieval System. AICCSA 2006: 1126-1130 - [c3]Sajjad Zarifzadeh, Amir Nayyeri, Nasser Yazdani, Caro Lucas:
Consumer oriented state aggregation using reinforcement learning approach. CCNC 2006: 524-530 - [c2]Amir Nayyeri, Sajjad Zarifzadeh, Nasser Yazdani:
Load Sensitive Topology Control for Energy Conservation in Ad Hoc Sensor Networks. GLOBECOM 2006 - [c1]Sajjad Zarifzadeh, Amir Nayyeri, Nasser Yazdani:
Joint Range and Load Considerations for Topology Control in Wireless Ad Hoc Networks. SECON 2006: 469-478
Coauthor Index
aka: Erin Wolf Chambers
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
