3 citations · 4 across the 6 of their papers we have counts for
6 papers
Minimum-Weight Steiner Triangulation of Convex Polygons Requires Interior Steiner Points
David Eppstein, Zahra Hadizadeh
We construct a convex polygon for which the minimum-weight Steiner triangulation requires an interior Steiner point. This provides a counterexample to a 1994 conjecture of Eppstein…
Networked Information Aggregation for Binary Classification
MohammadHossein Bateni, Zahra Hadizadeh, MohammadTaghi Hajiaghayi +2
We study networked binary classification on a directed acyclic graph (DAG) where each agent observes only a subset of the feature columns of a shared dataset. Agents act sequential…
Accelerating Scientific Research with Gemini: Case Studies and Common Techniques
David P. Woodruff, Vincent Cohen-Addad, Lalit Jain +33
Recent advances in large language models (LLMs) have opened new avenues for accelerating scientific research. While models are increasingly capable of assisting with routine tasks,…
The Rectilinear Marco Polo Problem
Ofek Gila, Michael T. Goodrich, Zahra Hadizadeh +2
We study the rectilinear Marco Polo problem, which generalizes the Euclidean version of the Marco Polo problem for performing geometric localization to rectilinear search environme…
The Marco Polo Problem: A Combinatorial Approach to Geometric Localization
Ofek Gila, Michael T. Goodrich, Zahra Hadizadeh +2
We introduce and study the Marco Polo problem, which is a combinatorial approach to geometric localization. In this problem, we are told there are one or more points of interest (P…
Independent Domination in Subcubic Graphs
A. Akbari, S. Akbari, A. Doosthosseini +3
A set of vertices in a graph is a dominating set if every vertex not in is adjacent to a vertex in . If, in addition, is an independent set, then is an indep…