Seguir
Ananya Das Christman
Ananya Das Christman
Associate Professor of Computer Science, Middlebury College
Dirección de correo verificada de middlebury.edu - Página principal
Título
Citado por
Citado por
Año
A partial-protection approach using multipath provisioning
A Das, CU Martel, B Mukherjee
Communications, 2009. ICC'09. IEEE International Conference on, 1-5, 2009
352009
Maximizing profit using SLA-aware provisioning
A Das
2012 IEEE Network Operations and Management Symposium, 393-400, 2012
272012
New approach to reliable multipath provisioning
A Das, C Martel, B Mukherjee, S Rai
Journal of Optical Communications and Networking 3 (1), 95-103, 2011
152011
Maximizing the probability of arriving on time
A Christman, J Cassamano
Analytical and Stochastic Modeling Techniques and Applications: 20th …, 2013
142013
From theory to practice: maximizing revenues for on-line dial-a-ride
A Christman, W Forcier, A Poudel
Journal of Combinatorial Optimization 35, 512-529, 2018
122018
Revenue maximization in online dial-a-ride
A Christman, C Chung, N Jaczko, M Milan, A Vasilchenko, S Westvold
17th Workshop on Algorithmic Approaches for Transportation Modelling …, 2017
82017
A better approach to reliable multi-path provisioning
A Das, C Martel, B Mukherjee, S Rai
IEEE GLOBECOM 2007-IEEE Global Telecommunications Conference, 2724-2728, 2007
82007
Maximizing the number of rides served for dial-a-ride
BM Anthony, R Birnbaum, S Boyd, A Christman, C Chung, P Davis, ...
19th Symposium on Algorithmic Approaches for Transportation Modelling …, 2019
72019
Stochastic shortest path with unlimited hops
A Das, C Martel
Information processing letters 109 (5), 290-295, 2009
72009
Maximizing revenues for on-line dial-a-ride
A Christman, W Forcier
Combinatorial Optimization and Applications: 8th International Conference …, 2014
62014
Security Analysis of the eVACS Open-Source Voting System
A Das, Y Niu, T Stegers
online], http://wwwcsif. cs. ucdavis. edu/% 7Esteqers/eVACS-final-report …, 2005
42005
New bounds for maximizing revenue in online dial-a-ride
A Christman, C Chung, N Jaczko, T Li, S Westvold, X Xu, D Yuen
International Workshop on Combinatorial Algorithms, 180-194, 2020
22020
Robustly assigning unstable items
A Christman, C Chung, N Jaczko, S Westvold, DS Yuen
Journal of Combinatorial Optimization 44 (3), 1556-1577, 2022
12022
Improved bounds for revenue maximization in time-limited online dial-a-ride
AD Christman, C Chung, N Jaczko, T Li, S Westvold, X Xu, D Yuen
Operations Research Forum 2, 1-38, 2021
12021
Serving rides of equal importance for time-limited dial-a-ride
BM Anthony, AD Christman, C Chung, D Yuen
International Conference on Mathematical Optimization Theory and Operations …, 2021
12021
A Two-Pass Algorithm for Unordered Colored Bin Packing
H Alsarhan, D Chia, A Christman, S Fu, Y Jin
12016
The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride
A Christman, C Chung, N Jaczko, T Li, S Westvold, X Xu
arXiv preprint arXiv:1912.06300, 2019
2019
Efficient service-aware network algorithms
A Das
University of California, Davis, 2010
2010
A Formal Model of the Yolo County Election Process
A Das, C Franke, Y Niu
2006
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–19