Syamantak Das

MaRDI QIDQ825890zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A study on the \(\mathscr{F}\)-simultaneous approximative \(\tau\)-compactness property in Banach spaces Functional Analysis and its Applications	2026-05-20	Paper
Nearly-tight bounds for flow sparsifiers in quasi-bipartite graphs	2026-05-12	Paper
A study on various generalizations of generalized centers <b> ( <i>GC</i> ) </b> in Banach spaces Optimization	2026-02-10	Paper
WITHDRAWN: On best constrained and best simultaneous approximation in Banach spaces (available as arXiv preprint)	2026-01-01	Paper
A simpler QPTAS for scheduling jobs with precedence constraints	2025-06-19	Paper
A study on $\mr{F}$-simultaneous approximative $\tau$-compactness property in Banach spaces (available as arXiv preprint)	2025-01-01	Paper
Tight approximation algorithms for ordered covering Lecture Notes in Computer Science	2024-01-16	Paper
A study on various generalizations of Generalized centers $\bm{(GC)}$ in Banach spaces	2023-11-27	Paper
scientific article; zbMATH DE number 7758357 (Why is no real title available?) (available as arXiv preprint)	2023-10-31	Paper
On property-$\bm{(R_1)}$ and relative Chebyshev centers in Banach spaces-II	2022-07-19	Paper
On cyclic codes with minimal generating sets over the ring \(\mathbb{Z}_{p^k}\) Southeast Asian Bulletin of Mathematics	2021-12-17	Paper
Survivable network design for group connectivity in low-treewidth graphs (available as arXiv preprint)	2021-08-04	Paper
On minimizing the makespan when some jobs cannot be assigned on the same machine	2020-05-27	Paper
Beyond metric embedding: approximating group Steiner trees on bounded treewidth graphs Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
Rejecting jobs to minimize load and maximum flow-time Journal of Computer and System Sciences	2017-10-11	Paper
Rejecting jobs to Minimize Load and Maximum Flow-time Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms	2017-10-05	Paper
Minimizing weighted _p-norm of flow-time in the rejection model	2017-07-13	Paper
Minimizing average flow-time under knapsack constraint Theoretical Computer Science	2015-12-11	Paper
Minimizing average flow-time under knapsack constraint Lecture Notes in Computer Science	2014-09-26	Paper

Research outcomes over time

This page was built for person: Syamantak Das