Reconstructing Biological and Digital Phylogenetic Trees in Parallel. - Ramtin Afshar; Michael T. Goodrich; Pedro Matias 001; Martha C. Osegueda (ESA, 2020)

Reconstructing Binary Trees in Parallel. - Ramtin Afshar; Michael T. Goodrich; Pedro Matias 001; Martha C. Osegueda (SPAA, 2020)

Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction. - Ramtin Afshar; Amihood Amir; Michael T. Goodrich; Pedro Matias 001 (SPIRE, 2020)

Parallel Network Mapping Algorithms. - Ramtin Afshar; Michael T. Goodrich; Pedro Matias 001; Martha C. Osegueda (SPAA, 2021)

Exact Learning of Multitrees and Almost-Trees Using Path Queries. - Ramtin Afshar; Michael T. Goodrich (LATIN, 2022)

Mapping Networks via Parallel kth-Hop Traceroute Queries. - Ramtin Afshar; Michael T. Goodrich; Pedro Matias 001; Martha C. Osegueda (STACS, 2022)

Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees. - Ramtin Afshar; Michael T. Goodrich; Evrim Ozel (SEA, 2022)

Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors. - Ramtin Afshar; Michael B. Dillencourt; Michael T. Goodrich; Evrim Ozel (SEA, 2023)

Exact Learning of Graphs Using Queries - Ramtin Afshar (2023)