Saeed Odak

activity

20222026

most citedOn Separating Path and Tree Systems in Graphs

1 citations · 2 across the 9 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

cs.CC2025

Deciding if a DAG is Interesting is Hard

Jean-Lou De Carufel, Anil Maheshwari, Saeed Odak +3

The \emph{interestingness score} of a directed path $Π = e_{1}, e_{2}, e_{3}, \dots, e_{ℓ}$ in an edge-weighted directed graph $G$ is defined as $\texttt{score}(Π) := \sum_{i=1}^\ell w(e…

cs.CG2025

Closest Pair Queries in Vertical Slabs and Tight Bounds on the Number of Possible Answers

Ahmad Biniaz, Prosenjit Bose, Chaeyoon Chung +6

Let $S$ be a set of $n$ points in $R^{d}$ , where $d \geq 2$ is a constant, and let $H_{1}, H_{2}, \dots, H_{m + 1}$ be a sequence of vertical hyperplanes that are sorted by their fi…