Sayan bandyapadhyay
ReceNT NEws
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
New paper "Extraction Theorems With Small Extraction Numbers" accepted at FWCG 2024
Paper "Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants" accepted in Algorithmica
Paper "True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs " accepted in ACM TALG
New paper "An O(n logn)-Time Approximation Scheme for Geometric Many-to-Many Matching" accepted at SoCG 2024 (Recipient of Best Paper Award)
I am looking for PhD students details can be found here
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.