Sayan Bandyapadhyay

Available identifiers

zbMath Open bandyapadhyay.sayanMaRDI QIDQ476869

List of research outcomes

Publication	Date of Publication	Type
Euclidean bottleneck Steiner tree is fixed-parameter tractable	2024-11-28	Paper
Minimum-membership geometric set cover, revisited	2024-10-16	Paper
Coresets for clustering in geometric intersection graphs	2024-10-16	Paper
FPT constant-approximations for capacitated clustering to minimize the sum of cluster radii	2024-10-16	Paper
Parameterized approximation algorithms and lower bounds for \(k\)-center clustering and variants	2024-08-13	Paper
Subexponential parameterized algorithms for cut and cycle hitting problems on \(H\)-minor-free graphs	2024-07-19	Paper
True contraction decomposition and almost ETH-tight bipartization for unit-disk graphs	2024-05-14	Paper
Proportionally Fair Matching with Multiple Groups	2024-05-03	Paper
On coresets for fair clustering in metric and Euclidean spaces and their applications	2024-03-11	Paper
Socially fair matching: exact and approximation algorithms	2024-01-16	Paper
A parameterized approximation scheme for generalized partial vertex cover	2024-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q6147551	2024-01-15	Paper
On colorful vertex and edge cover problems	2023-12-13	Paper
https://portal.mardi4nfdi.de/entity/Q6062155	2023-10-31	Paper
How to find a good explanation for clustering?	2023-08-28	Paper
Lossy kernelization of same-size clustering	2023-08-17	Paper
Parameterized Complexity of Feature Selection for Categorical Data Clustering.	2023-08-08	Paper
Improved bounds for metric capacitated covering problems	2023-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q5874473	2023-02-07	Paper
Lossy kernelization of same-size clustering	2022-11-11	Paper
On fair covering and hitting problems	2022-06-08	Paper
https://portal.mardi4nfdi.de/entity/Q5075746	2022-05-11	Paper
On perturbation resilience of non-uniform \(k\)-center	2022-02-01	Paper
Near-optimal clustering in the \(k\)-machine model	2021-12-22	Paper
Geometric planar networks on bichromatic collinear points	2021-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q5009492	2021-08-04	Paper
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames	2021-08-04	Paper
Improved approximation bounds for the minimum constraint removal problem	2020-10-23	Paper
Capacitated Covering Problems in Geometric Spaces	2020-08-18	Paper
Geometric planar networks on bichromatic points	2020-07-21	Paper
Capacitated covering problems in geometric spaces	2020-06-16	Paper
Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames	2019-10-25	Paper
Approximate Clustering via Metric Partitioning	2018-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q3132847	2018-01-30	Paper
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation	2017-10-05	Paper
Effectiveness of local search for art gallery problems	2017-09-22	Paper
Polynomial Time Algorithms for Bichromatic Problems	2017-04-07	Paper
On the Approximability of Orthogonal Order Preserving Layout Adjustment	2015-10-30	Paper
Voronoi game on graphs	2014-12-02	Paper
Voronoi Game on Graphs	2013-04-12	Paper

Research outcomes over time

This page was built for person: Sayan Bandyapadhyay