| Assortment optimization with small consideration sets J Feldman, A Paul, H Topaloglu Operations Research 67 (5), 1283-1299, 2019 | 50 | 2019 |
| Budgeted prize-collecting traveling salesman and minimum spanning tree problems A Paul, D Freund, A Ferber, DB Shmoys, DP Williamson Mathematics of Operations Research 45 (2), 576-590, 2020 | 40 | 2020 |
| Assortment optimization and pricing under a nonparametric tree choice model A Paul, J Feldman, JM Davis Manufacturing & Service Operations Management 20 (3), 550-565, 2018 | 36 | 2018 |
| Data-driven rebalancing methods for bike-share systems D Freund, A Norouzi-Fard, A Paul, C Wang, SG Henderson, DB Shmoys Analytics for the sharing economy: Mathematics, engineering and business …, 2020 | 28 | 2020 |
| Prize-collecting TSP with a budget constraint A Paul, D Freund, A Ferber, DB Shmoys, DP Williamson 25th Annual European Symposium on Algorithms (ESA 2017), 2017 | 22 | 2017 |
| A framework for vehicle routing approximation schemes in trees A Becker, A Paul Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019 | 16 | 2019 |
| Relating the approximability of the fixed cost and space constrained assortment problems J Feldman, A Paul Production and Operations Management 28 (5), 1238-1255, 2019 | 13 | 2019 |
| Technical note—Assortment optimization with small consideration sets J Feldman, A Paul, H Topaloglu Oper. Res 67 (5), 1283-1299, 2019 | 11 | 2019 |
| Assortment optimization for choosy customers A Paul, H Topaloglu, J Feldman URL https://api. semanticscholar. org/CorpusID 198922854, 2016 | 11 | 2016 |
| Erratum to “budgeted prize-collecting traveling salesman and minimum spanning tree problems” A Paul, D Freund, A Ferber, DB Shmoys, DP Williamson Mathematics of Operations Research 48 (4), 2304-2307, 2023 | 6 | 2023 |
| A census of vertices by generations in regular tessellations of the plane A Paul, N Pippenger arXiv preprint arXiv:1006.4356, 2010 | 6 | 2010 |
| A PTAS for minimum makespan vehicle routing in trees A Becker, A Paul arXiv preprint arXiv:1807.04308, 2018 | 4 | 2018 |
| Simple approximation algorithms for balanced MAX 2SAT A Paul, M Poloczek, DP Williamson Algorithmica 80 (3), 995-1012, 2018 | 3 | 2018 |
| Detecting covert members of terrorist networks A Paul | 3 | 2012 |
| Clustering with semidefinite programming and fixed point iteration P Felzenszwalb, C Klivans, A Paul Journal of Machine Learning Research 23 (190), 1-23, 2022 | 2 | 2022 |
| Estimating Censored Spatial-Temporal Demand with Applications to Shared Micromobility A Paul, K Flynn, C Overney arXiv preprint arXiv:2303.09971, 2023 | 1 | 2023 |
| Iterated linear optimization P Felzenszwalb, C Klivans, A Paul arXiv preprint arXiv:2012.02213, 2020 | 1 | 2020 |
| Easy capacitated facility location problems, with connections to lot-sizing A Paul, DP Williamson Operations Research Letters 48 (2), 109-114, 2020 | 1 | 2020 |
| The all-pairs vitality-maximization (VIMAX) problem A Paul, SE Martonosi Annals of Operations Research, 1-30, 2024 | | 2024 |
| " Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems"(vol 45, pg 576, 2020) A Paul, D Freund, A Ferber, DB Shmoys, DP Williamson MATHEMATICS OF OPERATIONS RESEARCH 48 (4), 2304-2307, 2023 | | 2023 |
