About me: I am a Ph.D. candidate at
Duke University in the
The Department of Computer Science.
I have broad interests in theoretical computer science and algorithms. I am
particularly interested in computational geometry and graph algorithms.
Email: asteiger AT cs DOT duke DOT edu
Office: D208 LSRC
Publications / Manuscripts
- An Output-Sensitive Algorithm for Computing the Union of Cubes and Fat Boxes in 3D. [online]
With Pankaj K. Agarwal.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021.
- Decomposing the Complement of the Union of Cubes in Three Dimensions. [online]
With Pankaj K. Agarwal and Micha Sharir.
Proceedings of the 32nd ACM Symposium on Discrete Algorithms (SODA), 2021.
- Efficient Indexes for Diverse Top-k Range Queries. [online]
With Pankaj K. Agarwal and Stavros Sintos.
Proceedings of the 39th ACM Symposium on Principles of Database Systems (PODS), 2020.
- Single-face non-crossing shortest paths in planar graphs. [online]
(Master's thesis, advised by Jeff Erickson)