Time is both finite and invaluable, making its efficient use essential in today\u2019s world; a theme nicely illustrated in the book Algorithms to Live By. Sanjana\u2019s research embraces this philosophy: she focuses on developing optimal and approximate algorithms that solve classical computational problems efficiently, often in polynomial time. During her PhD, she worked on problems in graph theory and computational geometry. The geometric problems were motivated by sensor placement: monitoring large or inaccessible regions becomes challenging when the terrain is complex. This leads to questions about how to position a minimum number of sensors to achieve optimal coverage. She showed that even seemingly simple regions, such as unit squares, pose computational difficulties when it comes to optimal monitoring, and she designed several approximation algorithms for such geometric settings. She also studied nearest-neighbor problems on colored graphs, devising efficient polynomial-time algorithms for various graph classes.
\nIn her postdoctoral work at NUS, she turned to problems inspired by recommendation systems. She proved that, for binary matrices under Hamming distance, certain optimization problems are inapproximable within a factor of 2. She also worked on distance measures between strings, commonly known as edit distance or indel distance, which are widely used in DNA sequencing and related applications. She has also worked on problems involving rank aggregation which stems from the domain of candidate selection. She has studied the problem from the lens of fairness and provided approximation algorithms for the same. As a postdoctoral researcher in Micka\u00ebl Randour\u2019s group at UMONS, she aims to apply her algorithmic expertise to formal methods and verification, particularly reactive synthesis, which is closely linked to games on graphs. Her strong background in graph algorithms offers a fresh perspective, especially for single-objective and multi-objective quantitative games that model real-world trade-offs. Many such objectives lead to high computational complexity, making efficient (possibly approximate) algorithms indispensable. She is currently collaborating with a team member on representing games with memory using decision trees and is also investigating lower bounds for several qualitative and quantitative objectives in graph-based games.<\/p>\n","protected":false},"excerpt":{"rendered":"
Sanjana Dey received her doctorate from the Indian Statistical Institute in Kolkata in 2022. Before joining UMONS as a postdoctoral researcher in 2024, she worked as a postdoctoral fellow at the National University of Singapore from 2022 to 2024. Her background lies primarily in designing exact and approximation algorithms for a wide range of problems in graphs, geometry, and strings.<\/p>\n","protected":false},"author":16,"featured_media":563,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[54,42],"tags":[],"class_list":["post-559","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-prix-bourses-et-distinctions","category-recherche"],"yoast_head":"\n