default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnanya Das 0003
Person information
- affiliation: Middlebury College, Department of Computer Science, VT, USA
Other persons with the same name
- Ananya Das 0001 — Lake Forest College, IL, USA (and 1 more)
- Ananya Das 0002 — Mayo Clinic Arizona, Scottsdale, AZ, USA
- Ananya Das 0004 — Colgate University, New York, NY, USA
- Ananya Das 0005
![[0000-0003-1813-566X]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-1813-566X")
— Indian Institute of Technology (Indian School of Mines), Department of Mathematics and Computing, Dhanbad, India - Ananya Das 0006 — Indian Institute of Technology Kharagpur, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Barbara M. Anthony, Christine Chung, Ananya Das, David S. Yuen:
New Bounds on the Performance of SBP for the Dial-a-Ride Problem with Revenues (Short Paper). ATMOS 2024: 8:1-8:6- 2023
- [c9]Barbara M. Anthony, Christine Chung, Ananya Das, David S. Yuen:
Earliest Deadline First Is a 2-Approximation for DARP with Time Windows. COCOA (2) 2023: 97-110 - 2022
- [j3]Ananya Christman, Christine Chung, Nicholas Jaczko, Scott Westvold, David S. Yuen:
Robustly assigning unstable items. J. Comb. Optim. 44(3): 1556-1577 (2022) - 2021
- [j2]Ananya D. Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu, David S. Yuen:
Improved Bounds for Revenue Maximization in Time-Limited Online Dial-a-Ride. Oper. Res. Forum 2(3) (2021) - [c8]Barbara M. Anthony, Ananya D. Christman, Christine Chung, David S. Yuen:
Serving Rides of Equal Importance for Time-Limited Dial-a-Ride. MOTOR 2021: 35-50 - 2020
- [c7]Ananya Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu, David S. Yuen:
New Bounds for Maximizing Revenue in Online Dial-a-Ride. IWOCA 2020: 180-194
2010 – 2019
- 2019
- [c6]Barbara M. Anthony, Ricky Birnbaum, Sara Boyd, Ananya Christman, Christine Chung, Patrick Davis, Jigar Dhimar, David S. Yuen:
Maximizing the Number of Rides Served for Dial-a-Ride. ATMOS 2019: 11:1-11:15 - [i4]Ananya Christman, Christine Chung, Nicholas Jaczko, Tianzhi Li, Scott Westvold, Xinyue Xu:
The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride. CoRR abs/1912.06300 (2019) - 2018
- [j1]Ananya Christman, William Forcier, Aayam Poudel:
From theory to practice: maximizing revenues for on-line dial-a-ride. J. Comb. Optim. 35(2): 512-529 (2018) - [c5]Ananya Christman, Christine Chung, Nicholas Jaczko, Scott Westvold, David S. Yuen:
Robustly Assigning Unstable Items. COCOA 2018: 402-420 - 2017
- [c4]Ananya Christman, Christine Chung, Nicholas Jaczko, Marina Milan, Anna Vasilchenko, Scott Westvold:
Revenue Maximization in Online Dial-A-Ride. ATMOS 2017: 1:1-1:15 - 2016
- [c3]Ananya Christman, Hamza Alsarhan, Davin Chia, Shannia Fu, Yanfeng Jin:
A Two-Pass Algorithm for Unordered Colored Bin Packing. DOOR (Supplement) 2016: 1-10 - 2015
- [i3]Hamza Alsarhan, Davin Chia, Ananya Christman, Shannia Fu, Tony Jin:
Colored Bin Packing. CoRR abs/1508.07380 (2015) - [i2]Hamza Alsarhan, Davin Chia, Ananya Christman, Shannia Fu, Yanfeng Jin:
Bin Packing with Multiple Colors. CoRR abs/1511.04762 (2015) - 2014
- [c2]Ananya Christman, William Forcier:
Maximizing Revenues for On-Line Dial-a-Ride. COCOA 2014: 522-534 - 2013
- [c1]Ananya Christman, Joao Cassamano:
Maximizing the Probability of Arriving on Time. ASMTA 2013: 142-157 - [i1]Ananya Christman, William Forcier:
Maximizing Revenues for Online-Dial-a-Ride. CoRR abs/1310.7232 (2013)
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-04 21:39 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:
