default search action
Syamantak Das
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c18]Syamantak Das, Nikhil Kumar, Daniel Vaz:
Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs. MFCS 2024: 45:1-45:17 - [c17]Mohit Jain
, Anis Mishra
A Deadline-Aware Scheduler for Smart Factory using WiFi 6. MobiHoc 2024: 221-230 - [i11]Syamantak Das, Nikhil Kumar, Daniel Vaz:
Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs. CoRR abs/2407.09433 (2024) - [i10]Mohit Jain, Anis Mishra, Syamantak Das, Andreas Wiese, Arani Bhattacharya, Mukulika Maity:
A Deadline-Aware Scheduler for Smart Factory using WiFi 6. CoRR abs/2408.12274 (2024) - 2023
- [j5]Kelin Luo
A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem. Proc. VLDB Endow. 16(5): 1195-1207 (2023) - [c16]Daman Deep Singh
FairAssign: Stochastically Fair Driver Assignment in Gig Delivery Platforms. FAccT 2023: 753-763 - [c15]Jatin Batra, Syamantak Das, Agastya Vibhuti Jha:
Tight Approximation Algorithms for Ordered Covering. WADS 2023: 120-135 - [i9]Diptarka Chakraborty, Syamantak Das, Arindam Khan, Aditya Subramanian:
Fair Rank Aggregation. CoRR abs/2308.10499 (2023) - 2022
- [j4]Surajit Kundu
Design and Development of a Medical Image Databank for Assisting Studies in Radiomics. J. Digit. Imaging 35(3): 408-423 (2022) - [c14]Syamantak Das, Andreas Wiese:
A Simpler QPTAS for Scheduling Jobs with Precedence Constraints. ESA 2022: 40:1-40:11 - [c13]Naman Gupta, Syamantak Das, Mukulika Maity:
FairSplit - An efficient near-optimal bandwidth splitting strategy for OFDMA in IEEE 802.11ax. ICC 2022: 285-290 - [c12]Diptarka Chakraborty, Syamantak Das, Arindam Khan, Aditya Subramanian:
Fair Rank Aggregation. NeurIPS 2022 - [c11]Kelin Luo, Chaitanya Agarwal, Syamantak Das, Xiangyu Guo:
The Multi-vehicle Ride-Sharing Problem. WSDM 2022: 628-637 - [c10]Suman K. Bera, Syamantak Das, Sainyam Galhotra, Sagar Sudhir Kale
Fair k-Center Clustering in MapReduce and Streaming Settings. WWW 2022: 1414-1422 - [i8]Kelin Luo, Alexandre M. Florio, Syamantak Das, Xiangyu Guo:
A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem. CoRR abs/2210.05000 (2022) - 2021
- [j3]Surajit Kundu
Research Goal-Driven Data Model and Harmonization for De-Identifying Patient Data in Radiomics. J. Digit. Imaging 34(4): 986-1004 (2021) - [c9]Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz:
Vertex Sparsification for Edge Connectivity. SODA 2021: 1206-1225 - 2020
- [c8]Syamantak Das, Lavina Jain, Nikhil Kumar:
A Constant Factor Approximation for Capacitated Min-Max Tree Cover. APPROX-RANDOM 2020: 55:1-55:13 - [c7]Avik Dutta
MMRU-ALLOC: An Optimal Resource Allocation Framework for OFDMA in IEEE 802.11ax. PIMRC 2020: 1-6 - [i7]Nihesh Anderson, Suman K. Bera, Syamantak Das, Yang Liu:
Distributional Individual Fairness in Clustering. CoRR abs/2006.12589 (2020) - [i6]Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz:
Vertex Sparsification for Edge Connectivity. CoRR abs/2007.07862 (2020)
2010 – 2019
- 2019
- [i5]Syamantak Das, Lavina Jain, Nikhil Kumar:
A Constant Factor Approximation for Capacitated Min-Max Tree Cover. CoRR abs/1907.08304 (2019) - [i4]Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz:
Mimicking Networks Parameterized by Connectivity. CoRR abs/1910.10665 (2019) - 2018
- [j2]Anamitra Roy Choudhury, Syamantak Das, Naveen Garg
Rejecting jobs to minimize load and maximum flow-time. J. Comput. Syst. Sci. 91: 42-68 (2018) - [c6]Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. APPROX-RANDOM 2018: 8:1-8:19 - [i3]Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz:
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. CoRR abs/1802.10403 (2018) - 2017
- [c5]Syamantak Das, Andreas Wiese:
On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine. ESA 2017: 31:1-31:14 - [c4]Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. SODA 2017: 737-751 - 2016
- [j1]Suman Kalyan Bera, Syamantak Das, Amit Kumar
Minimizing average flow-time under knapsack constraint. Theor. Comput. Sci. 609: 516-525 (2016) - 2015
- [c3]Anamitra Roy Choudhury, Syamantak Das, Amit Kumar
Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model. FSTTCS 2015: 25-37 - [c2]Anamitra Roy Choudhury, Syamantak Das, Naveen Garg
Rejecting jobs to Minimize Load and Maximum Flow-time. SODA 2015: 1114-1133 - 2014
- [c1]Suman Kalyan Bera, Syamantak Das, Amit Kumar
Minimizing Average Flow-Time under Knapsack Constraint. COCOON 2014: 584-595 - [i2]Anamitra Roy Choudhury, Syamantak Das, Naveen Garg, Amit Kumar:
Rejecting Jobs to Minimize Load and Maximum Flow-time. CoRR abs/1410.1839 (2014) - 2013
- [i1]Suman Kalyan Bera, Anamitra R. Choudhury, Syamantak Das, Sambuddha Roy, Jayram S. Thatchachar:
Fenchel Duals for Drifting Adversaries. CoRR abs/1309.5904 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-08 01:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: