Neeldhara
  • About
  • Research
    • Overview
    • People
    • Publications
    • Surveys
  • Teaching
    • Courses
    • Materials
  • Lists
    • Puzzles
    • Bookmarks
  • Exposition
    • Talks
    • Videos
  • Events
  • Blog

Talks

Talks

 

The slides for most of my talks are available from here, and several recordings are on this Youtube playlist.

Coming Soon

A few tutorial-style talks are missing from this list, they will be added soon.

 

  • Featured
  • All

 

2022 Games of Pursuit and Evasion
STCS Vigyan Vidushi 2022 Distinguished Lecture
TIFR, Mumbai
2022 History of Algorithms: The Worst Case and Beyond
History of Ideas 2.0 (Seminar Series)
Virtual (organized by IIT Gandhinagar)
2022 Parameterized Approaches to Kemeny Rank Aggregation
Bangalore Theory Seminars
Virtual (organized by CSA, Indian Institute of Science and MSR Bangalore)
2020 Fair Division with Minimal Sharing
COMSOC Video Seminar Rump Session
Virtual
2019 Evolution of Trust
Summer Research Internship Program Seminar Series
IIT Gandhinagar
No matching items

 

2022 A Few Algorithmic Puzzles (and why you should care)
Department Seminar
Virtual (organized by SSN College of Engineering)
2022 A career in academia - why and why not?
ACM-W India Grad Cohort Workshop
IIT Jodhpur
2022 Current Research Directions in Fair Division
ACM Goa Chapter Seminar Series
Virtual
2022 Games of Pursuit and Evasion
STCS Vigyan Vidushi 2022 Distinguished Lecture
TIFR, Mumbai
2022 History of Algorithms: The Worst Case and Beyond
History of Ideas 2.0 (Seminar Series)
Virtual (organized by IIT Gandhinagar)
2022 On Fair Division with Binary Valuations Respecting Social Networks
Workshop on Computation and Economics
Ashoka University
2022 Panel discussion on "The Source Code: Foundational Literacy Numeracy Digitacy and Beyond"
Raising Learners For India 2040, a Karadi Path event
The Shri Ram Universal School, Lodha Lakeshore Greens, Palava
2022 Parameterized Approaches to Kemeny Rank Aggregation
Bangalore Theory Seminars
Virtual (organized by CSA, Indian Institute of Science and MSR Bangalore)
2022 Problem Solving with Python
Paradox Workshop, a Convocation Event for the IITM Online BSc Degree Program
IIT Madras
2022 Programming Beyond Block Coding
Coding Bootcamp for Innovation Club Students
Science City Ahmedabad (organized by GUJCOST)
2022 The Games we Play
FDP on Futuristic Technologies in the field of IT
LD College of Engineering
2021 Algorithmic Aspects of Firefighting
a short talk given as a part of the INAE webinar series
Virtual
2021 Panel discussion on Women in Computing Panel on PhD Opportunities in India
CSA Golden Jubilee lecture series
CSA, Indian Institute of Science
2021 Party Nominations
a talk at ReLaX — a Workshop on Games
Virtual (organized by Chennai Mathematical Institute)
2020 Fair Division with Minimal Sharing
COMSOC Video Seminar Rump Session
Virtual
2020 Parameterized Algorithms for Variants of Dominating Set
Workshop on Recent Trends Domination in Graphs - Algorithms, Complexity and Applications
Virtual (organized by NIT Warangal)
2019 Chamberlin-Courant on Restricted Domains
Recent Trends in Algorithms
National Institute of Science Education and Research, Bhubaneswar
2019 Early Career Researcher Presentation
13th Inter-Research-Institute Student Seminar in Computer Science (IRISS)
Rajagiri School of Engineering and Technology
2019 Evolution of Trust
Summer Research Internship Program Seminar Series
IIT Gandhinagar
2019 Explorable Explanations - Interactive Essays
Winter Institute in Digital Humanities
IIT Gandhinagar
2019 Firefighting with Critical Nodes
CSA50 - Pratiksha Trust Workshop on Theoretical Computer Science
CSA, Indian Institute of Science, Bangalore
2019 On Stable Matchings
Keynote Talk at the ACM India Student Chapters Summit
Manipal University, Jaipur
2018 Technical presentation skills versus interpersonal skills (joint presentation with Varsha Apte)
First ACM India Grad Cohort Workshop for Women in Computing
IIT Bombay
2017 An Introduction to Parameterized Algorithms
Pre-Conference Workshop on Graph Algorithms (13th ADMA Conference)
SSN College
2017 Efficient Algorithms for Hard Problems on Structured Electorates
Workshop on Aspects of Computation
National University of Singapore
2016 An Introduction to Computational Social Choice
Workshop on Game Theory and Optimization
CSA, Indian Institute of Science
2016 Efficient Algorithms for Hard Problems on Structured Electorates
Workshop on Rangoli of Algorithms
Chennai Mathematical Institute
2016 Elicitation for Preferences Single Peaked on Trees
CS-Econ Seminar Series
Duke University
2016 Parameterized Algorithms
Tutorial Talk
Duke University
2016 Parameterized Algorithms for Computational Social Choice
Workshop on Game Theory and Optimization
Indian Institute of Science
2015 Glimpses of Algebraic Graph Theory and Linear Algebra Methods in Combinatorics
Workshop on Linear Algebra and Related Topics at the School of Mathematics and Computing Sciences
Rani Channamma University, Belagavi
2015 On the Planar F-Deletion Problem
Fourth India-Taiwan Conference on Discrete Mathematics
IIT Madras
2015 Some Algorithmic Excursions
Science Academies Education Program, Workshop for Pre-University Students in Elementary Mathematics
Christ College, Bangalore
2014 Iterative Compression for FVS
Department Seminar
IIIT Bangalore
2014 Max $q$-Colorable Induced Subgraph Problem on Perfect Graphs
Graph Modification Problems
Dagstuhl, Germany
2014 Parameterized Graph Modification - A Modern Perspective
New Developments in Exact Algorithms and Lower Bounds (Pre-FSTTCS Workshop)
IIT Delhi
2012 Connected Dominating Set and Short Cycles
Department Seminar
Indian Statistical Institute, Bangalore
2012 From FVS to F-deletion - the Story of a Simple Algorithm
Department Seminar
VCLA, Technical University of Vienna
2012 Kernelization
Chennai Update Meeting on Parameterized Complexity
Institute of Mathematical Sciences, Chennai
2012 Kernels for Planar F-Deletion
Data Reduction and Problem Kernels
Dagstuhl, Germany
2012 Separators with Non-Hereditary Properties
Mini-Workshop on Logic, Proofs and Algorithms
VCLA, Technical University of Vienna
2011 Efficient Simplification - Polynomial Time Revisited
Department Seminar
CSA, Indian Institute of Science
2010 Connected Dominating Set and Short Cycles
Algorithms Seminar Series
University of Bergen, Norway
2010 Efficient Simplification - The (im)possibilities
IMPECS School on Parameterized Complexity
Institute for Mathematical Sciences
2010 Expansions for Reductions
Workshop on Kernelization
Lorentz Center, Netherlands
2010 Iterative Compression --- Try, try, till you succeed --- or fail.
Kalasalingam University, Madurai, and Institute Seminar Week
The Institute of Mathematical Sciences
2010 Lower Bounds on Kernelization
Department Seminar
Chalmers University, Sweden
No matching items
×

A Few Algorithmic Puzzles (and why you should care)

 

×

A Few Algorithmic Puzzles (and why you should care)

 

×

The Games we Play

 

×

The Games we Play

 

×

Programming Beyond Block Coding

 

×

Programming Beyond Block Coding

 

×

On Fair Division with Binary Valuations Respecting Social Networks

 

×

On Fair Division with Binary Valuations Respecting Social Networks

 

×

Problem Solving with Python

 

×

Problem Solving with Python

 

×

History of Algorithms: The Worst Case and Beyond

 

×

History of Algorithms: The Worst Case and Beyond

 

×

Games of Pursuit and Evasion

 

×

Games of Pursuit and Evasion

 

×

A career in academia - why and why not?

 

×

A career in academia - why and why not?

 

×

Panel discussion on “The Source Code: Foundational Literacy Numeracy Digitacy and Beyond”

 

×

Panel discussion on “The Source Code: Foundational Literacy Numeracy Digitacy and Beyond”

 

×

Parameterized Approaches to Kemeny Rank Aggregation

 

×

Parameterized Approaches to Kemeny Rank Aggregation

 

×

Current Research Directions in Fair Division

 

×

Current Research Directions in Fair Division

 

×

Panel discussion on Women in Computing Panel on PhD Opportunities in India

 

×

Panel discussion on Women in Computing Panel on PhD Opportunities in India

 

×

Algorithmic Aspects of Firefighting

 

×

Algorithmic Aspects of Firefighting

 

×

Party Nominations

 

×

Party Nominations

 

×

Fair Division with Minimal Sharing

 

×

Fair Division with Minimal Sharing

 

×

Parameterized Algorithms for Variants of Dominating Set

 

×

Parameterized Algorithms for Variants of Dominating Set

 

×

Explorable Explanations - Interactive Essays

 

×

Explorable Explanations - Interactive Essays

 

×

On Stable Matchings

 

×

On Stable Matchings

 

×

Chamberlin-Courant on Restricted Domains

 

×

Chamberlin-Courant on Restricted Domains

 

×

Firefighting with Critical Nodes

 

×

Firefighting with Critical Nodes

 

×

Early Career Researcher Presentation

 

×

Early Career Researcher Presentation

 

×

Evolution of Trust

 

×

Evolution of Trust

 

×

Technical presentation skills versus interpersonal skills (joint presentation with Varsha Apte)

 

×

Technical presentation skills versus interpersonal skills (joint presentation with Varsha Apte)

 

×

An Introduction to Parameterized Algorithms

 

×

An Introduction to Parameterized Algorithms

 

×

Efficient Algorithms for Hard Problems on Structured Electorates

 

×

Efficient Algorithms for Hard Problems on Structured Electorates

 

×

Efficient Algorithms for Hard Problems on Structured Electorates

 

×

Efficient Algorithms for Hard Problems on Structured Electorates

 

×

Parameterized Algorithms for Computational Social Choice

 

×

Parameterized Algorithms for Computational Social Choice

 

×

Elicitation for Preferences Single Peaked on Trees

 

×

Elicitation for Preferences Single Peaked on Trees

 

×

Parameterized Algorithms

 

×

Parameterized Algorithms

 

×

An Introduction to Computational Social Choice

 

×

An Introduction to Computational Social Choice

 

×

On the Planar F-Deletion Problem

 

×

On the Planar F-Deletion Problem

 

×

Glimpses of Algebraic Graph Theory and Linear Algebra Methods in Combinatorics

 

×

Glimpses of Algebraic Graph Theory and Linear Algebra Methods in Combinatorics

 

×

Some Algorithmic Excursions

 

×

Some Algorithmic Excursions

 

×

Parameterized Graph Modification - A Modern Perspective

 

×

Parameterized Graph Modification - A Modern Perspective

 

×

Iterative Compression for FVS

 

×

Iterative Compression for FVS

 

×

Max qqq-Colorable Induced Subgraph Problem on Perfect Graphs

 

×

Max qqq-Colorable Induced Subgraph Problem on Perfect Graphs

 

×

Kernels for Planar F-Deletion

 

×

Kernels for Planar F-Deletion

 

×

Separators with Non-Hereditary Properties

 

×

Separators with Non-Hereditary Properties

 

×

From FVS to F-deletion - the Story of a Simple Algorithm

 

×

From FVS to F-deletion - the Story of a Simple Algorithm

 

×

Kernelization

 

×

Kernelization

 

×

Connected Dominating Set and Short Cycles

 

×

Connected Dominating Set and Short Cycles

 

×

Efficient Simplification - Polynomial Time Revisited

 

×

Efficient Simplification - Polynomial Time Revisited

 

×

Efficient Simplification - The (im)possibilities

 

×

Efficient Simplification - The (im)possibilities

 

×

Expansions for Reductions

 

×

Expansions for Reductions

 

×

Connected Dominating Set and Short Cycles

 

×

Connected Dominating Set and Short Cycles

 

×

Lower Bounds on Kernelization

 

×

Lower Bounds on Kernelization

 

×

Iterative Compression — Try, try, till you succeed — or fail.

 

×

Iterative Compression — Try, try, till you succeed — or fail.

 

No matching items

© 2022 • Neeldhara Misra • Credits •

 

Corrections? Please leave a comment here or a PR in this repository, thanks!

I’d rather be a failure at something I love than a success at something I hate.

George Burns

You live and you learn — at any rate, you live.

Douglas Adams

A problem worthy of attack proves its worth by fighting back.

Paul Erdos

×