Aparna Das

According to our database1, Aparna Das authored at least 18 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Butterfly detection and classification techniques: A review.
Intell. Syst. Appl., May, 2023

2021
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., 2021

2019
Semantic Integration of Neuroinformatics Data in the Arkansas Image Enterprise System with Open Biomedical Ontologies.
Proceedings of the 10th International Conference on Biomedical Ontology (ICBO 2019), Buffalo, New York, USA, July 30, 2019

2018
Approximating the Generalized Minimum Manhattan Network Problem.
Algorithmica, 2018

2017
Cybersecurity for Future Presidents: An Interdisciplinary Non-majors Course.
Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education, 2017

2015
A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing.
Algorithmica, 2015

Approximating Minimum Manhattan Networks in Higher Dimensions.
Algorithmica, 2015

2014
Convergence of Position Auctions under Myopic Best-Response Dynamics.
ACM Trans. Economics and Comput., 2014

2013
Maximum Differential Coloring of Caterpillars and Spiders
CoRR, 2013

2012
Simplified Models for the Mammalian Circadian Clock.
Proceedings of the 3rd International Conference on Computational Systems-Biology and Bioinformatics, 2012

AngryAnts: A Citizen Science Approach to Computing Accurate Average Trajectories
CoRR, 2012

Polylogarithmic Approximation for Generalized Minimum Manhattan Networks
CoRR, 2012

2011
Approximation Schemes for Euclidean Vehicle Routing Problems.
PhD thesis, 2011

2010
The Train Delivery Problem - Vehicle Routing Meets Bin Packing.
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
On Hierarchical Diameter-Clustering and the Supplier Problem.
Theory Comput. Syst., 2009

Maximizing profit using recommender systems
CoRR, 2009

2007
Greedy bidding strategies for keyword auctions.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007


  Loading...