• Fast Algorithms for Max Cut on Geometric Intersection Graphs 

      Joshi, Utkarsh
      In this work, we design fast algorithms for max cut on geometric intersection graphs. In the maximum cut (a.k.a., max cut) problem, the input is an undirected graph, and the goal is to partition the vertex set into two ...
    • Multi-Armed Bandits – On Range Searching and On Slowly-varying Non-stationarity 

      Ramakrishnan, K
      Multi-Armed Bandits (MAB) is a popular framework for modelling sequential decision-making problems under uncertainty. This thesis is a compilation of two independent works on MABs. 1. In the first work, we study a ...
    • Top-k Spatial Aware Ads 

      Savla, Virti
      Consider an app on a smartphone which displays local business ads. When a user opens the app, then k local business ads need to displayed (where k would typically be 3 or 5) such that the profit made by the app is ...