<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Sayan Bandyapadhyay | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/sayan-bandyapadhyay/</link><atom:link href="https://ac.tuwien.ac.at/team/sayan-bandyapadhyay/index.xml" rel="self" type="application/rss+xml"/><description>Sayan Bandyapadhyay</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sat, 01 Jan 2022 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Sayan Bandyapadhyay</title><link>https://ac.tuwien.ac.at/team/sayan-bandyapadhyay/</link></image><item><title>FPT Approximation for Fair Minimum-Load Clustering</title><link>https://ac.tuwien.ac.at/publication/fpt-approximation-for-fair-minimum-load-clustering/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/fpt-approximation-for-fair-minimum-load-clustering/</guid><description/></item><item><title>How to Find a Good Explanation for Clustering?</title><link>https://ac.tuwien.ac.at/publication/how-to-find-a-good-explanation-for-clustering/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/how-to-find-a-good-explanation-for-clustering/</guid><description/></item><item><title>Lossy Kernelization of Same-Size Clustering</title><link>https://ac.tuwien.ac.at/publication/lossy-kernelization-of-same-size-clustering/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/lossy-kernelization-of-same-size-clustering/</guid><description/></item><item><title>Geometric Planar Networks on Bichromatic Collinear Points</title><link>https://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-collinear-points/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-collinear-points/</guid><description/></item><item><title>On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications</title><link>https://ac.tuwien.ac.at/publication/on-coresets-for-fair-clustering-in-metric-and-euclidean-spaces-and-their-applications/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/on-coresets-for-fair-clustering-in-metric-and-euclidean-spaces-and-their-applications/</guid><description/></item><item><title>Parameterized Complexity of Feature Selection for Categorical Data Clustering</title><link>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-feature-selection-for-categorical-data-clustering/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/parameterized-complexity-of-feature-selection-for-categorical-data-clustering/</guid><description/></item><item><title>Geometric Planar Networks on Bichromatic Points</title><link>https://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-points/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/geometric-planar-networks-on-bichromatic-points/</guid><description/></item></channel></rss>