Amir Nayyeri

From MaRDI portal
Person:249465

Available identifiers

zbMath Open nayyeri.amirMaRDI QIDQ249465

List of research outcomes





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
https://portal.mardi4nfdi.de/entity/Q60591742023-11-02Paper
Minimum bounded chains and minimum homologous chains in embedded simplicial complexes2023-11-02Paper
https://portal.mardi4nfdi.de/entity/Q60759642023-09-20Paper
Minimum Cuts in Surface Graphs2023-04-04Paper
Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes2022-05-04Paper
Viewing the rings of a tree: minimum distortion embeddings into trees2019-10-15Paper
Testing surface area2019-06-20Paper
Solving 1-Laplacians in nearly linear time: collapsing and expanding a topological ball2019-06-20Paper
Global minimum cuts in surface embedded graphs2019-05-10Paper
A treehouse with custom windows: minimum distortion embeddings into bounded treewidth graphs2018-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 graphs2018-01-30Paper
Minimum cycle and homology bases of surface embedded graphs2018-01-30Paper
Minimum cuts and shortest homologous cycles2017-10-20Paper
A pseudo-approximation for the genus of Hamiltonian graphs2017-10-11Paper
Shortest non-crossing walks in the plane2017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q53651072017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q53651222017-09-29Paper
Minimum cycle and homology bases of surface-embedded graphs2017-03-30Paper
How to walk your dog in the mountains with no magic leash2016-02-29Paper
Towards single face shortest vertex-disjoint paths in undirected planar graphs2015-11-19Paper
Approximating nearest neighbor distances2015-10-30Paper
Computing the Fréchet distance between polygons with holes2015-10-27Paper
Counting and sampling minimum cuts in genus g graphs2015-02-17Paper
Homology flows, cohomology cuts2015-02-04Paper
Counting and sampling minimum cuts in genus \(g\) graphs2014-11-14Paper
Tracing compressed curves in triangulated surfaces2014-08-07Paper
How to walk your dog in the mountains with no magic leash2014-08-07Paper
A pseudo-approximation for the genus of Hamiltonian graphs2013-10-04Paper
Tracing compressed curves in triangulated surfaces2013-08-05Paper
Homology Flows, Cohomology Cuts2013-03-19Paper
Joint range assignment and routing to conserve energy in wireless ad hoc networks2009-10-28Paper
A SOCIOLOGICAL PERSPECTIVE ON THE REORDERING PROBLEM IN MULTIPATH ROUTING2009-08-26Paper
Load sensitive topology control: towards minimum energy consumption in dense ad hoc sensor networks2008-03-05Paper

Research outcomes over time

This page was built for person: Amir Nayyeri