On the spectrum of the forced matching number of graphs. - Peyman Afshani; Hamed Hatami; Ebadollah S. Mahmoodian (Australas. J Comb., 2004)

Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs. - Peyman Afshani; Timothy M. Chan (CCCG, 2005)

Circular chromatic index of graphs of maximum degree 3. - Peyman Afshani; Mahsa Ghandehari; Mahya Ghandehari; Hamed Hatami; Ruzbeh Tusserkani; Xuding Zhu (J. Graph Theory, 2005)

Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull. - Peyman Afshani; Arash Farzan (CCCG, 2007)

On the Complexity of Finding an Unknown Cut Via Vertex Queries. - Peyman Afshani; Ehsan Chiniforooshan; Reza Dorrigiv; Arash Farzan; Mehdi Mirzazadeh; Narges Simjour; Hamid Zarrabi-Zadeh (COCOON, 2007)

On Dominance Reporting in 3D. - Peyman Afshani (ESA, 2008)

Approximation and inapproximability results for maximum clique of disc graphs in high dimensions. - Peyman Afshani; Hamed Hatami (Inf. Process. Lett., 2008)

On Geometric Range Searching, Approximate Counting and Depth Problems. - Peyman Afshani (2008)

Orthogonal Range Reporting in Three and Higher Dimensions. - Peyman Afshani; Lars Arge; Kasper Dalgaard Larsen (FOCS, 2009)

Optimal halfspace range reporting in three dimensions. - Peyman Afshani; Timothy M. Chan (SODA, 2009)

Dynamic Connectivity for Axis-Parallel Rectangles. - Peyman Afshani; Timothy M. Chan (Algorithmica, 2009)

On Approximate Range Counting and Depth. - Peyman Afshani; Timothy M. Chan (Discret. Comput. Geom., 2009)

Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. - Peyman Afshani; Lars Arge; Kasper Dalgaard Larsen (SCG, 2010)

A general approach for cache-oblivious range reporting and approximate range counting. - Peyman Afshani; Chris H. Hamilton; Norbert Zeh (Comput. Geom., 2010)

Ordered and Unordered Top-K Range Reporting in Large Data Sets. - Peyman Afshani; Gerth Stølting Brodal; Norbert Zeh (SODA, 2011)

Improved Space Bounds for Cache-Oblivious Range Reporting. - Peyman Afshani; Norbert Zeh (SODA, 2011)

Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space. - Peyman Afshani; Chris H. Hamilton; Norbert Zeh (Discret. Comput. Geom., 2011)

Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model. - Peyman Afshani; Lars Arge; Kasper Green Larsen (SCG, 2012)

Lower Bounds for Sorted Geometric Queries in the I/O Model. - Peyman Afshani; Norbert Zeh (ESA, 2012)

The Deterministic and Randomized Query Complexity of a Simple Guessing Game. - Peyman Afshani; Manindra Agrawal; Benjamin Doerr; Carola Winzen; Kasper Green Larsen; Kurt Mehlhorn (Electron. Colloquium Comput. Complex., 2012)

