Abhishek Rathod
Contact: rathod ατ ma [dot] tum [dot] de
I am doing my PhD under the supervision of Prof. Dr. Ulrich Bauer at the Technical University of Munich. I have handed in my thesis, and will defend soon.
I am visiting Prof. Meirav Zehavi in November 2021.
In 2022, I will be joining Prof. Tamal Dey's group.
My research interests include topological data analysis, parameterized algorithms and approximation algorithms.
Selected conference talks.
- 09/2021 DGD Days 2021
- 07/2020 ATMCS/AATRN talk.
- 06/2020 Symposium on Computational Geometry (SoCG 2020).
- 09/2019 European Symposium on Algorithms (ESA 2019).
- 04/2019 DGD Days 2019.
- 01/2019 Symposium on Discrete Algorithms (SODA19).
- 10/2018 International Conference on Discretization in Geometry and Dynamics. (×2)
Invited and upcoming talks.
- 03/2022 AMS special session on Multiparameter persistence in theory and practice
- 11/2021Computational Persistence Workshop, Purdue University
- 03/2021 Computational Topology group, Purdue University.
- 02/2021 Mittagsseminar theoretische Informatik, TU Berlin.
- 01/2021 Discrete Geometry group, MPI Leipzig.
- 04/2019 Topology and Visualization group, CSA , IISc.
- 05/2017 Operations Research group, TU Munich.
Publications.
- with Ulrich Bauer and Meirav Zehavi. The Complexity of High-dimensional Cuts. (preprint).
- with Ulrich Bauer. Parameterized inapproximability of Morse matching. (preprint).
- Fast Algorithms for Minimum Cycle Basis and Minimum Homology Basis. Proceedings of the 36th Annual Symposium on Computational Geometry (SOCG 2020). (arXiv)
- with Ulrich Bauer and Jonathan Spreer. Parametrized Complexity of Expansion Height, 27th Annual European Symposium on Algorithms (ESA 2019). (arXiv)
- with Ulrich Bauer. Hardness of Approximation for Morse Matching, SODA '19: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. (arXiv).
- with Talha bin Masood and Vijay Natarajan. Approximation algorithms for Max Morse Matching, Computational Geometry Volume 61 (arXiv).
Related research articles.
A recent survey article by Francisco Martinez on computing optimal discrete gradients on simplicial complexes.