• 2023 DSA1 | Week 4

  • CCL Workshop

  • 2023 DSA1 | Week 3

  • 2023 DSA1 | Week 2

    Data Structures: Just some Structured Data

  • 2023 DSA1 | Week 1

    Data Structures: Just some Structured Data

  • Aarohan - Winter 2022

  • DAIICT Session

  • A Few Algorithmic Puzzles (and why you should care)

  • Games we Play: FDP at LD College

  • DSA 1 | Week 12

  • DSA1 | Week 9

  • Prof Moona Welcome Event at IITGN

  • DSA1 | Week 8

  • VV TIFR

  • Fair Division

  • DSA1 | Week 7

  • AWoCE

  • DSA1 | Week 6

  • DSA1 | Week 5

  • DSA1 | Week 4

  • DSA1 | Week 3

  • DSA1 | Week 1

    Data Structures: Just some Structured Data

  • VV TIFR

  • Gujcost Coding Bootcamp

  • From Puzzles to Problems - Fun with STEM

  • CS Research 101: Part 5

  • CS Research 101: Part 4

  • CS Research 101: Part 3

  • CS Research 101: Part 2

  • CS Research 101: Part 1

  • Puzzles with Python

  • Solo Chess

    Presentation made for Fun with Algorithms (2022), based on the paper "Chess is Hard even for a Single Player".

  • Algorithmic Aspects of Firefighting with Critical Nodes

    This talk was based on joint work with Jayesh Choudhari, Anirban Dasgupta and M. S. Ramanujan. The talk was a part of the CSA50 Pratiksha Trust Workshop on Theoretical Computer Science organized by the department of Computer Science and Automation (CSA) at IISc as a part of a series of events held in 2019 to mark the golden jubilee year for the department. The talk itself was a survey of algorithmic results in the context of the firefighting game. View the videos from the rest of the workshop here.

  • EKR for Matchings

  • KRA Hardness

  • Parameterized KRA

  • On Fair Division with Binary Valuations Respecting Social Networks

  • Efficient Algorithms for Hard Problems on Structured Electorates

  • Elicitation for preferences single peaked on trees

  • Parameterized graph modification a modern perspective

  • History of Algorithms

  • Efficient Simplification: The (im)possibilities

  • An FPT Algorithm for Maximum Edge Coloring

  • On The Parameterized Complexity of Party Nominations

  • Deleting to Structured Trees

  • Masters Thesis: On the Infeasibility of Polynomial Kernelization

  • Aarohan

  • Communication Complexity of Equality