( en | de | ru )

 

Disambiguation of "Nayyeri, Amir"

Author of the publication

copydeleteadd this publication to your clipboard
Low-Stretch Spanning Trees of Graphs with Bounded Width.

, , , , and . SWAT, volume 162 of LIPIcs, page 15:1-15:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mostafa Nayyeri

Mostafa Nayyeri

Mostafa Nayyeri

Mostafa Nayyeri

Manutschehr Amirfeyz

 

Other publications of authors with the same name

Load sensitive topology control: Towards minimum energy consumption in dense ad hoc sensor networks., , , and . Comput. Networks, 52 (3): 493-513 (2008)Minimum cycle and homology bases of surface-embedded graphs., , , and . J. Comput. Geom., 8 (2): 58-79 (2017)All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs., , , and . CoRR, (2014)Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs., , and . ESA, volume 9294 of Lecture Notes in Computer Science, page 227-238. Springer, (2015)Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes., and . ICALP, volume 229 of LIPIcs, page 23:1-23:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Joint Range and Load Considerations for Topology Control in Wireless Ad Hoc Networks., , and . SECON, page 469-478. IEEE, (2006)Minimum Cycle and Homology Bases of Surface Embedded Graphs., , , and . SoCG, volume 51 of LIPIcs, page 23:1-23:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Counting and sampling minimum cuts in genus g graphs., , and . SoCG, page 249-258. ACM, (2013)On the Decidability of the Fréchet Distance between Surfaces., and . SODA, page 1109-1120. SIAM, (2018)Understanding Oversquashing in GNNs through the Lens of Effective Resistance., , , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 2528-2547. PMLR, (2023)