 | 2011 |
| 22 |  | Peyman Afshani,
Pankaj K. Agarwal,
Lars Arge,
Kasper Green Larsen,
Jeff M. Phillips:
(Approximate) uncertain skylines.
ICDT 2011: 186-196 |
| 21 |  | Peyman Afshani,
Norbert Zeh:
Improved Space Bounds for Cache-Oblivious Range Reporting.
SODA 2011: 1745-1758 |
| 20 |  | Peyman Afshani,
Gerth Stølting Brodal,
Norbert Zeh:
Ordered and Unordered Top-K Range Reporting in Large Data Sets.
SODA 2011: 390-400 |
| 19 |  | Peyman Afshani,
Chris H. Hamilton,
Norbert Zeh:
Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space.
Discrete & Computational Geometry 45(4): 824-850 (2011) |
| 2010 |
| 18 |  | Peyman Afshani,
Lars Arge,
Kasper Dalgaard Larsen:
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements.
Symposium on Computational Geometry 2010: 240-246 |
| 17 |  | Peyman Afshani,
Chris H. Hamilton,
Norbert Zeh:
A general approach for cache-oblivious range reporting and approximate range counting.
Comput. Geom. 43(8): 700-712 (2010) |
| 2009 |
| 16 |  | Peyman Afshani,
Jérémy Barbay,
Timothy M. Chan:
Instance-Optimal Geometric Algorithms.
FOCS 2009: 129-138 |
| 15 |  | Peyman Afshani,
Lars Arge,
Kasper Dalgaard Larsen:
Orthogonal Range Reporting in Three and Higher Dimensions.
FOCS 2009: 149-158 |
| 14 |  | Peyman Afshani,
Timothy M. Chan:
Optimal halfspace range reporting in three dimensions.
SODA 2009: 180-186 |
| 13 |  | Peyman Afshani,
Chris H. Hamilton,
Norbert Zeh:
Cache-oblivious range reporting with optimal queries requires superlinear space.
Symposium on Computational Geometry 2009: 277-286 |
| 12 |  | Peyman Afshani,
Chris H. Hamilton,
Norbert Zeh:
A general approach for cache-oblivious range reporting and approximate range counting.
Symposium on Computational Geometry 2009: 287-295 |
| 11 |  | Peyman Afshani,
Timothy M. Chan:
Dynamic Connectivity for Axis-Parallel Rectangles.
Algorithmica 53(4): 474-487 (2009) |
| 10 |  | Peyman Afshani,
Timothy M. Chan:
On Approximate Range Counting and Depth.
Discrete & Computational Geometry 42(1): 3-21 (2009) |
| 2008 |
| 9 |  | Peyman Afshani:
On Dominance Reporting in 3D.
ESA 2008: 41-51 |
| 8 |  | Peyman Afshani,
Hamed Hatami:
Approximation and inapproximability results for maximum clique of disc graphs in high dimensions.
Inf. Process. Lett. 105(3): 83-87 (2008) |
| 2007 |
| 7 |  | Peyman Afshani,
Arash Farzan:
Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull.
CCCG 2007: 153-155 |
| 6 |  | Peyman Afshani,
Ehsan Chiniforooshan,
Reza Dorrigiv,
Arash Farzan,
Mehdi Mirzazadeh,
Narges Simjour,
Hamid Zarrabi-Zadeh:
On the Complexity of Finding an Unknown Cut Via Vertex Queries.
COCOON 2007: 459-469 |
| 5 |  | Peyman Afshani,
Timothy M. Chan:
On approximate range counting and depth.
Symposium on Computational Geometry 2007: 337-343 |
| 4 |  | Peyman Afshani,
Hamed Hatami:
Approximation and Inapproximability Results for Maximum Clique of Disc Graphs in High Dimensions
CoRR abs/cs/0701009: (2007) |
| 2006 |
| 3 |  | Peyman Afshani,
Timothy M. Chan:
Dynamic Connectivity for Axis-Parallel Rectangles.
ESA 2006: 16-27 |
| 2005 |
| 2 |  | Peyman Afshani,
Timothy M. Chan:
Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs.
CCCG 2005: 19-22 |
| 1 |  | Peyman Afshani,
Mahsa Ghandehari,
Mahya Ghandehari,
Hamed Hatami,
Ruzbeh Tusserkani,
Xuding Zhu:
Circular chromatic index of graphs of maximum degree 3.
Journal of Graph Theory 49(4): 325-335 (2005) |