![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Aparna Das
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j7]Rumana Yasmin, Aparna Das, Liton Jude Rozario, Md. Ezharul Islam
:
Butterfly detection and classification techniques: A review. Intell. Syst. Appl. 18: 200214 (2023) - 2021
- [j6]Jonathan P. Bona, Aaron S. Kemp
, Carli Cox, Tracy S. Nolan, Lakshmi Pillai
, Aparna Das, James E. Galvin, Linda Larson-Prior, Tuhin Virmani, Fred W. Prior:
Semantic Integration of Multi-Modal Data and Derived Neuroimaging Results Using the Platform for Imaging in Precision Medicine (PRISM) in the Arkansas Imaging Enterprise System (ARIES). Frontiers Artif. Intell. 4: 649970 (2021)
2010 – 2019
- 2019
- [c9]Jonathan P. Bona, Aaron S. Kemp, Tracy S. Nolan, Linda J. Larson-Prior, Aparna Das, Tuhin Virmani, Lakshmi Pillai, Mathias Brochhausen, Fred W. Prior:
Semantic Integration of Neuroinformatics Data in the Arkansas Image Enterprise System with Open Biomedical Ontologies. ICBO 2019: 1 - 2018
- [j5]Aparna Das, Krzysztof Fleszar
, Stephen G. Kobourov
, Joachim Spoerhase
, Sankar Veeramoni, Alexander Wolff
:
Approximating the Generalized Minimum Manhattan Network Problem. Algorithmica 80(4): 1170-1190 (2018) - 2017
- [c8]Aparna Das, David Voorhees, Cynthia Choi, Carl E. Landwehr:
Cybersecurity for Future Presidents: An Interdisciplinary Non-majors Course. SIGCSE 2017: 141-146 - 2015
- [j4]Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov
, Joachim Spoerhase
, Alexander Wolff
:
Approximating Minimum Manhattan Networks in Higher Dimensions. Algorithmica 71(1): 36-52 (2015) - [j3]Aparna Das, Claire Mathieu:
A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing. Algorithmica 73(1): 115-142 (2015) - 2014
- [j2]Matthew Cary, Aparna Das, Benjamin Edelman, Ioannis Giotis, Kurtis Heimerl, Anna R. Karlin, Scott Duke Kominers
, Claire Mathieu, Michael Schwarz:
Convergence of Position Auctions under Myopic Best-Response Dynamics. ACM Trans. Economics and Comput. 2(3): 9:1-9:20 (2014) - 2013
- [c7]Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov
, Joachim Spoerhase
, Sankar Veeramoni, Alexander Wolff
:
Approximating the Generalized Minimum Manhattan Network Problem. ISAAC 2013: 722-732 - [i6]Aparna Das, Markus Geyer, Michael Kaufmann, Stephen G. Kobourov, Sankar Veeramoni:
Maximum Differential Coloring of Caterpillars and Spiders. CoRR abs/1302.7085 (2013) - 2012
- [c6]Jean-Paul Comet, Gilles Bernot, Aparna Das, Francine Diener, Camille Massot, Amélie Cessieux:
Simplified Models for the Mammalian Circadian Clock. CSBio 2012: 127-138 - [i5]Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff:
Polylogarithmic Approximation for Generalized Minimum Manhattan Networks. CoRR abs/1203.6481 (2012) - [i4]Joy Chen, Ryan Compton, Aparna Das, Yi Huang, Stephen G. Kobourov, Paul S. Shen, Sankar Veeramoni, Yunhao Xu:
AngryAnts: A Citizen Science Approach to Computing Accurate Average Trajectories. CoRR abs/1212.0935 (2012) - 2011
- [b1]Aparna Das:
Approximation Schemes for Euclidean Vehicle Routing Problems. Brown University, USA, 2011 - [c5]Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov
, Joachim Spoerhase
, Alexander Wolff
:
Approximating Minimum Manhattan Networks in Higher Dimensions. ESA 2011: 49-60 - [i3]Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff:
Approximating Minimum Manhattan Networks in Higher Dimensions. CoRR abs/1107.0901 (2011) - 2010
- [c4]Aparna Das, Claire Mathieu:
A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing. SODA 2010: 390-403 - [c3]Aparna Das, Claire Mathieu, Shay Mozes
:
The Train Delivery Problem - Vehicle Routing Meets Bin Packing. WAOA 2010: 94-105
2000 – 2009
- 2009
- [j1]Aparna Das, Claire Kenyon-Mathieu:
On Hierarchical Diameter-Clustering and the Supplier Problem. Theory Comput. Syst. 45(3): 497-511 (2009) - [i2]Aparna Das, Claire Mathieu, Daniel Ricketts:
Maximizing profit using recommender systems. CoRR abs/0908.3633 (2009) - 2008
- [i1]Aparna Das, Claire Mathieu:
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing. CoRR abs/0812.1595 (2008) - 2007
- [c2]Matthew Cary, Aparna Das, Benjamin Edelman, Ioannis Giotis, Kurtis Heimerl, Anna R. Karlin, Claire Mathieu, Michael Schwarz:
Greedy bidding strategies for keyword auctions. EC 2007: 262-271 - 2006
- [c1]Aparna Das, Claire Kenyon:
On Hierarchical Diameter-Clustering, and the Supplier Problem. WAOA 2006: 132-145
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint