{ "title": "Library · Neeldhara Misra", "url": "https://talks.neeldhara.com/library/", "links_last_checked": "2026-10-21", "entries": [ { "title": "Parameterized Algorithms (textbook, free PDF on the companion site)", "url": "https://parameterized-algorithms.mimuw.edu.pl/", "kind": "Book", "shelf": "read", "by": "Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh", "note": "The standard textbook, free to download: kernels, branching, iterative compression, treewidth and lower bounds.", "own": false, "talks": [ { "id": "masters-thesis", "title": "On the Infeasibility of Polynomial Kernelization", "url": "https://talks.neeldhara.com/talks/masters-thesis/" }, { "id": "cds-short-cycles", "title": "Connected Dominating Set and Short Cycles", "url": "https://talks.neeldhara.com/talks/cds-short-cycles/" }, { "id": "kernelization-expansions", "title": "Expansions for Reductions", "url": "https://talks.neeldhara.com/talks/kernelization-expansions/" }, { "id": "iterative-compression", "title": "Iterative Compression", "url": "https://talks.neeldhara.com/talks/iterative-compression/" }, { "id": "colorful-motifs", "title": "On the Kernelization Complexity of Colorful Motifs", "url": "https://talks.neeldhara.com/talks/colorful-motifs/" }, { "id": "planar-f-deletion", "title": "From FVS to Planar F-Deletion", "url": "https://talks.neeldhara.com/talks/planar-f-deletion/" }, { "id": "kernelization", "title": "Kernelization", "url": "https://talks.neeldhara.com/talks/kernelization/" }, { "id": "separators", "title": "Separators with Non-Hereditary Properties", "url": "https://talks.neeldhara.com/talks/separators/" }, { "id": "cheat-sheets", "title": "Cheat Sheets for Hard Problems", "url": "https://talks.neeldhara.com/talks/cheat-sheets/" }, { "id": "matroids-repsets", "title": "Parameterized Algorithms using Matroids", "url": "https://talks.neeldhara.com/talks/matroids-repsets/" }, { "id": "pc-school-lectures", "title": "Parameterized Complexity school lectures", "url": "https://talks.neeldhara.com/talks/pc-school-lectures/" }, { "id": "fpt-intro", "title": "An Introduction to Parameterized Algorithms", "url": "https://talks.neeldhara.com/talks/fpt-intro/" }, { "id": "protrusions", "title": "Protrusion Reduction Techniques", "url": "https://talks.neeldhara.com/talks/protrusions/" }, { "id": "firefighting", "title": "Algorithmic Aspects of Firefighting", "url": "https://talks.neeldhara.com/talks/firefighting/" } ] }, { "title": "The Evolution of Trust", "url": "https://ncase.me/trust", "kind": "Interactive", "shelf": "play", "by": "Nicky Case", "note": "The game-theory explorable behind the icebreaker: play it to see how trust is built and lost.", "own": false, "talks": [ { "id": "grad-school", "title": "Being a Successful Grad Student", "url": "https://talks.neeldhara.com/talks/grad-school/" }, { "id": "explorables", "title": "Explorable Explanations: Interactive Essays", "url": "https://talks.neeldhara.com/talks/explorables/" }, { "id": "trust", "title": "The Evolution of Trust", "url": "https://talks.neeldhara.com/talks/trust/" }, { "id": "games-we-play", "title": "The Games We Play", "url": "https://talks.neeldhara.com/talks/games-we-play/" }, { "id": "women-careers", "title": "Career Opportunities for Women in Computing", "url": "https://talks.neeldhara.com/talks/women-careers/" }, { "id": "fun-with-stem", "title": "From Puzzles to Problems: Fun with STEM", "url": "https://talks.neeldhara.com/talks/fun-with-stem/" }, { "id": "block-coding", "title": "Programming Beyond Block Coding", "url": "https://talks.neeldhara.com/talks/block-coding/" }, { "id": "joyful-interactives", "title": "Building Joyful Interactives", "url": "https://talks.neeldhara.com/talks/joyful-interactives/" } ] }, { "title": "Fair Division of Indivisible Goods: Recent Progress and Open Questions", "url": "https://arxiv.org/abs/2208.08782", "kind": "Survey", "shelf": "read", "by": "Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Hervé Moulin, Alexandros A. Voudouris, Xiaowei Wu", "note": "Survey of fair division with indivisible goods with a long list of open questions.", "own": false, "talks": [ { "id": "fair-division-directions", "title": "Current Research Directions in Fair Division", "url": "https://talks.neeldhara.com/talks/fair-division-directions/" }, { "id": "games-we-play", "title": "The Games We Play", "url": "https://talks.neeldhara.com/talks/games-we-play/" }, { "id": "fair-division-binary-social", "title": "On Fair Division with Binary Valuations Respecting Social Networks", "url": "https://talks.neeldhara.com/talks/fair-division-binary-social/" }, { "id": "envy-free-graphical", "title": "Envy-Free and Efficient Allocations for Graphical Valuations", "url": "https://talks.neeldhara.com/talks/envy-free-graphical/" }, { "id": "cake-candy", "title": "The Math of Cutting Cake and Dividing Candy", "url": "https://talks.neeldhara.com/talks/cake-candy/" }, { "id": "fairness-resource-allocation", "title": "Algorithmic Fairness in Resource Allocation", "url": "https://talks.neeldhara.com/talks/fairness-resource-allocation/" }, { "id": "graphical-valuations", "title": "On Fairness with Graphical Valuations", "url": "https://talks.neeldhara.com/talks/graphical-valuations/" } ] }, { "title": "Handbook of Computational Social Choice", "url": "https://cgi.cse.unsw.edu.au/~haziz/comsoc.pdf", "kind": "Book", "shelf": "read", "by": "F. Brandt, V. Conitzer, U. Endriss, J. Lang, A. D. Procaccia (eds.)", "note": "The standard reference, free as a PDF: voting, fair allocation, matching and more, by leading researchers.", "own": false, "talks": [ { "id": "comsoc-intro", "title": "An Introduction to Computational Social Choice", "url": "https://talks.neeldhara.com/talks/comsoc-intro/" }, { "id": "structured-electorates", "title": "Efficient Algorithms for Hard Problems on Structured Electorates", "url": "https://talks.neeldhara.com/talks/structured-electorates/" }, { "id": "elicitation-sp-trees", "title": "Elicitation for Preferences Single Peaked on Trees", "url": "https://talks.neeldhara.com/talks/elicitation-sp-trees/" }, { "id": "protecting-elections", "title": "A Parameterized Perspective on Protecting and Attacking Elections", "url": "https://talks.neeldhara.com/talks/protecting-elections/" }, { "id": "fair-division-directions", "title": "Current Research Directions in Fair Division", "url": "https://talks.neeldhara.com/talks/fair-division-directions/" }, { "id": "kemeny", "title": "Parameterized Approaches to Kemeny Rank Aggregation", "url": "https://talks.neeldhara.com/talks/kemeny/" } ] }, { "title": "The Magic of the Thirds (27-card trick)", "url": "https://27cardtrick.netlify.app/", "kind": "Interactive", "shelf": "play", "by": "Interactive linked in Neeldhara's slides", "note": "Play the 27-card trick on screen, then work out why three rounds of dealing always find the card.", "own": false, "talks": [ { "id": "algorithmic-excursions", "title": "Some Algorithmic Excursions", "url": "https://talks.neeldhara.com/talks/algorithmic-excursions/" }, { "id": "algorithmic-puzzles", "title": "A Few Algorithmic Puzzles (and Why You Should Care)", "url": "https://talks.neeldhara.com/talks/algorithmic-puzzles/" }, { "id": "recreational-math", "title": "Recreational Math and Science: In the Classrooms and Beyond", "url": "https://talks.neeldhara.com/talks/recreational-math/" }, { "id": "fun-with-stem", "title": "From Puzzles to Problems: Fun with STEM", "url": "https://talks.neeldhara.com/talks/fun-with-stem/" }, { "id": "block-coding", "title": "Programming Beyond Block Coding", "url": "https://talks.neeldhara.com/talks/block-coding/" }, { "id": "magical-mathematics", "title": "Magical Mathematics", "url": "https://talks.neeldhara.com/talks/magical-mathematics/" } ] }, { "title": "Kernelization: Theory of Parameterized Preprocessing", "url": "https://doi.org/10.1017/9781107415157", "kind": "Book", "shelf": "read", "by": "Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi", "note": "The standard textbook on kernels; Part III treats lower bounds via distillation and composition.", "own": false, "talks": [ { "id": "efficient-simplification", "title": "Efficient Simplification", "url": "https://talks.neeldhara.com/talks/efficient-simplification/" }, { "id": "kernelization-expansions", "title": "Expansions for Reductions", "url": "https://talks.neeldhara.com/talks/kernelization-expansions/" }, { "id": "kernel-lower-bounds", "title": "Lower Bounds on Kernelization", "url": "https://talks.neeldhara.com/talks/kernel-lower-bounds/" }, { "id": "planar-f-deletion", "title": "From FVS to Planar F-Deletion", "url": "https://talks.neeldhara.com/talks/planar-f-deletion/" }, { "id": "phd-defense", "title": "Kernels for F-Deletion", "url": "https://talks.neeldhara.com/talks/phd-defense/" } ] }, { "title": "Lower Bounds on Kernelization", "url": "https://doi.org/10.1016/j.disopt.2010.10.001", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Venkatesh Raman, Saket Saurabh", "note": "My companion survey on proving that small kernels are unlikely to exist.", "own": true, "authors": [ "Neeldhara Misra", "Venkatesh Raman", "Saket Saurabh" ], "venue": "Discrete Optimization", "year": 2011, "doi": "https://doi.org/10.1016/j.disopt.2010.10.001", "arxiv": null, "pdf": "https://www.imsc.res.in/~vraman/pub/nokers-short.pdf", "talks": [ { "id": "masters-thesis", "title": "On the Infeasibility of Polynomial Kernelization", "url": "https://talks.neeldhara.com/talks/masters-thesis/" }, { "id": "efficient-simplification", "title": "Efficient Simplification", "url": "https://talks.neeldhara.com/talks/efficient-simplification/" }, { "id": "kernel-lower-bounds", "title": "Lower Bounds on Kernelization", "url": "https://talks.neeldhara.com/talks/kernel-lower-bounds/" }, { "id": "kernelization", "title": "Kernelization", "url": "https://talks.neeldhara.com/talks/kernelization/" }, { "id": "pc-school-lectures", "title": "Parameterized Complexity school lectures", "url": "https://talks.neeldhara.com/talks/pc-school-lectures/" } ] }, { "title": "Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms", "url": "https://doi.org/10.1109/focs.2012.62", "kind": "Paper", "shelf": "read", "by": "Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh", "note": "FOCS 2012", "own": true, "authors": [ "Fedor V. Fomin", "Daniel Lokshtanov", "Neeldhara Misra", "Saket Saurabh" ], "venue": "FOCS 2012", "year": 2012, "doi": "https://doi.org/10.1109/focs.2012.62", "arxiv": "https://arxiv.org/abs/1204.4230", "pdf": null, "talks": [ { "id": "planar-f-deletion", "title": "From FVS to Planar F-Deletion", "url": "https://talks.neeldhara.com/talks/planar-f-deletion/" }, { "id": "phd-defense", "title": "Kernels for F-Deletion", "url": "https://talks.neeldhara.com/talks/phd-defense/" }, { "id": "pgm", "title": "Parameterized Graph Modification: A Modern Perspective", "url": "https://talks.neeldhara.com/talks/pgm/" }, { "id": "research-overview", "title": "Algorithms for Planar F-Deletion and Satisfiability", "url": "https://talks.neeldhara.com/talks/research-overview/" }, { "id": "protrusions", "title": "Protrusion Reduction Techniques", "url": "https://talks.neeldhara.com/talks/protrusions/" } ] }, { "title": "Hitting Forbidden Minors: Approximation and Kernelization", "url": "https://doi.org/10.4230/lipics.stacs.2011.189", "kind": "Paper", "shelf": "read", "by": "Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh", "note": "The paper with the q-expansion lemma and the polynomial kernels for hitting θ_c minors.", "own": true, "authors": [ "Fedor V. Fomin", "Daniel Lokshtanov", "Neeldhara Misra", "Geevarghese Philip", "Saket Saurabh" ], "venue": "STACS 2011", "year": 2011, "doi": "https://doi.org/10.4230/lipics.stacs.2011.189", "arxiv": "https://arxiv.org/abs/1010.1365", "pdf": null, "talks": [ { "id": "kernelization-expansions", "title": "Expansions for Reductions", "url": "https://talks.neeldhara.com/talks/kernelization-expansions/" }, { "id": "planar-f-deletion", "title": "From FVS to Planar F-Deletion", "url": "https://talks.neeldhara.com/talks/planar-f-deletion/" }, { "id": "phd-defense", "title": "Kernels for F-Deletion", "url": "https://talks.neeldhara.com/talks/phd-defense/" }, { "id": "protrusions", "title": "Protrusion Reduction Techniques", "url": "https://talks.neeldhara.com/talks/protrusions/" } ] }, { "title": "On Fair Division with Binary Valuations Respecting Social Networks", "url": "https://doi.org/10.1007/978-3-030-95018-7_21", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Debanuj Nayak", "note": "CALDAM 2022", "own": true, "authors": [ "Neeldhara Misra", "Debanuj Nayak" ], "venue": "CALDAM 2022 (LNCS)", "year": 2022, "doi": "https://doi.org/10.1007/978-3-030-95018-7_21", "arxiv": "https://arxiv.org/abs/2111.11528", "pdf": null, "talks": [ { "id": "games-we-play", "title": "The Games We Play", "url": "https://talks.neeldhara.com/talks/games-we-play/" }, { "id": "fair-division-binary-social", "title": "On Fair Division with Binary Valuations Respecting Social Networks", "url": "https://talks.neeldhara.com/talks/fair-division-binary-social/" }, { "id": "cake-candy", "title": "The Math of Cutting Cake and Dividing Candy", "url": "https://talks.neeldhara.com/talks/cake-candy/" }, { "id": "graphical-valuations", "title": "On Fairness with Graphical Valuations", "url": "https://talks.neeldhara.com/talks/graphical-valuations/" } ] }, { "title": "Binary magic cards: guess the number", "url": "https://binarysearch2.netlify.app/", "kind": "Interactive", "shelf": "play", "by": "Neeldhara Misra", "note": "Five yes/no questions pin down any number from 1 to 31; a hands-on look at binary representation.", "own": true, "talks": [ { "id": "algorithmic-excursions", "title": "Some Algorithmic Excursions", "url": "https://talks.neeldhara.com/talks/algorithmic-excursions/" }, { "id": "fun-with-stem", "title": "From Puzzles to Problems: Fun with STEM", "url": "https://talks.neeldhara.com/talks/fun-with-stem/" }, { "id": "block-coding", "title": "Programming Beyond Block Coding", "url": "https://talks.neeldhara.com/talks/block-coding/" } ] }, { "title": "De Bruijn sequence", "url": "https://en.wikipedia.org/wiki/De_Bruijn_sequence", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Cyclic strings in which every block of a given length appears exactly once, with constructions via Euler tours.", "own": false, "talks": [ { "id": "puzzles-python", "title": "Problem Solving with Python", "url": "https://talks.neeldhara.com/talks/puzzles-python/" }, { "id": "two-tricks", "title": "Two Tricks", "url": "https://talks.neeldhara.com/talks/two-tricks/" }, { "id": "magical-mathematics", "title": "Magical Mathematics", "url": "https://talks.neeldhara.com/talks/magical-mathematics/" } ] }, { "title": "Domain Restrictions and Multiwinner Elections (ACM Summer School on Algorithmic Game Theory 2019)", "url": "https://www.youtube.com/watch?v=HlpM_-3jMIU", "kind": "Video", "shelf": "watch", "by": "Neeldhara Misra", "note": "My own summer-school lecture on restricted domains and committee elections, at a gentler pace.", "own": true, "talks": [ { "id": "structured-electorates", "title": "Efficient Algorithms for Hard Problems on Structured Electorates", "url": "https://talks.neeldhara.com/talks/structured-electorates/" }, { "id": "chamberlin-courant", "title": "Chamberlin–Courant on Restricted Domains", "url": "https://talks.neeldhara.com/talks/chamberlin-courant/" }, { "id": "multiwinner-voting", "title": "Multiwinner Voting", "url": "https://talks.neeldhara.com/talks/multiwinner-voting/" } ] }, { "title": "Envy-Free and Efficient Allocations for Graphical Valuations", "url": "https://doi.org/10.1007/978-3-031-73903-3_17", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Aditi Sethia", "note": "Recent work on when envy-free, efficient allocations can be found for graph-structured valuations.", "own": true, "authors": [ "Neeldhara Misra", "Aditi Sethia" ], "venue": "ADT 2024 (LNCS)", "year": 2024, "doi": "https://doi.org/10.1007/978-3-031-73903-3_17", "arxiv": "https://arxiv.org/abs/2410.14272", "pdf": null, "talks": [ { "id": "envy-free-graphical", "title": "Envy-Free and Efficient Allocations for Graphical Valuations", "url": "https://talks.neeldhara.com/talks/envy-free-graphical/" }, { "id": "cake-candy", "title": "The Math of Cutting Cake and Dividing Candy", "url": "https://talks.neeldhara.com/talks/cake-candy/" }, { "id": "graphical-valuations", "title": "On Fairness with Graphical Valuations", "url": "https://talks.neeldhara.com/talks/graphical-valuations/" } ] }, { "title": "Fairness Notions for Indivisible Goods (ACM Summer School on Algorithmic Game Theory 2019)", "url": "https://www.youtube.com/watch?v=yDxOMOeVdaA", "kind": "Video", "shelf": "watch", "by": "Siddharth Barman", "note": "Summer-school lecture on fairness notions for indivisible goods, from the school where I also taught.", "own": false, "talks": [ { "id": "fair-division-binary-social", "title": "On Fair Division with Binary Valuations Respecting Social Networks", "url": "https://talks.neeldhara.com/talks/fair-division-binary-social/" }, { "id": "envy-free-graphical", "title": "Envy-Free and Efficient Allocations for Graphical Valuations", "url": "https://talks.neeldhara.com/talks/envy-free-graphical/" }, { "id": "fairness-resource-allocation", "title": "Algorithmic Fairness in Resource Allocation", "url": "https://talks.neeldhara.com/talks/fairness-resource-allocation/" } ] }, { "title": "Kernelization – Preprocessing with a Guarantee", "url": "https://doi.org/10.1007/978-3-642-30891-8_10", "kind": "Paper", "shelf": "read", "by": "Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh", "note": null, "own": true, "authors": [ "Daniel Lokshtanov", "Neeldhara Misra", "Saket Saurabh" ], "venue": "The Multivariate Algorithmic Revolution and Beyond (LNCS 7370)", "year": 2012, "doi": "https://doi.org/10.1007/978-3-642-30891-8_10", "arxiv": null, "pdf": "https://sites.cs.ucsb.edu/~daniello/papers/surveyKernels.pdf", "talks": [ { "id": "efficient-simplification", "title": "Efficient Simplification", "url": "https://talks.neeldhara.com/talks/efficient-simplification/" }, { "id": "kernelization", "title": "Kernelization", "url": "https://talks.neeldhara.com/talks/kernelization/" }, { "id": "pc-school-lectures", "title": "Parameterized Complexity school lectures", "url": "https://talks.neeldhara.com/talks/pc-school-lectures/" } ] }, { "title": "Parameterized Algorithms (NPTEL course playlist)", "url": "https://www.youtube.com/playlist?list=PLyqSpQzTE6M_0KLR2_FVBN4Rnvq_PlcrA", "kind": "Course", "shelf": "watch", "by": "Neeldhara Misra and Saket Saurabh (NPTEL)", "note": "My full online course for anyone who wants to learn the techniques properly.", "own": true, "talks": [ { "id": "cheat-sheets", "title": "Cheat Sheets for Hard Problems", "url": "https://talks.neeldhara.com/talks/cheat-sheets/" }, { "id": "pc-school-lectures", "title": "Parameterized Complexity school lectures", "url": "https://talks.neeldhara.com/talks/pc-school-lectures/" }, { "id": "fpt-intro", "title": "An Introduction to Parameterized Algorithms", "url": "https://talks.neeldhara.com/talks/fpt-intro/" } ] }, { "title": "Parameterized Algorithms (textbook)", "url": "https://parameterized-algorithms.mimuw.edu.pl/parameterized-algorithms.pdf", "kind": "Book", "shelf": "read", "by": "Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh", "note": "The standard textbook, free to download: kernels, branching, iterative compression, treewidth and lower bounds.", "own": false, "talks": [ { "id": "max-edge-coloring", "title": "An FPT Algorithm for Maximum Edge Coloring", "url": "https://talks.neeldhara.com/talks/max-edge-coloring/" }, { "id": "r-dominating-diameter", "title": "Hardness of r-Dominating Set on Graphs of Diameter (r+1)", "url": "https://talks.neeldhara.com/talks/r-dominating-diameter/" }, { "id": "max-q-colorable", "title": "Max q-Colorable Induced Subgraph on Perfect Graphs", "url": "https://talks.neeldhara.com/talks/max-q-colorable/" } ] }, { "title": "Saving Critical Nodes with Firefighters is FPT", "url": "https://doi.org/10.4230/LIPIcs.ICALP.2017.135", "kind": "Paper", "shelf": "read", "by": "Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan", "note": "Firefighting is FPT in the number of firefighters, via important separators.", "own": true, "authors": [ "Jayesh Choudhari", "Anirban Dasgupta", "Neeldhara Misra", "M. S. Ramanujan" ], "venue": "ICALP 2017 (LIPIcs 80)", "year": 2017, "doi": "https://doi.org/10.4230/LIPIcs.ICALP.2017.135", "arxiv": "https://arxiv.org/abs/1705.10923", "pdf": null, "talks": [ { "id": "firefighting", "title": "Algorithmic Aspects of Firefighting", "url": "https://talks.neeldhara.com/talks/firefighting/" }, { "id": "games-we-play", "title": "The Games We Play", "url": "https://talks.neeldhara.com/talks/games-we-play/" }, { "id": "games-pursuit-evasion", "title": "Games of Pursuit and Evasion", "url": "https://talks.neeldhara.com/talks/games-pursuit-evasion/" } ] }, { "title": "Spliddit", "url": "http://www.spliddit.org/", "kind": "Interactive", "shelf": "play", "by": "Ariel Procaccia and collaborators", "note": "Free website that splits rent, goods, tasks and credit with provable fairness guarantees; try it yourself.", "own": false, "talks": [ { "id": "fair-division-directions", "title": "Current Research Directions in Fair Division", "url": "https://talks.neeldhara.com/talks/fair-division-directions/" }, { "id": "fair-division-binary-social", "title": "On Fair Division with Binary Valuations Respecting Social Networks", "url": "https://talks.neeldhara.com/talks/fair-division-binary-social/" }, { "id": "fairness-resource-allocation", "title": "Algorithmic Fairness in Resource Allocation", "url": "https://talks.neeldhara.com/talks/fairness-resource-allocation/" } ] }, { "title": "Structured Preferences (Trends in Computational Social Choice, ch. 10)", "url": "https://archive.illc.uva.nl/COST-IC1205/BookDocs/Chapters/TrendsCOMSOC-10.pdf", "kind": "Survey", "shelf": "read", "by": "Edith Elkind, Martin Lackner, Dominik Peters", "note": "Free book chapter on single-peaked, single-crossing and tree-based domains and what they make tractable.", "own": false, "talks": [ { "id": "structured-electorates", "title": "Efficient Algorithms for Hard Problems on Structured Electorates", "url": "https://talks.neeldhara.com/talks/structured-electorates/" }, { "id": "elicitation-sp-trees", "title": "Elicitation for Preferences Single Peaked on Trees", "url": "https://talks.neeldhara.com/talks/elicitation-sp-trees/" }, { "id": "chamberlin-courant", "title": "Chamberlin–Courant on Restricted Domains", "url": "https://talks.neeldhara.com/talks/chamberlin-courant/" } ] }, { "title": "(Meta) Kernelization", "url": "https://arxiv.org/abs/0904.0727", "kind": "Paper", "shelf": "read", "by": "H. L. Bodlaender, F. V. Fomin, D. Lokshtanov, E. Penninkx, S. Saurabh, D. M. Thilikos", "note": "Where protrusion replacement was developed, the tool the thesis adapts to general graphs.", "own": false, "talks": [ { "id": "phd-defense", "title": "Kernels for F-Deletion", "url": "https://talks.neeldhara.com/talks/phd-defense/" }, { "id": "protrusions", "title": "Protrusion Reduction Techniques", "url": "https://talks.neeldhara.com/talks/protrusions/" } ] }, { "title": "A Characterization of Spartan Graphs and New Lower Bounds for Eternal Vertex Cover", "url": "https://doi.org/10.4230/LIPIcs.FSTTCS.2025.45", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Saraswati Girish Nanoti", "note": "König graphs, new lower bounds and a matching-based characterization of all such graphs.", "own": true, "authors": [ "Neeldhara Misra", "Saraswati Girish Nanoti" ], "venue": "FSTTCS 2025 (LIPIcs)", "year": 2025, "doi": "https://doi.org/10.4230/LIPIcs.FSTTCS.2025.45", "arxiv": "https://arxiv.org/abs/2504.06832", "pdf": null, "talks": [ { "id": "games-pursuit-evasion", "title": "Games of Pursuit and Evasion", "url": "https://talks.neeldhara.com/talks/games-pursuit-evasion/" }, { "id": "eternal-vc", "title": "Eternal Versions of Vertex Cover and Dominating Set", "url": "https://talks.neeldhara.com/talks/eternal-vc/" } ] }, { "title": "Advice for the budding theorist", "url": "https://windowsontheory.org/2015/11/03/advice-for-the-budding-theorist/", "kind": "Article", "shelf": "read", "by": "Boaz Barak (Windows On Theory)", "note": "Five candid tips on grad school and research life, linked from the 2023 deck.", "own": false, "talks": [ { "id": "grad-school", "title": "Being a Successful Grad Student", "url": "https://talks.neeldhara.com/talks/grad-school/" }, { "id": "early-career", "title": "Early Career Researcher Presentation", "url": "https://talks.neeldhara.com/talks/early-career/" } ] }, { "title": "Card Colm", "url": "https://www.cardcolm.org/", "kind": "Article", "shelf": "read", "by": "Colm Mulcahy", "note": "Home of Colm Mulcahy, author of Mathematical Card Magic, with columns on self-working, mathematics-based card tricks.", "own": false, "talks": [ { "id": "recreational-math", "title": "Recreational Math and Science: In the Classrooms and Beyond", "url": "https://talks.neeldhara.com/talks/recreational-math/" }, { "id": "magical-mathematics", "title": "Magical Mathematics", "url": "https://talks.neeldhara.com/talks/magical-mathematics/" } ] }, { "title": "Conversation with Neeldhara Misra: Journey of a Computer Scientist", "url": "https://www.youtube.com/watch?v=pxaU2Gvhmx8", "kind": "Video", "shelf": "watch", "by": "Pratidhvani podcast", "note": "A two-hour conversation about my path from literature and mathematics to computer science.", "own": false, "talks": [ { "id": "early-career", "title": "Early Career Researcher Presentation", "url": "https://talks.neeldhara.com/talks/early-career/" }, { "id": "joy-of-computing", "title": "Joy of Computing", "url": "https://talks.neeldhara.com/talks/joy-of-computing/" } ] }, { "title": "CS Unplugged", "url": "https://www.csunplugged.org/en/", "kind": "Course", "shelf": "watch", "by": "Computer Science Education Research Group, University of Canterbury", "note": "Free activities that teach computer science through games and puzzles with cards, string and crayons, no computer needed.", "own": false, "talks": [ { "id": "algorithmic-excursions", "title": "Some Algorithmic Excursions", "url": "https://talks.neeldhara.com/talks/algorithmic-excursions/" }, { "id": "fun-with-stem", "title": "From Puzzles to Problems: Fun with STEM", "url": "https://talks.neeldhara.com/talks/fun-with-stem/" } ] }, { "title": "Dominating set", "url": "https://en.wikipedia.org/wiki/Dominating_set", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Background on the problem, including its parameterized complexity and its many variants.", "own": false, "talks": [ { "id": "r-dominating-diameter", "title": "Hardness of r-Dominating Set on Graphs of Diameter (r+1)", "url": "https://talks.neeldhara.com/talks/r-dominating-diameter/" }, { "id": "dominating-set-variants", "title": "Parameterized Algorithms for Variants of Dominating Set", "url": "https://talks.neeldhara.com/talks/dominating-set-variants/" } ] }, { "title": "Efficient Fair Division with Minimal Sharing", "url": "https://arxiv.org/abs/1908.01669", "kind": "Paper", "shelf": "read", "by": "Fedor Sandomirskiy, Erel Segal-Halevi", "note": "Introduces fair division with minimal sharing and the degeneracy notion this work builds on (Operations Research, 2022).", "own": false, "talks": [ { "id": "amicable-agents", "title": "Fair Division is Hard even for Amicable Agents", "url": "https://talks.neeldhara.com/talks/amicable-agents/" }, { "id": "fair-division-minimal-sharing", "title": "Fair Division with Minimal Sharing", "url": "https://talks.neeldhara.com/talks/fair-division-minimal-sharing/" } ] }, { "title": "EFX Allocations on Graphs", "url": "https://livrepository.liverpool.ac.uk/id/eprint/3171870", "kind": "Paper", "shelf": "read", "by": "George Christodoulou, Amos Fiat, Elias Koutsoupias, Alkmini Sgouritsa", "note": "EC 2023 paper (also titled \"Fair allocation in graphs\") that introduced graphical valuations and proved EFX allocations exist.", "own": false, "talks": [ { "id": "envy-free-graphical", "title": "Envy-Free and Efficient Allocations for Graphical Valuations", "url": "https://talks.neeldhara.com/talks/envy-free-graphical/" }, { "id": "graphical-valuations", "title": "On Fairness with Graphical Valuations", "url": "https://talks.neeldhara.com/talks/graphical-valuations/" } ] }, { "title": "Elicitation for Preferences Single Peaked on Trees", "url": "https://arxiv.org/abs/1604.04403", "kind": "Paper", "shelf": "read", "by": "Palash Dey, Neeldhara Misra", "note": null, "own": true, "authors": [ "Palash Dey", "Neeldhara Misra" ], "venue": "IJCAI 2016", "year": 2016, "doi": null, "arxiv": "https://arxiv.org/abs/1604.04403", "pdf": null, "talks": [ { "id": "structured-electorates", "title": "Efficient Algorithms for Hard Problems on Structured Electorates", "url": "https://talks.neeldhara.com/talks/structured-electorates/" }, { "id": "elicitation-sp-trees", "title": "Elicitation for Preferences Single Peaked on Trees", "url": "https://talks.neeldhara.com/talks/elicitation-sp-trees/" } ] }, { "title": "Envy-free item allocation", "url": "https://en.wikipedia.org/wiki/Envy-free_item_allocation", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Background on envy-freeness and its relaxations EF1 and EFX.", "own": false, "talks": [ { "id": "envy-free-graphical", "title": "Envy-Free and Efficient Allocations for Graphical Valuations", "url": "https://talks.neeldhara.com/talks/envy-free-graphical/" }, { "id": "graphical-valuations", "title": "On Fairness with Graphical Valuations", "url": "https://talks.neeldhara.com/talks/graphical-valuations/" } ] }, { "title": "Essays and Opinions", "url": "https://www.wisdom.weizmann.ac.il/~oded/essays.html", "kind": "Essay", "shelf": "read", "by": "Oded Goldreich", "note": "A long-running collection of essays on research, the TCS community and academic life; on the 2013 reading list.", "own": false, "talks": [ { "id": "career-academia", "title": "A Career in Academia: Why and Why Not?", "url": "https://talks.neeldhara.com/talks/career-academia/" }, { "id": "early-career", "title": "Early Career Researcher Presentation", "url": "https://talks.neeldhara.com/talks/early-career/" } ] }, { "title": "Eternal Vertex Cover on Bipartite Graphs", "url": "https://doi.org/10.1007/978-3-031-09574-0_5", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Saraswati Girish Nanoti", "note": "My results on the eternal vertex cover game: hard on bipartite graphs, easy on co-bipartite ones.", "own": true, "authors": [ "Neeldhara Misra", "Saraswati Girish Nanoti" ], "venue": "CSR 2022 (LNCS)", "year": 2022, "doi": "https://doi.org/10.1007/978-3-031-09574-0_5", "arxiv": "https://arxiv.org/abs/2201.03820", "pdf": null, "talks": [ { "id": "games-pursuit-evasion", "title": "Games of Pursuit and Evasion", "url": "https://talks.neeldhara.com/talks/games-pursuit-evasion/" }, { "id": "eternal-vc", "title": "Eternal Versions of Vertex Cover and Dominating Set", "url": "https://talks.neeldhara.com/talks/eternal-vc/" } ] }, { "title": "Explorable Explanations", "url": "https://worrydream.com/ExplorableExplanations/", "kind": "Essay", "shelf": "read", "by": "Bret Victor", "note": "The 2011 essay that named the idea of reactive, explorable documents.", "own": false, "talks": [ { "id": "explorables", "title": "Explorable Explanations: Interactive Essays", "url": "https://talks.neeldhara.com/talks/explorables/" }, { "id": "joyful-interactives", "title": "Building Joyful Interactives", "url": "https://talks.neeldhara.com/talks/joyful-interactives/" } ] }, { "title": "Fair Division Is Hard Even for Amicable Agents", "url": "https://doi.org/10.1007/978-3-030-67731-2_31", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Aditi Sethia", "note": null, "own": true, "authors": [ "Neeldhara Misra", "Aditi Sethia" ], "venue": "SOFSEM 2021 (LNCS); short version at ICTCS 2020", "year": 2021, "doi": "https://doi.org/10.1007/978-3-030-67731-2_31", "arxiv": null, "pdf": "https://ceur-ws.org/Vol-2756/paper_24.pdf", "talks": [ { "id": "amicable-agents", "title": "Fair Division is Hard even for Amicable Agents", "url": "https://talks.neeldhara.com/talks/amicable-agents/" }, { "id": "fair-division-minimal-sharing", "title": "Fair Division with Minimal Sharing", "url": "https://talks.neeldhara.com/talks/fair-division-minimal-sharing/" } ] }, { "title": "Fair Division with Bounded Sharing: Binary and Non-Degenerate Valuations", "url": "https://arxiv.org/abs/1912.00459", "kind": "Paper", "shelf": "read", "by": "Samuel Bismuth, Ivan Bliznets, Erel Segal-Halevi", "note": "Related work on fair division when only a bounded number of goods may be shared.", "own": false, "talks": [ { "id": "amicable-agents", "title": "Fair Division is Hard even for Amicable Agents", "url": "https://talks.neeldhara.com/talks/amicable-agents/" }, { "id": "fair-division-minimal-sharing", "title": "Fair Division with Minimal Sharing", "url": "https://talks.neeldhara.com/talks/fair-division-minimal-sharing/" } ] }, { "title": "Fold and Cut Theorem - Numberphile", "url": "https://www.youtube.com/watch?v=ZREp1mAPKTM", "kind": "Video", "shelf": "watch", "by": "Katie Steckles, Numberphile", "note": "A ten-minute demonstration of cutting letters and shapes from folded paper with one cut.", "own": false, "talks": [ { "id": "recreational-math", "title": "Recreational Math and Science: In the Classrooms and Beyond", "url": "https://talks.neeldhara.com/talks/recreational-math/" }, { "id": "fold-cut", "title": "Geometric Puzzles: Fold and Cut", "url": "https://talks.neeldhara.com/talks/fold-cut/" } ] }, { "title": "Graph Modification Problems (Dagstuhl Seminar 14071), Dagstuhl Reports 4(2)", "url": "https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.2.38", "kind": "Reference", "shelf": "read", "by": "Hans L. Bodlaender, Pinar Heggernes, Daniel Lokshtanov (eds.)", "note": "Talk abstracts and a list of open problems from the 2014 seminar.", "own": false, "talks": [ { "id": "max-q-colorable", "title": "Max q-Colorable Induced Subgraph on Perfect Graphs", "url": "https://talks.neeldhara.com/talks/max-q-colorable/" }, { "id": "pgm", "title": "Parameterized Graph Modification: A Modern Perspective", "url": "https://talks.neeldhara.com/talks/pgm/" } ] }, { "title": "Hardness of r-dominating set on Graphs of Diameter (r + 1)", "url": "https://doi.org/10.1007/978-3-319-03898-8_22", "kind": "Paper", "shelf": "read", "by": "Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh", "note": "IPEC 2013", "own": true, "authors": [ "Daniel Lokshtanov", "Neeldhara Misra", "Geevarghese Philip", "M. S. Ramanujan", "Saket Saurabh" ], "venue": "IPEC 2013", "year": 2013, "doi": "https://doi.org/10.1007/978-3-319-03898-8_22", "arxiv": null, "pdf": null, "talks": [ { "id": "r-dominating-diameter", "title": "Hardness of r-Dominating Set on Graphs of Diameter (r+1)", "url": "https://talks.neeldhara.com/talks/r-dominating-diameter/" }, { "id": "dominating-set-variants", "title": "Parameterized Algorithms for Variants of Dominating Set", "url": "https://talks.neeldhara.com/talks/dominating-set-variants/" } ] }, { "title": "Having a Hard Time? Explore Parameterized Complexity! (Trends in Computational Social Choice, ch. 11)", "url": "https://archive.illc.uva.nl/COST-IC1205/BookDocs/Chapters/TrendsCOMSOC-11.pdf", "kind": "Survey", "shelf": "read", "by": "Britta Dorn, Ildikó Schlotter", "note": "Friendly introduction to parameterized complexity and kernelization for social choice problems.", "own": false, "talks": [ { "id": "protecting-elections", "title": "A Parameterized Perspective on Protecting and Attacking Elections", "url": "https://talks.neeldhara.com/talks/protecting-elections/" }, { "id": "party-nominations", "title": "On the Parameterized Complexity of Party Nominations", "url": "https://talks.neeldhara.com/talks/party-nominations/" } ] }, { "title": "How to give a great research talk", "url": "https://www.microsoft.com/en-us/research/academic-program/give-great-research-talk/", "kind": "Article", "shelf": "read", "by": "Simon Peyton Jones", "note": "A video and slides with guidelines for research talks that make people want to read the paper.", "own": false, "talks": [ { "id": "grad-school", "title": "Being a Successful Grad Student", "url": "https://talks.neeldhara.com/talks/grad-school/" }, { "id": "presentation-skills", "title": "Technical Presentation Skills vs Interpersonal Skills", "url": "https://talks.neeldhara.com/talks/presentation-skills/" } ] }, { "title": "Interactives", "url": "https://interactives.neeldhara.com", "kind": "Interactive", "shelf": "play", "by": "Neeldhara Misra", "note": "Games, puzzles and mathematical explorations I build, for a hands-on taste of playful computing.", "own": true, "talks": [ { "id": "joyful-interactives", "title": "Building Joyful Interactives", "url": "https://talks.neeldhara.com/talks/joyful-interactives/" }, { "id": "joy-of-computing", "title": "Joy of Computing", "url": "https://talks.neeldhara.com/talks/joy-of-computing/" } ] }, { "title": "Kernelization (Wikipedia)", "url": "https://en.wikipedia.org/wiki/Kernelization", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Good short introduction to kernels and their equivalence with fixed-parameter tractability.", "own": false, "talks": [ { "id": "efficient-simplification", "title": "Efficient Simplification", "url": "https://talks.neeldhara.com/talks/efficient-simplification/" }, { "id": "kernelization", "title": "Kernelization", "url": "https://talks.neeldhara.com/talks/kernelization/" } ] }, { "title": "Kernelization, Planar F-Deletion", "url": "https://doi.org/10.1007/978-1-4939-2864-4_527", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra", "note": "My short encyclopedia entry on the problem and its kernels.", "own": true, "authors": [ "Neeldhara Misra" ], "venue": "Encyclopedia of Algorithms (Springer)", "year": 2016, "doi": "https://doi.org/10.1007/978-1-4939-2864-4_527", "arxiv": null, "pdf": null, "talks": [ { "id": "planar-f-deletion", "title": "From FVS to Planar F-Deletion", "url": "https://talks.neeldhara.com/talks/planar-f-deletion/" }, { "id": "protrusions", "title": "Protrusion Reduction Techniques", "url": "https://talks.neeldhara.com/talks/protrusions/" } ] }, { "title": "Kernelization: High Degree Rule (NPTEL Parameterized Algorithms, mod01lec03)", "url": "https://www.youtube.com/watch?v=iJctyVg0SLU", "kind": "Video", "shelf": "watch", "by": "NPTEL course by Neeldhara Misra and Saket Saurabh", "note": "Opens the kernelization module of my NPTEL course (Point Line Cover, Edge Clique Cover, Vertex Cover); later lectures cover d-Hitting Set, crowns and the expansion lemma.", "own": true, "talks": [ { "id": "efficient-simplification", "title": "Efficient Simplification", "url": "https://talks.neeldhara.com/talks/efficient-simplification/" }, { "id": "kernelization", "title": "Kernelization", "url": "https://talks.neeldhara.com/talks/kernelization/" } ] }, { "title": "Kernels for the F-Deletion Problem (PhD thesis, IMSc repository)", "url": "https://www.imsc.res.in/xmlui/handle/123456789/328", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra", "note": "My PhD thesis, free to download; part of it studies Colorful Motifs.", "own": true, "talks": [ { "id": "colorful-motifs", "title": "On the Kernelization Complexity of Colorful Motifs", "url": "https://talks.neeldhara.com/talks/colorful-motifs/" }, { "id": "phd-defense", "title": "Kernels for F-Deletion", "url": "https://talks.neeldhara.com/talks/phd-defense/" } ] }, { "title": "Lecture Notes on Fair Division", "url": "https://arxiv.org/abs/1806.04234", "kind": "Lecture notes", "shelf": "read", "by": "Ulle Endriss", "note": "Short, readable lecture notes covering cake cutting and indivisible goods.", "own": false, "talks": [ { "id": "fair-division-directions", "title": "Current Research Directions in Fair Division", "url": "https://talks.neeldhara.com/talks/fair-division-directions/" }, { "id": "fairness-resource-allocation", "title": "Algorithmic Fairness in Resource Allocation", "url": "https://talks.neeldhara.com/talks/fairness-resource-allocation/" } ] }, { "title": "Multi-Winner Voting with Approval Preferences", "url": "https://arxiv.org/abs/2007.01795", "kind": "Book", "shelf": "read", "by": "Martin Lackner, Piotr Skowron", "note": "Open-access book on approval-based committee rules and proportionality.", "own": false, "talks": [ { "id": "multiwinner-voting", "title": "Multiwinner Voting", "url": "https://talks.neeldhara.com/talks/multiwinner-voting/" }, { "id": "equal-shares", "title": "Equal Shares and Then Some", "url": "https://talks.neeldhara.com/talks/equal-shares/" } ] }, { "title": "NPTEL course: Parameterized Algorithms", "url": "https://nptel.ac.in/courses/106106230", "kind": "Course", "shelf": "watch", "by": "Neeldhara Misra and Saket Saurabh", "note": "Full online course with lectures on kernels and much more.", "own": true, "talks": [ { "id": "efficient-simplification", "title": "Efficient Simplification", "url": "https://talks.neeldhara.com/talks/efficient-simplification/" }, { "id": "research-overview", "title": "Algorithms for Planar F-Deletion and Satisfiability", "url": "https://talks.neeldhara.com/talks/research-overview/" } ] }, { "title": "On Problems without Polynomial Kernels (technical report)", "url": "https://ics-archive.science.uu.nl/research/techreps/repo/CS-2007/2007-046.pdf", "kind": "Paper", "shelf": "read", "by": "Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin", "note": "Where compositions and distillations were introduced.", "own": false, "talks": [ { "id": "masters-thesis", "title": "On the Infeasibility of Polynomial Kernelization", "url": "https://talks.neeldhara.com/talks/masters-thesis/" }, { "id": "kernel-lower-bounds", "title": "Lower Bounds on Kernelization", "url": "https://talks.neeldhara.com/talks/kernel-lower-bounds/" } ] }, { "title": "On the Complexity of Chamberlin-Courant on Almost Structured Profiles", "url": "https://doi.org/10.1007/978-3-319-67504-6_9", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan", "note": null, "own": true, "authors": [ "Neeldhara Misra", "Chinmay Sonar", "P. R. Vaidyanathan" ], "venue": "ADT 2017 (Algorithmic Decision Theory, LNCS)", "year": 2017, "doi": "https://doi.org/10.1007/978-3-319-67504-6_9", "arxiv": null, "pdf": null, "talks": [ { "id": "structured-electorates", "title": "Efficient Algorithms for Hard Problems on Structured Electorates", "url": "https://talks.neeldhara.com/talks/structured-electorates/" }, { "id": "chamberlin-courant", "title": "Chamberlin–Courant on Restricted Domains", "url": "https://talks.neeldhara.com/talks/chamberlin-courant/" } ] }, { "title": "On the Complexity of Two Dots for Narrow Boards and Few Colors", "url": "https://doi.org/10.4230/LIPIcs.FUN.2018.7", "kind": "Paper", "shelf": "read", "by": "Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra", "note": "Follow-up: still hard with only 3 colours or 2 columns, but easy on one column with few goals.", "own": true, "authors": [ "Davide Bilò", "Luciano Gualà", "Stefano Leucci", "Neeldhara Misra" ], "venue": "FUN 2018 (LIPIcs 100)", "year": 2018, "doi": "https://doi.org/10.4230/LIPIcs.FUN.2018.7", "arxiv": null, "pdf": null, "talks": [ { "id": "two-dots", "title": "Two Dots is NP-complete", "url": "https://talks.neeldhara.com/talks/two-dots/" }, { "id": "trends-in-theory", "title": "Trends in Theory", "url": "https://talks.neeldhara.com/talks/trends-in-theory/" } ] }, { "title": "On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules", "url": "https://doi.org/10.24963/ijcai.2020/13", "kind": "Paper", "shelf": "read", "by": "Chinmay Sonar, Palash Dey, Neeldhara Misra", "note": null, "own": true, "authors": [ "Chinmay Sonar", "Palash Dey", "Neeldhara Misra" ], "venue": "IJCAI 2020", "year": 2020, "doi": "https://doi.org/10.24963/ijcai.2020/13", "arxiv": "https://arxiv.org/abs/2004.13933", "pdf": null, "talks": [ { "id": "chamberlin-courant", "title": "Chamberlin–Courant on Restricted Domains", "url": "https://talks.neeldhara.com/talks/chamberlin-courant/" }, { "id": "multiwinner-voting", "title": "Multiwinner Voting", "url": "https://talks.neeldhara.com/talks/multiwinner-voting/" } ] }, { "title": "On the Kernelization Complexity of Colorful Motifs", "url": "https://doi.org/10.1007/978-3-642-17493-3_4", "kind": "Paper", "shelf": "read", "by": "Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan", "note": "IPEC 2010", "own": true, "authors": [ "Abhimanyu M. Ambalath", "Radheshyam Balasundaram", "Chintan Rao H.", "Venkata Koppula", "Neeldhara Misra", "Geevarghese Philip", "M. S. Ramanujan" ], "venue": "IPEC 2010", "year": 2010, "doi": "https://doi.org/10.1007/978-3-642-17493-3_4", "arxiv": null, "pdf": null, "talks": [ { "id": "colorful-motifs", "title": "On the Kernelization Complexity of Colorful Motifs", "url": "https://talks.neeldhara.com/talks/colorful-motifs/" }, { "id": "phd-defense", "title": "Kernels for F-Deletion", "url": "https://talks.neeldhara.com/talks/phd-defense/" } ] }, { "title": "On the Structure of EFX Orientations on Graphs", "url": "https://arxiv.org/abs/2404.13527", "kind": "Paper", "shelf": "read", "by": "Jinghan A. Zeng, Ruta Mehta", "note": "Which graphs always admit EFX orientations.", "own": false, "talks": [ { "id": "envy-free-graphical", "title": "Envy-Free and Efficient Allocations for Graphical Valuations", "url": "https://talks.neeldhara.com/talks/envy-free-graphical/" }, { "id": "graphical-valuations", "title": "On Fairness with Graphical Valuations", "url": "https://talks.neeldhara.com/talks/graphical-valuations/" } ] }, { "title": "Parameterized complexity", "url": "https://en.wikipedia.org/wiki/Parameterized_complexity", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Solid overview of fixed-parameter tractability and the W-hierarchy.", "own": false, "talks": [ { "id": "cheat-sheets", "title": "Cheat Sheets for Hard Problems", "url": "https://talks.neeldhara.com/talks/cheat-sheets/" }, { "id": "fpt-intro", "title": "An Introduction to Parameterized Algorithms", "url": "https://talks.neeldhara.com/talks/fpt-intro/" } ] }, { "title": "Preference Elicitation For Single Crossing Domain", "url": "https://arxiv.org/abs/1604.05194", "kind": "Paper", "shelf": "read", "by": "Palash Dey, Neeldhara Misra", "note": null, "own": true, "authors": [ "Palash Dey", "Neeldhara Misra" ], "venue": "IJCAI 2016", "year": 2016, "doi": null, "arxiv": "https://arxiv.org/abs/1604.05194", "pdf": null, "talks": [ { "id": "structured-electorates", "title": "Efficient Algorithms for Hard Problems on Structured Electorates", "url": "https://talks.neeldhara.com/talks/structured-electorates/" }, { "id": "elicitation-sp-trees", "title": "Elicitation for Preferences Single Peaked on Trees", "url": "https://talks.neeldhara.com/talks/elicitation-sp-trees/" } ] }, { "title": "Protecting a Graph with Mobile Guards", "url": "https://arxiv.org/abs/1407.5228", "kind": "Survey", "shelf": "read", "by": "William F. Klostermeyer, Christina M. Mynhardt", "note": "A survey of eternal domination and eternal vertex cover.", "own": false, "talks": [ { "id": "games-pursuit-evasion", "title": "Games of Pursuit and Evasion", "url": "https://talks.neeldhara.com/talks/games-pursuit-evasion/" }, { "id": "eternal-vc", "title": "Eternal Versions of Vertex Cover and Dominating Set", "url": "https://talks.neeldhara.com/talks/eternal-vc/" } ] }, { "title": "Reductions: Problems as Hard as Clique (Dominating Set, Set Cover) (NPTEL Parameterized Algorithms, Week 12)", "url": "https://www.youtube.com/watch?v=ClIkYsMjON0", "kind": "Video", "shelf": "watch", "by": "NPTEL Parameterized Algorithms course (Neeldhara Misra and Saket Saurabh)", "note": "Why Dominating Set resists parameterization by solution size, via parameterized reductions.", "own": true, "talks": [ { "id": "r-dominating-diameter", "title": "Hardness of r-Dominating Set on Graphs of Diameter (r+1)", "url": "https://talks.neeldhara.com/talks/r-dominating-diameter/" }, { "id": "dominating-set-variants", "title": "Parameterized Algorithms for Variants of Dominating Set", "url": "https://talks.neeldhara.com/talks/dominating-set-variants/" } ] }, { "title": "Saket Saurabh: Parametrized Algorithms and possible future directions", "url": "https://www.youtube.com/watch?v=FxxmR9P1fPw", "kind": "Talk", "shelf": "watch", "by": "Saket Saurabh (Hausdorff Center for Mathematics)", "note": "Linked from the 2023 slides: an overview of where parameterized complexity research is heading.", "own": false, "talks": [ { "id": "cheat-sheets", "title": "Cheat Sheets for Hard Problems", "url": "https://talks.neeldhara.com/talks/cheat-sheets/" }, { "id": "fpt-intro", "title": "An Introduction to Parameterized Algorithms", "url": "https://talks.neeldhara.com/talks/fpt-intro/" } ] }, { "title": "Short Cycles make W-hard problems hard: FPT algorithms for W-hard Problems in Graphs with no short Cycles", "url": "https://www.imsc.res.in/~vraman/pub/algmcadometc.pdf", "kind": "Paper", "shelf": "read", "by": "Venkatesh Raman, Saket Saurabh", "note": "Dominating Set and variants become FPT without short cycles, but stay W[2]-hard on bipartite and split graphs.", "own": false, "talks": [ { "id": "r-dominating-diameter", "title": "Hardness of r-Dominating Set on Graphs of Diameter (r+1)", "url": "https://talks.neeldhara.com/talks/r-dominating-diameter/" }, { "id": "dominating-set-variants", "title": "Parameterized Algorithms for Variants of Dominating Set", "url": "https://talks.neeldhara.com/talks/dominating-set-variants/" } ] }, { "title": "Spartan Bipartite Graphs Are Essentially Elementary", "url": "https://doi.org/10.4230/LIPIcs.MFCS.2023.68", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Saraswati Girish Nanoti", "note": "Which bipartite graphs can be guarded with no more guards than a minimum vertex cover.", "own": true, "authors": [ "Neeldhara Misra", "Saraswati Girish Nanoti" ], "venue": "MFCS 2023 (LIPIcs 272)", "year": 2023, "doi": "https://doi.org/10.4230/LIPIcs.MFCS.2023.68", "arxiv": "https://arxiv.org/abs/2308.04548", "pdf": null, "talks": [ { "id": "games-pursuit-evasion", "title": "Games of Pursuit and Evasion", "url": "https://talks.neeldhara.com/talks/games-pursuit-evasion/" }, { "id": "eternal-vc", "title": "Eternal Versions of Vertex Cover and Dominating Set", "url": "https://talks.neeldhara.com/talks/eternal-vc/" } ] }, { "title": "Stable Marriage Problem - Numberphile", "url": "https://www.youtube.com/watch?v=Qcv1IqHWAzg", "kind": "Video", "shelf": "watch", "by": "Numberphile", "note": "An eight-minute, very watchable introduction to the problem and the proposal algorithm.", "own": false, "talks": [ { "id": "stable-matchings", "title": "On Stable Matchings", "url": "https://talks.neeldhara.com/talks/stable-matchings/" }, { "id": "matching-markets", "title": "Manipulation with(out) Money in Matching Markets", "url": "https://talks.neeldhara.com/talks/matching-markets/" } ] }, { "title": "The Cops and Robbers Theorem | Infinite Series", "url": "https://www.youtube.com/watch?v=9mJEu-j1KT0", "kind": "Video", "shelf": "watch", "by": "Kelsey Houston-Edwards, PBS Infinite Series", "note": "A ten-minute visual introduction to cop-win graphs and why some graphs need more cops.", "own": false, "talks": [ { "id": "games-we-play", "title": "The Games We Play", "url": "https://talks.neeldhara.com/talks/games-we-play/" }, { "id": "games-pursuit-evasion", "title": "Games of Pursuit and Evasion", "url": "https://talks.neeldhara.com/talks/games-pursuit-evasion/" } ] }, { "title": "The Fold-and-Cut Problem (Erik Demaine)", "url": "https://erikdemaine.org/foldcut/", "kind": "Reference", "shelf": "read", "by": "Erik Demaine", "note": "Erik Demaine's hub for the problem: history, the theorem, papers, and printable shapes to try.", "own": false, "talks": [ { "id": "recreational-math", "title": "Recreational Math and Science: In the Classrooms and Beyond", "url": "https://talks.neeldhara.com/talks/recreational-math/" }, { "id": "fold-cut", "title": "Geometric Puzzles: Fold and Cut", "url": "https://talks.neeldhara.com/talks/fold-cut/" } ] }, { "title": "The Game of Sim (playable)", "url": "https://game-of-sim.lovable.app/", "kind": "Game", "shelf": "play", "by": "Embedded in Neeldhara's slides", "note": "Two players colour lines between six dots; whoever completes a triangle in their own colour loses.", "own": false, "talks": [ { "id": "games-we-play", "title": "The Games We Play", "url": "https://talks.neeldhara.com/talks/games-we-play/" }, { "id": "games-pursuit-evasion", "title": "Games of Pursuit and Evasion", "url": "https://talks.neeldhara.com/talks/games-pursuit-evasion/" } ] }, { "title": "The illustrated guide to a Ph.D.", "url": "https://matt.might.net/articles/phd-school-in-pictures/", "kind": "Essay", "shelf": "read", "by": "Matt Might", "note": "What a PhD adds to the circle of human knowledge, in pictures.", "own": false, "talks": [ { "id": "grad-school", "title": "Being a Successful Grad Student", "url": "https://talks.neeldhara.com/talks/grad-school/" }, { "id": "women-careers", "title": "Career Opportunities for Women in Computing", "url": "https://talks.neeldhara.com/talks/women-careers/" } ] }, { "title": "The impossible chessboard puzzle", "url": "https://www.youtube.com/watch?v=wTJI_WuZSwE", "kind": "Video", "shelf": "watch", "by": "3Blue1Brown", "note": "The 64-square version of the rigged-bits trick, solved with XOR and a colouring of the hypercube.", "own": false, "talks": [ { "id": "two-tricks", "title": "Two Tricks", "url": "https://talks.neeldhara.com/talks/two-tricks/" }, { "id": "magical-mathematics", "title": "Magical Mathematics", "url": "https://talks.neeldhara.com/talks/magical-mathematics/" } ] }, { "title": "The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles", "url": "https://doi.org/10.1007/s00453-012-9681-z", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh", "note": null, "own": true, "authors": [ "Neeldhara Misra", "Geevarghese Philip", "Venkatesh Raman", "Saket Saurabh" ], "venue": "Algorithmica", "year": 2012, "doi": "https://doi.org/10.1007/s00453-012-9681-z", "arxiv": null, "pdf": null, "talks": [ { "id": "cds-short-cycles", "title": "Connected Dominating Set and Short Cycles", "url": "https://talks.neeldhara.com/talks/cds-short-cycles/" }, { "id": "dominating-set-variants", "title": "Parameterized Algorithms for Variants of Dominating Set", "url": "https://talks.neeldhara.com/talks/dominating-set-variants/" } ] }, { "title": "The Prize in Economic Sciences 2012: Popular information", "url": "https://www.nobelprize.org/prizes/economic-sciences/2012/popular-information/", "kind": "Article", "shelf": "read", "by": "Royal Swedish Academy of Sciences (NobelPrize.org)", "note": "Popular account of the prize to Roth and Shapley: stable allocations in theory and market design in practice.", "own": false, "talks": [ { "id": "stable-matchings", "title": "On Stable Matchings", "url": "https://talks.neeldhara.com/talks/stable-matchings/" }, { "id": "matching-markets", "title": "Manipulation with(out) Money in Matching Markets", "url": "https://talks.neeldhara.com/talks/matching-markets/" } ] }, { "title": "The United States and India: How Does Women’s Participation in Computing Differ?", "url": "https://ncwit.org/blog/the-united-states-and-india-how-does-womens-participation-in-computing-differ/", "kind": "Article", "shelf": "read", "by": "NCWIT", "note": "Two qualitative studies on why women's share of computing degrees rose in India while it fell in the US.", "own": false, "talks": [ { "id": "gender-programming", "title": "Gender Disparities in Programming Competence in India", "url": "https://talks.neeldhara.com/talks/gender-programming/" }, { "id": "women-careers", "title": "Career Opportunities for Women in Computing", "url": "https://talks.neeldhara.com/talks/women-careers/" } ] }, { "title": "Tournaments in Computational Social Choice: Recent Developments", "url": "https://www.ijcai.org/proceedings/2021/626", "kind": "Survey", "shelf": "read", "by": "Warut Suksompong", "note": "A short IJCAI survey of tournament solutions and single-elimination tournaments.", "own": false, "talks": [ { "id": "tournaments-intro", "title": "An Introduction to Tournaments", "url": "https://talks.neeldhara.com/talks/tournaments-intro/" }, { "id": "champion", "title": "How Many Matches Does It Take to Find a Champion?", "url": "https://talks.neeldhara.com/talks/champion/" } ] }, { "title": "Two Dots is NP-complete", "url": "https://doi.org/10.4230/LIPIcs.FUN.2016.24", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra", "note": "The open-access paper with the full reduction.", "own": true, "authors": [ "Neeldhara Misra" ], "venue": "FUN 2016 (LIPIcs 49)", "year": 2016, "doi": "https://doi.org/10.4230/LIPIcs.FUN.2016.24", "arxiv": null, "pdf": null, "talks": [ { "id": "two-dots", "title": "Two Dots is NP-complete", "url": "https://talks.neeldhara.com/talks/two-dots/" }, { "id": "trends-in-theory", "title": "Trends in Theory", "url": "https://talks.neeldhara.com/talks/trends-in-theory/" } ] }, { "title": "You and Your Research (transcript)", "url": "https://www.cs.virginia.edu/~robins/YouAndYourResearch.html", "kind": "Essay", "shelf": "read", "by": "Richard Hamming", "note": "The classic 1986 Bell Labs talk on why some researchers do great work, transcribed in full.", "own": false, "talks": [ { "id": "grad-school", "title": "Being a Successful Grad Student", "url": "https://talks.neeldhara.com/talks/grad-school/" }, { "id": "early-career", "title": "Early Career Researcher Presentation", "url": "https://talks.neeldhara.com/talks/early-career/" } ] }, { "title": "33 Miniatures Reading Group (recorded sessions)", "url": "https://www.youtube.com/playlist?list=PLadhlDF3zdvv81kngHfUoFR6n1iMj-7vk", "kind": "Video", "shelf": "watch", "by": "Neeldhara Misra", "note": "My 2023 reading group working through Matoušek's book one miniature at a time, in nearly thirty recorded sessions.", "own": true, "talks": [ { "id": "linear-algebra-methods", "title": "Linear Algebra Methods in Combinatorics", "url": "https://talks.neeldhara.com/talks/linear-algebra-methods/" } ] }, { "title": "6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs (Fall 2014)", "url": "https://courses.csail.mit.edu/6.890/fall14/", "kind": "Course", "shelf": "watch", "by": "Erik Demaine (MIT)", "note": "A full course, with lecture videos, on proving games and puzzles hard; the toolkit behind results like this one.", "own": false, "talks": [ { "id": "two-dots", "title": "Two Dots is NP-complete", "url": "https://talks.neeldhara.com/talks/two-dots/" } ] }, { "title": "A Constant-Factor Approximate Kernelization for Planar Vertex Deletion (STOC 2022 talk)", "url": "https://www.youtube.com/watch?v=dODVYEpGvJ0", "kind": "Video", "shelf": "watch", "by": "Bart M. P. Jansen and Michał Włodarczyk", "note": "Recent progress on the open direction of dropping planarity, for the case of planarization.", "own": false, "talks": [ { "id": "phd-defense", "title": "Kernels for F-Deletion", "url": "https://talks.neeldhara.com/talks/phd-defense/" } ] }, { "title": "A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents", "url": "https://arxiv.org/abs/1604.03655", "kind": "Paper", "shelf": "read", "by": "Haris Aziz, Simon Mackenzie", "note": "The 2016 breakthrough mentioned in the talk: a bounded envy-free protocol for any number of people.", "own": false, "talks": [ { "id": "cake-candy", "title": "The Math of Cutting Cake and Dividing Candy", "url": "https://talks.neeldhara.com/talks/cake-candy/" } ] }, { "title": "A New Kernel for Feedback Vertex Set (WorKer 2019)", "url": "https://www.youtube.com/watch?v=q94kGDNDkYo", "kind": "Video", "shelf": "watch", "by": "Yoichi Iwata", "note": "A later talk at the kernelization workshop series on newer FVS kernels.", "own": false, "talks": [ { "id": "kernelization-expansions", "title": "Expansions for Reductions", "url": "https://talks.neeldhara.com/talks/kernelization-expansions/" } ] }, { "title": "A Parameterized Perspective on Attacking and Defending Elections", "url": "https://doi.org/10.1007/978-3-030-48966-3_21", "kind": "Paper", "shelf": "read", "by": "Kishen N. Gowda, Neeldhara Misra, Vraj Patel", "note": null, "own": true, "authors": [ "Kishen N. Gowda", "Neeldhara Misra", "Vraj Patel" ], "venue": "IWOCA 2020 (Combinatorial Algorithms, LNCS)", "year": 2020, "doi": "https://doi.org/10.1007/978-3-030-48966-3_21", "arxiv": "https://arxiv.org/abs/2005.03176", "pdf": null, "talks": [ { "id": "protecting-elections", "title": "A Parameterized Perspective on Protecting and Attacking Elections", "url": "https://talks.neeldhara.com/talks/protecting-elections/" } ] }, { "title": "A Parameterized Perspective on Protecting Elections", "url": "https://doi.org/10.24963/ijcai.2019/34", "kind": "Paper", "shelf": "read", "by": "Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya", "note": null, "own": true, "authors": [ "Palash Dey", "Neeldhara Misra", "Swaprava Nath", "Garima Shakya" ], "venue": "IJCAI 2019", "year": 2019, "doi": "https://doi.org/10.24963/ijcai.2019/34", "arxiv": "https://arxiv.org/abs/1905.11838", "pdf": null, "talks": [ { "id": "protecting-elections", "title": "A Parameterized Perspective on Protecting and Attacking Elections", "url": "https://talks.neeldhara.com/talks/protecting-elections/" } ] }, { "title": "A short proof of the first selection lemma and weak 1/r-nets for moving points", "url": "https://arxiv.org/abs/1512.07505", "kind": "Preprint", "shelf": "read", "by": "Alexandre Rok, Shakhar Smorodinsky", "note": "A short, readable proof of the classical first selection lemma for simplices.", "own": false, "talks": [ { "id": "hitting-piercing-rectangles", "title": "Hitting and Piercing Rectangles Induced by a Point Set", "url": "https://talks.neeldhara.com/talks/hitting-piercing-rectangles/" } ] }, { "title": "A Simple Randomized FPT Algorithm for FVS (NPTEL Parameterized Algorithms, mod04lec16)", "url": "https://www.youtube.com/watch?v=fsCw6ow0tO8", "kind": "Video", "shelf": "watch", "by": "NPTEL course by Neeldhara Misra and Saket Saurabh", "note": "Lecture on the random-edge algorithm for Feedback Vertex Set that the talk starts from.", "own": true, "talks": [ { "id": "planar-f-deletion", "title": "From FVS to Planar F-Deletion", "url": "https://talks.neeldhara.com/talks/planar-f-deletion/" } ] }, { "title": "A survey of parameterized algorithms and the complexity of edge modification", "url": "https://arxiv.org/abs/2001.06867", "kind": "Survey", "shelf": "read", "by": "Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach", "note": "Comprehensive later survey of edge modification problems.", "own": false, "talks": [ { "id": "pgm", "title": "Parameterized Graph Modification: A Modern Perspective", "url": "https://talks.neeldhara.com/talks/pgm/" } ] }, { "title": "A world from a sheet of paper - Tadashi Tokieda", "url": "https://www.youtube.com/watch?v=8p02DtmyQhU", "kind": "Video", "shelf": "watch", "by": "Tadashi Tokieda, Oxford Mathematics", "note": "A public lecture full of surprising paper toys and the mathematics inside them.", "own": false, "talks": [ { "id": "recreational-math", "title": "Recreational Math and Science: In the Classrooms and Beyond", "url": "https://talks.neeldhara.com/talks/recreational-math/" } ] }, { "title": "abcvoting", "url": "https://github.com/martinlackner/abcvoting", "kind": "Code", "shelf": "use", "by": "Martin Lackner and contributors", "note": "Python library implementing approval-based committee rules; handy for experiments.", "own": false, "talks": [ { "id": "multiwinner-voting", "title": "Multiwinner Voting", "url": "https://talks.neeldhara.com/talks/multiwinner-voting/" } ] }, { "title": "Academia Stack Exchange", "url": "https://academia.stackexchange.com/", "kind": "Reference", "shelf": "read", "by": "Stack Exchange community", "note": "Questions and answers on every stage of an academic career; on the 2013 reading list.", "own": false, "talks": [ { "id": "career-academia", "title": "A Career in Academia: Why and Why Not?", "url": "https://talks.neeldhara.com/talks/career-academia/" } ] }, { "title": "ACM-W India", "url": "https://acmwindia.acm.org/", "kind": "Reference", "shelf": "read", "by": "ACM India", "note": "Mentoring programmes for women in computing in India, including the annual Grad Cohort workshop.", "own": false, "talks": [ { "id": "women-careers", "title": "Career Opportunities for Women in Computing", "url": "https://talks.neeldhara.com/talks/women-careers/" } ] }, { "title": "ADFOCS 2013 lecture material: Parameterized Algorithms using Matroids", "url": "https://conferences.mpi-inf.mpg.de/adfocs13/material.html", "kind": "Lecture notes", "shelf": "read", "by": "Saket Saurabh (ADFOCS 2013)", "note": "Slides and exercise sheets from the ADFOCS 2013 course of the same name: matroid basics, representative sets, advanced applications.", "own": false, "talks": [ { "id": "matroids-repsets", "title": "Parameterized Algorithms using Matroids", "url": "https://talks.neeldhara.com/talks/matroids-repsets/" } ] }, { "title": "Algorithmic and Hardness Results for the Colorful Components Problems", "url": "https://arxiv.org/abs/1311.1298", "kind": "Preprint", "shelf": "read", "by": "Anna Adamaszek, Alexandru Popa", "note": "Classical complexity and approximability of three colorful-components objectives.", "own": false, "talks": [ { "id": "colorful-components", "title": "Structural Parameterizations for Colorful Components", "url": "https://talks.neeldhara.com/talks/colorful-components/" } ] }, { "title": "Algorithmic Lower Bounds: Fun with Hardness Proofs (MIT 6.890)", "url": "https://ocw.mit.edu/courses/6-890-algorithmic-lower-bounds-fun-with-hardness-proofs-fall-2014/", "kind": "Course", "shelf": "watch", "by": "Erik Demaine (MIT OpenCourseWare)", "note": "Full video course on proving games and puzzles NP-hard and PSPACE-hard.", "own": false, "talks": [ { "id": "trends-in-theory", "title": "Trends in Theory", "url": "https://talks.neeldhara.com/talks/trends-in-theory/" } ] }, { "title": "Algorithms", "url": "https://jeffe.cs.illinois.edu/teaching/algorithms/", "kind": "Book", "shelf": "read", "by": "Jeff Erickson", "note": "A free, rigorous textbook for turning puzzle-solving instincts into algorithm design.", "own": false, "talks": [ { "id": "algorithmic-puzzles", "title": "A Few Algorithmic Puzzles (and Why You Should Care)", "url": "https://talks.neeldhara.com/talks/algorithmic-puzzles/" } ] }, { "title": "An algebraic proof of the Erdős–Ko–Rado theorem for intersecting families of perfect matchings", "url": "https://arxiv.org/abs/1506.08770", "kind": "Preprint", "shelf": "read", "by": "Chris Godsil, Karen Meagher", "note": "An algebraic proof for perfect matchings (r = n), the case the talk's theorem leaves out.", "own": false, "talks": [ { "id": "ekr-matchings", "title": "An Erdős–Ko–Rado Theorem for Matchings", "url": "https://talks.neeldhara.com/talks/ekr-matchings/" } ] }, { "title": "An Erdős–Ko–Rado theorem for matchings in the complete graph", "url": "https://doi.org/10.1007/978-88-7642-475-5_98", "kind": "Paper", "shelf": "read", "by": "Vikram Kamat, Neeldhara Misra", "note": "The paper behind the talk: a short, self-contained proof via Baranyai partitions and a Katona-style count.", "own": true, "authors": [ "Vikram Kamat", "Neeldhara Misra" ], "venue": "EuroComb 2013", "year": 2013, "doi": "https://doi.org/10.1007/978-88-7642-475-5_98", "arxiv": "https://arxiv.org/abs/1303.4061", "pdf": null, "talks": [ { "id": "ekr-matchings", "title": "An Erdős–Ko–Rado Theorem for Matchings", "url": "https://talks.neeldhara.com/talks/ekr-matchings/" } ] }, { "title": "An Introduction to Cake-Cutting (ACM Summer School on Algorithmic Game Theory 2019)", "url": "https://www.youtube.com/watch?v=yV7oLK3gkPM", "kind": "Video", "shelf": "watch", "by": "Siddharth Barman", "note": "Summer-school lecture introducing cake cutting, a natural next step after this talk.", "own": false, "talks": [ { "id": "fair-division-directions", "title": "Current Research Directions in Fair Division", "url": "https://talks.neeldhara.com/talks/fair-division-directions/" } ] }, { "title": "An Optimal Algorithm for Finding Champions in Tournament Graphs", "url": "https://arxiv.org/abs/2111.13621", "kind": "Preprint", "shelf": "read", "by": "Lorenzo Beretta, Franco Maria Nardini, Roberto Trani, Rossano Venturini", "note": "Related recent work: finding the Copeland winner of a round-robin while playing few matches.", "own": false, "talks": [ { "id": "champion", "title": "How Many Matches Does It Take to Find a Champion?", "url": "https://talks.neeldhara.com/talks/champion/" } ] }, { "title": "Anatomy: a skill for Claude Code", "url": "https://skills.wheresryan.sh/anatomy", "kind": "Tool", "shelf": "use", "by": "Ryan (wheresryan.sh)", "note": "Turns a one-line prompt into an interactive isometric machine; the talk's example of AI-built explorables.", "own": false, "talks": [ { "id": "joyful-interactives", "title": "Building Joyful Interactives", "url": "https://talks.neeldhara.com/talks/joyful-interactives/" } ] }, { "title": "Apache DataSketches", "url": "https://datasketches.apache.org/", "kind": "Tool", "shelf": "use", "by": "Apache Software Foundation", "note": "Open-source library of production streaming sketches (HLL, KLL quantiles, frequent items), mentioned in the talk.", "own": false, "talks": [ { "id": "streaming-intro", "title": "A Gentle Introduction to Streaming Algorithms", "url": "https://talks.neeldhara.com/talks/streaming-intro/" } ] }, { "title": "Approximating Maximum Edge 2-Coloring by Normalizing Graphs", "url": "https://arxiv.org/abs/2403.06691", "kind": "Preprint", "shelf": "read", "by": "Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze", "note": "Recent approximation results: ratio 1.625 for graphs with a perfect matching, and 1.5 for claw-free or subcubic graphs.", "own": false, "talks": [ { "id": "max-edge-coloring", "title": "An FPT Algorithm for Maximum Edge Coloring", "url": "https://talks.neeldhara.com/talks/max-edge-coloring/" } ] }, { "title": "Backdoors into Heterogeneous Classes of SAT and CSP", "url": "https://doi.org/10.1609/aaai.v28i1.9111", "kind": "Paper", "shelf": "read", "by": "Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Živný", "note": "Backdoors whose assignments may land in different tractable classes.", "own": true, "authors": [ "Serge Gaspers", "Neeldhara Misra", "Sebastian Ordyniak", "Stefan Szeider", "Stanislav Živný" ], "venue": "AAAI 2014", "year": 2014, "doi": "https://doi.org/10.1609/aaai.v28i1.9111", "arxiv": "https://arxiv.org/abs/1509.05725", "pdf": null, "talks": [ { "id": "research-overview", "title": "Algorithms for Planar F-Deletion and Satisfiability", "url": "https://talks.neeldhara.com/talks/research-overview/" } ] }, { "title": "Backdoors to Satisfaction", "url": "https://arxiv.org/abs/1110.6387", "kind": "Survey", "shelf": "read", "by": "Serge Gaspers, Stefan Szeider", "note": "Readable survey of backdoor sets for SAT from the parameterized point of view.", "own": false, "talks": [ { "id": "research-overview", "title": "Algorithms for Planar F-Deletion and Satisfiability", "url": "https://talks.neeldhara.com/talks/research-overview/" } ] }, { "title": "Backdoors to Typical Case Complexity (Beyond Worst Case Analysis workshop, 2011)", "url": "https://www.youtube.com/watch?v=Yu0yK5lBve4", "kind": "Video", "shelf": "watch", "by": "Ryan Williams", "note": "One of the originators of backdoors explains how they may account for the success of SAT solvers.", "own": false, "talks": [ { "id": "research-overview", "title": "Algorithms for Planar F-Deletion and Satisfiability", "url": "https://talks.neeldhara.com/talks/research-overview/" } ] }, { "title": "Baranyai's theorem", "url": "https://en.wikipedia.org/wiki/Baranyai%27s_theorem", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Its r = 2 case, splitting the edges of K_{2n} into perfect matchings, is the 'Baranyai partition' the proof builds its cycles from.", "own": false, "talks": [ { "id": "ekr-matchings", "title": "An Erdős–Ko–Rado Theorem for Matchings", "url": "https://talks.neeldhara.com/talks/ekr-matchings/" } ] }, { "title": "Bartosz Ciechanowski", "url": "https://ciechanow.ski/", "kind": "Interactive", "shelf": "play", "by": "Bartosz Ciechanowski", "note": "Long-form interactive articles on how everyday things work.", "own": false, "talks": [ { "id": "explorables", "title": "Explorable Explanations: Interactive Essays", "url": "https://talks.neeldhara.com/talks/explorables/" } ] }, { "title": "Beyond the Worst-Case Analysis of Algorithms (Introduction)", "url": "https://arxiv.org/abs/2007.13241", "kind": "Survey", "shelf": "read", "by": "Tim Roughgarden", "note": "Introduction to the book that surveys alternatives to worst-case analysis, the 'beyond' of the talk's title.", "own": false, "talks": [ { "id": "history-algorithms", "title": "History of Algorithms: The Worst Case and Beyond", "url": "https://talks.neeldhara.com/talks/history-algorithms/" } ] }, { "title": "Bidimensionality and Kernels", "url": "https://arxiv.org/abs/1606.05689", "kind": "Paper", "shelf": "read", "by": "Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos", "note": "Linear kernels for many bidimensional problems on graphs excluding a fixed minor, via protrusion-style reductions.", "own": false, "talks": [ { "id": "protrusions", "title": "Protrusion Reduction Techniques", "url": "https://talks.neeldhara.com/talks/protrusions/" } ] }, { "title": "Branch-and-cut algorithms for colorful components problems", "url": "https://arxiv.org/abs/2408.16508", "kind": "Preprint", "shelf": "read", "by": "Claudia Archetti, Martina Cerulli, Carmine Sorgente", "note": "Exact integer-programming methods for these problems, with computational experiments.", "own": false, "talks": [ { "id": "colorful-components", "title": "Structural Parameterizations for Colorful Components", "url": "https://talks.neeldhara.com/talks/colorful-components/" } ] }, { "title": "Bribery and Control in Stable Marriage", "url": "https://arxiv.org/abs/2007.04948", "kind": "Paper", "shelf": "read", "by": "Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier", "note": "Closely related study of bribery and control in stable marriage, with parameterized results.", "own": false, "talks": [ { "id": "matching-markets", "title": "Manipulation with(out) Money in Matching Markets", "url": "https://talks.neeldhara.com/talks/matching-markets/" } ] }, { "title": "Cake Cutting (Harvard CS 1360, Lecture 10 notes)", "url": "https://procaccia.info/courses/CS1360-S26/notes10.pdf", "kind": "Lecture notes", "shelf": "read", "by": "Ariel Procaccia (scribes Rhea Acharya, Jakob de Raaij)", "note": "Clear lecture notes on cake-cutting algorithms and their complexity.", "own": false, "talks": [ { "id": "cake-candy", "title": "The Math of Cutting Cake and Dividing Candy", "url": "https://talks.neeldhara.com/talks/cake-candy/" } ] }, { "title": "Cantor set", "url": "https://en.wikipedia.org/wiki/Cantor_set", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Remove middle thirds forever: a set with no length that is still as large as the real line.", "own": false, "talks": [ { "id": "recreational-math", "title": "Recreational Math and Science: In the Classrooms and Beyond", "url": "https://talks.neeldhara.com/talks/recreational-math/" } ] }, { "title": "Chess Is Hard Even for a Single Player", "url": "https://doi.org/10.4230/LIPIcs.FUN.2022.5", "kind": "Paper", "shelf": "read", "by": "N. R. Aravind, Neeldhara Misra, Harshil Mittal", "note": "The paper behind the Solo Chess segment: the generalized puzzle is NP-complete.", "own": true, "authors": [ "N. R. Aravind", "Neeldhara Misra", "Harshil Mittal" ], "venue": "FUN 2022 (LIPIcs 226)", "year": 2022, "doi": "https://doi.org/10.4230/LIPIcs.FUN.2022.5", "arxiv": "https://arxiv.org/abs/2203.14864", "pdf": null, "talks": [ { "id": "games-we-play", "title": "The Games We Play", "url": "https://talks.neeldhara.com/talks/games-we-play/" } ] }, { "title": "Chromatic Coding for Feedback Arc Set on Tournaments (NPTEL Parameterized Algorithms, Week 4)", "url": "https://www.youtube.com/watch?v=xpH9kH3OCuw", "kind": "Video", "shelf": "watch", "by": "NPTEL Parameterized Algorithms course (Neeldhara Misra and Saket Saurabh)", "note": "A 46-minute lecture on the same material: the FAST kernel and chromatic coding.", "own": true, "talks": [ { "id": "fast-tournaments", "title": "Random Explorations in Algorithms for Feedback Set Problems on Tournaments", "url": "https://talks.neeldhara.com/talks/fast-tournaments/" } ] }, { "title": "Color Coding for Longest Path (NPTEL Parameterized Algorithms, Week 4)", "url": "https://www.youtube.com/watch?v=_4opS8Hpvc0", "kind": "Video", "shelf": "watch", "by": "NPTEL Parameterized Algorithms course (Neeldhara Misra and Saket Saurabh)", "note": "The randomized technique behind the talk's k^{O(k)} algorithm for MEC.", "own": true, "talks": [ { "id": "colorful-components", "title": "Structural Parameterizations for Colorful Components", "url": "https://talks.neeldhara.com/talks/colorful-components/" } ] }, { "title": "Color Coding: Variations and Applications (AofA 2010 slides)", "url": "https://www.dmg.tuwien.ac.at/aofa10/alon.pdf", "kind": "Talk", "shelf": "watch", "by": "Noga Alon", "note": "Slides by a co-inventor of chromatic coding, placing FAST within the color-coding family.", "own": false, "talks": [ { "id": "fast-tournaments", "title": "Random Explorations in Algorithms for Feedback Set Problems on Tournaments", "url": "https://talks.neeldhara.com/talks/fast-tournaments/" } ] }, { "title": "Combination Can Be Hard: Approximability of the Unique Coverage Problem", "url": "https://erikdemaine.org/papers/UniqueCoverage_SICOMP/", "kind": "Paper", "shelf": "read", "by": "Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour", "note": "The approximation side of Unique Coverage: maximize the number of elements covered exactly once.", "own": false, "talks": [ { "id": "unique-covering", "title": "Unique Covering Problems with Geometric Sets", "url": "https://talks.neeldhara.com/talks/unique-covering/" } ] }, { "title": "Combinatorial Game Suite (CGSuite)", "url": "https://www.cgsuite.org/", "kind": "Tool", "shelf": "use", "by": "Aaron Siegel and contributors", "note": "Free software for exploring and computing values of combinatorial games such as Hackenbush and Domineering.", "own": false, "talks": [ { "id": "nim-hackenbush", "title": "Nim, Hackenbush, and Friends", "url": "https://talks.neeldhara.com/talks/nim-hackenbush/" } ] }, { "title": "Combinatorial Games, Theory and Applications", "url": "https://academic.timwylie.com/19CSCI4341F/Combinatorial-Games-Theory-and-Applications.pdf", "kind": "Lecture notes", "shelf": "read", "by": "Brit C. A. Milvang-Jensen", "note": "A thesis-length introduction to Nim, Domineering, Sprague–Grundy and games as numbers.", "own": false, "talks": [ { "id": "nim-hackenbush", "title": "Nim, Hackenbush, and Friends", "url": "https://talks.neeldhara.com/talks/nim-hackenbush/" } ] }, { "title": "Complexity of Games (CoG) compendium", "url": "https://www.isnphard.com/", "kind": "Reference", "shelf": "read", "by": "Complexity of Games project", "note": "Open, community-maintained index of known hardness results for games and puzzles.", "own": false, "talks": [ { "id": "trends-in-theory", "title": "Trends in Theory", "url": "https://talks.neeldhara.com/talks/trends-in-theory/" } ] }, { "title": "Computational Boundaries for Escaping Rectangles (ESA 2026)", "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2026.49", "kind": "Paper", "shelf": "read", "by": "Akanksha Agrawal, Pradeesha Ashok, Matthias Bentert, Satyabrata Jana, Abhishek Sahu, Saket Saurabh, Kushal Singanporia", "note": "Recent work settling several open complexity questions about Rectangle Escape and its restricted-direction variants.", "own": false, "talks": [ { "id": "rectangle-escape", "title": "On the d-Runaway Rectangle Escape Problem", "url": "https://talks.neeldhara.com/talks/rectangle-escape/" } ] }, { "title": "Computational Social Choice (lecture series)", "url": "https://www.youtube.com/playlist?list=PLOfTMPqb4h4YpejIw7acMsdUnBm51a-FD", "kind": "Video", "shelf": "watch", "by": "Felix Brandt", "note": "A full recorded course from TU Munich, from voting rules and axioms to strategic manipulation; a free book draft accompanies it.", "own": false, "talks": [ { "id": "comsoc-intro", "title": "An Introduction to Computational Social Choice", "url": "https://talks.neeldhara.com/talks/comsoc-intro/" } ] }, { "title": "Computational Social Choice Lecture 8 (Top Cycle)", "url": "https://www.youtube.com/watch?v=-FkgTd7dPEY", "kind": "Video", "shelf": "watch", "by": "Felix Brandt", "note": "Course lecture whose segments from 8:52 cover 'The Many Faces of Kemeny's Rule' and 'Computing Kemeny Rankings'.", "own": false, "talks": [ { "id": "kemeny", "title": "Parameterized Approaches to Kemeny Rank Aggregation", "url": "https://talks.neeldhara.com/talks/kemeny/" } ] }, { "title": "Computer Scientists Invent an Efficient New Way to Count", "url": "https://www.quantamagazine.org/computer-scientists-invent-an-efficient-new-way-to-count-20240516/", "kind": "Article", "shelf": "read", "by": "Steve Nadis (Quanta Magazine)", "note": "Popular account of the CVM algorithm, explained by counting the distinct words in Hamlet with a whiteboard and coin flips.", "own": false, "talks": [ { "id": "streaming-intro", "title": "A Gentle Introduction to Streaming Algorithms", "url": "https://talks.neeldhara.com/talks/streaming-intro/" } ] }, { "title": "COMSOC Video Seminar", "url": "https://sites.google.com/view/comsoc-seminar/", "kind": "Reference", "shelf": "read", "by": "COMSOC Video Seminar organisers", "note": "Seminar home page; its archive lists the 22 May 2020 rump session with all ten speakers and the video.", "own": false, "talks": [ { "id": "fair-division-minimal-sharing", "title": "Fair Division with Minimal Sharing", "url": "https://talks.neeldhara.com/talks/fair-division-minimal-sharing/" } ] }, { "title": "Connected dominating set (Wikipedia)", "url": "https://en.wikipedia.org/wiki/Connected_dominating_set", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Definitions, complementarity with max-leaf spanning trees, and applications.", "own": false, "talks": [ { "id": "cds-short-cycles", "title": "Connected Dominating Set and Short Cycles", "url": "https://talks.neeldhara.com/talks/cds-short-cycles/" } ] }, { "title": "Cop-win graph", "url": "https://en.wikipedia.org/wiki/Cop-win_graph", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Dismantlable graphs and why exactly these are the graphs where one cop always wins.", "own": false, "talks": [ { "id": "games-pursuit-evasion", "title": "Games of Pursuit and Evasion", "url": "https://talks.neeldhara.com/talks/games-pursuit-evasion/" } ] }, { "title": "Creating a Website (Quarto guide)", "url": "https://quarto.org/docs/websites/", "kind": "Tool", "shelf": "use", "by": "Quarto (Posit)", "note": "Official walkthrough for turning a folder of Markdown files into a website.", "own": false, "talks": [ { "id": "personal-website", "title": "Building a Personal Website", "url": "https://talks.neeldhara.com/talks/personal-website/" } ] }, { "title": "CS Research 101 (NPTEL lecture series)", "url": "https://www.youtube.com/playlist?list=PLjkVkDqZ8USZPKF5QYPVO3xl7kD6CqaX2", "kind": "Course", "shelf": "watch", "by": "Neeldhara Misra and Shashank Srikant", "note": "A five-part live lecture series I co-ran on why and how to do CS research, for students who want more depth.", "own": true, "talks": [ { "id": "grad-school", "title": "Being a Successful Grad Student", "url": "https://talks.neeldhara.com/talks/grad-school/" } ] }, { "title": "CS607: Combinatorics with Applications in Computer Science (2024)", "url": "https://www.neeldhara.com/courses/2024/01-cs607/", "kind": "Course", "shelf": "watch", "by": "Neeldhara Misra", "note": "My IITGN course that leans on linear algebra methods: Oddtown and Eventown, intersecting families, two-distance sets, equiangular lines and more.", "own": true, "talks": [ { "id": "linear-algebra-methods", "title": "Linear Algebra Methods in Combinatorics", "url": "https://talks.neeldhara.com/talks/linear-algebra-methods/" } ] }, { "title": "Data Reduction and Problem Kernels (Dagstuhl Seminar 12241 report)", "url": "https://doi.org/10.4230/DagRep.2.6.26", "kind": "Reference", "shelf": "read", "by": "Michael R. Fellows, Jiong Guo, Dániel Marx, Saket Saurabh (eds.)", "note": "Report of the seminar where this talk was given, with abstracts of companion talks on Planar F-Deletion.", "own": false, "talks": [ { "id": "planar-f-deletion", "title": "From FVS to Planar F-Deletion", "url": "https://talks.neeldhara.com/talks/planar-f-deletion/" } ] }, { "title": "Data Stream Algorithms: Lecture Notes", "url": "https://www.cs.dartmouth.edu/~ac/Teach/data-streams-lecnotes.pdf", "kind": "Lecture notes", "shelf": "read", "by": "Amit Chakrabarti", "note": "Free, regularly updated book-length notes: Misra–Gries, distinct elements, approximate counting, frequency moments and sketches.", "own": false, "talks": [ { "id": "streaming-intro", "title": "A Gentle Introduction to Streaming Algorithms", "url": "https://talks.neeldhara.com/talks/streaming-intro/" } ] }, { "title": "David's de Bruijn sequence card trick", "url": "https://aperiodical.com/2012/08/davids-de-bruijn-sequence-card-trick/", "kind": "Article", "shelf": "read", "by": "Christian Lawson-Perfect, The Aperiodical", "note": "A video of the de Bruijn card trick plus a full explanation; the trick comes from Diaconis and Graham's Magical Mathematics.", "own": false, "talks": [ { "id": "magical-mathematics", "title": "Magical Mathematics", "url": "https://talks.neeldhara.com/talks/magical-mathematics/" } ] }, { "title": "de Bruijn Card Trick", "url": "https://www.youtube.com/watch?v=EWG6e-yBL94", "kind": "Video", "shelf": "watch", "by": "singingbanana (James Grime)", "note": "A short demonstration and explanation of a mind-reading card trick powered by a de Bruijn sequence.", "own": false, "talks": [ { "id": "two-tricks", "title": "Two Tricks", "url": "https://talks.neeldhara.com/talks/two-tricks/" } ] }, { "title": "Deleting to Structured Trees", "url": "https://doi.org/10.1007/978-3-030-26176-4_11", "kind": "Paper", "shelf": "read", "by": "Pratyush Dayal, Neeldhara Misra", "note": "The full version, with both hardness reductions and the branching algorithm.", "own": true, "authors": [ "Pratyush Dayal", "Neeldhara Misra" ], "venue": "COCOON 2019", "year": 2019, "doi": "https://doi.org/10.1007/978-3-030-26176-4_11", "arxiv": "https://arxiv.org/abs/1912.12765", "pdf": null, "talks": [ { "id": "deleting-structured-trees", "title": "Deleting to Structured Trees", "url": "https://talks.neeldhara.com/talks/deleting-structured-trees/" } ] }, { "title": "Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets", "url": "https://doi.org/10.1137/140981290", "kind": "Paper", "shelf": "read", "by": "Prachi Goyal, Neeldhara Misra, Fahad Panolan, Meirav Zehavi", "note": null, "own": true, "authors": [ "Prachi Goyal", "Neeldhara Misra", "Fahad Panolan", "Meirav Zehavi" ], "venue": "SIAM Journal on Discrete Mathematics", "year": 2015, "doi": "https://doi.org/10.1137/140981290", "arxiv": null, "pdf": null, "talks": [ { "id": "matroids-repsets", "title": "Parameterized Algorithms using Matroids", "url": "https://talks.neeldhara.com/talks/matroids-repsets/" } ] }, { "title": "Distinct Elements in Streams and the Klee's Measure Problem", "url": "https://www.youtube.com/watch?v=hvcGl8ER9bY", "kind": "Talk", "shelf": "watch", "by": "Sourav Chakraborty (CSA, IISc seminar)", "note": "One of the CVM authors explains the algorithm and where it came from.", "own": false, "talks": [ { "id": "streaming-intro", "title": "A Gentle Introduction to Streaming Algorithms", "url": "https://talks.neeldhara.com/talks/streaming-intro/" } ] }, { "title": "Distinct Elements in Streams: An Algorithm for the (Text) Book", "url": "https://arxiv.org/abs/2301.10191", "kind": "Paper", "shelf": "read", "by": "Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel", "note": "The sampling-based distinct-elements algorithm at the heart of the talk, with a proof aimed at undergraduates.", "own": false, "talks": [ { "id": "streaming-intro", "title": "A Gentle Introduction to Streaming Algorithms", "url": "https://talks.neeldhara.com/talks/streaming-intro/" } ] }, { "title": "Diversity in Kemeny Rank Aggregation: A Parameterized Approach", "url": "https://arxiv.org/abs/2105.09413", "kind": "Paper", "shelf": "read", "by": "Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf", "note": "The IJCAI 2021 paper most of the talk is based on.", "own": false, "talks": [ { "id": "kemeny", "title": "Parameterized Approaches to Kemeny Rank Aggregation", "url": "https://talks.neeldhara.com/talks/kemeny/" } ] }, { "title": "Doing It in Public", "url": "https://doingitinpublic.com/", "kind": "Book", "shelf": "read", "by": "Nicole van der Hoeven", "note": "A book, written in public, on learning in public, cited for documenting learning journeys.", "own": false, "talks": [ { "id": "personal-website", "title": "Building a Personal Website", "url": "https://talks.neeldhara.com/talks/personal-website/" } ] }, { "title": "Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity", "url": "https://doi.org/10.1613/jair.2467", "kind": "Paper", "shelf": "read", "by": "Sylvain Bouveret, Jérôme Lang", "note": "Classic results on the complexity of finding allocations that are both envy-free and efficient (JAIR 2008).", "own": false, "talks": [ { "id": "amicable-agents", "title": "Fair Division is Hard even for Amicable Agents", "url": "https://talks.neeldhara.com/talks/amicable-agents/" } ] }, { "title": "Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms", "url": "https://arxiv.org/abs/1304.4626", "kind": "Paper", "shelf": "read", "by": "Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh", "note": "Fast algorithms for computing representative families, and their use for single-exponential algorithms.", "own": false, "talks": [ { "id": "matroids-repsets", "title": "Parameterized Algorithms using Matroids", "url": "https://talks.neeldhara.com/talks/matroids-repsets/" } ] }, { "title": "Eliciting Single-Peaked Preferences Using Comparison Queries", "url": "https://jair.org/index.php/jair/article/view/10607", "kind": "Paper", "shelf": "read", "by": "Vincent Conitzer", "note": "The starting point: eliciting single-peaked preferences on a line with few comparison queries (JAIR 2009).", "own": false, "talks": [ { "id": "elicitation-sp-trees", "title": "Elicitation for Preferences Single Peaked on Trees", "url": "https://talks.neeldhara.com/talks/elicitation-sp-trees/" } ] }, { "title": "Engineering Motif Search for Large Graphs (Simons Institute, 2015)", "url": "https://www.youtube.com/watch?v=glB5rCdhJ-U", "kind": "Video", "shelf": "watch", "by": "Petteri Kaski", "note": "How motif search algorithms are engineered to run on large real graphs.", "own": false, "talks": [ { "id": "colorful-motifs", "title": "On the Kernelization Complexity of Colorful Motifs", "url": "https://talks.neeldhara.com/talks/colorful-motifs/" } ] }, { "title": "Envy-Free Allocations Respecting Social Networks", "url": "https://arxiv.org/abs/2011.11596", "kind": "Paper", "shelf": "read", "by": "Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier", "note": "Envy-freeness on directed social networks (AAMAS 2018, Artificial Intelligence 2022); key prior work in the talk.", "own": false, "talks": [ { "id": "fair-division-binary-social", "title": "On Fair Division with Binary Valuations Respecting Social Networks", "url": "https://talks.neeldhara.com/talks/fair-division-binary-social/" } ] }, { "title": "Erdős–Ko–Rado theorem", "url": "https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93Ko%E2%80%93Rado_theorem", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "The theorem being generalized, with a clear account of Katona's cycle proof.", "own": false, "talks": [ { "id": "ekr-matchings", "title": "An Erdős–Ko–Rado Theorem for Matchings", "url": "https://talks.neeldhara.com/talks/ekr-matchings/" } ] }, { "title": "Eternal dominating set", "url": "https://en.wikipedia.org/wiki/Eternal_dominating_set", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Overview of eternal domination and its variants, including eternal vertex cover and grid results.", "own": false, "talks": [ { "id": "eternal-vc", "title": "Eternal Versions of Vertex Cover and Dominating Set", "url": "https://talks.neeldhara.com/talks/eternal-vc/" } ] }, { "title": "Exact cover", "url": "https://en.wikipedia.org/wiki/Exact_cover", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "The classic problem, with examples from puzzles such as Sudoku and pentomino tilings.", "own": false, "talks": [ { "id": "unique-covering", "title": "Unique Covering Problems with Geometric Sets", "url": "https://talks.neeldhara.com/talks/unique-covering/" } ] }, { "title": "Exact Multi-Covering Problems with Geometric Sets", "url": "https://doi.org/10.1007/s00224-021-10050-z", "kind": "Paper", "shelf": "read", "by": "Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh", "note": "Journal version, extended from exact cover to covering every element an exact number of times.", "own": true, "authors": [ "Pradeesha Ashok", "Sudeshna Kolay", "Neeldhara Misra", "Saket Saurabh" ], "venue": "Theory of Computing Systems", "year": 2021, "doi": "https://doi.org/10.1007/s00224-021-10050-z", "arxiv": null, "pdf": null, "talks": [ { "id": "unique-covering", "title": "Unique Covering Problems with Geometric Sets", "url": "https://talks.neeldhara.com/talks/unique-covering/" } ] }, { "title": "Explorable Explanations (explorabl.es)", "url": "https://explorabl.es/", "kind": "Interactive", "shelf": "play", "by": "A community of artists, coders and educators", "note": "A hub for learning through play: explorables by subject, plus how to make your own.", "own": false, "talks": [ { "id": "explorables", "title": "Explorable Explanations: Interactive Essays", "url": "https://talks.neeldhara.com/talks/explorables/" } ] }, { "title": "Fair cake-cutting", "url": "https://en.wikipedia.org/wiki/Fair_cake-cutting", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "A good map of fairness notions and procedures, from cut-and-choose onwards.", "own": false, "talks": [ { "id": "cake-candy", "title": "The Math of Cutting Cake and Dividing Candy", "url": "https://talks.neeldhara.com/talks/cake-candy/" } ] }, { "title": "Fair division", "url": "https://en.wikipedia.org/wiki/Fair_division", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Broad overview of the field and its many settings.", "own": false, "talks": [ { "id": "fair-division-directions", "title": "Current Research Directions in Fair Division", "url": "https://talks.neeldhara.com/talks/fair-division-directions/" } ] }, { "title": "Fair Division via Social Comparison", "url": "https://arxiv.org/abs/1611.06589", "kind": "Paper", "shelf": "read", "by": "Rediet Abebe, Jon Kleinberg, David Parkes", "note": "Introduced fairness defined through comparisons along a social network (AAMAS 2017).", "own": false, "talks": [ { "id": "fair-division-binary-social", "title": "On Fair Division with Binary Valuations Respecting Social Networks", "url": "https://talks.neeldhara.com/talks/fair-division-binary-social/" } ] }, { "title": "Fair Division with Minimal Sharing (COMSOC Video Seminar rump session)", "url": "https://www.youtube.com/watch?v=1JJfmGoryT4", "kind": "Talk", "shelf": "watch", "by": "Neeldhara Misra", "note": "My five-minute rump-session talk where this result was first previewed.", "own": true, "talks": [ { "id": "amicable-agents", "title": "Fair Division is Hard even for Amicable Agents", "url": "https://talks.neeldhara.com/talks/amicable-agents/" } ] }, { "title": "Fair item allocation", "url": "https://en.wikipedia.org/wiki/Fair_item_allocation", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Well-maintained overview of fairness notions and algorithms for indivisible items.", "own": false, "talks": [ { "id": "fairness-resource-allocation", "title": "Algorithmic Fairness in Resource Allocation", "url": "https://talks.neeldhara.com/talks/fairness-resource-allocation/" } ] }, { "title": "Fast FAST (ICALP 2009)", "url": "https://collaborate.princeton.edu/en/publications/fast-fast/", "kind": "Paper", "shelf": "read", "by": "Noga Alon, Daniel Lokshtanov, Saket Saurabh", "note": "Introduces chromatic coding and the subexponential algorithm for feedback arc set in tournaments that the talk presents.", "own": false, "talks": [ { "id": "fast-tournaments", "title": "Random Explorations in Algorithms for Feedback Set Problems on Tournaments", "url": "https://talks.neeldhara.com/talks/fast-tournaments/" } ] }, { "title": "Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament", "url": "https://arxiv.org/abs/1006.4396", "kind": "Paper", "shelf": "read", "by": "Marek Karpinski, Warren Schudy", "note": "Subexponential parameterized algorithms for Kemeny aggregation and feedback arc set in tournaments, cited in the talk.", "own": false, "talks": [ { "id": "kemeny", "title": "Parameterized Approaches to Kemeny Rank Aggregation", "url": "https://talks.neeldhara.com/talks/kemeny/" } ] }, { "title": "Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets", "url": "https://doi.org/10.4230/lipics.fsttcs.2013.237", "kind": "Paper", "shelf": "read", "by": "Prachi Goyal, Neeldhara Misra, Fahad Panolan", "note": "My open-access paper combining dynamic programming with representative families for faster deterministic matching algorithms.", "own": true, "authors": [ "Prachi Goyal", "Neeldhara Misra", "Fahad Panolan" ], "venue": "FSTTCS 2013 (LIPIcs 24)", "year": 2013, "doi": "https://doi.org/10.4230/lipics.fsttcs.2013.237", "arxiv": null, "pdf": null, "talks": [ { "id": "matroids-repsets", "title": "Parameterized Algorithms using Matroids", "url": "https://talks.neeldhara.com/talks/matroids-repsets/" } ] }, { "title": "Faster FAST (Feedback Arc Set in Tournaments)", "url": "https://arxiv.org/abs/0911.5094", "kind": "Preprint", "shelf": "read", "by": "Uriel Feige", "note": "Removes the log factor: an n^{O(1)} 2^{O(√k)} algorithm.", "own": false, "talks": [ { "id": "fast-tournaments", "title": "Random Explorations in Algorithms for Feedback Set Problems on Tournaments", "url": "https://talks.neeldhara.com/talks/fast-tournaments/" } ] }, { "title": "Feedback arc set", "url": "https://en.wikipedia.org/wiki/Feedback_arc_set", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Good article on the problem, including ranking from tournaments and parameterized algorithms.", "own": false, "talks": [ { "id": "fast-tournaments", "title": "Random Explorations in Algorithms for Feedback Set Problems on Tournaments", "url": "https://talks.neeldhara.com/talks/fast-tournaments/" } ] }, { "title": "Feedback vertex set", "url": "https://en.wikipedia.org/wiki/Feedback_vertex_set", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "The classic problem this talk varies.", "own": false, "talks": [ { "id": "deleting-structured-trees", "title": "Deleting to Structured Trees", "url": "https://talks.neeldhara.com/talks/deleting-structured-trees/" } ] }, { "title": "Finding and counting vertex-colored subtrees", "url": "https://arxiv.org/abs/1002.1880", "kind": "Preprint", "shelf": "read", "by": "Sylvain Guillemot, Florian Sikora", "note": "The O*(2^k) algorithm for colorful motifs cited in the talk.", "own": false, "talks": [ { "id": "colorful-motifs", "title": "On the Kernelization Complexity of Colorful Motifs", "url": "https://talks.neeldhara.com/talks/colorful-motifs/" } ] }, { "title": "Finding small separators in linear time via treewidth reduction", "url": "https://arxiv.org/abs/1110.4765", "kind": "Preprint", "shelf": "read", "by": "Dániel Marx, Barry O'Sullivan, Igor Razgon", "note": "The FPT results for connected and independent separators that this work generalizes.", "own": false, "talks": [ { "id": "separators", "title": "Separators with Non-Hereditary Properties", "url": "https://talks.neeldhara.com/talks/separators/" } ] }, { "title": "Fixed-Parameter Algorithms (MIT 6.046J, Lecture 18)", "url": "https://www.youtube.com/watch?v=4q-jmGrmxKs", "kind": "Video", "shelf": "watch", "by": "Erik Demaine", "note": "Clear classroom introduction to FPT algorithms and kernels, using Vertex Cover.", "own": false, "talks": [ { "id": "efficient-simplification", "title": "Efficient Simplification", "url": "https://talks.neeldhara.com/talks/efficient-simplification/" } ] }, { "title": "Folding and Cutting Paper", "url": "https://erikdemaine.org/papers/JCDCG98/", "kind": "Paper", "shelf": "read", "by": "Erik D. Demaine, Martin L. Demaine, Anna Lubiw", "note": "The paper behind the straight-skeleton method for finding the folds.", "own": false, "talks": [ { "id": "fold-cut", "title": "Geometric Puzzles: Fold and Cut", "url": "https://talks.neeldhara.com/talks/fold-cut/" } ] }, { "title": "Fully proportional representation", "url": "https://en.wikipedia.org/wiki/Fully_proportional_representation", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Overview of the Chamberlin–Courant and Monroe rules and their complexity.", "own": false, "talks": [ { "id": "chamberlin-courant", "title": "Chamberlin–Courant on Restricted Domains", "url": "https://talks.neeldhara.com/talks/chamberlin-courant/" } ] }, { "title": "Games, Puzzles, and Computation", "url": "https://erikdemaine.org/papers/GPC/", "kind": "Book", "shelf": "read", "by": "Robert A. Hearn, Erik D. Demaine", "note": "The book on the computational complexity of games and puzzles, built around constraint logic.", "own": false, "talks": [ { "id": "trends-in-theory", "title": "Trends in Theory", "url": "https://talks.neeldhara.com/talks/trends-in-theory/" } ] }, { "title": "GCJ in Picat", "url": "https://picat-lang.org/gcj/", "kind": "Code", "shelf": "use", "by": "picat-lang.org (includes solutions by Dymchenko and Mykhailova)", "note": "Google Code Jam problems solved in the Picat language: contest problems as a showcase for language features.", "own": false, "talks": [ { "id": "algorithmic-puzzles", "title": "A Few Algorithmic Puzzles (and Why You Should Care)", "url": "https://talks.neeldhara.com/talks/algorithmic-puzzles/" } ] }, { "title": "Gender and Programming Contests: Mitigating Exclusionary Practices", "url": "https://doi.org/10.15388/infedu.2006.04", "kind": "Paper", "shelf": "read", "by": "Maryanne L. Fisher and Anthony Cox (2006)", "note": "Open-access study cited in the talk on why programming contests can exclude women.", "own": false, "talks": [ { "id": "gender-programming", "title": "Gender Disparities in Programming Competence in India", "url": "https://talks.neeldhara.com/talks/gender-programming/" } ] }, { "title": "GeoGebra", "url": "https://www.geogebra.org/", "kind": "Tool", "shelf": "use", "by": "GeoGebra", "note": "Free interactive geometry, graphing and calculus apps, with ready-made classroom activities.", "own": false, "talks": [ { "id": "teaching-tools", "title": "Tools and Technology for Teaching", "url": "https://talks.neeldhara.com/talks/teaching-tools/" } ] }, { "title": "Geometric Folding Algorithms (MIT 6.849, Fall 2012)", "url": "https://ocw.mit.edu/courses/6-849-geometric-folding-algorithms-linkages-origami-polyhedra-fall-2012/", "kind": "Course", "shelf": "watch", "by": "Erik Demaine (MIT OpenCourseWare)", "note": "Free lecture videos and notes, including the 'fold and one cut' lectures.", "own": false, "talks": [ { "id": "fold-cut", "title": "Geometric Puzzles: Fold and Cut", "url": "https://talks.neeldhara.com/talks/fold-cut/" } ] }, { "title": "Geometric Folding Algorithms: Linkages, Origami, Polyhedra", "url": "https://www.gfalop.org/", "kind": "Book", "shelf": "read", "by": "Erik D. Demaine, Joseph O'Rourke", "note": "The book cited in the talk; covers fold-and-cut alongside linkages, origami and polyhedra.", "own": false, "talks": [ { "id": "fold-cut", "title": "Geometric Puzzles: Fold and Cut", "url": "https://talks.neeldhara.com/talks/fold-cut/" } ] }, { "title": "Getting Started with Competitive Programming (NPTEL)", "url": "https://nptel.ac.in/courses/106106231", "kind": "Course", "shelf": "watch", "by": "Neeldhara Misra", "note": "My free online course on contest problem solving, with lecture videos and worked problems.", "own": true, "talks": [ { "id": "algorithmic-puzzles", "title": "A Few Algorithmic Puzzles (and Why You Should Care)", "url": "https://talks.neeldhara.com/talks/algorithmic-puzzles/" } ] }, { "title": "GitHub Pages documentation", "url": "https://docs.github.com/en/pages", "kind": "Tool", "shelf": "use", "by": "GitHub", "note": "Free hosting for a static site straight from a repository.", "own": false, "talks": [ { "id": "personal-website", "title": "Building a Personal Website", "url": "https://talks.neeldhara.com/talks/personal-website/" } ] }, { "title": "Graph Modification Problems: A Modern Perspective", "url": "https://doi.org/10.1007/978-3-319-19647-3_1", "kind": "Paper", "shelf": "read", "by": "Fedor V. Fomin, Saket Saurabh, Neeldhara Misra", "note": "My survey with Fedor Fomin and Saket Saurabh, with nearly the same title as the talk.", "own": true, "authors": [ "Fedor V. Fomin", "Saket Saurabh", "Neeldhara Misra" ], "venue": "FAW 2015", "year": 2015, "doi": "https://doi.org/10.1007/978-3-319-19647-3_1", "arxiv": null, "pdf": null, "talks": [ { "id": "pgm", "title": "Parameterized Graph Modification: A Modern Perspective", "url": "https://talks.neeldhara.com/talks/pgm/" } ] }, { "title": "GS: Cheating Strategies for Men (ACM Summer School on Algorithmic Game Theory 2019)", "url": "https://www.youtube.com/watch?v=eTRt1BckFLk", "kind": "Video", "shelf": "watch", "by": "Prajakta Nimbhorkar", "note": "How individual agents can manipulate Gale–Shapley, the classic counterpart to manipulation by a central agency.", "own": false, "talks": [ { "id": "matching-markets", "title": "Manipulation with(out) Money in Matching Markets", "url": "https://talks.neeldhara.com/talks/matching-markets/" } ] }, { "title": "HACKENBUSH: a window to a new world of math", "url": "https://www.youtube.com/watch?v=ZYj4NkeGPdM", "kind": "Video", "shelf": "watch", "by": "Owen Maitzen", "note": "An animated hour on Hackenbush and how its positions behave like numbers.", "own": false, "talks": [ { "id": "nim-hackenbush", "title": "Nim, Hackenbush, and Friends", "url": "https://talks.neeldhara.com/talks/nim-hackenbush/" } ] }, { "title": "High-Degree Branching for FVS (NPTEL Parameterized Algorithms, Week 2)", "url": "https://www.youtube.com/watch?v=ygZKn-WuMGM", "kind": "Video", "shelf": "watch", "by": "NPTEL Parameterized Algorithms course (Neeldhara Misra and Saket Saurabh)", "note": "How branching gives an FPT algorithm for Feedback Vertex Set, background for the talk’s FPT result.", "own": true, "talks": [ { "id": "deleting-structured-trees", "title": "Deleting to Structured Trees", "url": "https://talks.neeldhara.com/talks/deleting-structured-trees/" } ] }, { "title": "History of the Fold and Cut Problem", "url": "https://wild.maths.org/history-fold-and-cut-problem", "kind": "Article", "shelf": "read", "by": "wild.maths.org", "note": "From Kan Chu Sen's 1721 puzzle to Betsy Ross's star and Houdini's Paper Magic.", "own": false, "talks": [ { "id": "fold-cut", "title": "Geometric Puzzles: Fold and Cut", "url": "https://talks.neeldhara.com/talks/fold-cut/" } ] }, { "title": "Hitting and Harvesting Pumpkins", "url": "https://arxiv.org/abs/1105.2704", "kind": "Preprint", "shelf": "read", "by": "Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé", "note": "Related work on hitting and packing θ_c minors (pumpkins), including approximation and FPT results.", "own": false, "talks": [ { "id": "kernelization-expansions", "title": "Expansions for Reductions", "url": "https://talks.neeldhara.com/talks/kernelization-expansions/" } ] }, { "title": "Hitting and Piercing Rectangles Induced by a Point Set", "url": "https://doi.org/10.1007/978-3-642-38768-5_21", "kind": "Paper", "shelf": "read", "by": "Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra", "note": "The paper behind the talk.", "own": true, "authors": [ "Ninad Rajgopal", "Pradeesha Ashok", "Sathish Govindarajan", "Abhijit Khopkar", "Neeldhara Misra" ], "venue": "COCOON 2013", "year": 2013, "doi": "https://doi.org/10.1007/978-3-642-38768-5_21", "arxiv": null, "pdf": null, "talks": [ { "id": "hitting-piercing-rectangles", "title": "Hitting and Piercing Rectangles Induced by a Point Set", "url": "https://talks.neeldhara.com/talks/hitting-piercing-rectangles/" } ] }, { "title": "How Hard Is It for a Party to Nominate an Election Winner?", "url": "https://www.ijcai.org/Abstract/16/044", "kind": "Paper", "shelf": "read", "by": "Piotr Faliszewski, Laurent Gourvès, Jérôme Lang, Julien Lesca, Jérôme Monnot", "note": "IJCAI 2016 paper that introduced the party nomination problems for plurality elections.", "own": false, "talks": [ { "id": "party-nominations", "title": "On the Parameterized Complexity of Party Nominations", "url": "https://talks.neeldhara.com/talks/party-nominations/" } ] }, { "title": "How to Speak", "url": "https://www.youtube.com/watch?v=Unzc731iCUY", "kind": "Video", "shelf": "watch", "by": "Patrick Winston (MIT OpenCourseWare)", "note": "The annual MIT lecture: an hour of practical heuristics for talks, slides and job talks.", "own": false, "talks": [ { "id": "presentation-skills", "title": "Technical Presentation Skills vs Interpersonal Skills", "url": "https://talks.neeldhara.com/talks/presentation-skills/" } ] }, { "title": "How to Write a Great Research Paper", "url": "https://www.youtube.com/watch?v=VK51E3gHENc", "kind": "Video", "shelf": "watch", "by": "Simon Peyton Jones", "note": "Seven concrete suggestions for writing papers, starting before the research is done.", "own": false, "talks": [ { "id": "grad-school", "title": "Being a Successful Grad Student", "url": "https://talks.neeldhara.com/talks/grad-school/" } ] }, { "title": "Important Separators - I (Parameterized Complexity Workshop, IIT Gandhinagar)", "url": "https://www.youtube.com/watch?v=cZCxt66BxfE", "kind": "Video", "shelf": "watch", "by": "Dániel Marx", "note": "Lecture on the separator techniques that power many FPT algorithms for cut problems.", "own": false, "talks": [ { "id": "separators", "title": "Separators with Non-Hereditary Properties", "url": "https://talks.neeldhara.com/talks/separators/" } ] }, { "title": "Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture", "url": "https://arxiv.org/abs/1907.00847", "kind": "Paper", "shelf": "read", "by": "Hao Huang", "note": "A celebrated 2019 paper whose core argument fits in about two pages: a cleverly signed matrix and eigenvalue interlacing settle a decades-old question.", "own": false, "talks": [ { "id": "linear-algebra-methods", "title": "Linear Algebra Methods in Combinatorics", "url": "https://talks.neeldhara.com/talks/linear-algebra-methods/" } ] }, { "title": "Infeasibility of Instance Compression and Succinct PCPs for NP (ECCC TR07-096)", "url": "https://eccc.weizmann.ac.il/report/2007/096/", "kind": "Paper", "shelf": "read", "by": "Lance Fortnow, Rahul Santhanam", "note": "The complexity result that makes distillation imply a collapse of the polynomial hierarchy.", "own": false, "talks": [ { "id": "masters-thesis", "title": "On the Infeasibility of Polynomial Kernelization", "url": "https://talks.neeldhara.com/talks/masters-thesis/" } ] }, { "title": "Iterative compression", "url": "https://en.wikipedia.org/wiki/Iterative_compression", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Short overview of the technique, its origin in Reed, Smith and Vetta's Odd Cycle Transversal algorithm, and later uses.", "own": false, "talks": [ { "id": "iterative-compression", "title": "Iterative Compression", "url": "https://talks.neeldhara.com/talks/iterative-compression/" } ] }, { "title": "Iterative Compression I: Setting Up the Method", "url": "https://www.youtube.com/watch?v=mTRw5p1U-0Q", "kind": "Video", "shelf": "watch", "by": "Neeldhara Misra and Saket Saurabh (NPTEL)", "note": "First of four lectures in my NPTEL course, continuing to Vertex Cover, Feedback Vertex Set, 3-Hitting Set and Odd Cycle Transversal.", "own": true, "talks": [ { "id": "iterative-compression", "title": "Iterative Compression", "url": "https://talks.neeldhara.com/talks/iterative-compression/" } ] }, { "title": "Kemeny method", "url": "https://en.wikipedia.org/wiki/Kemeny%E2%80%93Young_method", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Definition, properties and history of the rule.", "own": false, "talks": [ { "id": "kemeny", "title": "Parameterized Approaches to Kemeny Rank Aggregation", "url": "https://talks.neeldhara.com/talks/kemeny/" } ] }, { "title": "Kernel Lower Bounds (Parameterized Complexity Workshop, IIT Gandhinagar)", "url": "https://www.youtube.com/watch?v=2BTljoiZy_Y", "kind": "Video", "shelf": "watch", "by": "Petr Golovach", "note": "A recorded lecture on compositions and kernel lower bounds.", "own": false, "talks": [ { "id": "kernel-lower-bounds", "title": "Lower Bounds on Kernelization", "url": "https://talks.neeldhara.com/talks/kernel-lower-bounds/" } ] }, { "title": "Kernel lower bounds I (parameterized complexity school lecture)", "url": "https://www.youtube.com/watch?v=o8PvqC5wpy0", "kind": "Video", "shelf": "watch", "by": "Michał Pilipczuk", "note": "Lecture on OR- and AND-compositions and ruling out polynomial kernels.", "own": false, "talks": [ { "id": "masters-thesis", "title": "On the Infeasibility of Polynomial Kernelization", "url": "https://talks.neeldhara.com/talks/masters-thesis/" } ] }, { "title": "Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves", "url": "https://arxiv.org/abs/0810.4796", "kind": "Preprint", "shelf": "read", "by": "Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger", "note": "The 'many polynomial kernels' result that the talk discusses as a way around the barrier.", "own": false, "talks": [ { "id": "masters-thesis", "title": "On the Infeasibility of Polynomial Kernelization", "url": "https://talks.neeldhara.com/talks/masters-thesis/" } ] }, { "title": "Kernelization 3: Sunflower Lemma and Dominating Set in K_{i,j}-free graphs (IMSc lecture)", "url": "https://www.youtube.com/watch?v=n2oPV64ErT8", "kind": "Video", "shelf": "watch", "by": "IMSc Chennai lecture series (matsciencechannel)", "note": "Lecture on kernelizing Dominating Set on graphs that exclude a fixed biclique K_{i,j}.", "own": false, "talks": [ { "id": "cds-short-cycles", "title": "Connected Dominating Set and Short Cycles", "url": "https://talks.neeldhara.com/talks/cds-short-cycles/" } ] }, { "title": "Kernelization Lower Bounds By Cross-Composition", "url": "https://arxiv.org/abs/1206.5941", "kind": "Preprint", "shelf": "read", "by": "Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch", "note": "The later, more flexible framework that most lower-bound proofs now use.", "own": false, "talks": [ { "id": "kernel-lower-bounds", "title": "Lower Bounds on Kernelization", "url": "https://talks.neeldhara.com/talks/kernel-lower-bounds/" } ] }, { "title": "Kernelization: Nemhauser-Trotter and Expansion Lemma (NPTEL Parameterized Algorithms, mod01lec06)", "url": "https://www.youtube.com/watch?v=CpVCkLYpTIE", "kind": "Video", "shelf": "watch", "by": "NPTEL course by Neeldhara Misra and Saket Saurabh", "note": "Lecture introducing the expansion lemma and using it in a kernel.", "own": true, "talks": [ { "id": "kernelization-expansions", "title": "Expansions for Reductions", "url": "https://talks.neeldhara.com/talks/kernelization-expansions/" } ] }, { "title": "Kernels for Feedback Arc Set In Tournaments", "url": "https://arxiv.org/abs/0907.2165", "kind": "Preprint", "shelf": "read", "by": "Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé", "note": "Improves the talk's quadratic kernel to a linear vertex kernel.", "own": false, "talks": [ { "id": "fast-tournaments", "title": "Random Explorations in Algorithms for Feedback Set Problems on Tournaments", "url": "https://talks.neeldhara.com/talks/fast-tournaments/" } ] }, { "title": "Lecture 10: Extremal set theory, part 2 (Erdős–Ko–Rado and Katona's proof)", "url": "https://www.ibs.re.kr/ecopro/wp-content/uploads/2022/03/topic-comb-lecture10.pdf", "kind": "Lecture notes", "shelf": "read", "by": "Hong Liu", "note": "A written version of Katona's double-counting proof, short enough to read before the talk.", "own": false, "talks": [ { "id": "ekr-matchings", "title": "An Erdős–Ko–Rado Theorem for Matchings", "url": "https://talks.neeldhara.com/talks/ekr-matchings/" } ] }, { "title": "Lectures on Discrete Geometry", "url": "https://kam.mff.cuni.cz/~matousek/dg.html", "kind": "Book", "shelf": "read", "by": "Jiří Matoušek", "note": "The standard text; its chapter on geometric selection theorems covers the first and second selection lemmas.", "own": false, "talks": [ { "id": "hitting-piercing-rectangles", "title": "Hitting and Piercing Rectangles Induced by a Point Set", "url": "https://talks.neeldhara.com/talks/hitting-piercing-rectangles/" } ] }, { "title": "Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion", "url": "https://arxiv.org/abs/2202.02174", "kind": "Preprint", "shelf": "read", "by": "Bart M. P. Jansen, Michał Włodarczyk", "note": "Later progress on Planarization, which the talk lists as wide open for kernels.", "own": false, "talks": [ { "id": "pgm", "title": "Parameterized Graph Modification: A Modern Perspective", "url": "https://talks.neeldhara.com/talks/pgm/" } ] }, { "title": "Lower bounds based on the Exponential Time Hypothesis", "url": "https://sites.cs.ucsb.edu/~daniello/papers/surveyETH.pdf", "kind": "Survey", "shelf": "read", "by": "Daniel Lokshtanov, Dániel Marx, Saket Saurabh", "note": "Readable survey of lower bounds from ETH and SETH in exact and parameterized algorithms.", "own": false, "talks": [ { "id": "pc-school-lectures", "title": "Parameterized Complexity school lectures", "url": "https://talks.neeldhara.com/talks/pc-school-lectures/" } ] }, { "title": "m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs", "url": "https://arxiv.org/abs/2507.09283", "kind": "Paper", "shelf": "read", "by": "Tiziana Calamoneri, Federico Corò, Neeldhara Misra, Saraswati Girish Nanoti, Giacomo Paesani", "note": "Hardness results and tight bounds on square, octagonal, hexagonal and triangular grids, the second half of the talk.", "own": true, "authors": [ "Tiziana Calamoneri", "Federico Corò", "Neeldhara Misra", "Saraswati Girish Nanoti", "Giacomo Paesani" ], "venue": "FCT 2025", "year": 2025, "doi": null, "arxiv": "https://arxiv.org/abs/2507.09283", "pdf": null, "talks": [ { "id": "eternal-vc", "title": "Eternal Versions of Vertex Cover and Dominating Set", "url": "https://talks.neeldhara.com/talks/eternal-vc/" } ] }, { "title": "Magical Mathematics Reading Group", "url": "https://www.youtube.com/playlist?list=PLadhlDF3zdvt4ehc9R2o_rukOXFexYltg", "kind": "Video", "shelf": "watch", "by": "Neeldhara Misra", "note": "My recorded reading group on Diaconis and Graham's book, with several sessions on de Bruijn-based tricks.", "own": true, "talks": [ { "id": "two-tricks", "title": "Two Tricks", "url": "https://talks.neeldhara.com/talks/two-tricks/" } ] }, { "title": "Magical Mathematics: The Mathematical Ideas That Animate Great Magic Tricks", "url": "https://press.princeton.edu/books/paperback/9780691169774/magical-mathematics", "kind": "Book", "shelf": "read", "by": "Persi Diaconis, Ron Graham", "note": "The mathematics behind card tricks of this kind, de Bruijn sequences included, by a mathematician-magician duo.", "own": false, "talks": [ { "id": "two-tricks", "title": "Two Tricks", "url": "https://talks.neeldhara.com/talks/two-tricks/" } ] }, { "title": "Manipulation With(out) Money in Matching Market", "url": "https://doi.org/10.1007/978-3-031-73903-3_18", "kind": "Paper", "shelf": "read", "by": "Sushmita Gupta, Pallavi Jain", "note": "The ADT 2024 paper this talk presents.", "own": false, "talks": [ { "id": "matching-markets", "title": "Manipulation with(out) Money in Matching Markets", "url": "https://talks.neeldhara.com/talks/matching-markets/" } ] }, { "title": "Math Encounters - Fair Division: How to Cut Cakes (and other things) Fairly", "url": "https://www.youtube.com/watch?v=CBVg8x4LWZE", "kind": "Video", "shelf": "watch", "by": "Francis Su, National Museum of Mathematics", "note": "A public lecture by Francis Su on envy-free ways to cut cakes and share other things fairly.", "own": false, "talks": [ { "id": "cake-candy", "title": "The Math of Cutting Cake and Dividing Candy", "url": "https://talks.neeldhara.com/talks/cake-candy/" } ] }, { "title": "Matroids: Representative Sets", "url": "https://www.youtube.com/watch?v=X3EwU-p4elU", "kind": "Video", "shelf": "watch", "by": "Neeldhara Misra and Saket Saurabh (NPTEL)", "note": "First of four lectures on representative sets in my NPTEL course, continuing to their computation and to paths and kernels.", "own": true, "talks": [ { "id": "matroids-repsets", "title": "Parameterized Algorithms using Matroids", "url": "https://talks.neeldhara.com/talks/matroids-repsets/" } ] }, { "title": "Mentimeter", "url": "https://www.mentimeter.com/", "kind": "Tool", "shelf": "use", "by": "Mentimeter", "note": "The live polling tool used for audience interaction in the talk.", "own": false, "talks": [ { "id": "trust", "title": "The Evolution of Trust", "url": "https://talks.neeldhara.com/talks/trust/" } ] }, { "title": "Method of Equal Shares explained in 5 minutes", "url": "https://www.youtube.com/watch?v=RYK3heBDKJ4", "kind": "Video", "shelf": "watch", "by": "Piotr Skowron", "note": "A quick explainer by one of the method's inventors.", "own": false, "talks": [ { "id": "equal-shares", "title": "Equal Shares and Then Some", "url": "https://talks.neeldhara.com/talks/equal-shares/" } ] }, { "title": "Method of Equal Shares for Participatory Budgeting", "url": "https://equalshares.net/", "kind": "Reference", "shelf": "read", "by": "Dominik Peters, Piotr Skowron", "note": "The website the talk borrows from: explanations, benefits and elections that used the method.", "own": false, "talks": [ { "id": "equal-shares", "title": "Equal Shares and Then Some", "url": "https://talks.neeldhara.com/talks/equal-shares/" } ] }, { "title": "Method of Equal Shares: Online Computation Tool", "url": "https://equalshares.net/tools/compute/", "kind": "Interactive", "shelf": "play", "by": "Dominik Peters, Piotr Skowron (equalshares.net)", "note": "Compute Method of Equal Shares outcomes online for your own instances.", "own": false, "talks": [ { "id": "equal-shares", "title": "Equal Shares and Then Some", "url": "https://talks.neeldhara.com/talks/equal-shares/" } ] }, { "title": "More math for six-year-olds: Win at Nim!", "url": "https://jdh.hamkins.org/more-math-for-six-year-olds-win-at-nim/", "kind": "Article", "shelf": "read", "by": "Joel David Hamkins", "note": "A lovely account of teaching Nim strategy to young children, step by step.", "own": false, "talks": [ { "id": "nim-hackenbush", "title": "Nim, Hackenbush, and Friends", "url": "https://talks.neeldhara.com/talks/nim-hackenbush/" } ] }, { "title": "Multivariate stable polynomials: theory and applications", "url": "https://arxiv.org/abs/0911.3569", "kind": "Survey", "shelf": "read", "by": "David G. Wagner", "note": "Survey of the theory of multivariate stable polynomials and its uses in combinatorics, probability and matrix theory.", "own": false, "talks": [ { "id": "real-stable-polynomials", "title": "Real Stable Polynomials and their Zeros", "url": "https://talks.neeldhara.com/talks/real-stable-polynomials/" } ] }, { "title": "Multiwinner voting", "url": "https://en.wikipedia.org/wiki/Multiwinner_voting", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Overview of committee elections and the main rules.", "own": false, "talks": [ { "id": "multiwinner-voting", "title": "Multiwinner Voting", "url": "https://talks.neeldhara.com/talks/multiwinner-voting/" } ] }, { "title": "Multiwinner Voting: A New Challenge for Social Choice Theory (Trends in Computational Social Choice, ch. 2)", "url": "https://archive.illc.uva.nl/COST-IC1205/BookDocs/Chapters/TrendsCOMSOC-02.pdf", "kind": "Survey", "shelf": "read", "by": "Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon", "note": "Free book chapter surveying multiwinner rules, their axioms and their complexity.", "own": false, "talks": [ { "id": "multiwinner-voting", "title": "Multiwinner Voting", "url": "https://talks.neeldhara.com/talks/multiwinner-voting/" } ] }, { "title": "ncase/trust", "url": "https://github.com/ncase/trust", "kind": "Code", "shelf": "use", "by": "Nicky Case", "note": "The source code of The Evolution of Trust, for anyone who wants to remix or extend it.", "own": false, "talks": [ { "id": "trust", "title": "The Evolution of Trust", "url": "https://talks.neeldhara.com/talks/trust/" } ] }, { "title": "Necessary President in Elections with Parties", "url": "https://arxiv.org/abs/2602.10601", "kind": "Preprint", "shelf": "read", "by": "Katarína Cechlárová, Ildikó Schlotter", "note": "Recent work focused on the Necessary President problem.", "own": false, "talks": [ { "id": "party-nominations", "title": "On the Parameterized Complexity of Party Nominations", "url": "https://talks.neeldhara.com/talks/party-nominations/" } ] }, { "title": "neeldhara/quartosite", "url": "https://github.com/neeldhara/quartosite", "kind": "Code", "shelf": "use", "by": "Neeldhara Misra", "note": "The full Quarto source of neeldhara.com, to borrow structure, listings and styling from.", "own": true, "talks": [ { "id": "personal-website", "title": "Building a Personal Website", "url": "https://talks.neeldhara.com/talks/personal-website/" } ] }, { "title": "New Developments in Exact Algorithms and Lower Bounds (pre-FSTTCS 2014 workshop)", "url": "https://www.imsc.res.in/~vraman/exact/index.html", "kind": "Talk", "shelf": "watch", "by": "Venkatesh Raman and Saket Saurabh (organizers)", "note": "The workshop page, with slides of this talk and of companion talks on ETH, SETH, backdoors and kernel lower bounds.", "own": false, "talks": [ { "id": "pgm", "title": "Parameterized Graph Modification: A Modern Perspective", "url": "https://talks.neeldhara.com/talks/pgm/" } ] }, { "title": "New Methods in Parameterized Algorithms and Complexity (PhD thesis), Chapter 6: Chromatic Coding", "url": "https://sites.cs.ucsb.edu/~daniello/papers/PhdThesis_Daniel.pdf", "kind": "Reference", "shelf": "read", "by": "Daniel Lokshtanov", "note": "A careful write-up of chromatic coding for tournament feedback arc set, including kernelization and the coloring analysis.", "own": false, "talks": [ { "id": "fast-tournaments", "title": "Random Explorations in Algorithms for Feedback Set Problems on Tournaments", "url": "https://talks.neeldhara.com/talks/fast-tournaments/" } ] }, { "title": "No “yes.” Either “HELL YEAH!” or “no.”", "url": "https://sive.rs/hellyeah", "kind": "Essay", "shelf": "read", "by": "Derek Sivers", "note": "The short essay behind the deck's quote on saying no (Act III).", "own": false, "talks": [ { "id": "grad-school", "title": "Being a Successful Grad Student", "url": "https://talks.neeldhara.com/talks/grad-school/" } ] }, { "title": "On Detecting Nearly Structured Preference Profiles", "url": "https://ojs.aaai.org/index.php/AAAI/article/view/8823", "kind": "Paper", "shelf": "read", "by": "Edith Elkind, Martin Lackner", "note": "AAAI 2014 paper on measuring and detecting profiles that are close to single-peaked or single-crossing.", "own": false, "talks": [ { "id": "structured-electorates", "title": "Efficient Algorithms for Hard Problems on Structured Electorates", "url": "https://talks.neeldhara.com/talks/structured-electorates/" } ] }, { "title": "On Graphs whose Eternal Vertex Cover Number and Vertex Cover Number Coincide", "url": "https://arxiv.org/abs/1812.05125", "kind": "Preprint", "shelf": "read", "by": "Jasine Babu, L. Sunil Chandran, Mathew Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier", "note": "Earlier work on the graphs where the two numbers agree, the question the talk takes up.", "own": false, "talks": [ { "id": "eternal-vc", "title": "Eternal Versions of Vertex Cover and Dominating Set", "url": "https://talks.neeldhara.com/talks/eternal-vc/" } ] }, { "title": "On Leonid Gurvits's proof for permanents", "url": "https://homepages.cwi.nl/~lex/files/perma5.pdf", "kind": "Article", "shelf": "read", "by": "Monique Laurent, Alexander Schrijver", "note": "A concise, self-contained exposition of Gurvits's proof; the best first read.", "own": false, "talks": [ { "id": "real-stable-polynomials", "title": "Real Stable Polynomials and their Zeros", "url": "https://talks.neeldhara.com/talks/real-stable-polynomials/" } ] }, { "title": "On Parameterized Independent Feedback Vertex Set", "url": "https://doi.org/10.1007/978-3-642-22685-4_9", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh", "note": null, "own": true, "authors": [ "Neeldhara Misra", "Geevarghese Philip", "Venkatesh Raman", "Saket Saurabh" ], "venue": "COCOON 2011", "year": 2011, "doi": "https://doi.org/10.1007/978-3-642-22685-4_9", "arxiv": null, "pdf": null, "talks": [ { "id": "phd-defense", "title": "Kernels for F-Deletion", "url": "https://talks.neeldhara.com/talks/phd-defense/" } ] }, { "title": "On Parameterized Independent Feedback Vertex Set", "url": "https://doi.org/10.1016/j.tcs.2012.02.012", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh", "note": null, "own": true, "authors": [ "Neeldhara Misra", "Geevarghese Philip", "Venkatesh Raman", "Saket Saurabh" ], "venue": "Theoretical Computer Science 461", "year": 2012, "doi": "https://doi.org/10.1016/j.tcs.2012.02.012", "arxiv": null, "pdf": null, "talks": [ { "id": "phd-defense", "title": "Kernels for F-Deletion", "url": "https://talks.neeldhara.com/talks/phd-defense/" } ] }, { "title": "On Structural Parameterizations of Firefighting", "url": "https://doi.org/10.1016/j.tcs.2019.02.032", "kind": "Paper", "shelf": "read", "by": "Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy", "note": "Which structural parameters make classic firefighting tractable, and which do not.", "own": true, "authors": [ "Bireswar Das", "Murali Krishna Enduri", "Neeldhara Misra", "I. Vinod Reddy" ], "venue": "Theoretical Computer Science (conference version CALDAM 2018)", "year": 2019, "doi": "https://doi.org/10.1016/j.tcs.2019.02.032", "arxiv": "https://arxiv.org/abs/1711.10227", "pdf": null, "talks": [ { "id": "firefighting", "title": "Algorithmic Aspects of Firefighting", "url": "https://talks.neeldhara.com/talks/firefighting/" } ] }, { "title": "On Structural Parameterizations of Graph Motif and Chromatic Number", "url": "https://doi.org/10.1007/978-3-319-53007-9_11", "kind": "Paper", "shelf": "read", "by": "Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy", "note": null, "own": true, "authors": [ "Bireswar Das", "Murali Krishna Enduri", "Neeldhara Misra", "I. Vinod Reddy" ], "venue": "CALDAM 2017", "year": 2017, "doi": "https://doi.org/10.1007/978-3-319-53007-9_11", "arxiv": null, "pdf": null, "talks": [ { "id": "colorful-motifs", "title": "On the Kernelization Complexity of Colorful Motifs", "url": "https://talks.neeldhara.com/talks/colorful-motifs/" } ] }, { "title": "On the Computation of Fully Proportional Representation", "url": "https://www.jair.org/index.php/jair/article/view/10825", "kind": "Paper", "shelf": "read", "by": "Nadja Betzler, Arkadii Slinko, Johannes Uhlmann", "note": "JAIR 2013 paper with the single-peaked algorithm for Chamberlin–Courant that the talk builds on.", "own": false, "talks": [ { "id": "chamberlin-courant", "title": "Chamberlin–Courant on Restricted Domains", "url": "https://talks.neeldhara.com/talks/chamberlin-courant/" } ] }, { "title": "On the d-Runaway Rectangle Escape Problem (CCCG 2014)", "url": "https://cccg.ca/proceedings/2014/papers/paper43.pdf", "kind": "Paper", "shelf": "read", "by": "Aniket Basu Roy, Sathish Govindarajan, Neeldhara Misra, Shreyas Shetty", "note": "The paper behind the talk, free in the CCCG proceedings.", "own": true, "talks": [ { "id": "rectangle-escape", "title": "On the d-Runaway Rectangle Escape Problem", "url": "https://talks.neeldhara.com/talks/rectangle-escape/" } ] }, { "title": "On the Parameterized Complexity of Colorful Components and Related Problems", "url": "https://doi.org/10.1007/978-3-319-94667-2_20", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra", "note": "The paper behind the talk.", "own": true, "authors": [ "Neeldhara Misra" ], "venue": "IWOCA 2018", "year": 2018, "doi": "https://doi.org/10.1007/978-3-319-94667-2_20", "arxiv": null, "pdf": null, "talks": [ { "id": "colorful-components", "title": "Structural Parameterizations for Colorful Components", "url": "https://talks.neeldhara.com/talks/colorful-components/" } ] }, { "title": "On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties", "url": "https://doi.org/10.1007/978-3-642-34611-8_33", "kind": "Paper", "shelf": "read", "by": "Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger", "note": null, "own": true, "authors": [ "Pinar Heggernes", "Pim van 't Hof", "Dániel Marx", "Neeldhara Misra", "Yngve Villanger" ], "venue": "WG 2012", "year": 2012, "doi": "https://doi.org/10.1007/978-3-642-34611-8_33", "arxiv": null, "pdf": null, "talks": [ { "id": "separators", "title": "Separators with Non-Hereditary Properties", "url": "https://talks.neeldhara.com/talks/separators/" } ] }, { "title": "On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties", "url": "https://doi.org/10.1007/s00453-014-9868-6", "kind": "Paper", "shelf": "read", "by": "Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger", "note": "Journal version with all the results from the talk.", "own": true, "authors": [ "Pinar Heggernes", "Pim van 't Hof", "Dániel Marx", "Neeldhara Misra", "Yngve Villanger" ], "venue": "Algorithmica", "year": 2014, "doi": "https://doi.org/10.1007/s00453-014-9868-6", "arxiv": null, "pdf": null, "talks": [ { "id": "separators", "title": "Separators with Non-Hereditary Properties", "url": "https://talks.neeldhara.com/talks/separators/" } ] }, { "title": "On the Parameterized Complexity of Minimax Approval Voting (AAMAS 2015 PDF)", "url": "https://www.ifaamas.org/Proceedings/aamas2015/aamas/p97.pdf", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Arshed Nabeel, Harman Singh", "note": "My earlier paper on multiwinner voting; the PDF is free.", "own": true, "talks": [ { "id": "multiwinner-voting", "title": "Multiwinner Voting", "url": "https://talks.neeldhara.com/talks/multiwinner-voting/" } ] }, { "title": "On the Parameterized Complexity of Party Nominations", "url": "https://doi.org/10.1007/978-3-030-31489-7_8", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra", "note": null, "own": true, "authors": [ "Neeldhara Misra" ], "venue": "ADT 2019 (LNCS)", "year": 2019, "doi": "https://doi.org/10.1007/978-3-030-31489-7_8", "arxiv": null, "pdf": null, "talks": [ { "id": "party-nominations", "title": "On the Parameterized Complexity of Party Nominations", "url": "https://talks.neeldhara.com/talks/party-nominations/" } ] }, { "title": "On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem", "url": "https://doi.org/10.1007/978-3-642-40313-2_44", "kind": "Paper", "shelf": "read", "by": "Prachi Goyal, Vikram Kamat, Neeldhara Misra", "note": "The paper behind the talk, with the FPT algorithm, kernels and hardness for restricted classes.", "own": true, "authors": [ "Prachi Goyal", "Vikram Kamat", "Neeldhara Misra" ], "venue": "MFCS 2013", "year": 2013, "doi": "https://doi.org/10.1007/978-3-642-40313-2_44", "arxiv": "https://arxiv.org/abs/1306.2931", "pdf": null, "talks": [ { "id": "max-edge-coloring", "title": "An FPT Algorithm for Maximum Edge Coloring", "url": "https://talks.neeldhara.com/talks/max-edge-coloring/" } ] }, { "title": "On the Rectangle Escape Problem (CCCG 2013)", "url": "https://cccg.ca/proceedings/2013/papers/paper_78.pdf", "kind": "Paper", "shelf": "read", "by": "Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Sadra Yazdanbod, Hamid Zarrabi-Zadeh", "note": "The density-minimizing version and its PCB bus-routing motivation, which the talk builds on.", "own": false, "talks": [ { "id": "rectangle-escape", "title": "On the d-Runaway Rectangle Escape Problem", "url": "https://talks.neeldhara.com/talks/rectangle-escape/" } ] }, { "title": "On the Role of Half-Catalan Numbers and Pathwidth in Hyperbranched Polymers Synthesized by ABm Step Polymerization", "url": "https://doi.org/10.1021/acs.macromol.1c01608", "kind": "Paper", "shelf": "read", "by": "Pratyush Dayal, Neeldhara Misra, Surbhi Khewle, Ravi Anand Singh", "note": "Where tree structures meet polymer chemistry, one of the motivations named in the talk.", "own": true, "talks": [ { "id": "deleting-structured-trees", "title": "Deleting to Structured Trees", "url": "https://talks.neeldhara.com/talks/deleting-structured-trees/" } ] }, { "title": "Once you understand game theory, you understand the world.", "url": "https://www.youtube.com/watch?v=mScpHTIi-kM", "kind": "Video", "shelf": "watch", "by": "Veritasium", "note": "A video tour of the repeated prisoner's dilemma and Axelrod's tournaments, the same story as the talk.", "own": false, "talks": [ { "id": "trust", "title": "The Evolution of Trust", "url": "https://talks.neeldhara.com/talks/trust/" } ] }, { "title": "Oral Presentation Advice", "url": "https://pages.cs.wisc.edu/~markhill/conference-talk.html", "kind": "Article", "shelf": "read", "by": "Mark D. Hill", "note": "Compact advice on conference talks, with a generic talk outline and notes on job talks.", "own": false, "talks": [ { "id": "presentation-skills", "title": "Technical Presentation Skills vs Interpersonal Skills", "url": "https://talks.neeldhara.com/talks/presentation-skills/" } ] }, { "title": "PACE 2016: Treewidth and Feedback Vertex Set tracks", "url": "https://pacechallenge.org/2016/", "kind": "Tool", "shelf": "use", "by": "PACE challenge", "note": "Implementation challenge with benchmark instances and solvers for Feedback Vertex Set and treewidth.", "own": false, "talks": [ { "id": "planar-f-deletion", "title": "From FVS to Planar F-Deletion", "url": "https://talks.neeldhara.com/talks/planar-f-deletion/" } ] }, { "title": "PACE Challenge (Parameterized Algorithms and Computational Experiments)", "url": "https://pacechallenge.org/", "kind": "Tool", "shelf": "use", "by": "PACE organisers", "note": "Annual implementation challenge that puts parameterized algorithms to work on real instances.", "own": false, "talks": [ { "id": "fpt-intro", "title": "An Introduction to Parameterized Algorithms", "url": "https://talks.neeldhara.com/talks/fpt-intro/" } ] }, { "title": "Parable of the Polygons", "url": "https://ncase.me/polygons/", "kind": "Interactive", "shelf": "play", "by": "Vi Hart and Nicky Case", "note": "A playable post on how small individual biases add up to segregation.", "own": false, "talks": [ { "id": "explorables", "title": "Explorable Explanations: Interactive Essays", "url": "https://talks.neeldhara.com/talks/explorables/" } ] }, { "title": "Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges", "url": "https://arxiv.org/abs/1407.2143", "kind": "Survey", "shelf": "read", "by": "Robert Bredereck, Jiehua Chen, Piotr Faliszewski, Jiong Guo, Rolf Niedermeier, Gerhard J. Woeginger", "note": "Research agenda for parameterized social choice, with control problems among the challenges.", "own": false, "talks": [ { "id": "protecting-elections", "title": "A Parameterized Perspective on Protecting and Attacking Elections", "url": "https://talks.neeldhara.com/talks/protecting-elections/" } ] }, { "title": "Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem (FSTTCS 2024)", "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2024.31", "kind": "Paper", "shelf": "read", "by": "Rogers Mathew, Fahad Panolan, Seshikanth", "note": "Answers the talk's open question: parameterized above the maximum matching size, the problem is W[1]-hard.", "own": false, "talks": [ { "id": "max-edge-coloring", "title": "An FPT Algorithm for Maximum Edge Coloring", "url": "https://talks.neeldhara.com/talks/max-edge-coloring/" } ] }, { "title": "Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs", "url": "https://doi.org/10.1007/978-3-642-45043-3_32", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh", "note": null, "own": true, "authors": [ "Neeldhara Misra", "Fahad Panolan", "Ashutosh Rai", "Venkatesh Raman", "Saket Saurabh" ], "venue": "WG 2013", "year": 2013, "doi": "https://doi.org/10.1007/978-3-642-45043-3_32", "arxiv": null, "pdf": null, "talks": [ { "id": "max-q-colorable", "title": "Max q-Colorable Induced Subgraph on Perfect Graphs", "url": "https://talks.neeldhara.com/talks/max-q-colorable/" } ] }, { "title": "Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs", "url": "https://doi.org/10.1007/s00453-018-0431-8", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh", "note": "Journal version of the paper behind the talk, with full proofs.", "own": true, "authors": [ "Neeldhara Misra", "Fahad Panolan", "Ashutosh Rai", "Venkatesh Raman", "Saket Saurabh" ], "venue": "Algorithmica", "year": 2018, "doi": "https://doi.org/10.1007/s00453-018-0431-8", "arxiv": null, "pdf": null, "talks": [ { "id": "max-q-colorable", "title": "Max q-Colorable Induced Subgraph on Perfect Graphs", "url": "https://talks.neeldhara.com/talks/max-q-colorable/" } ] }, { "title": "Parameterized Aspects of Distinct Kemeny Rank Aggregation", "url": "https://doi.org/10.1007/978-3-031-52213-0_2", "kind": "Paper", "shelf": "read", "by": "Koustav De, Harshil Mittal, Palash Dey, Neeldhara Misra", "note": null, "own": true, "authors": [ "Koustav De", "Harshil Mittal", "Palash Dey", "Neeldhara Misra" ], "venue": "CALDAM 2024 (LNCS)", "year": 2024, "doi": "https://doi.org/10.1007/978-3-031-52213-0_2", "arxiv": "https://arxiv.org/abs/2309.03517", "pdf": null, "talks": [ { "id": "kemeny", "title": "Parameterized Approaches to Kemeny Rank Aggregation", "url": "https://talks.neeldhara.com/talks/kemeny/" } ] }, { "title": "Parameterized Complexity and Approximation Issues for the Colorful Components Problems", "url": "https://arxiv.org/abs/1605.03071", "kind": "Preprint", "shelf": "read", "by": "Riccardo Dondi, Florian Sikora", "note": "The earlier parameterized and approximation results for both problems that the talk improves on.", "own": false, "talks": [ { "id": "colorful-components", "title": "Structural Parameterizations for Colorful Components", "url": "https://talks.neeldhara.com/talks/colorful-components/" } ] }, { "title": "Parameterized Complexity of Candidate Nomination for Elections Based on Positional Scoring Rules", "url": "https://real.mtak.hu/199303/", "kind": "Paper", "shelf": "read", "by": "Ildikó Schlotter, Katarína Cechlárová, Diana Trellová", "note": "Open-access follow-up (JAAMAS 2024) extending the parameterized analysis to positional scoring rules.", "own": false, "talks": [ { "id": "party-nominations", "title": "On the Parameterized Complexity of Party Nominations", "url": "https://talks.neeldhara.com/talks/party-nominations/" } ] }, { "title": "Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs", "url": "https://arxiv.org/abs/2405.10556", "kind": "Preprint", "shelf": "read", "by": "Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman", "note": "Algorithms and lower bounds for many dominating set variants on graphs close to cluster or split graphs.", "own": false, "talks": [ { "id": "dominating-set-variants", "title": "Parameterized Algorithms for Variants of Dominating Set", "url": "https://talks.neeldhara.com/talks/dominating-set-variants/" } ] }, { "title": "Parameterized Complexity of Envy-Free Resource Allocation in Social Networks", "url": "https://doi.org/10.1609/aaai.v34i05.6201", "kind": "Paper", "shelf": "read", "by": "Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak", "note": "AAAI 2020 parameterized study of local envy-freeness, the closest prior work on parameters.", "own": false, "talks": [ { "id": "fair-division-binary-social", "title": "On Fair Division with Binary Valuations Respecting Social Networks", "url": "https://talks.neeldhara.com/talks/fair-division-binary-social/" } ] }, { "title": "Parameterized Complexity Summer School 2017 (programme and slides)", "url": "https://algo2017.ac.tuwien.ac.at/pcss/", "kind": "Course", "shelf": "watch", "by": "TU Wien (ALGO 2017)", "note": "Programme of the summer school with slides from every lecture, including advanced kernels and kernel lower bounds.", "own": false, "talks": [ { "id": "protrusions", "title": "Protrusion Reduction Techniques", "url": "https://talks.neeldhara.com/talks/protrusions/" } ] }, { "title": "Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers", "url": "https://doi.org/10.1016/j.tcs.2019.03.022", "kind": "Paper", "shelf": "read", "by": "Palash Dey, Neeldhara Misra, Y. Narahari", "note": null, "own": true, "authors": [ "Palash Dey", "Neeldhara Misra", "Y. Narahari" ], "venue": "Theoretical Computer Science (AAMAS 2017 conference version)", "year": 2019, "doi": "https://doi.org/10.1016/j.tcs.2019.03.022", "arxiv": "https://arxiv.org/abs/1511.04190", "pdf": null, "talks": [ { "id": "multiwinner-voting", "title": "Multiwinner Voting", "url": "https://talks.neeldhara.com/talks/multiwinner-voting/" } ] }, { "title": "Participatory Budgeting in Pune, India", "url": "https://participedia.net/case/4280", "kind": "Article", "shelf": "read", "by": "Participedia", "note": "Background on the Pune participatory budgeting process mentioned in the talk.", "own": false, "talks": [ { "id": "equal-shares", "title": "Equal Shares and Then Some", "url": "https://talks.neeldhara.com/talks/equal-shares/" } ] }, { "title": "Partitioning to Decrease Diameter - Understanding a Beautiful Proof", "url": "https://www.youtube.com/watch?v=QQBFXn7tgog", "kind": "Video", "shelf": "watch", "by": "Jacob Von Holly", "note": "Accessible video on how the Frankl–Wilson theorem, a linear algebra bound on set systems, disproves Borsuk's conjecture.", "own": false, "talks": [ { "id": "linear-algebra-methods", "title": "Linear Algebra Methods in Combinatorics", "url": "https://talks.neeldhara.com/talks/linear-algebra-methods/" } ] }, { "title": "Paths, Trees, and Flowers", "url": "https://math.nist.gov/~JBernal/p_t_f.pdf", "kind": "Paper", "shelf": "read", "by": "Jack Edmonds (1965)", "note": "The matching paper that argued for polynomial time as the mark of a 'good' algorithm.", "own": false, "talks": [ { "id": "history-algorithms", "title": "History of Algorithms: The Worst Case and Beyond", "url": "https://talks.neeldhara.com/talks/history-algorithms/" } ] }, { "title": "Perfect graph", "url": "https://en.wikipedia.org/wiki/Perfect_graph", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Good article on the graph class the talk works in, including the strong perfect graph theorem.", "own": false, "talks": [ { "id": "max-q-colorable", "title": "Max q-Colorable Induced Subgraph on Perfect Graphs", "url": "https://talks.neeldhara.com/talks/max-q-colorable/" } ] }, { "title": "Perfect Graphs (Numberphile)", "url": "https://www.youtube.com/watch?v=C4Zr4cOVm9g", "kind": "Video", "shelf": "watch", "by": "Numberphile, with Maria Chudnovsky", "note": "A friendly introduction to perfect graphs from one of the authors of the strong perfect graph theorem.", "own": false, "talks": [ { "id": "max-q-colorable", "title": "Max q-Colorable Induced Subgraph on Perfect Graphs", "url": "https://talks.neeldhara.com/talks/max-q-colorable/" } ] }, { "title": "Playing Games with Algorithms: Algorithmic Combinatorial Game Theory", "url": "https://arxiv.org/abs/cs/0106019", "kind": "Survey", "shelf": "read", "by": "Erik D. Demaine, Robert A. Hearn", "note": "A survey of what is known about the complexity of games and puzzles, one- and two-player.", "own": false, "talks": [ { "id": "two-dots", "title": "Two Dots is NP-complete", "url": "https://talks.neeldhara.com/talks/two-dots/" } ] }, { "title": "Preference Restrictions in Computational Social Choice: A Survey", "url": "https://arxiv.org/abs/2205.09092", "kind": "Survey", "shelf": "read", "by": "Edith Elkind, Martin Lackner, Dominik Peters", "note": "Up-to-date survey of preference restrictions: recognition, elicitation and algorithmic uses.", "own": false, "talks": [ { "id": "structured-electorates", "title": "Efficient Algorithms for Hard Problems on Structured Electorates", "url": "https://talks.neeldhara.com/talks/structured-electorates/" } ] }, { "title": "PrefLib: A Library for Preferences", "url": "https://www.preflib.org/", "kind": "Tool", "shelf": "use", "by": "Nicholas Mattei and Simon Rey (maintainers)", "note": "Curated real-world preference data, plus Python tools, for experimenting with voting rules.", "own": false, "talks": [ { "id": "comsoc-intro", "title": "An Introduction to Computational Social Choice", "url": "https://talks.neeldhara.com/talks/comsoc-intro/" } ] }, { "title": "Prisoner's Dilemma (Stanford Encyclopedia of Philosophy)", "url": "https://plato.stanford.edu/entries/prisoner-dilemma/", "kind": "Reference", "shelf": "read", "by": "Steven Kuhn", "note": "A thorough reference on the dilemma, its iterated version and strategies such as tit for tat.", "own": false, "talks": [ { "id": "trust", "title": "The Evolution of Trust", "url": "https://talks.neeldhara.com/talks/trust/" } ] }, { "title": "Prof. Edith Elkind | Computational Social Choice | Day 1 | IIT Gandhinagar", "url": "https://www.youtube.com/watch?v=0SetHyfBA_M", "kind": "Video", "shelf": "watch", "by": "Edith Elkind", "note": "A three-hour lecture by a leading researcher in the field, recorded at IIT Gandhinagar.", "own": false, "talks": [ { "id": "comsoc-intro", "title": "An Introduction to Computational Social Choice", "url": "https://talks.neeldhara.com/talks/comsoc-intro/" } ] }, { "title": "Programming for the Puzzled (MIT 6.S095)", "url": "https://ocw.mit.edu/courses/6-s095-programming-for-the-puzzled-january-iap-2018/", "kind": "Course", "shelf": "watch", "by": "Srini Devadas (MIT OpenCourseWare)", "note": "A free course that teaches Python through classic puzzles, with videos and code.", "own": false, "talks": [ { "id": "puzzles-python", "title": "Problem Solving with Python", "url": "https://talks.neeldhara.com/talks/puzzles-python/" } ] }, { "title": "Project Euler", "url": "https://projecteuler.net/", "kind": "Game", "shelf": "play", "by": "Project Euler", "note": "Hundreds of mathematical puzzles meant to be solved with short programs.", "own": false, "talks": [ { "id": "puzzles-python", "title": "Problem Solving with Python", "url": "https://talks.neeldhara.com/talks/puzzles-python/" } ] }, { "title": "Proportional Participatory Budgeting with Additive Utilities", "url": "https://arxiv.org/abs/2008.13276", "kind": "Paper", "shelf": "read", "by": "Dominik Peters, Grzegorz Pierczyński, Piotr Skowron", "note": "The NeurIPS 2021 paper the talk is based on.", "own": false, "talks": [ { "id": "equal-shares", "title": "Equal Shares and Then Some", "url": "https://talks.neeldhara.com/talks/equal-shares/" } ] }, { "title": "Protecting Elections by Recounting Ballots", "url": "https://arxiv.org/abs/1906.07071", "kind": "Paper", "shelf": "read", "by": "Edith Elkind, Jiarui Gan, Svetlana Obraztsova, Zinovi Rabinovich, Alexandros A. Voudouris", "note": "IJCAI 2019 model of ballot tampering and recounts across districts that the IWOCA 2020 paper analyses.", "own": false, "talks": [ { "id": "protecting-elections", "title": "A Parameterized Perspective on Protecting and Attacking Elections", "url": "https://talks.neeldhara.com/talks/protecting-elections/" } ] }, { "title": "Puzzles from the TGIF Group", "url": "https://www.neeldhara.com/tgif/", "kind": "Reference", "shelf": "read", "by": "Neeldhara Misra", "note": "Puzzles from my Friday puzzle group at IITGN, tagged by theme, with a Discord to join.", "own": true, "talks": [ { "id": "joy-of-computing", "title": "Joy of Computing", "url": "https://talks.neeldhara.com/talks/joy-of-computing/" } ] }, { "title": "Python for Everybody", "url": "https://www.py4e.com/", "kind": "Course", "shelf": "watch", "by": "Charles Severance", "note": "A free, beginner-friendly course and book for moving from blocks to Python.", "own": false, "talks": [ { "id": "block-coding", "title": "Programming Beyond Block Coding", "url": "https://talks.neeldhara.com/talks/block-coding/" } ] }, { "title": "Python Tutor", "url": "https://pythontutor.com/", "kind": "Tool", "shelf": "use", "by": "Philip Guo", "note": "Step through Python, Java, C, C++ or JavaScript code and see memory change; handy for teaching programming and data structures.", "own": false, "talks": [ { "id": "teaching-tools", "title": "Tools and Technology for Teaching", "url": "https://talks.neeldhara.com/talks/teaching-tools/" } ] }, { "title": "pytudes", "url": "https://github.com/norvig/pytudes", "kind": "Code", "shelf": "use", "by": "Peter Norvig", "note": "Short Python notebooks that solve puzzles and problems, a model of using code to think.", "own": false, "talks": [ { "id": "puzzles-python", "title": "Problem Solving with Python", "url": "https://talks.neeldhara.com/talks/puzzles-python/" } ] }, { "title": "Quadratic Upper Bounds on the Erdős–Pósa Property for a Generalization of Packing and Covering Cycles", "url": "https://doi.org/10.1002/jgt.21720", "kind": "Paper", "shelf": "read", "by": "Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh", "note": null, "own": true, "authors": [ "Fedor V. Fomin", "Daniel Lokshtanov", "Neeldhara Misra", "Geevarghese Philip", "Saket Saurabh" ], "venue": "Journal of Graph Theory", "year": 2013, "doi": "https://doi.org/10.1002/jgt.21720", "arxiv": null, "pdf": "https://sites.cs.ucsb.edu/~daniello/papers/QuadErdosPosa.pdf", "talks": [ { "id": "phd-defense", "title": "Kernels for F-Deletion", "url": "https://talks.neeldhara.com/talks/phd-defense/" } ] }, { "title": "Quarto", "url": "https://quarto.org/", "kind": "Tool", "shelf": "use", "by": "Posit (open source)", "note": "One Markdown source for slides, notes and course websites; the tool behind neeldhara.com.", "own": false, "talks": [ { "id": "teaching-tools", "title": "Tools and Technology for Teaching", "url": "https://talks.neeldhara.com/talks/teaching-tools/" } ] }, { "title": "Query Complexity of Tournament Solutions", "url": "https://arxiv.org/abs/1611.06189", "kind": "Preprint", "shelf": "read", "by": "Arnab Maiti, Palash Dey", "note": "The other source paper: how many match outcomes you must query to find Copeland, Slater, Banks and top-cycle winners (TCS 2024).", "own": false, "talks": [ { "id": "champion", "title": "How Many Matches Does It Take to Find a Champion?", "url": "https://talks.neeldhara.com/talks/champion/" } ] }, { "title": "Rank Aggregation Methods for the Web", "url": "https://archives.iw3c2.org/www10/cdrom/papers/577/", "kind": "Paper", "shelf": "read", "by": "Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar", "note": "WWW 2001 classic on rank aggregation, source of the NP-hardness for four rankings shown in the talk.", "own": false, "talks": [ { "id": "kemeny", "title": "Parameterized Approaches to Kemeny Rank Aggregation", "url": "https://talks.neeldhara.com/talks/kemeny/" } ] }, { "title": "Reading Group on Combinatorial and Computational Aspects of Games (Summer 2023)", "url": "https://www.neeldhara.com/courses/2023/02-games/", "kind": "Course", "shelf": "watch", "by": "Neeldhara Misra", "note": "My reading group page with recorded sessions, a reading list and small playable games.", "own": true, "talks": [ { "id": "trends-in-theory", "title": "Trends in Theory", "url": "https://talks.neeldhara.com/talks/trends-in-theory/" } ] }, { "title": "Real stable polynomials and the Kadison-Singer problem", "url": "https://terrytao.wordpress.com/2013/11/04/real-stable-polynomials-and-the-kadison-singer-problem/", "kind": "Article", "shelf": "read", "by": "Terence Tao", "note": "Blog exposition of how real stable polynomials and interlacing helped resolve the Kadison–Singer problem.", "own": false, "talks": [ { "id": "real-stable-polynomials", "title": "Real Stable Polynomials and their Zeros", "url": "https://talks.neeldhara.com/talks/real-stable-polynomials/" } ] }, { "title": "Real Stable Polynomials, Strongly Rayleigh Distributions, and Applications, Part I-A", "url": "https://www.youtube.com/watch?v=vqvNzwbnyxY", "kind": "Video", "shelf": "watch", "by": "Shayan Oveis Gharan (Simons Institute)", "note": "Boot camp tutorial from the Geometry of Polynomials programme, with applications in algorithms.", "own": false, "talks": [ { "id": "real-stable-polynomials", "title": "Real Stable Polynomials and their Zeros", "url": "https://talks.neeldhara.com/talks/real-stable-polynomials/" } ] }, { "title": "Red Blob Games", "url": "https://www.redblobgames.com/", "kind": "Interactive", "shelf": "play", "by": "Amit Patel", "note": "Interactive tutorials on algorithms for games, a model of explanation through play.", "own": false, "talks": [ { "id": "explorables", "title": "Explorable Explanations: Interactive Essays", "url": "https://talks.neeldhara.com/talks/explorables/" } ] }, { "title": "Redesign the Course: A Playable Teaching Essay", "url": "https://slides.neeldhara.com/learning-outcomes-assessment/", "kind": "Interactive", "shelf": "play", "by": "Neeldhara Misra", "note": "Redesign one course file step by step, from learning outcomes to feedback, and watch a student's experience change.", "own": true, "talks": [ { "id": "teaching-tools", "title": "Tools and Technology for Teaching", "url": "https://talks.neeldhara.com/talks/teaching-tools/" } ] }, { "title": "Representative sets and irrelevant vertices: New tools for kernelization", "url": "https://arxiv.org/abs/1111.2195", "kind": "Paper", "shelf": "read", "by": "Stefan Kratsch, Magnus Wahlström", "note": "Uses representative sets from matroid theory to get polynomial kernels, including for Almost 2-SAT.", "own": false, "talks": [ { "id": "matroids-repsets", "title": "Parameterized Algorithms using Matroids", "url": "https://talks.neeldhara.com/talks/matroids-repsets/" } ] }, { "title": "Reservoir Sampling and Preference Elicitation (ACM Summer School on Algorithmic Game Theory 2019)", "url": "https://www.youtube.com/watch?v=Y8auDIDqaOY", "kind": "Video", "shelf": "watch", "by": "Palash Dey", "note": "Summer-school lecture by my co-author on sampling and preference elicitation.", "own": false, "talks": [ { "id": "elicitation-sp-trees", "title": "Elicitation for Preferences Single Peaked on Trees", "url": "https://talks.neeldhara.com/talks/elicitation-sp-trees/" } ] }, { "title": "Robustness Among Multiwinner Voting Rules", "url": "https://arxiv.org/abs/1707.01417", "kind": "Paper", "shelf": "read", "by": "Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon", "note": "Introduces the robustness radius that the SOFSEM 2019 paper studies on restricted domains.", "own": false, "talks": [ { "id": "chamberlin-courant", "title": "Chamberlin–Courant on Restricted Domains", "url": "https://talks.neeldhara.com/talks/chamberlin-courant/" } ] }, { "title": "Robustness Radius for Chamberlin-Courant on Restricted Domains", "url": "https://doi.org/10.1007/978-3-030-10801-4_27", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Chinmay Sonar", "note": null, "own": true, "authors": [ "Neeldhara Misra", "Chinmay Sonar" ], "venue": "SOFSEM 2019 (LNCS)", "year": 2019, "doi": "https://doi.org/10.1007/978-3-030-10801-4_27", "arxiv": null, "pdf": null, "talks": [ { "id": "chamberlin-courant", "title": "Chamberlin–Courant on Restricted Domains", "url": "https://talks.neeldhara.com/talks/chamberlin-courant/" } ] }, { "title": "Selection algorithm", "url": "https://en.wikipedia.org/wiki/Selection_algorithm", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Finding the k-th best by comparisons, with the history from Lewis Carroll's tennis complaint and Steinhaus.", "own": false, "talks": [ { "id": "champion", "title": "How Many Matches Does It Take to Find a Champion?", "url": "https://talks.neeldhara.com/talks/champion/" } ] }, { "title": "Selection Lemmas for various geometric objects", "url": "https://arxiv.org/abs/1401.0443", "kind": "Preprint", "shelf": "read", "by": "Pradeesha Ashok, Ninad Rajgopal, Sathish Govindarajan", "note": "A longer treatment of the selection lemma results by three of the coauthors, covering more classes of objects.", "own": false, "talks": [ { "id": "hitting-piercing-rectangles", "title": "Hitting and Piercing Rectangles Induced by a Point Set", "url": "https://talks.neeldhara.com/talks/hitting-piercing-rectangles/" } ] }, { "title": "Single peaked preferences", "url": "https://en.wikipedia.org/wiki/Single_peaked_preferences", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Quick reference for the central domain restriction, including single-peakedness on trees.", "own": false, "talks": [ { "id": "structured-electorates", "title": "Efficient Algorithms for Hard Problems on Structured Electorates", "url": "https://talks.neeldhara.com/talks/structured-electorates/" } ] }, { "title": "Solo Chess - Capture All the Pieces on the Board", "url": "https://www.chess.com/solo-chess", "kind": "Game", "shelf": "play", "by": "Chess.com", "note": "Play the single-player puzzle: every move captures, and the goal is to leave one piece.", "own": false, "talks": [ { "id": "games-we-play", "title": "The Games We Play", "url": "https://talks.neeldhara.com/talks/games-we-play/" } ] }, { "title": "Solving connectivity problems parameterized by treewidth in single exponential time", "url": "https://arxiv.org/abs/1103.0534", "kind": "Paper", "shelf": "read", "by": "M. Cygan, J. Nederlof, M. Pilipczuk, M. Pilipczuk, J. van Rooij, J. O. Wojtaszczyk", "note": "The paper that introduced Cut & Count for connectivity problems on graphs of bounded treewidth.", "own": false, "talks": [ { "id": "pc-school-lectures", "title": "Parameterized Complexity school lectures", "url": "https://talks.neeldhara.com/talks/pc-school-lectures/" } ] }, { "title": "Solving d-SAT via Backdoors to Small Treewidth", "url": "https://doi.org/10.1137/1.9781611973730.43", "kind": "Paper", "shelf": "read", "by": "Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh", "note": null, "own": true, "authors": [ "Fedor V. Fomin", "Daniel Lokshtanov", "Neeldhara Misra", "M. S. Ramanujan", "Saket Saurabh" ], "venue": "SODA 2015", "year": 2015, "doi": "https://doi.org/10.1137/1.9781611973730.43", "arxiv": null, "pdf": "https://sites.cs.ucsb.edu/~daniello/papers/BackdoorsTreewidth.pdf", "talks": [ { "id": "research-overview", "title": "Algorithms for Planar F-Deletion and Satisfiability", "url": "https://talks.neeldhara.com/talks/research-overview/" } ] }, { "title": "Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels", "url": "https://arxiv.org/abs/0903.4521", "kind": "Preprint", "shelf": "read", "by": "Geevarghese Philip, Venkatesh Raman, Somnath Sikdar", "note": "Background: polynomial kernels for Dominating Set on graphs excluding a fixed K_{i,j}, closely related to the girth setting of the talk.", "own": false, "talks": [ { "id": "cds-short-cycles", "title": "Connected Dominating Set and Short Cycles", "url": "https://talks.neeldhara.com/talks/cds-short-cycles/" } ] }, { "title": "Sprague–Grundy theorem", "url": "https://en.wikipedia.org/wiki/Sprague%E2%80%93Grundy_theorem", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Why every impartial game is equivalent to a single Nim heap.", "own": false, "talks": [ { "id": "nim-hackenbush", "title": "Nim, Hackenbush, and Friends", "url": "https://talks.neeldhara.com/talks/nim-hackenbush/" } ] }, { "title": "Stable matching problem", "url": "https://en.wikipedia.org/wiki/Stable_matching_problem", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Good overview of the problem, the algorithm, its properties and its applications.", "own": false, "talks": [ { "id": "stable-matchings", "title": "On Stable Matchings", "url": "https://talks.neeldhara.com/talks/stable-matchings/" } ] }, { "title": "Stable Matchings | part I", "url": "https://www.youtube.com/watch?v=6BlnSqsrc-4", "kind": "Video", "shelf": "watch", "by": "Neeldhara Misra (IIT Madras BS, Advanced Algorithms)", "note": "First of my three short lectures: blocking pairs, the Gale–Shapley algorithm, and the proof that it works.", "own": true, "talks": [ { "id": "stable-matchings", "title": "On Stable Matchings", "url": "https://talks.neeldhara.com/talks/stable-matchings/" } ] }, { "title": "Stable matchings, part II: the Gale–Shapley algorithm", "url": "https://www.youtube.com/watch?v=PIM334WOSkg", "kind": "Video", "shelf": "watch", "by": "Neeldhara Misra", "note": "My lecture on blocking pairs and the Gale–Shapley algorithm.", "own": true, "talks": [ { "id": "matching-markets", "title": "Manipulation with(out) Money in Matching Markets", "url": "https://talks.neeldhara.com/talks/matching-markets/" } ] }, { "title": "Strategic Aspects of Stable Matching Markets: A Survey", "url": "https://www.ijcai.org/proceedings/2024/893", "kind": "Survey", "shelf": "read", "by": "Hadi Hosseini, Shraddha Pathak", "note": "IJCAI 2024 survey of manipulation and strategic behaviour in matching markets.", "own": false, "talks": [ { "id": "matching-markets", "title": "Manipulation with(out) Money in Matching Markets", "url": "https://talks.neeldhara.com/talks/matching-markets/" } ] }, { "title": "Structural Parameterizations for Eternal Vertex Cover", "url": "https://arxiv.org/abs/2609.17891", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki", "note": "A follow-up: computing the eternal vertex cover number with structural parameters.", "own": true, "authors": [ "Neeldhara Misra", "Sebastian Ordyniak", "Giacomo Paesani", "Mateusz Rychlicki" ], "venue": "IPEC 2026", "year": 2026, "doi": null, "arxiv": "https://arxiv.org/abs/2609.17891", "pdf": null, "talks": [ { "id": "eternal-vc", "title": "Eternal Versions of Vertex Cover and Dominating Set", "url": "https://talks.neeldhara.com/talks/eternal-vc/" } ] }, { "title": "Students Testing Without Coercion", "url": "https://blog.brownplt.org/2020/10/20/examplar.html", "kind": "Article", "shelf": "read", "by": "Brown PLT blog", "note": "On Examplar, a tool that gets students to write test cases before code; one of the education angles in the talk.", "own": false, "talks": [ { "id": "algorithmic-puzzles", "title": "A Few Algorithmic Puzzles (and Why You Should Care)", "url": "https://talks.neeldhara.com/talks/algorithmic-puzzles/" } ] }, { "title": "Subexponential Parameterized Complexity of Completion Problems: Survey of the Upper Bounds (Simons Institute, 2015)", "url": "https://www.youtube.com/watch?v=GTndKwsT4Gc", "kind": "Video", "shelf": "watch", "by": "Marcin Pilipczuk", "note": "Video survey of the subexponential completion algorithms the talk mentions.", "own": false, "talks": [ { "id": "pgm", "title": "Parameterized Graph Modification: A Modern Perspective", "url": "https://talks.neeldhara.com/talks/pgm/" } ] }, { "title": "Tangle: a JavaScript library for reactive documents", "url": "https://worrydream.com/Tangle/", "kind": "Tool", "shelf": "use", "by": "Bret Victor", "note": "A small library for building documents whose numbers readers can drag and change.", "own": false, "talks": [ { "id": "explorables", "title": "Explorable Explanations: Interactive Essays", "url": "https://talks.neeldhara.com/talks/explorables/" } ] }, { "title": "Teaching Innovations @IITGN: Ft. Prof Neeldhara Misra", "url": "https://www.youtube.com/watch?v=-KavoGltbfk", "kind": "Video", "shelf": "watch", "by": "IIT Gandhinagar", "note": "Eight minutes on my flipped DSA course, taught over YouTube live streams with OBS and Itempool.", "own": false, "talks": [ { "id": "teaching-tools", "title": "Tools and Technology for Teaching", "url": "https://talks.neeldhara.com/talks/teaching-tools/" } ] }, { "title": "Tetris is Hard, Even to Approximate", "url": "https://arxiv.org/abs/cs/0210020", "kind": "Paper", "shelf": "read", "by": "Erik D. Demaine, Susan Hohenberger, David Liben-Nowell", "note": "The classic hardness result for Tetris, another game among the talk's projects.", "own": false, "talks": [ { "id": "trends-in-theory", "title": "Trends in Theory", "url": "https://talks.neeldhara.com/talks/trends-in-theory/" } ] }, { "title": "The (Computational) Social Choice Take on Indivisible Participatory Budgeting", "url": "https://arxiv.org/abs/2303.00621", "kind": "Survey", "shelf": "read", "by": "Simon Rey, Felicia Schmidt, Jan Maly", "note": "Survey of the social choice literature on participatory budgeting.", "own": false, "talks": [ { "id": "equal-shares", "title": "Equal Shares and Then Some", "url": "https://talks.neeldhara.com/talks/equal-shares/" } ] }, { "title": "The /now page movement", "url": "https://sive.rs/nowff", "kind": "Article", "shelf": "read", "by": "Derek Sivers", "note": "The idea behind a 'now' page, one of the workshop's content suggestions.", "own": false, "talks": [ { "id": "personal-website", "title": "Building a Personal Website", "url": "https://talks.neeldhara.com/talks/personal-website/" } ] }, { "title": "The almost impossible chessboard puzzle", "url": "https://www.youtube.com/watch?v=as7Gkm7Y7h4", "kind": "Video", "shelf": "watch", "by": "Stand-up Maths (Matt Parker)", "note": "The companion video that poses the puzzle; I use both videos in my CS607 course.", "own": false, "talks": [ { "id": "two-tricks", "title": "Two Tricks", "url": "https://talks.neeldhara.com/talks/two-tricks/" } ] }, { "title": "The CVM Algorithm for Estimating Distinct Elements in Streams", "url": "https://cs.stanford.edu/~knuth/papers/cvm-note.pdf", "kind": "Paper", "shelf": "read", "by": "Donald E. Knuth", "note": "Knuth's own exposition and analysis of the CVM algorithm, cited in the talk.", "own": false, "talks": [ { "id": "streaming-intro", "title": "A Gentle Introduction to Streaming Algorithms", "url": "https://talks.neeldhara.com/talks/streaming-intro/" } ] }, { "title": "The Effect of Girth on the Kernelization Complexity of Connected Dominating Set", "url": "https://doi.org/10.4230/lipics.fsttcs.2010.96", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh", "note": "Free full text of the paper behind the talk, with the girth trichotomy.", "own": true, "authors": [ "Neeldhara Misra", "Geevarghese Philip", "Venkatesh Raman", "Saket Saurabh" ], "venue": "FSTTCS 2010", "year": 2010, "doi": "https://doi.org/10.4230/lipics.fsttcs.2010.96", "arxiv": null, "pdf": null, "talks": [ { "id": "cds-short-cycles", "title": "Connected Dominating Set and Short Cycles", "url": "https://talks.neeldhara.com/talks/cds-short-cycles/" } ] }, { "title": "The Evolution of Cooperation", "url": "https://en.wikipedia.org/wiki/The_Evolution_of_Cooperation", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Robert Axelrod's book on the computer tournaments that inspired Nicky Case's explorable.", "own": false, "talks": [ { "id": "trust", "title": "The Evolution of Trust", "url": "https://talks.neeldhara.com/talks/trust/" } ] }, { "title": "The Firefighter Problem: A survey of results, directions and questions", "url": "https://ajc.maths.uq.edu.au/pdf/43/ajc_v43_p057.pdf", "kind": "Survey", "shelf": "read", "by": "Stephen Finbow, Gary MacGillivray", "note": "The standard survey of the firefighter problem (Australasian Journal of Combinatorics, 2009).", "own": false, "talks": [ { "id": "firefighting", "title": "Algorithmic Aspects of Firefighting", "url": "https://talks.neeldhara.com/talks/firefighting/" } ] }, { "title": "The Golden Ticket: P, NP, and the Search for the Impossible", "url": "https://goldenticket.fortnow.com/", "kind": "Book", "shelf": "read", "by": "Lance Fortnow", "note": "Popular book on P versus NP that I recommended to attendees of the 2013 talk.", "own": false, "talks": [ { "id": "cheat-sheets", "title": "Cheat Sheets for Hard Problems", "url": "https://talks.neeldhara.com/talks/cheat-sheets/" } ] }, { "title": "The Graph Motif Problem Parameterized by the Structure of the Input Graph (IPEC 2015)", "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.319", "kind": "Paper", "shelf": "read", "by": "Édouard Bonnet, Florian Sikora", "note": "Later work on which structural parameters make Graph Motif easier.", "own": false, "talks": [ { "id": "colorful-motifs", "title": "On the Kernelization Complexity of Colorful Motifs", "url": "https://talks.neeldhara.com/talks/colorful-motifs/" } ] }, { "title": "The Humble Programmer (EWD340)", "url": "https://www.cs.utexas.edu/~EWD/ewd03xx/EWD340.PDF", "kind": "Essay", "shelf": "read", "by": "Edsger W. Dijkstra (1972)", "note": "Dijkstra's Turing Award lecture on programming as an intellectual discipline.", "own": false, "talks": [ { "id": "history-algorithms", "title": "History of Algorithms: The Worst Case and Beyond", "url": "https://talks.neeldhara.com/talks/history-algorithms/" } ] }, { "title": "The intrinsic computational difficulty of functions", "url": "https://www.cs.toronto.edu/~sacook/homepage/cobham_intrinsic.pdf", "kind": "Paper", "shelf": "read", "by": "Alan Cobham (1965)", "note": "An early, independent case for polynomial time as the right notion of feasible computation.", "own": false, "talks": [ { "id": "history-algorithms", "title": "History of Algorithms: The Worst Case and Beyond", "url": "https://talks.neeldhara.com/talks/history-algorithms/" } ] }, { "title": "The Life and times of Edsger Dijkstra", "url": "https://www.youtube.com/watch?v=pxWjlLDRoAs", "kind": "Talk", "shelf": "watch", "by": "Madhavan Mukund", "note": "An hour-long lecture on Dijkstra's life and work.", "own": false, "talks": [ { "id": "history-algorithms", "title": "History of Algorithms: The Worst Case and Beyond", "url": "https://talks.neeldhara.com/talks/history-algorithms/" } ] }, { "title": "The Matching Algorithm (NRMP)", "url": "https://www.nrmp.org/intro-to-the-match/how-matching-algorithm-works/", "kind": "Article", "shelf": "read", "by": "National Resident Matching Program", "note": "How the US residency match uses tentative matches and 'bumping', with worked examples.", "own": false, "talks": [ { "id": "stable-matchings", "title": "On Stable Matchings", "url": "https://talks.neeldhara.com/talks/stable-matchings/" } ] }, { "title": "The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs", "url": "https://doi.org/10.1007/978-3-030-19955-5_26", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Piyush Rathi", "note": "Structural parameterizations of domination, efficient domination and their distance versions.", "own": true, "authors": [ "Neeldhara Misra", "Piyush Rathi" ], "venue": "CSR 2019", "year": 2019, "doi": "https://doi.org/10.1007/978-3-030-19955-5_26", "arxiv": null, "pdf": null, "talks": [ { "id": "dominating-set-variants", "title": "Parameterized Algorithms for Variants of Dominating Set", "url": "https://talks.neeldhara.com/talks/dominating-set-variants/" } ] }, { "title": "The Parameterized Complexity of Unique Coverage and Its Variants", "url": "https://doi.org/10.1007/s00453-011-9608-0", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar", "note": "Earlier work on Unique Coverage for abstract set systems, the baseline the geometric results improve on.", "own": true, "authors": [ "Neeldhara Misra", "Hannes Moser", "Venkatesh Raman", "Saket Saurabh", "Somnath Sikdar" ], "venue": "Algorithmica", "year": 2011, "doi": "https://doi.org/10.1007/s00453-011-9608-0", "arxiv": null, "pdf": null, "talks": [ { "id": "unique-covering", "title": "Unique Covering Problems with Geometric Sets", "url": "https://talks.neeldhara.com/talks/unique-covering/" } ] }, { "title": "The Python Tutorial", "url": "https://docs.python.org/3/tutorial/", "kind": "Reference", "shelf": "read", "by": "Python Software Foundation", "note": "The official tutorial, for anyone who wants to start writing their own puzzle solvers.", "own": false, "talks": [ { "id": "puzzles-python", "title": "Problem Solving with Python", "url": "https://talks.neeldhara.com/talks/puzzles-python/" } ] }, { "title": "The Runaway Rectangle Escape Problem", "url": "https://arxiv.org/abs/1603.04210", "kind": "Paper", "shelf": "read", "by": "Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty", "note": "Expanded 26-page version of the CCCG paper.", "own": true, "authors": [ "Aniket Basu Roy", "Anil Maheshwari", "Sathish Govindarajan", "Neeldhara Misra", "Subhas C. Nandy", "Shreyas Shetty" ], "venue": "arXiv preprint", "year": 2016, "doi": null, "arxiv": "https://arxiv.org/abs/1603.04210", "pdf": null, "talks": [ { "id": "rectangle-escape", "title": "On the d-Runaway Rectangle Escape Problem", "url": "https://talks.neeldhara.com/talks/rectangle-escape/" } ] }, { "title": "The Silent (R)evolution of SAT", "url": "https://www.youtube.com/watch?v=8kSWh3m69-I", "kind": "Video", "shelf": "watch", "by": "Johannes K. Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider (VCLA)", "note": "A three-minute video on why practical SAT solving works so well.", "own": false, "talks": [ { "id": "research-overview", "title": "Algorithms for Planar F-Deletion and Satisfiability", "url": "https://talks.neeldhara.com/talks/research-overview/" } ] }, { "title": "Thirty-three Miniatures: Mathematical and Algorithmic Applications of Linear Algebra", "url": "https://kam.mff.cuni.cz/~matousek/la-ams.html", "kind": "Book", "shelf": "read", "by": "Jiří Matoušek", "note": "Short, self-contained gems of the linear algebra method; the author's page links a free preliminary version.", "own": false, "talks": [ { "id": "linear-algebra-methods", "title": "Linear Algebra Methods in Combinatorics", "url": "https://talks.neeldhara.com/talks/linear-algebra-methods/" } ] }, { "title": "To Build a Better Ballot", "url": "https://ncase.me/ballot/", "kind": "Interactive", "shelf": "play", "by": "Nicky Case", "note": "Playable explainer comparing voting systems with simulated voters.", "own": false, "talks": [ { "id": "comsoc-intro", "title": "An Introduction to Computational Social Choice", "url": "https://talks.neeldhara.com/talks/comsoc-intro/" } ] }, { "title": "Topics in Combinatorics lecture 2.0: Intersecting families", "url": "https://www.youtube.com/watch?v=gesQpnQNyqw", "kind": "Video", "shelf": "watch", "by": "Timothy Gowers", "note": "A lecture on Katona's proof of Erdős–Ko–Rado, the method the talk adapts.", "own": false, "talks": [ { "id": "ekr-matchings", "title": "An Erdős–Ko–Rado Theorem for Matchings", "url": "https://talks.neeldhara.com/talks/ekr-matchings/" } ] }, { "title": "Topics on Tournaments", "url": "https://www.gutenberg.org/ebooks/42833", "kind": "Book", "shelf": "read", "by": "John W. Moon", "note": "The classic monograph on the graph theory of tournaments, free on Project Gutenberg.", "own": false, "talks": [ { "id": "tournaments-intro", "title": "An Introduction to Tournaments", "url": "https://talks.neeldhara.com/talks/tournaments-intro/" } ] }, { "title": "Tournament (graph theory)", "url": "https://en.wikipedia.org/wiki/Tournament_(graph_theory)", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Definitions and basic facts: paths and cycles, transitivity, score sequences, and majority relations from voting.", "own": false, "talks": [ { "id": "tournaments-intro", "title": "An Introduction to Tournaments", "url": "https://talks.neeldhara.com/talks/tournaments-intro/" } ] }, { "title": "Tournament Fixing and Superkings", "url": "https://www.youtube.com/watch?v=tHcAcZ45kww", "kind": "Video", "shelf": "watch", "by": "Neeldhara Misra (ACM Summer School on Algorithmic Game Theory 2019, NPTEL)", "note": "My 2019 summer-school lecture on rigging knockout tournaments and the role of kings.", "own": true, "talks": [ { "id": "tournaments-intro", "title": "An Introduction to Tournaments", "url": "https://talks.neeldhara.com/talks/tournaments-intro/" } ] }, { "title": "Tournaments in Computational Social Choice (IJCAI 2024 Tutorial)", "url": "https://www.comp.nus.edu.sg/~warut/ijcai24-tutorial.html", "kind": "Lecture notes", "shelf": "read", "by": "Warut Suksompong", "note": "A tutorial on choosing winners from pairwise comparisons, including single-elimination (knockout) tournaments.", "own": false, "talks": [ { "id": "tournaments-intro", "title": "An Introduction to Tournaments", "url": "https://talks.neeldhara.com/talks/tournaments-intro/" } ] }, { "title": "Tree Deletion Set has a Polynomial Kernel (but no OPT^{O(1)} approximation)", "url": "https://arxiv.org/abs/1309.7891", "kind": "Preprint", "shelf": "read", "by": "Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý", "note": "A close cousin from the talk's related-work slides: delete vertices so that what remains is a tree.", "own": false, "talks": [ { "id": "deleting-structured-trees", "title": "Deleting to Structured Trees", "url": "https://talks.neeldhara.com/talks/deleting-structured-trees/" } ] }, { "title": "Two Dots - Connect the Colors (App Store)", "url": "https://apps.apple.com/us/app/two-dots-connect-the-colors/id880178264", "kind": "Game", "shelf": "play", "by": "Playdots, Inc.", "note": "Play the game itself.", "own": false, "talks": [ { "id": "two-dots", "title": "Two Dots is NP-complete", "url": "https://talks.neeldhara.com/talks/two-dots/" } ] }, { "title": "Unique Covering Problems with Geometric Sets", "url": "https://doi.org/10.1007/978-3-319-21398-9_43", "kind": "Paper", "shelf": "read", "by": "Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh", "note": null, "own": true, "authors": [ "Pradeesha Ashok", "Sudeshna Kolay", "Neeldhara Misra", "Saket Saurabh" ], "venue": "COCOON 2015", "year": 2015, "doi": "https://doi.org/10.1007/978-3-319-21398-9_43", "arxiv": null, "pdf": null, "talks": [ { "id": "unique-covering", "title": "Unique Covering Problems with Geometric Sets", "url": "https://talks.neeldhara.com/talks/unique-covering/" } ] }, { "title": "UNO Gets Easier for a Single Player", "url": "https://doi.org/10.1007/978-3-319-07890-8_13", "kind": "Paper", "shelf": "read", "by": "Palash Dey, Prachi Goyal, Neeldhara Misra", "note": null, "own": true, "authors": [ "Palash Dey", "Prachi Goyal", "Neeldhara Misra" ], "venue": "FUN 2014 (LNCS 8496)", "year": 2014, "doi": "https://doi.org/10.1007/978-3-319-07890-8_13", "arxiv": null, "pdf": null, "talks": [ { "id": "trends-in-theory", "title": "Trends in Theory", "url": "https://talks.neeldhara.com/talks/trends-in-theory/" } ] }, { "title": "Upper and Lower Bounds for Weak Backdoor Set Detection", "url": "https://doi.org/10.1007/978-3-642-39071-5_29", "kind": "Paper", "shelf": "read", "by": "Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider", "note": null, "own": true, "authors": [ "Neeldhara Misra", "Sebastian Ordyniak", "Venkatesh Raman", "Stefan Szeider" ], "venue": "SAT 2013", "year": 2013, "doi": "https://doi.org/10.1007/978-3-642-39071-5_29", "arxiv": "https://arxiv.org/abs/1304.5518", "pdf": null, "talks": [ { "id": "research-overview", "title": "Algorithms for Planar F-Deletion and Satisfiability", "url": "https://talks.neeldhara.com/talks/research-overview/" } ] }, { "title": "Van der Waerden/Schrijver-Valiant like Conjectures and Stable (aka Hyperbolic) Homogeneous Polynomials: One Theorem for all", "url": "https://arxiv.org/abs/0711.3496", "kind": "Paper", "shelf": "read", "by": "Leonid Gurvits", "note": "The original paper: one inequality for stable homogeneous polynomials that implies van der Waerden-type bounds.", "own": false, "talks": [ { "id": "real-stable-polynomials", "title": "Real Stable Polynomials and their Zeros", "url": "https://talks.neeldhara.com/talks/real-stable-polynomials/" } ] }, { "title": "Vapnik–Chervonenkis dimension", "url": "https://en.wikipedia.org/wiki/Vapnik%E2%80%93Chervonenkis_dimension", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Lines and hyperplanes have bounded VC-dimension, a theme in the talk's table of results.", "own": false, "talks": [ { "id": "unique-covering", "title": "Unique Covering Problems with Geometric Sets", "url": "https://talks.neeldhara.com/talks/unique-covering/" } ] }, { "title": "Variations on the Tournament Problem", "url": "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.20", "kind": "Paper", "shelf": "read", "by": "Fabrizio Luccio, Linda Pagli, Nicola Santoro", "note": "One of the two papers the talk draws on: finding the top t with k-way races (FUN 2024).", "own": false, "talks": [ { "id": "champion", "title": "How Many Matches Does It Take to Find a Champion?", "url": "https://talks.neeldhara.com/talks/champion/" } ] }, { "title": "Vertex separator (Wikipedia)", "url": "https://en.wikipedia.org/wiki/Vertex_separator", "kind": "Reference", "shelf": "read", "by": "Wikipedia", "note": "Definitions of s–t separators and minimal separators.", "own": false, "talks": [ { "id": "separators", "title": "Separators with Non-Hereditary Properties", "url": "https://talks.neeldhara.com/talks/separators/" } ] }, { "title": "Visualising Sorting Algorithms", "url": "https://corte.si/posts/code/visualisingsorting/", "kind": "Article", "shelf": "read", "by": "Aldo Cortesi", "note": "The essay behind the 'glob of porridge' critique of animations, and its static alternative.", "own": false, "talks": [ { "id": "joyful-interactives", "title": "Building Joyful Interactives", "url": "https://talks.neeldhara.com/talks/joyful-interactives/" } ] }, { "title": "Visualizing quaternions", "url": "https://eater.net/quaternions", "kind": "Interactive", "shelf": "play", "by": "Grant Sanderson and Ben Eater", "note": "An explorable video series where you can grab the objects the narrator is talking about.", "own": false, "talks": [ { "id": "joyful-interactives", "title": "Building Joyful Interactives", "url": "https://talks.neeldhara.com/talks/joyful-interactives/" } ] }, { "title": "W6_L6.3: Iterative compression, feedback vertex set", "url": "https://www.youtube.com/watch?v=geOL5EJIOO0", "kind": "Video", "shelf": "watch", "by": "Neeldhara Misra (IIT Madras BS, Advanced Algorithms)", "note": "My hour-long lecture applying the method to Feedback Vertex Set, after a warm-up on Vertex Cover in the previous video.", "own": true, "talks": [ { "id": "iterative-compression", "title": "Iterative Compression", "url": "https://talks.neeldhara.com/talks/iterative-compression/" } ] }, { "title": "Web Content Accessibility Guidelines (WCAG) 2.1", "url": "https://www.w3.org/TR/WCAG21/", "kind": "Reference", "shelf": "read", "by": "W3C", "note": "The standard behind the accessibility checklist in the workshop: alt text, contrast, resizable text.", "own": false, "talks": [ { "id": "personal-website", "title": "Building a Personal Website", "url": "https://talks.neeldhara.com/talks/personal-website/" } ] }, { "title": "What Computers Can't Do - with Kevin Buzzard", "url": "https://www.youtube.com/watch?v=jQPb7DRMoZY", "kind": "Talk", "shelf": "watch", "by": "Kevin Buzzard (Royal Institution)", "note": "A Royal Institution public lecture on P versus NP, the central open question about the limits of efficient computation.", "own": false, "talks": [ { "id": "history-algorithms", "title": "History of Algorithms: The Worst Case and Beyond", "url": "https://talks.neeldhara.com/talks/history-algorithms/" } ] }, { "title": "Why I want to be a Professor", "url": "https://dsanghi.blogspot.com/2014/08/why-i-want-to-be-professor.html", "kind": "Essay", "shelf": "read", "by": "Dheeraj Sanghi", "note": "The 'why' side, from an Indian computer science professor.", "own": false, "talks": [ { "id": "career-academia", "title": "A Career in Academia: Why and Why Not?", "url": "https://talks.neeldhara.com/talks/career-academia/" } ] }, { "title": "Why I'm leaving Harvard", "url": "https://matt-welsh.blogspot.com/2010/11/why-im-leaving-harvard.html", "kind": "Essay", "shelf": "read", "by": "Matt Welsh", "note": "The 'why not' side: a tenured professor explains leaving for industry.", "own": false, "talks": [ { "id": "career-academia", "title": "A Career in Academia: Why and Why Not?", "url": "https://talks.neeldhara.com/talks/career-academia/" } ] }, { "title": "Women in Tech: The Facts", "url": "https://ncwit.org/resource/thefacts/", "kind": "Reference", "shelf": "read", "by": "NCWIT", "note": "The data report the talk cites on the gender gap in computing careers.", "own": false, "talks": [ { "id": "gender-programming", "title": "Gender Disparities in Programming Competence in India", "url": "https://talks.neeldhara.com/talks/gender-programming/" } ] }, { "title": "XOR trick (interactive)", "url": "https://xortrick.netlify.app/", "kind": "Interactive", "shelf": "play", "by": "Neeldhara Misra", "note": "Toggle 16 bits and compute f, the XOR of the positions of the 1s; try steering it to any value with one flip.", "own": true, "talks": [ { "id": "two-tricks", "title": "Two Tricks", "url": "https://talks.neeldhara.com/talks/two-tricks/" } ] }, { "title": "Y. Dinitz's talk at S. Even's Party (2003)", "url": "https://www.wisdom.weizmann.ac.il/~oded/even-dini.html", "kind": "Essay", "shelf": "read", "by": "Yefim Dinitz", "note": "First-hand account of algorithms research in the USSR and of how Dinitz's max-flow algorithm reached the West through Shimon Even.", "own": false, "talks": [ { "id": "history-algorithms", "title": "History of Algorithms: The Worst Case and Beyond", "url": "https://talks.neeldhara.com/talks/history-algorithms/" } ] }, { "title": "You and Your Research (1995 lecture)", "url": "https://www.youtube.com/watch?v=a1zDuOPkMSw", "kind": "Video", "shelf": "watch", "by": "Richard Hamming", "note": "Hamming's classic talk on choosing important problems and working on them; a natural companion to the balancing acts.", "own": false, "talks": [ { "id": "grad-school", "title": "Being a Successful Grad Student", "url": "https://talks.neeldhara.com/talks/grad-school/" } ] }, { "title": "Zeros of Polynomials and their Applications to Theory: A Primer", "url": "https://www.cs.yale.edu/homes/vishnoi/Publications_files/ZerosIntro.pdf", "kind": "Survey", "shelf": "read", "by": "Nisheeth K. Vishnoi", "note": "A 2013 primer on proving that polynomials have no zeros in a region, opening with the permanent lower bound.", "own": false, "talks": [ { "id": "real-stable-polynomials", "title": "Real Stable Polynomials and their Zeros", "url": "https://talks.neeldhara.com/talks/real-stable-polynomials/" } ] } ] }