Amir Nayyeri

According to our database1, Amir Nayyeri authored at least 41 papers between 2006 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Minimum Cuts in Surface Graphs.
CoRR, 2019

Viewing the Rings of a Tree: Minimum Distortion Embeddings into Trees.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Cost-effective conceptual design using taxonomies.
VLDB J., 2018

On the Decidability of the Fréchet Distance between Surfaces.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
A Pseudo-Approximation for the Genus of Hamiltonian Graphs.
Theory of Computing, 2017

Minimum cycle and homology bases of surface-embedded graphs.
JoCG, 2017

A Simple Algorithm for Computing a Cycle Separator.
CoRR, 2017

Cost-Effective Conceptual Design Over Taxonomies.
Proceedings of the 20th International Workshop on the Web and Databases, 2017

A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Global Minimum Cuts in Surface-Embedded Graphs.
Encyclopedia of Algorithms, 2016

How to Walk Your Dog in the Mountains with No Magic Leash.
Discrete & Computational Geometry, 2016

On Computing the Fréchet Distance Between Surfaces.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
A simplicial complex-based approach to unmixing tumor progression data.
BMC Bioinformatics, 2015

Approximating Nearest Neighbor Distances.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Computing the Fréchet Distance Between Polygons with Holes.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Reality Distortion: Exact and Approximate Algorithms for Embedding into the Line.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Counting and Sampling Minimum Cuts in Genus $$g$$ g Graphs.
Discrete & Computational Geometry, 2014

Testing Surface Area.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

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, 2014

2013
Tracing Compressed Curves in Triangulated Surfaces.
Discrete & Computational Geometry, 2013

Counting and sampling minimum cuts in genus g graphs.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

2012
Homology Flows, Cohomology Cuts.
SIAM J. Comput., 2012

Energy-efficient topology control in wireless ad hoc networks with selfish nodes.
Comput. Networks, 2012

Global minimum cuts in surface embedded graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Computing Replacement Paths in Surface Embedded Graphs.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Shortest Non-Crossing Walks in the Plane.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2009
Joint range assignment and routing to conserve energy in wireless ad hoc networks.
Comput. Networks, 2009

On optimizing survivable multihoming.
Proceedings of the 34th Annual IEEE Conference on Local Computer Networks, 2009

Minimum cuts and shortest homologous cycles.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
Efficient construction of network topology to conserve energy in wireless ad hoc networks.
Comput. Commun., 2008

Load sensitive topology control: Towards minimum energy consumption in dense ad hoc sensor networks.
Comput. Networks, 2008

AntMig: A Novel Code Migration Method to Conserve Energy in Wireless Sensor Networks.
Proceedings of the WCNC 2008, IEEE Wireless Communications & Networking Conference, March 31 2008, 2008

2007
A Sociological Perspective on the Reordering Problem in Multipath Routing.
Cybernetics and Systems, 2007

Efficient and Adjustable Recipient Anonymity in Mobile Ad Hoc Networks.
Proceedings of the IEEE 4th International Conference on Mobile Adhoc and Sensor Systems, 2007

2006
Energy conserving movement-assisted deployment of ad hoc sensor networks.
IEEE Communications Letters, 2006

Joint Range and Load Considerations for Topology Control in Wireless Ad Hoc Networks.
Proceedings of the Third Annual IEEE Communications Society Conference on Sensor, 2006

Load Sensitive Topology Control for Energy Conservation in Ad Hoc Sensor Networks.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

FuFaIR: a Fuzzy Farsi Information Retrieval System.
Proceedings of the 2006 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2006), 2006


  Loading...