Talks @ Seminars, Schools, and Conferences (selected)

• Sparsification and Uncertainty: Through Geometric Lens, University of Vienna, 2024. 

• Sparsification and Uncertainty: Through Geometric Lens, TU Wien, Austria, 2024. 

• Sparsification and Uncertainty: Through Geometric Lens, CMI, India, 2024. 

• Online duet between Metric Embeddings & Minimum Weight Perfect Matchings,  

ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024.  

• Geometry and Graphs: A Tale of two worlds, Tufts University, USA, 2023.  

• Geometric Sparsification: The Holy Grail!, CSE Dept., IIT Kharagpur, 2023. 

• Geometric Sparsification: The Holy Grail!, Maths Dept., IIT Delhi, 2023. 

• Euclidean Steiner Spanners: Light and Sparse, Recent Trends in Algorithms, 2023.  

• Geometric Sparsification: The Holy Grail!, IISER Bhopal DSE Colloquium, 2023. 

• Extending Orthogonal Planar Graph Drawings, 

Symposium on Computational Geometry (SoCG), 2023.

• Algorithms and Complexity: Song of Ice and Fire, CSE Research Symposium, IIT Bombay, 2023.  

• Computing: Structures; Combinations; Algorithms..., IIT Bombay, 2023.  

• Geometry and Graphs: A Tale of two worlds, Jadavpur University & IEEE CS Kolkata Section, 2023.  

• Geometry and Graphs: A tale of two worlds, London School of Economics, UK, 2022.  

• Online Spanners in Metric Spaces, European Symposium on Algorithms (ESA), 2022.

• Geometry and Graphs: A tale of two worlds, IMSc, India, 2022.  

• Graphs and Geometry, IISER Bhopal Mathematics Colloquium, 2022. 

• Online Euclidean Spanners, European Symposium on Algorithms (ESA), 2021. 

• Light Euclidean Steiner Spanners in the Plane, Symposium on Computational Geometry (SoCG), 2021. 

• On the Upward Book Thickness Problem: Combinatorial and Complexity Results,  

Symposium on Graph Drawing and Network Visualization (GD), 2021. 

• On Fair Covering and Hitting Problems, 

International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2021. 

• Space-Efficient Algorithms for Reachability in Geometric Graphs, International Symposium on Algorithms and Computation (ISAAC), 2021. 

• On Euclidean Steiner (1+ε)-Spanners, 

Symposium on Theoretical Aspects of Computer Science (STACS), 2021.

• Planar Bichromatic Bottleneck Spanning Tree, European Symposium on Algorithms (ESA), 2020.

• Parameterized Algorithms for Queue Layouts, 

Symposium on Graph Drawing and Network Visualization (GD), 2020. 

• Parameterized Study of Steiner Tree on Unit Disk Graphs, Scandinavian Symposium & Workshop on Algorithm Theory (SWAT), 2020, & ULB Algorithms Seminar, & IMSc Algorithms Seminar.  

• Parameterized Algorithms for Book Embedding Problems, 

Symposium on Graph Drawing and Network Visualization (GD), 2019.  

• Algorithms and Hardness Results for Variants of Dominating Set, 

International Workshop on Combinatorial Algorithms (IWOCA), 2019. 

• Geometric System of Unbiased Representatives, 

Canadian Conference on Computational Geometry (CCCG), 2019.  

• Balanced Covering Problems in Bicolored Point Sets,  

European Workshop on Computational Geometry (EuroCG), 2019. 

• An Algorithmic Study of Geometric Optimization Problems, 

Departmental Colloquium, Ben-Gurion University, 2018. 

• Erdős–Szekeres type problems for k-convex point sets, CG meet, Stony-Brook University, USA, 2018.  

• Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets, Latin American Theoretical Informatics Symposium (LATIN), 2018.

• Monochromatic Plane Matchings in Bicolored Point Sets, 

Canadian Conference on Computational Geometry (CCCG), 2017. 

• Bottleneck Bichromatic Full Steiner Trees, 

European Workshop on Computational Geometry (EuroCG), 2017. 

• Monochromatic matching in Bicolored point set, 

Ben-Gurion University Algorithms Seminar, Israel, 2016. 

• On a Special Class of Boxicity 2 Graphs, Haifa Workshop on Interdisciplinary Applications of Graphs, Combinatorics and Algorithms, 2015.