Syamantak Das

Orcid: 0000-0002-4393-8678

According to our database1, Syamantak Das authored at least 22 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem.
Proc. VLDB Endow., 2023

Tight Approximation Algorithms for Ordered Covering.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

FairAssign: Stochastically Fair Driver Assignment in Gig Delivery Platforms.
Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, 2023

2022
Design and Development of a Medical Image Databank for Assisting Studies in Radiomics.
J. Digit. Imaging, 2022

Fair k-Center Clustering in MapReduce and Streaming Settings.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

The Multi-vehicle Ride-Sharing Problem.
Proceedings of the WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21, 2022

Fair Rank Aggregation.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

FairSplit - An efficient near-optimal bandwidth splitting strategy for OFDMA in IEEE 802.11ax.
Proceedings of the IEEE International Conference on Communications, 2022

A Simpler QPTAS for Scheduling Jobs with Precedence Constraints.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Research Goal-Driven Data Model and Harmonization for De-Identifying Patient Data in Radiomics.
J. Digit. Imaging, 2021

Vertex Sparsification for Edge Connectivity.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
Distributional Individual Fairness in Clustering.
CoRR, 2020

MMRU-ALLOC: An Optimal Resource Allocation Framework for OFDMA in IEEE 802.11ax.
Proceedings of the 31st IEEE Annual International Symposium on Personal, 2020

A Constant Factor Approximation for Capacitated Min-Max Tree Cover.
Proceedings of the Approximation, 2020

2019
Mimicking Networks Parameterized by Connectivity.
CoRR, 2019

2018
Rejecting jobs to minimize load and maximum flow-time.
J. Comput. Syst. Sci., 2018

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs.
Proceedings of the Approximation, 2018

2017
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
Minimizing average flow-time under knapsack constraint.
Theor. Comput. Sci., 2016

2015
Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2013
Fenchel Duals for Drifting Adversaries.
CoRR, 2013


  Loading...