Scholar
Sayan Bandyapadhyay
Google Scholar ID: Q4WUsiEAAAAJ
Assistant Professor, Portland State University
Citations & Impact
Citations
451
H-index
12
i10-index
13
Publications
20
Co-authors
35
list available
Contact
Publications
Resume (English only)
Academic Achievements
- Papers published:
- - "Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering" accepted at ESA 2025
- - "Improved FPT Approximation for Sum of Radii Clustering with Mergeable Constraints" accepted at APPROX 2025
- - "Approximation and Parameterized Algorithms for Covering with Disks of Two Types of Radii" accepted at WADS
- - "A Constant-Factor Approximation for Pairwise Fair k-Center Clustering" accepted at IPCO 2025
- - "PTASes for Euclidean TSP with Unit Disk and Unit Square Neighborhoods" accepted at SODA 2025
Research Experience
- Joined the Dept. of Computer Science at Portland State University as an Assistant Professor in Fall 2022; 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.
Education
- PhD from the University of Iowa, supervised by Prof. Kasturi Varadarajan; M.Tech (CS) degree from the Indian Statistical Institute, Kolkata.
Background
- 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.
Miscellany
- For more information, check out his LinkedIn and Blog.
