| On minimizing the makespan when some jobs cannot be assigned on the same machine S Das, A Wiese 25th Annual European Symposium on Algorithms (ESA 2017), 2017 | 23 | 2017 |
| Vertex sparsification for edge connectivity P Chalermsook, S Das, Y Kook, B Laekhanukit, YP Liu, R Peng, M Sellke, ... Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 16* | 2021 |
| Rejecting jobs to minimize load and maximum flow-time AR Choudhury, S Das, N Garg, A Kumar Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014 | 16 | 2014 |
| Distributional individual fairness in clustering N Anderson, SK Bera, S Das, Y Liu arXiv preprint arXiv:2006.12589, 2020 | 13 | 2020 |
| Survivable network design for group connectivity in low-treewidth graphs P Chalermsook, S Das, G Even, B Laekhanukit, D Vaz arXiv preprint arXiv:1802.10403, 2018 | 10 | 2018 |
| Beyond metric embedding: Approximating group steiner trees on bounded treewidth graphs P Chalermsook, S Das, B Laekhanukit, D Vaz Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 9 | 2017 |
| Minimizing weighted lp-norm of flow-time in the rejection model A Roy Choudhury, S Das, A Kumar 35th IARCS Annual Conference on Foundations of Software Technology and …, 2015 | 6 | 2015 |
| MMRU-ALLOC: An optimal resource allocation framework for OFDMA in IEEE 802.11 ax A Dutta, N Gupta, S Das, M Maity 2020 IEEE 31st Annual International Symposium on Personal, Indoor and Mobile …, 2020 | 4 | 2020 |
| Rejecting jobs to minimize load and maximum flow-time AR Choudhury, S Das, N Garg, A Kumar Journal of Computer and System Sciences 91, 42-68, 2018 | 4 | 2018 |
| A constant factor approximation for capacitated min-max tree cover S Das, L Jain, N Kumar arXiv preprint arXiv:1907.08304, 2019 | 3 | 2019 |
| The multi-vehicle ride-sharing problem K Luo, C Agarwal, S Das, X Guo Proceedings of the Fifteenth ACM International Conference on Web Search and …, 2022 | 2 | 2022 |
| A constant factor approximation for capacitated min-max tree cover S Das, L Jain, N Kumar Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020 | 2 | 2020 |
| Fair k-Center Clustering in MapReduce and Streaming Settings SK Bera, S Das, S Galhotra, SS Kale Proceedings of the ACM Web Conference 2022, 1414-1422, 2022 | 1 | 2022 |
| A Simpler QPTAS for Scheduling Jobs with Precedence Constraints S Das, A Wiese 30th Annual European Symposium on Algorithms (ESA 2022), 2022 | 1 | 2022 |
| Mimicking networks parameterized by connectivity P Chalermsook, S Das, B Laekhanukit, D Vaz arXiv preprint arXiv:1910.10665, 2019 | 1 | 2019 |
| Check for updates Tight Approximation Algorithms for Ordered Covering J Batra¹, S Das, AV Jha Algorithms and Data Structures: 18th International Symposium, WADS 2023 …, 2023 | | 2023 |
| Tight Approximation Algorithms for Ordered Covering J Batra, S Das, AV Jha Algorithms and Data Structures Symposium, 120-135, 2023 | | 2023 |
| FairAssign: Stochastically Fair Driver Assignment in Gig Delivery Platforms DD Singh, S Das, A Chakraborty Proceedings of the 2023 ACM Conference on Fairness, Accountability, and …, 2023 | | 2023 |
| Fair Rank Aggregation D Chakraborty, S Das, A Khan, A Subramanian Advances in Neural Information Processing Systems 35, 23965-23978, 2022 | | 2022 |
| A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem K Luo, AM Florio, S Das, X Guo arXiv preprint arXiv:2210.05000, 2022 | | 2022 |
Parinya ChalermsookAalto UniversityVerified email at aalto.fi
