Amir Nayyeri

CoRR, 2023

An Incremental Span-Program-Based Algorithm and the Fine Print of Quantum Topological Data Analysis.

[BibT_eX]

[DOI]

Mitchell Black

William Maxwell

CoRR, 2023

Understanding Oversquashing in GNNs through the Lens of Effective Resistance.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

2022

Computational Topology in a Collapsing Universe: Laplacians, Homology, Cohomology.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes.

[BibT_eX]

[DOI]

Mitchell Black

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Finding surfaces in simplicial complexes with bounded-treewidth 1-skeleton.

[BibT_eX]

[DOI]

Mitchell Black

CoRR, 2021

Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Foundations of Robotics XIV, 2021

Generalized Max-Flows and Min-Cuts in Simplicial Complexes.

[BibT_eX]

[DOI]

William Maxwell

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Low-Stretch Spanning Trees of Graphs with Bounded Width.

[BibT_eX]

[DOI]

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes.

[BibT_eX]

[DOI]

Glencora Borradaile

William Maxwell

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

Viewing the Rings of a Tree: Minimum Distortion Embeddings into Trees.

[BibT_eX]

[DOI]

Benjamin Raichel

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Cost-effective conceptual design using taxonomies.

[BibT_eX]

[DOI]

Yodsawalai Chodpathumwan

Ali Vakilian

Arash Termehchy

VLDB J., 2018

On the Decidability of the Fréchet Distance between Surfaces.

[BibT_eX]

[DOI]

Hanzhong Xu

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

A Pseudo-Approximation for the Genus of Hamiltonian Graphs.

[BibT_eX]

[DOI]

Yury Makarychev

Anastasios Sidiropoulos

Theory Comput., 2017

Minimum cycle and homology bases of surface-embedded graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

A Simple Algorithm for Computing a Cycle Separator.

[BibT_eX]

[DOI]

Sariel Har-Peled

CoRR, 2017

Cost-Effective Conceptual Design Over Taxonomies.

[BibT_eX]

[DOI]

Ali Vakilian

Yodsawalai Chodpathumwan

Arash Termehchy

Proceedings of the 20th International Workshop on the Web and Databases, 2017

A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs.

[BibT_eX]

[DOI]

Benjamin Raichel

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Global Minimum Cuts in Surface-Embedded Graphs.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

How to Walk Your Dog in the Mountains with No Magic Leash.

[BibT_eX]

[DOI]

Sariel Har-Peled

Mohammad R. Salavatipour

Anastasios Sidiropoulos

Discret. Comput. Geom., 2016

On Computing the Fréchet Distance Between Surfaces.

[BibT_eX]

[DOI]

Hanzhong Xu

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs.

[BibT_eX]

[DOI]

Glencora Borradaile

David Eppstein

Christian Wulff-Nilsen

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

A simplicial complex-based approach to unmixing tumor progression data.

[BibT_eX]

[DOI]

BMC Bioinform., 2015

Approximating Nearest Neighbor Distances.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Computing the Fréchet Distance Between Polygons with Holes.

[BibT_eX]

[DOI]

Anastasios Sidiropoulos

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Reality Distortion: Exact and Approximate Algorithms for Embedding into the Line.

[BibT_eX]

[DOI]

Benjamin Raichel

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs.

[BibT_eX]

[DOI]

Glencora Borradaile

Farzad Zafarani

Proceedings of the Algorithms - ESA 2015, 2015

2014

Counting and Sampling Minimum Cuts in Genus $$g$$ g Graphs.

[BibT_eX]

[DOI]

Kyle Fox

Discret. Comput. Geom., 2014

Testing Surface Area.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Tracing Compressed Curves in Triangulated Surfaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Counting and sampling minimum cuts in genus g graphs.

[BibT_eX]

[DOI]

Kyle Fox

Proceedings of the Symposium on Computational Geometry 2013, 2013

2012

Combinatorial optimization on embedded curves

[BibT_eX]

[DOI]

PhD thesis, 2012

Homology Flows, Cohomology Cuts.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Energy-efficient topology control in wireless ad hoc networks with selfish nodes.

[BibT_eX]

[DOI]

Comput. Networks, 2012

Global minimum cuts in surface embedded graphs.

[BibT_eX]

[DOI]

Kyle Fox

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Computing Replacement Paths in Surface Embedded Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Shortest Non-Crossing Walks in the Plane.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Hamid Hajabdolali Bazzaz

Comput. Networks, 2009

On optimizing survivable multihoming.

[BibT_eX]

[DOI]

Hamid Hajabdolali Bazzaz

Ahmad Khonsari

Proceedings of the 34th Annual IEEE Conference on Local Computer Networks, 2009

Minimum cuts and shortest homologous cycles.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008

Efficient construction of network topology to conserve energy in wireless ad hoc networks.

[BibT_eX]

[DOI]

Comput. Commun., 2008

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

[BibT_eX]

[DOI]

Mohammad Mahmoody-Ghidary

Comput. Networks, 2008

AntMig: A Novel Code Migration Method to Conserve Energy in Wireless Sensor Networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Cybern. Syst., 2007

Efficient and Adjustable Recipient Anonymity in Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2006

Joint Range and Load Considerations for Topology Control in Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Third Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks, 2006

Load Sensitive Topology Control for Energy Conservation in Ad Hoc Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

Consumer oriented state aggregation using reinforcement learning approach.

[BibT_eX]

[DOI]

Proceedings of the 3rd IEEE Consumer Communications and Networking Conference, 2006

FuFaIR: a Fuzzy Farsi Information Retrieval System.

[BibT_eX]

[DOI]