Talks
Recent Progress in Dynamic Complexity Theory
- (Nov 2023) University of California, Davis, USA
- (Jan 2023) National University of Singapore
- (Jan 2023) Indian Statistical Institute, Kolkata, India
- (Oct 2022) University of Oxford, UK
Subquadratic Dynamic Path Reporting in Directed Graphs against an Adaptive Adversary
- (Mar 2023) Weizmann Institute of Science, Israel
- (Aug 2022) ALGPiE 2022, Będlewo Palace, Poland
- (Jun 2022) STOC 2022, Rome, Italy
Dynamic Meta-theorems for Distance and Matching
- (Jul 2022) ICALP 2022, Paris, France
Planar Maximum Matching: Towards a Parallel Algorithm
- (Dec 2018) ISAAC 2018, Jiaoxi, Taiwan
Shortest Disjoint Paths via Determinants
- (Oct 2019) Charles University, Prague, Czech Republic
- (Dec 2018) FSTTCS 2018, Ahmedabad, India
- (Jul 2018) 33rd TCS Mini Workshop, TU Dortmund, Germany
Solving Connectivity Problems via Basic Linear Algebra
- (Oct 2019) Institute of Mathematics at CAS, Prague, Czech Republic
- (May 2019) University of Warsaw, Poland
- (Aug 2018) TU Eindhoven, The Netherlands
- (Mar 2018) SIGTACS, IIT Kanpur, India
Space-efficient Approximation Scheme for Maximum Matching in Sparse Graphs
- (Nov 2016) NMI Workshop on Complexity Theory, IIT Gandhinagar, India
- (Aug 2016) MFCS 2016, Krakow, Poland
- (Jun 2016) 29th TCS Mini Workshop, TU Dortmund, Germany
Reachability is in DynFO
- (Jul 2015) ICALP 2015, Kyoto, Japan
Dynamic Complexity of Reachability and Related Problems
- (May 2016) Chebyshev Laboratory, St. Petersburg State University, Russia
- (Sep 2015) Circuits, Logic and Games 2015, Schloss Dagstuhl, Germany
- (Jul 2015) Centre for Exploring Limits of Computation, Tokyo Institute of Technology, Japan
Approximating Traveling Salesman Problem: A Geometric Approach
- (Apr 2015) Ph.D. Seminar, Chennai Mathematical Institute.
A Survey on the Exact Exponential-Time Complexity of SAT
- (Jul 2014) The Institute of Mathematical Sciences, Chennai.