## Benjamin Raichel

Email: benjamin.raichel@utdallas.edu

Office: ECSS 4.226

Hi, welcome to my page. I am an assistant professor in the Computer Science Department at UT Dallas. My research interests lie broadly in Computer Science Theory, but primarily I work on problems in Computational Geometry and Geometric Approximation Algorithms.

**Current Students:**

- Chenglin Fan (PhD)
- Gregory Van Buskirk (PhD)

Please read this before contacting me about research.

**Teaching:**

- Advanced Algorithm Design and Analysis: CS 4349 (Spring 2017)
- Design and Anlysis of Computer Algorithms: CS 6363 (Fall 2016)
- Frontiers in Algorithms: CS 7301 (Spring 2016)
- Design and Anlysis of Computer Algorithms: CS 6363 (Fall 2015)

My PhD advisor was Sariel Har-Peled. Here is a copy of my CV, and here is a sneezing bear.

My research on other sites: arXiv dblp Google Scholar#### Published Papers:

- Computing the Frechet Gap Distance

With Chenglin Fan. Symposium on Computational Geometry (SoCG), 2017.

- A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs

With Amir Nayyeri. ACM-SIAM Symposium on Discrete Algorithms (SODA), 2017.

- Most Likely Voronoi Diagrams in Higher Dimensions

With Nirman Kumar, Subhash Suri, and Kevin Verbeek.

Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2016.

- Avoiding the Global Sort: A Faster Contour Tree Algorithm

With Seshadhri Comandur. Symposium on Computational Geometry (SoCG), 2016.

- Sparse Approximation via Generating Point Sets

With Avrim Blum and Sariel Har-Peled. ACM-SIAM Symposium on Discrete Algorithms (SODA), 2016.

- Reality Distortion: Exact and Approximate Algorithms for Embedding into the Line

With Amir Nayyeri. IEEE Symposium on Foundations of Computer Science (FOCS), 2015.

- From Proximity to Utility: A Voronoi Partition of Pareto Optima

With Hsien-Chih Chang and Sariel Har-Peled. Symposium on Computational Geometry (SoCG), 2015.

- Space Exploration via Proximity Search

With Sariel Har-Peled, Nirman Kumar, and David Mount. Symposium on Computational Geometry (SoCG), 2015.

- On the Complexity of Randomly Weighted Voronoi Diagrams

With Sariel Har-Peled. Symposium on Computational Geometry (SoCG), 2014.

Invited to the DCG special issue for SoCG 2014.

- Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems

With Sariel Har-Peled. ACM Symposium on the Theory of Computing (STOC) 2013.

- Fault Tolerant Clustering Revisited

With Nirman Kumar. Presented at YRF at SoCG 2013.

Canadian Conference on Computational Geometry (CCCG), 2013.

- Geometric Packing under Non-uniform Constraints

With Alina Ene and Sariel Har-Peled. Symposium on Computational Geometry (SoCG), 2012.

- On the Expected Complexity of Voronoi Diagrams on Terrains

With Anne Driemel and Sariel Har-Peled. Symposium on Computational Geometry (SoCG), 2012.

- The Frechet Distance Revisited and Extended
[Full Version]
[Master's Thesis]

With Sariel Har-Peled. ACM Transactions on Algorithms 10 (1):3:1-3:22, 2014.

Also in Symposium on Computational Geometry (SoCG), 2011.

#### Manuscripts:

- Fast Clustering with Lower Bounds

With Alina Ene and Sariel Har-Peled. Presented at YRF at SoCG 2012. [arXiv version] - Viewing the Rings of a Tree: Minimum Distortion Embeddings into Trees

With Amir Nayyeri. In submission to FOCS 2017.

--I did not create this GIF, but may the interwebs

carry my message of thanks to whoever did.

...that gives us the idea of what the idea

that wants to be transmitted wants to be.

--Reggie Watts