Aruni Choudhary

Aruni Choudhary is a Lecturer in the Algorithms department at Freie Universität Berlin since July 2022. Prior to this, they worked as a Postdoctoral Researcher at the same institution (2018–2022) and at the Max-Planck-Institut für Informatik (2018). Their research focuses on Discrete and Computational Geometry, Computational Topology, and Graph Algorithms.

They completed their PhD in Computer Science (Dr.-Ing.) at Universität des Saarlandes and Max-Planck-Institut für Informatik (2013–2017), advised by Michael Kerber and Kurt Mehlhorn. Earlier, they earned a dual B.Tech/M.Tech in Computer Science and Engineering from IIT Kharagpur (2007–2012), guided by Pallab Dasgupta and Susmita Sur-Kolay. They also hold a CBSE secondary degree from Jamshedpur Public School (2007).

Key research themes include topological approximations, geometric combinatorics, and high-dimensional geometric algorithms. Their work on Coxeter triangulations, Tverberg theorems, and Rips filtrations highlights interdisciplinary approaches to computational geometry and topology. Recent publications (2020–2022) emphasize algorithmic complexity, metric space analysis, and geometric data structures.

• Lecturer & TA for Compiler Construction (WS 23/24, WS 22/23)
• Lecturer for Advanced Algorithms (WS 19/20), Statistics for Computer Science (SS 24), and Programming Languages Seminar (WS 23/24)
• TA for Discrete Structures (AT 11), Programming Lab (SP 12), and Young Researchers Forum (SoCG 2016)