Abhishek Rathod

Orcid: 0009-0007-2597-7079

According to our database1, Abhishek Rathod authored at least 22 papers between 2017 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
AcroRL: Learning Aggressive Quadrotor Inversion using Bidirectional Thrust.
CoRR, May, 2026

Bifunction and Interlevel Delaunay Trifiltrations.
Proceedings of the 42nd International Symposium on Computational Geometry, 2026

2025
Quadrotor Navigation using Reinforcement Learning with Privileged Information.
CoRR, September, 2025

Fast Algorithms for Minimum Homology Basis.
Discret. Comput. Geom., July, 2025

(Almost-)Optimal FPT Algorithm and Kernel for <i>T</i>-Cycle on Planar Graphs.
CoRR, April, 2025

Parameterized inapproximability of Morse matching.
Comput. Geom., 2025

(Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024
Active Learning of Discrete-Time Dynamics for Uncertainty-Aware Model Predictive Control.
IEEE Trans. Robotics, 2024

Rapid Quadrotor Navigation in Diverse Environments using an Onboard Depth Camera.
CoRR, 2024

Decentralized Uncertainty-Aware Active Search with a Team of Aerial Robots.
CoRR, 2024

Keeping it sparse: Computing Persistent Homology revisited.
Comput. Geom. Topol., 2024

Rapid Quadrotor Navigation in Diverse Environments Using an Onboard Depth Camera.
Proceedings of the IEEE International Symposium on Safety Security Rescue Robotics, 2024

Cup Product Persistence and Its Efficient Computation.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

Geometric Localization of Homology Cycles.
Proceedings of the 36th Canadian Conference on Computational Geometry, 2024

2023
On Computing Homological Hitting Sets.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
Keeping it sparse: Computing Persistent Homology revised.
CoRR, 2022

2021
The complexity of high-dimensional cuts.
CoRR, 2021

2020
Fast Algorithms for Minimum Cycle Basis and Minimum Homology Basis.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
Hardness of Approximation for Morse Matching.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Energy Density and Hysteresis Comparison in Natural Rubber Tube Springs for Wearable Exoskeleton Applications.
Proceedings of the 16th IEEE International Conference on Rehabilitation Robotics, 2019

Parametrized Complexity of Expansion Height.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2017
Approximation algorithms for Max Morse Matching.
Comput. Geom., 2017


  Loading...