Sayan bandyapadhyay
ReceNT NEws
Paper "True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs " accepted at ACM TALG
New paper "An O(n logn)-Time Approximation Scheme for Geometric Many-to-Many Matching" accepted in SoCG 2024 (Recipient of Best Paper Award)
I am looking for PhD students details can be found here
New paper "Geometric Covering via Extraction Theorem" accepted in ITCS 2024
New paper "Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable" accepted in SODA 2024
New paper in Theory of Computing Systems Journal link
New paper in Artificial Intelligence Journal link
I will be serving as a PC member at SoCG and CALDAM 2024
We are honored to receive a generous grant from NSF for the project New Challenges and Approaches in Clustering Algorithms
We are organizing two workshops Recent Developments in Geometric Clustering and Parameterized Algorithms for Geometric Problems at CG Week 2023
Dr. Sayan Bandyapadhyay has 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.