Neeldhara
  • About
  • Research
    • Overview
    • People
    • Publications
    • Surveys
  • Teaching
    • Courses
    • Materials
  • Lists
    • Puzzles
    • Bookmarks
  • Exposition
    • Talks
    • Videos
  • Events
  • Blog
Year Title
2022 On Fair Division with Binary Valuations Respecting Social Networks
Workshop on Computation and Economics, Ashoka University
2022 Problem Solving with Python
a workshop conducted at Paradox, an NPTEL offline Convocation Event, IIT Madras
2022 The Games we Play
STCS Vigyan Vidushi 2022 Distinguished Lecture, TIFR
2022 A career in academia: why and why not?
ACM-W India Grad Cohort Workshop, IIT Jodhpur
2022 Panel discussion on “The Source Code: Foundational Literacy Numeracy Digitacy and Beyond”
Raising Learners For India 2040, a Karadi Path event
2022 Parameterized Approaches to Kemeny Rank Aggregation
Bangalore Theory Seminars, CSA, Indian Institute of Science and MSR Bangalore
2022 Current Research Directions in Fair Division
ACM Goa Chapter Seminar Series
2021 Panel discussion on Women in Computing Panel on PhD Opportunities in India
CSA, Indian Institute of Science
2021 Algorithmic Aspects of Firefighting
a short talk given as a part of the INAE webinar series
2021 Party Nominations
a talk at ReLaX — a Workshop on Games Chennai Mathematical Institute
2020 Parameterized Algorithms for Variants of Dominating Set
series of invited lectures in a virtual workshop on
Recent Trends Domination in Graphs - Algorithms, Complexity and Applications,
organized by NIT Warangal
2019 Explorable Explanations: Interactive Essays
Winter Institute in Digital Humanities, IIT Gandhinagar
2019 On Stable Matchings
Keynote Talk at the ACM India Student Chapters Summit, Manipal University
2019 Chamberlin-Courant on Restricted Domains
Recent Trends in Algorithms, National Institute of Science Education and Research, Bhubaneswar
2019 Firefighting with Critical Nodes
CSA50 - Pratiksha Trust Workshop on Theoretical Computer Science,
Indian Institute of Science, Bangalore
2019 Early Career Researcher Presentation
13th Inter-Research-Institute Student Seminar in Computer Science,
Rajagiri School of Engineering and Technology
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
Invited talk at the workshop on Aspects of Computation, National University of Singapore
2016 Efficient Algorithms for Hard Problems on Structured Electorates
Workshop on Rangoli of Algorithms, Chennai Mathematical Institute
2016 Parameterized Algorithms for Computational Social Choice
Workshop on Game Theory and Optimization, Indian Institute of Science
2016 Elicitation for Preferences Single Peaked on Trees
CS-Econ Seminar Series, Duke University
2016 Parameterized Algorithms
Tutorial Talk, Duke University
2016 An Introduction to Computational Social Choice
Workshop on Game Theory and Optimization, Indian Institute of Science
2015 On the Planar F-Deletion Problem
Fourth India-Taiwan Conference on Discrete Mathematics, IIT Madras
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 Some Algorithmic Excursions
Science Academies’ Education Program,
Workshop for Pre-University Students in Elementary Mathematics,
at Christ College, Bangalore
2014 Parameterized Graph Modification: A Modern Perspective
New Developments in Exact Algorithms and Lower Bounds,
Pre-FSTTCS Workshop, IIT Delhi
2014 Iterative Compression for FVS
IIIT Bangalore
2014 Max q-Colorable Induced Subgraph Problem on Perfect Graphs
Graph Modification Problems, Dagstuhl, Germany
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
2012 From FVS to F-deletion: the Story of a Simple Algorithm
VCLA, Technical University of Vienna
2012 Kernelization
Chennai Update Meeting on Parameterized Complexity,
Institute of Mathematical Sciences, Chennai
2012 Connected Dominating Set and Short Cycles
Indian Statistical Institute, Bangalore
2011 Efficient Simplification: Polynomial Time Revisited
Indian Institute of Science
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 Connected Dominating Set and Short Cycles
Algorithms Seminar Series, University of Bergen, Norway
2010 Lower Bounds on Kernelization
Chalmers University, Sweden
2010 Iterative Compression: Try, try, till you succeed — or fail.
Kalasalingam University, Madurai, and Institute Seminar Week, The Institute of Mathematical Sciences

© 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

×