Amir Nayyeri

From MaRDI portal
(Redirected from Person:249465)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Computational topology in a collapsing universe: Laplacians, homology, cohomology2024-07-19Paper
Hodge decomposition and general Laplacian solvers for embedded simplicial complexes2024-06-24Paper
On cyclic solutions to the min-max latency multi-robot patrolling problem2024-05-14Paper
ETH-tight algorithms for finding surfaces in simplicial complexes of bounded treewidth2024-05-14Paper
scientific article; zbMATH DE number 7759283 (Why is no real title available?)
(available as arXiv preprint)
2023-11-02Paper
Minimum bounded chains and minimum homologous chains in embedded simplicial complexes
(available as arXiv preprint)
2023-11-02Paper
scientific article; zbMATH DE number 7740924 (Why is no real title available?)
(available as arXiv preprint)
2023-09-20Paper
Minimum Cuts in Surface Graphs
SIAM Journal on Computing
2023-04-04Paper
Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes2022-05-04Paper
Viewing the rings of a tree: minimum distortion embeddings into trees
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-10-15Paper
Testing surface area
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-06-20Paper
Solving 1-Laplacians in nearly linear time: collapsing and expanding a topological ball
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-06-20Paper
Global minimum cuts in surface embedded graphs2019-05-10Paper
A treehouse with custom windows: minimum distortion embeddings into bounded treewidth graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
On the decidability of the Fréchet distance between surfaces2018-03-15Paper
On Computing the Fréchet Distance Between Surfaces.2018-01-30Paper
All-pairs minimum cuts in near-linear time for surface-embedded graphs
(available as arXiv preprint)
2018-01-30Paper
Minimum cycle and homology bases of surface embedded graphs2018-01-30Paper
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
2017-10-20Paper
A pseudo-approximation for the genus of Hamiltonian graphs
Theory of Computing
2017-10-11Paper
Shortest non-crossing walks in the plane2017-09-29Paper
scientific article; zbMATH DE number 6783459 (Why is no real title available?)2017-09-29Paper
scientific article; zbMATH DE number 6783474 (Why is no real title available?)2017-09-29Paper
Minimum cycle and homology bases of surface-embedded graphs
Journal of Computational Geometry
2017-03-30Paper
How to walk your dog in the mountains with no magic leash
Discrete & Computational Geometry
2016-02-29Paper
Towards single face shortest vertex-disjoint paths in undirected planar graphs
Algorithms - ESA 2015
2015-11-19Paper
Approximating nearest neighbor distances
Lecture Notes in Computer Science
2015-10-30Paper
Computing the Fréchet distance between polygons with holes
Automata, Languages, and Programming
2015-10-27Paper
Counting and sampling minimum cuts in genus g graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
2015-02-17Paper
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
2015-02-04Paper
Counting and sampling minimum cuts in genus \(g\) graphs
Discrete & Computational Geometry
2014-11-14Paper
Tracing compressed curves in triangulated surfaces
Proceedings of the twenty-eighth annual symposium on Computational geometry
2014-08-07Paper
How to walk your dog in the mountains with no magic leash
1293.6829
2014-08-07Paper
A pseudo-approximation for the genus of Hamiltonian graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2013-10-04Paper
Tracing compressed curves in triangulated surfaces
Discrete & Computational Geometry
2013-08-05Paper
Homology Flows, Cohomology Cuts
SIAM Journal on Computing
2013-03-19Paper
Joint range assignment and routing to conserve energy in wireless ad hoc networks
Computer Networks
2009-10-28Paper
A SOCIOLOGICAL PERSPECTIVE ON THE REORDERING PROBLEM IN MULTIPATH ROUTING
Cybernetics and Systems
2009-08-26Paper
Load sensitive topology control: towards minimum energy consumption in dense ad hoc sensor networks
Computer Networks
2008-03-05Paper


Research outcomes over time


This page was built for person: Amir Nayyeri