The Query Complexity of Finding a Hidden Permutation. - Peyman Afshani; Manindra Agrawal; Benjamin Doerr; Carola Doerr; Kasper Green Larsen; Kurt Mehlhorn (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

Property Testing on Linked Lists. - Peyman Afshani; Kevin Matulef; Bryan T. Wilkinson (Electron. Colloquium Comput. Complex., 2013)

Improved Pointer Machine and I/O Lower Bounds for Simplex Range Reporting and Related Problems. - Peyman Afshani (Int. J. Comput. Geom. Appl., 2013)

(Approximate) Uncertain Skylines. - Peyman Afshani; Pankaj K. Agarwal; Lars Arge; Kasper Green Larsen; Jeff M. Phillips (Theory Comput. Syst., 2013)

Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. - Peyman Afshani; Timothy M. Chan; Konstantinos Tsakalidis (ICALP (1), 2014)

Fast Computation of Output-Sensitive Maxima in a Word RAM. - Peyman Afshani (SODA, 2014)

Concurrent Range Reporting in Two-Dimensional Space. - Peyman Afshani; Cheng Sheng 001; Yufei Tao 001; Bryan T. Wilkinson (SODA, 2014)

Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges. - Peyman Afshani; Konstantinos Tsakalidis (SODA, 2014)

I/O-Efficient Range Minima Queries. - Peyman Afshani; Nodari Sitchinava (SWAT, 2014)

Sorting and Permuting without Bank Conflicts on GPUs. - Peyman Afshani; Nodari Sitchinava (ESA, 2015)

Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls. - Wanbin Son; Peyman Afshani (TAMC, 2015)

Approximating the Simplicial Depth. - Peyman Afshani; Donald R. Sheehy; Yannik Stein (CoRR, 2015)

Applications of Incidence Bounds in Point Covering Problems. - Peyman Afshani; Edvin Berglin; Ingo van Duijn; Jesper Sindahl Nielsen (SoCG, 2016)

Data Structure Lower Bounds for Document Indexing Problems. - Peyman Afshani; Jesper Sindahl Nielsen (ICALP, 2016)

An Efficient Algorithm for the 1D Total Visibility-Index Problem. - Peyman Afshani; Mark de Berg; Henri Casanova; Benjamin Karsin; Colin Lambrechts; Nodari Sitchinava; Constantinos Tsirogiannis (ALENEX, 2017)

Permuting and Batched Geometric Lower Bounds in the I/O Model. - Peyman Afshani; Ingo van Duijn (ESA, 2017)

Independent Range Sampling, Revisited. - Peyman Afshani; Zhewei Wei (ESA, 2017)

Cross-Referenced Dictionaries and the Limits of Write Optimization. - Peyman Afshani; Michael A. Bender; Martin Farach-Colton; Jeremy T. Fineman; Mayank Goswami 001; Meng-Tsung Tsai (SODA, 2017)

Instance-Optimal Geometric Algorithms. - Peyman Afshani; Jérémy Barbay; Timothy M. Chan (J. ACM, 2017)

On the complexity of range searching among curves. - Peyman Afshani; Anne Driemel (SODA, 2018)

Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges. - Peyman Afshani; Konstantinos Tsakalidis (Algorithmica, 2018)

An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization. - Peyman Afshani; Mark de Berg; Henri Casanova; Ben Karsin; Colin Lambrechts; Nodari Sitchinava; Constantinos Tsirogiannis (ACM J. Exp. Algorithmics, 2018)

A New Lower Bound for Semigroup Orthogonal Range Searching. - Peyman Afshani (SoCG, 2019)

Independent Range Sampling, Revisited Again. - Peyman Afshani; Jeff M. Phillips (SoCG, 2019)

Fragile Complexity of Comparison-Based Algorithms. - Peyman Afshani; Rolf Fagerberg; David Hammer; Riko Jacob; Irina Kostitsyna; Ulrich Meyer 001; Manuel Penschuck; Nodari Sitchinava (ESA, 2019)

Lower Bounds for Multiplication via Network Coding. - Peyman Afshani; Casper Benjamin Freksen; Lior Kamma; Kasper Green Larsen (ICALP, 2019)

The query complexity of a permutation-based variant of Mastermind. - Peyman Afshani; Manindra Agrawal; Benjamin Doerr; Carola Doerr; Kasper Green Larsen; Kurt Mehlhorn (Discret. Appl. Math., 2019)

Revisiting the Theory and Practice of Database Cracking. - Fatemeh Zardbani; Peyman Afshani; Panagiotis Karras (EDBT, 2020)

2D Generalization of Fractional Cascading on Axis-aligned Planar Subdivisions. - Peyman Afshani; Pingan Cheng (FOCS, 2020)

A Lower Bound for Jumbled Indexing. - Peyman Afshani; Ingo van Duijn; Rasmus Killmann; Jesper Sindahl Nielsen (SODA, 2020)

2D Fractional Cascading on Axis-aligned Planar Subdivisions. - Peyman Afshani; Pingan Cheng (CoRR, 2020)

Centerpoint Query Authentication. - Magnus Haxen; Morten Raeburn; Peyman Afshani; Panagiotis Karras (CIKM, 2021)

A Lower Bound for Dynamic Fractional Cascading. - Peyman Afshani (SODA, 2021)

Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. - Peyman Afshani; Mark de Berg; Kevin Buchin; Jie Gao 001; Maarten Löffler; Amir Nayyeri; Benjamin Raichel; Rik Sarkar; Haotian Wang 002; Hao-Tsung Yang (WAFR, 2021)

Locality-of-Reference Optimality of Cache-Oblivious Algorithms. - Peyman Afshani; John Iacono; Varunkumar Jayapaul; Ben Karsin; Nodari Sitchinava (APOCS, 2022)

On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. - Peyman Afshani; Mark de Berg; Kevin Buchin; Jie Gao 001; Maarten Löffler; Amir Nayyeri; Benjamin Raichel; Rik Sarkar; Haotian Wang 002; Hao-Tsung Yang (SoCG, 2022)

Lower Bounds for Intersection Reporting Among Flat Objects. - Peyman Afshani; Pingan Cheng (SoCG, 2023)

On Range Summary Queries. - Peyman Afshani; Pingan Cheng; Aniket Basu Roy; Zhewei Wei (ICALP, 2023)

An Optimal Lower Bound for Simplex Range Reporting. - Peyman Afshani; Pingan Cheng (SOSA, 2023)

Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions. - Peyman Afshani; Rasmus Killmann (Comput. Geom., 2023)

Lower Bounds for Semialgebraic Range Searching and Stabbing Problems. - Peyman Afshani; Pingan Cheng (J. ACM, 2023)

Optimal Coresets for Low-Dimensional Geometric Median. - Peyman Afshani; Chris Schwiegelshohn (ICML, 2024)

Hierarchical categories in colored searching. - Peyman Afshani; Rasmus Killmann; Kasper Green Larsen (Comput. Geom., 2024)

On Semialgebraic Range Reporting. - Peyman Afshani; Pingan Cheng (Discret. Comput. Geom., 2024)

Convexity Helps Iterated Search in 3D. - Peyman Afshani; Yakov Nekrich; Frank Staals (SoCG, 2025)

A Cell Probe Lower Bound for the Predecessor Search Problem in PRAM. - Peyman Afshani; Nodari Sitchinava (SODA, 2025)

Property Testing of Curve Similarity. - Peyman Afshani; Maike Buchin; Anne Driemel; Marena Richter; Sampson Wong (CoRR, 2025)