default search action
Sayan Bandyapadhyay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi:
Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants. Algorithmica 86(8): 2557-2574 (2024) - [j14]Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
:
On coresets for fair clustering in metric and Euclidean spaces and their applications. J. Comput. Syst. Sci. 142: 103506 (2024) - [j13]Sayan Bandyapadhyay
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. ACM Trans. Algorithms 20(3): 20 (2024) - [c35]Sayan Bandyapadhyay, Jie Xue:
An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching. SoCG 2024: 12:1-12:15 - [c34]Sayan Bandyapadhyay, Anil Maheshwari, Sasanka Roy, Michiel Smid, Kasturi R. Varadarajan:
Geometric Covering via Extraction Theorem. ITCS 2024: 7:1-7:20 - [c33]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. SODA 2024: 699-711 - [i31]Sayan Bandyapadhyay, Jie Xue:
An O(n log n)-Time Approximation Scheme for Geometric Many-to-Many Matching. CoRR abs/2402.15837 (2024) - [i30]Sayan Bandyapadhyay, Eden Chlamtác, Yury Makarychev, Ali Vakilian:
A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering. CoRR abs/2405.10378 (2024) - 2023
- [j12]Sayan Bandyapadhyay, Fedor V. Fomin
How to find a good explanation for clustering? Artif. Intell. 322: 103948 (2023) - [j11]Sayan Bandyapadhyay
Improved Bounds for Metric Capacitated Covering Problems. Algorithmica 85(7): 1825-1849 (2023) - [j10]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore:
On Colorful Vertex and Edge Cover Problems. Algorithmica 85(12): 3816-3827 (2023) - [j9]Sayan Bandyapadhyay, Fedor V. Fomin
Lossy Kernelization of Same-Size Clustering. Theory Comput. Syst. 67(4): 785-824 (2023) - [j8]Sayan Bandyapadhyay
Parameterized Complexity of Feature Selection for Categorical Data Clustering. ACM Trans. Comput. Theory 15(3-4): 7:1-7:24 (2023) - [c32]Sayan Bandyapadhyay, Fedor V. Fomin
Coresets for Clustering in Geometric Intersection Graphs. SoCG 2023: 10:1-10:16 - [c31]Sayan Bandyapadhyay, William Lochet
Minimum-Membership Geometric Set Cover, Revisited. SoCG 2023: 11:1-11:14 - [c30]Sayan Bandyapadhyay, William Lochet
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. SoCG 2023: 12:1-12:14 - [c29]Sayan Bandyapadhyay
Socially Fair Matching: Exact and Approximation Algorithms. WADS 2023: 79-92 - [c28]Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi:
A Parameterized Approximation Scheme for Generalized Partial Vertex Cover. WADS 2023: 93-105 - [c27]Sayan Bandyapadhyay
Proportionally Fair Matching with Multiple Groups. WG 2023: 1-15 - [i29]Sayan Bandyapadhyay, Fedor V. Fomin
Proportionally Fair Matching with Multiple Groups. CoRR abs/2301.03862 (2023) - [i28]Sayan Bandyapadhyay, Fedor V. Fomin
Coresets for Clustering in Geometric Intersection Graphs. CoRR abs/2303.01400 (2023) - [i27]Sayan Bandyapadhyay, William Lochet, Saket Saurabh:
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. CoRR abs/2303.07923 (2023) - [i26]Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue:
Minimum-Membership Geometric Set Cover, Revisited. CoRR abs/2305.03985 (2023) - [i25]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore:
On Colorful Vertex and Edge Cover Problems. CoRR abs/2308.15842 (2023) - [i24]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable. CoRR abs/2312.01589 (2023) - 2022
- [j7]Sayan Bandyapadhyay
On Perturbation Resilience of Non-uniform k-Center. Algorithmica 84(1): 13-36 (2022) - [j6]Sayan Bandyapadhyay, Tanmay Inamdar
Near-optimal clustering in the k-machine model. Theor. Comput. Sci. 899: 80-97 (2022) - [c26]Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi:
Parameterized Approximation Algorithms for K-center Clustering and Variants. AAAI 2022: 3895-3903 - [c25]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov:
How to Find a Good Explanation for Clustering? AAAI 2022: 3904-3912 - [c24]Sayan Bandyapadhyay, William Lochet
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. SoCG 2022: 11:1-11:16 - [c23]Sayan Bandyapadhyay, Fedor V. Fomin
Lossy Kernelization of Same-Size Clustering. CSR 2022: 96-114 - [c22]Sayan Bandyapadhyay, Fedor V. Fomin
FPT Approximation for Fair Minimum-Load Clustering. IPEC 2022: 4:1-4:14 - [c21]Sayan Bandyapadhyay, William Lochet
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs. SODA 2022: 2063-2084 - 2021
- [j5]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
Geometric planar networks on bichromatic collinear points. Theor. Comput. Sci. 895: 124-136 (2021) - [c20]Sayan Bandyapadhyay, Fedor V. Fomin
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. ICALP 2021: 23:1-23:15 - [c19]Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid:
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. ISAAC 2021: 44:1-44:14 - [c18]Sayan Bandyapadhyay, Fedor V. Fomin
Parameterized Complexity of Feature Selection for Categorical Data Clustering. MFCS 2021: 14:1-14:14 - [c17]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore:
On Fair Covering and Hitting Problems. WG 2021: 39-51 - [i23]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov:
Parameterized Complexity of Feature Selection for Categorical Data Clustering. CoRR abs/2105.03753 (2021) - [i22]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
Lossy Kernelization of Same-Size Clustering. CoRR abs/2107.07383 (2021) - [i21]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
FPT Approximation for Fair Minimum-Load Clustering. CoRR abs/2107.09481 (2021) - [i20]Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid:
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. CoRR abs/2109.07524 (2021) - [i19]Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov, Saket Saurabh, Jie Xue:
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs. CoRR abs/2111.14196 (2021) - [i18]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet
How to Find a Good Explanation for Clustering? CoRR abs/2112.06580 (2021) - [i17]Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi:
Parameterized Approximation Algorithms for k-Center Clustering and Variants. CoRR abs/2112.10195 (2021) - 2020
- [j4]Sayan Bandyapadhyay, Neeraj Kumar
Improved approximation bounds for the minimum constraint removal problem. Comput. Geom. 90: 101650 (2020) - [j3]Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar
Capacitated Covering Problems in Geometric Spaces. Discret. Comput. Geom. 63(4): 768-798 (2020) - [c16]Sayan Bandyapadhyay
On Perturbation Resilience of Non-Uniform k-Center. APPROX-RANDOM 2020: 31:1-31:22 - [c15]Sayan Bandyapadhyay
Geometric Planar Networks on Bichromatic Points. CALDAM 2020: 79-91 - [c14]Sayan Bandyapadhyay
Improved Bounds for Metric Capacitated Covering Problems. ESA 2020: 9:1-9:17 - [i16]Sayan Bandyapadhyay:
On Perturbation Resilience of Non-Uniform k-Center. CoRR abs/2004.12633 (2020) - [i15]Sayan Bandyapadhyay:
Improved Bounds for Metric Capacitated Covering Problems. CoRR abs/2006.12454 (2020) - [i14]Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov:
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. CoRR abs/2007.10137 (2020)
2010 – 2019
- 2019
- [j2]Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
Approximating dominating set on intersection graphs of rectangles and L-frames. Comput. Geom. 82: 32-44 (2019) - [c13]Sayan Bandyapadhyay, Saeed Mehrabi:
Constrained Orthogonal Segment Stabbing. CCCG 2019: 195-202 - [c12]Sayan Bandyapadhyay, Tanmay Inamdar
A Constant Approximation for Colorful k-Center. ESA 2019: 12:1-12:14 - [i13]Sayan Bandyapadhyay, Saeed Mehrabi:
Constrained Orthogonal Segment Stabbing. CoRR abs/1904.13369 (2019) - [i12]Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi R. Varadarajan:
A Constant Approximation for Colorful k-Center. CoRR abs/1907.08906 (2019) - [i11]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg:
Geometric Planar Networks on Bichromatic Points. CoRR abs/1911.08924 (2019) - 2018
- [c11]Sayan Bandyapadhyay, Neeraj Kumar, Subhash Suri, Kasturi R. Varadarajan:
Improved Approximation Bounds for the Minimum Constraint Removal Problem. APPROX-RANDOM 2018: 2:1-2:19 - [c10]Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar
Capacitated Covering Problems in Geometric Spaces. SoCG 2018: 7:1-7:15 - [c9]Sayan Bandyapadhyay, Tanmay Inamdar
Near-Optimal Clustering in the k-machine model. ICDCN 2018: 15:1-15:10 - [c8]Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. MFCS 2018: 37:1-37:15 - [i10]Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, Subhash Suri:
Approximating Dominating Set on Intersection Graphs of L-frames. CoRR abs/1803.06216 (2018) - 2017
- [c7]Sayan Bandyapadhyay, Aritra Banik:
Polynomial Time Algorithms for Bichromatic Problems. CALDAM 2017: 12-23 - [c6]Sayan Bandyapadhyay, Aniket Basu Roy
Effectiveness of Local Search for Art Gallery Problems. WADS 2017: 49-60 - [i9]Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, Kasturi R. Varadarajan:
A Unified Framework for Capacitated Covering Problems in Metric and Geometric Spaces. CoRR abs/1707.05170 (2017) - [i8]Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju:
Near-Optimal Clustering in the k-machine model. CoRR abs/1710.08381 (2017) - 2016
- [c5]Sayan Bandyapadhyay, Kasturi R. Varadarajan:
On Variants of k-means Clustering. SoCG 2016: 14:1-14:15 - [c4]Sayan Bandyapadhyay, Kasturi R. Varadarajan:
Approximate Clustering via Metric Partitioning. ISAAC 2016: 15:1-15:13 - [i7]Sayan Bandyapadhyay, Aritra Banik:
Polynomial Time Algorithms for Bichromatic Problems. CoRR abs/1610.00300 (2016) - 2015
- [j1]Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
Voronoi game on graphs. Theor. Comput. Sci. 562: 270-282 (2015) - [c3]Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan:
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation. SODA 2015: 1457-1470 - [c2]Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan:
On the Approximability of Orthogonal Order Preserving Layout Adjustment. WADS 2015: 54-65 - [i6]Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan:
A Constant Factor Approximation for Orthogonal Order Preserving Layout Adjustment. CoRR abs/1502.03847 (2015) - [i5]Sayan Bandyapadhyay, Kasturi R. Varadarajan:
Approximate Clustering via Metric Partitioning. CoRR abs/1507.02222 (2015) - [i4]Sayan Bandyapadhyay, Kasturi R. Varadarajan:
On Variants of k-means Clustering. CoRR abs/1512.02985 (2015) - 2014
- [i3]Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan:
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation. CoRR abs/1404.3776 (2014) - [i2]Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar:
Voronoi Game on Graphs. CoRR abs/1407.8474 (2014) - [i1]Sayan Bandyapadhyay:
A Variant of the Maximum Weight Independent Set Problem. CoRR abs/1409.0173 (2014) - 2013
- [c1]Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar:
Voronoi Game on Graphs. WALCOM 2013: 77-88
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-10-09 20:30 CEST 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: