Talks
Every talk I have given, where I gave it, and its slides when they are online.
Kind
More filters
When
Refine
Nothing matches these filters.
- Q Tools and Technology for Teaching Teaching tools from time-saving workflows to generative AI, matched to what learners need Q
- 10 Being a Successful Grad Student Ten balancing acts of grad school, from breadth versus depth to perfect versus good enough 10
- 6 Linear Algebra Methods in Combinatorics Turn sets into vectors, and dimension arguments settle hard counting puzzles 6
- 5 The Games We Play Trust games, cops and robbers, and solo chess as a way into computer science 5
- 4 From Puzzles to Problems: Fun with STEM Puzzles, a game of trust, and an honest story of finding your way into computing 4
- 4 Cheat Sheets for Hard Problems When you cannot be fast and exact on every input, relax one demand and see how far you get 4
- 4 An Introduction to Computational Social Choice Voting rules, impossibility theorems, and what computation adds to collective choice 4
- 3 Games of Pursuit and Evasion Cops chase robbers across a network, and the network's structure decides who wins 3
- 3 Two Tricks Two magic tricks, one with a flipped bit and one with a deck of cards, and why they work 3
- 3 A Few Algorithmic Puzzles (and Why You Should Care) What a contest problem looks like, where to find them, and the research they hide 3
- 3 Algorithmic Aspects of Firefighting As fire spreads through a network, where should a handful of firefighters actually stand? 3
- 3 Iterative Compression Add vertices one at a time, and squeeze each solution of size k+1 back down to k 3
- 3 An Introduction to Parameterized Algorithms Hard problems can be tame when the exponential blow-up is confined to a small parameter 3
- 3 From FVS to Planar F-Deletion A random-edge trick for Vertex Cover, stretched all the way to hitting forbidden minors 3
- 2 Building a Personal Website Why to have your own corner of the internet, and how to build it 2
- 2 On Fair Division with Binary Valuations Respecting Social Networks Dividing goods fairly when each person compares only with their neighbors in a network 2
- 2 A Career in Academia: Why and Why Not? Should you become an academic? Reasons for, reasons against, and how to start 2
- 2 A Parameterized Perspective on Protecting and Attacking Elections A parameterized look at attacking and defending elections when both sides have budgets 2
- 2 On Stable Matchings Pair everyone up so no two would rather run off together, the Gale–Shapley way 2
- 2 The Evolution of Trust Why do we trust, and when do we cheat? Game theory, live, through Nicky Case's explorable 2
- 2 Chamberlin–Courant on Restricted Domains Choosing a representative committee is hard, unless the voters line up nicely. How nicely? 2
- 2 Efficient Algorithms for Hard Problems on Structured Electorates Real voters are not arbitrary, and that structure can make hard voting problems easy 2
- 2 Parameterized Complexity school lectures Lectures from two schools on designing parameterized algorithms and proving their limits 2
- 2 Elicitation for Preferences Single Peaked on Trees How few questions reveal everyone's ranking when preferences are single-peaked on a tree? 2
- 2 Parameterized Algorithms using Matroids Using matroids to keep a small family of partial solutions that never loses the answer 2
- 2 Parameterized Graph Modification: A Modern Perspective A tour of graph modification, where you delete, add, or contract until the graph behaves 2
- 2 Algorithms for Planar F-Deletion and Satisfiability One meta-algorithm for minor-free deletion, and backdoors into easy SAT 2
- 2 Max q-Colorable Induced Subgraph on Perfect Graphs Carving the biggest q-colorable piece out of a perfect graph, parameterized by its size 2
- 2 Connected Dominating Set and Short Cycles Forbid short cycles and connected domination gets easier, one girth at a time 2
- 2 Efficient Simplification What makes a simplification good, and when is good simplification impossible? 2
- A Building Joyful Interactives What a card trick, a piano key, and a trust game taught me about building interactives A
- A Joy of Computing On the joy of computing, for women graduate students at ACM-W India Grad Cohort 2026 A
- A On Fairness with Graphical Valuations When agents sit on vertices and goods on edges, an EFX allocation always exists A
- A Algorithmic Fairness in Resource Allocation What does it mean to share indivisible things fairly, and when can algorithms do it? A
- A A Gentle Introduction to Streaming Algorithms One pass through the data firehose, tiny memory, surprisingly good estimates A
- A Eternal Versions of Vertex Cover and Dominating Set Guards on a graph against attacks that never stop, and how many guards it takes A
- A An Introduction to Tournaments A first look at tournaments, where every pair plays exactly once and one of them wins A
- A How Many Matches Does It Take to Find a Champion? How many races does it take to find the fastest horses, and who even counts as a champion? A
- A Geometric Puzzles: Fold and Cut Which shapes can you get by folding a sheet flat and making one straight cut? A
- A The Math of Cutting Cake and Dividing Candy The mathematics of sharing fairly, from "I cut, you choose" to envy-free protocols A
- A Envy-Free and Efficient Allocations for Graphical Valuations When every item is an edge between two agents, envy-freeness gets a graph-shaped answer A
- A Manipulation with(out) Money in Matching Markets Can a central agency steer a stable matching market within a budget, and how hard is it? A
- A Magical Mathematics Card tricks that cannot fail, and the mathematics that makes them work A
- A Nim, Hackenbush, and Friends Who wins at Nim? Pairing, mirroring, powers of two, and a first taste of Hackenbush A
- A Equal Shares and Then Some Give every voter an equal slice of the budget and let them spend it together A
- A Programming Beyond Block Coding A guessing game, a card trick, and a game of trust as first steps beyond block coding A
- A Problem Solving with Python Classic puzzles, cracked with a few lines of Python A
- A Parameterized Approaches to Kemeny Rank Aggregation Merging a lot of rankings into one (and finding many good answers) through parameters A
- A History of Algorithms: The Worst Case and Beyond Why we demand so much of algorithms, from al-Khwārizmī to beyond worst-case analysis A
- A Career Opportunities for Women in Computing Academia or industry? Balancing acts for women building careers in computing A
- A Current Research Directions in Fair Division What fairness means for cake and for indivisible items, and which questions are open A
- A PhD in India: Opportunities and Challenges A CSA IISc panel on doing a PhD in India, from coursework and rejection to postdocs and collaboration A
- A On the Parameterized Complexity of Party Nominations Who should a party nominate when it cannot see the other parties' picks? A
- A Gender Disparities in Programming Competence in India Do men and women in India's computing programmes code equally well? A study plan A
- A Multiwinner Voting The complexity of proportional voting rules that choose a committee, not a single winner A
- A Parameterized Algorithms for Variants of Dominating Set Dominating set and its cousins, and the graph structure that tames them A
- A Fair Division with Minimal Sharing An open problem, in five minutes, on how little sharing a fair division needs A
- A Fair Division is Hard even for Amicable Agents Even when agents have different tastes, fair division with minimal sharing remains hard A
- A Explorable Explanations: Interactive Essays Essays that readers can play with, where changing a number is part of the argument A
- A Trends in Theory How games like Two Dots and Tetris lead into research in theoretical computer science A
- A Early Career Researcher Presentation What comes after the PhD? Career choices and research plans from an early-career academic A
- A Deleting to Structured Trees Pruning a graph into a full binary tree is NP-hard, even if you are only deleting edges A
- A Technical Presentation Skills vs Interpersonal Skills Giving a good technical talk and communicating well with people are different skills A
- A Structural Parameterizations for Colorful Components Cut a colored graph into pieces where no color repeats, with genomics in mind A
- A Protrusion Reduction Techniques Cut out tree-like chunks of a graph, swap in tiny gadgets, and get small kernels A
- A Recreational Math and Science: In the Classrooms and Beyond Mathematics for fun, through card tricks, the Cantor set, fold-and-cut, and polynomials A
- A Two Dots is NP-complete The phone puzzle Two Dots, where you join dots of the same colour, is NP-complete A
- A Some Algorithmic Excursions A first tour of algorithmic thinking for pre-university mathematics students A
- A Unique Covering Problems with Geometric Sets Covering points with lines, squares, or hyperplanes so that many are covered exactly once A
- A On the d-Runaway Rectangle Escape Problem How many rectangles can slide out to the border without jamming? A
- A Random Explorations in Algorithms for Feedback Set Problems on Tournaments Random colorings (pun unintended) that untangle cycles in tournaments A
- A Hardness of r-Dominating Set on Graphs of Diameter (r+1) Small diameter does not save you, since r-domination stays W[2]-hard at diameter r + 1 A
- A Hitting and Piercing Rectangles Induced by a Point Set Some point pierces n²/8 of the rectangles spanned by n points, and that is tight A
- A An Erdős–Ko–Rado Theorem for Matchings Why the largest intersecting family of matchings is a star, via Katona's cycle method A
- A An FPT Algorithm for Maximum Edge Coloring Use as many colors as you can on the edges, but no vertex may see more than two A
- A Real Stable Polynomials and their Zeros Where polynomials have no roots, and why that bounds the permanent A
- A Kernels for F-Deletion Polynomial kernels for deleting a few vertices so that no forbidden minor remains A
- A Separators with Non-Hereditary Properties Cutting s from t is easy; cutting it with a well-behaved separator is another story A
- A Kernelization Preprocessing that is guaranteed to shrink any instance to a size set by the parameter A
- A On the Kernelization Complexity of Colorful Motifs Looking for a colorful motif is hard to preprocess, even when the graph is a tree A
- A Expansions for Reductions Hall's theorem, multiplied by q, becomes a machine for shrinking graphs A
- A Lower Bounds on Kernelization Why some hard problems are unlikely to shrink to polynomial size, and how to prove it A
- A On the Infeasibility of Polynomial Kernelization A 2009 tour of why some hard problems just will not shrink down to polynomial size A