17 citations · 32 across the 18 of their papers we have counts for
13 papers · 1 filter
The Impossibility of Simultaneous Time and I/O Optimality for The Planar Maxima and Convex Hull Problems
Peyman Afshani, Gerth Stølting Brodal, Nodari Sitchinava
We prove that no deterministic output-sensitive algorithm for the planar convex hull and maxima problems can obtain both optimal time and I/O complexity, where the optimality is de…
How many users have been here for a long time? Efficient solutions for counting long aggregated visits
Peyman Afshani, Rezaul Chowdhury, Inge Li Gørtz +3
This paper addresses the Counting Long Aggregated Visits problem, which is defined as follows. We are given users and regions, where each user spends some time visiting som…
Hierarchical Categories in Colored Searching
Peyman Afshani, Rasmus Killman, Kasper Green Larsen
In colored range counting (CRC), the input is a set of points where each point is assigned a ``color'' (or a ``category'') and the goal is to store them in a data structure such th…
A Lower Bound for Dynamic Fractional Cascading
Peyman Afshani
We investigate the limits of one of the fundamental ideas in data structures: fractional cascading. This is an important data structure technique to speed up repeated searches for…
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency
Peyman Afshani, Mark De Berg, Kevin Buchin +7
We consider the problem of finding patrol schedules for robots to visit a given set of sites in a metric space. Each robot has the same maximum speed and the goal is to min…
Independent Range Sampling, Revisited Again
Peyman Afshani, Jeff M. Phillips
We revisit the range sampling problem: the input is a set of points where each point is associated with a real-valued weight. The goal is to store them in a structure such that giv…