Geometric group testing. - Benjamin Aram Berendsohn; László Kozma 002 (CoRR, 2020)

Finding and Counting Permutations via CSPs. - Benjamin Aram Berendsohn; László Kozma 002; Dániel Marx (Algorithmica, 2021)

Group Testing with Geometric Ranges. - Benjamin Aram Berendsohn; László Kozma 002 (ISIT, 2022)

Fixed-Point Cycles and Approximate EFX Allocations. - Benjamin Aram Berendsohn; Simona Boyadzhiyska; László Kozma 002 (MFCS, 2022)

Splay trees on trees. - Benjamin Aram Berendsohn; László Kozma 002 (SODA, 2022)

The Diameter of Caterpillar Associahedra. - Benjamin Aram Berendsohn (SWAT, 2022)

Fixed-point cycles and EFX allocations. - Benjamin Aram Berendsohn; Simona Boyadzhiyska; László Kozma 002 (CoRR, 2022)

Fast Approximation of Search Trees on Trees with Centroid Trees. - Benjamin Aram Berendsohn; Ishay Golinsky; Haim Kaplan; László Kozma 002 (ICALP, 2023)

An exact characterization of saturation for permutation matrices. - Benjamin Aram Berendsohn (Comb. Theory, 2023)

Fast and simple unrooted dynamic forests. - Benjamin Aram Berendsohn (ALENEX, 2024)

Optimization with Pattern-Avoiding Input. - Benjamin Aram Berendsohn; László Kozma 002; Michal Opler (STOC, 2024)

Balanced TSP partitioning. - Benjamin Aram Berendsohn; Hwi Kim; László Kozma 002 (CoRR, 2025)

Permutation patterns in streams. - Benjamin Aram Berendsohn (CoRR, 2025)

Optimal antimatroid sorting. - Benjamin Aram Berendsohn (CoRR, 2025)