default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbhishek Rathod
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Alessandro Saviolo
, Jonathan Frey, Abhishek Rathod, Moritz Diehl, Giuseppe Loianno:
Active Learning of Discrete-Time Dynamics for Uncertainty-Aware Model Predictive Control. IEEE Trans. Robotics 40: 1273-1291 (2024)- [c6]Tamal K. Dey, Abhishek Rathod:
Cup Product Persistence and Its Efficient Computation. SoCG 2024: 50:1-50:15 - [i11]Amritendu Dhar, Vijay Natarajan, Abhishek Rathod:
Geometric Localization of Homology Cycles. CoRR abs/2406.03183 (2024) - [i10]Wennie Tabib, John Stecklein, Caleb McDowell, Kshitij Goel, Felix Jonathan, Abhishek Rathod, Meghan Kokoski, Edsel Burkholder, Brian Wallace, Luis Ernesto Navarro-Serment, Nikhil Angad Bakshi, Tejus Gupta, Norman Papernick, David Guttendorf, Erik E. Kahn, Jessica Kasemer, Jesse Holdaway, Jeff Schneider:
Decentralized Uncertainty-Aware Active Search with a Team of Aerial Robots. CoRR abs/2410.08507 (2024) - 2023
- [c5]Ulrich Bauer, Abhishek Rathod, Meirav Zehavi:
On Computing Homological Hitting Sets. ITCS 2023: 13:1-13:21 - 2022
- [i9]Alessandro Saviolo, Jonathan Frey, Abhishek Rathod, Moritz Diehl, Giuseppe Loianno:
Active Learning of Discrete-Time Dynamics for Uncertainty-Aware Model Predictive Control. CoRR abs/2210.12583 (2022) - [i8]Ulrich Bauer, Talha Bin Masood, Barbara Giunti, Guillaume Houry, Michael Kerber, Abhishek Rathod:
Keeping it sparse: Computing Persistent Homology revised. CoRR abs/2211.09075 (2022) - [i7]Tamal K. Dey, Abhishek Rathod:
Cup Product Persistence and Its Efficient Computation. CoRR abs/2212.01633 (2022) - 2021
- [i6]Ulrich Bauer, Abhishek Rathod, Meirav Zehavi:
The complexity of high-dimensional cuts. CoRR abs/2108.10195 (2021) - [i5]Ulrich Bauer, Abhishek Rathod:
Parameterized inapproximability of Morse matching. CoRR abs/2109.04529 (2021) - [i4]Abhishek Rathod:
Fast Algorithms for Minimum Cycle Basis and Minimum Homology Basis. CoRR abs/2109.04567 (2021) - 2020
- [c4]Abhishek Rathod:
Fast Algorithms for Minimum Cycle Basis and Minimum Homology Basis. SoCG 2020: 64:1-64:11
2010 – 2019
- 2019
- [c3]Ulrich Bauer, Abhishek Rathod, Jonathan Spreer:
Parametrized Complexity of Expansion Height. ESA 2019: 13:1-13:15 - [c2]Joel C. Perry, Abhishek Rathod:
Energy Density and Hysteresis Comparison in Natural Rubber Tube Springs for Wearable Exoskeleton Applications. ICORR 2019: 21-27 - [c1]Ulrich Bauer, Abhishek Rathod:
Hardness of Approximation for Morse Matching. SODA 2019: 2663-2674 - [i3]Ulrich Bauer, Abhishek Rathod, Jonathan Spreer:
Parametrized Complexity of Expansion Height. CoRR abs/1910.09228 (2019) - 2018
- [i2]Ulrich Bauer, Abhishek Rathod:
Hardness of Approximation for Morse Matching. CoRR abs/1801.08380 (2018) - 2017
- [j1]Abhishek Rathod, Talha Bin Masood, Vijay Natarajan:
Approximation algorithms for Max Morse Matching. Comput. Geom. 61: 1-23 (2017) - 2016
- [i1]Abhishek Rathod, Talha Bin Masood, Vijay Natarajan:
Approximation Algorithms for Max-Morse Matching. CoRR abs/1604.04707 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-19 21:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
