Embedded Files
ReceNT NEws
ReceNT NEws
New paper "Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering" accepted at ESA 2025
New paper "Improved FPT Approximation for Sum of Radii Clustering with Mergeable Constraints" accepted at APPROX 2025
New paper "Approximation and Parameterized Algorithms for Covering with Disks of Two Types of Radii" accepted at WADS
New paper "A Constant-Factor Approximation for Pairwise Fair k-Center Clustering" accepted at IPCO 2025
New paper "PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods" accepted at SODA 2025
Dr. Sayan Bandyapadhyay joined the Dept. of Computer Science at Portland State University as an Assistant Professor in Fall 2022. He was a postdoctoral researcher in the Algorithms Research Group at the University of Bergen, Norway, where he worked with Prof. Fedor Fomin, Prof. Saket Saurabh, and Prof. Petr Golovach. His current research interests are mainly in Algorithms: Algorithmic fairness, Approximation Algorithms, Parameterized Algorithms, Exact (exponential time) Algorithms, Computational Geometry, Discrete Geometry, Graph Algorithms, and Optimization. Prior to moving to Norway, he finished his PhD from the University of Iowa, where he was supervised by Prof. Kasturi Varadarajan. He has secured his M.Tech (CS) degree from the Indian Statistical Institute, Kolkata. To know more check out his Linkedin, and Blog.
Page updated
Google Sites
Report abuse