Benjamin Aram Berendsohn

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 17

Top Topics

Maximum Distance

Discrete Optimization

Top Venues

Publications

Benjamin Aram Berendsohn
Fast and simple unrooted dynamic forests. ALENEX (2024)
Benjamin Aram Berendsohn, László Kozma, Michal Opler
Optimization with Pattern-Avoiding Input. STOC (2024)
Benjamin Aram Berendsohn
Fast and simple unrooted dynamic forests. CoRR (2023)
Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma
Fast Approximation of Search Trees on Trees with Centroid Trees. ICALP (2023)
Benjamin Aram Berendsohn, László Kozma, Michal Opler
Optimization with pattern-avoiding input. CoRR (2023)
Benjamin Aram Berendsohn, László Kozma
Group Testing with Geometric Ranges. ISIT (2022)
Benjamin Aram Berendsohn, László Kozma
Splay trees on trees. SODA (2022)
Benjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma
Fixed-point cycles and EFX allocations. CoRR (2022)
Benjamin Aram Berendsohn, Ishay Golinsky, Haim Kaplan, László Kozma
Fast approximation of search trees on trees with centroid trees. CoRR (2022)
Benjamin Aram Berendsohn
The Diameter of Caterpillar Associahedra. SWAT (2022)
Benjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma
Fixed-Point Cycles and Approximate EFX Allocations. MFCS (2022)
Benjamin Aram Berendsohn
The diameter of caterpillar associahedra. CoRR (2021)
Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Finding and Counting Permutations via CSPs. Algorithmica 83 (8) (2021)
Benjamin Aram Berendsohn, László Kozma
Geometric group testing. CoRR (2020)
Benjamin Aram Berendsohn, László Kozma
Splay trees on trees. CoRR (2020)
Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Finding and Counting Permutations via CSPs. IPEC (2019)
Benjamin Aram Berendsohn, László Kozma, Dániel Marx
Finding and counting permutations via CSPs. CoRR (2019)