‣
Put the block below back up later, once the pages are fleshed out.
Resume ⸱ Research Group ⸱ Communications Team
- Home
- About
- Research
- Interests
- Publications
- Talks
- Theses
- Events
- Teaching
- Blog
- Contact
- Comments
- Portfolio Posts Media Recs Downloads Template Globals Content Offline Setup
Add PDF of CV on this page.
Unnamed
‣
- Downloads are served from the CONTENT DATABASE, based on a few properties:
- Type: Download
- Status: Live - a Download (or any entry) marked as Draft will not serve to a page.
- Price: Make that money
- Super:link - TBD whether or not you want to use this, but it's easiest if you have a Super:link set for product purchase. If it's a Gumroad product, the gumroad.js is in the <head> tab so the user clicks generates a purchase modal.
- Gallery images are from the Download content image NOT the Hero cover image
- You can link to Gumroad (or wherever) via the callout button below or through the super:link property field
- Again - If the super:link is active, your product's page won't be viewable and instead the user will be sent directly to the purchasing site. If you don't want that and want to use you product page to really "sell" your product, you can! Just use the "Buy Me" callout to insert a link to your product
Pratyush Dayal, Neeldhara Misra, Surbhi Khewle, Ravi Anand Singh: On the Role of Half-Catalan Numbers and Pathwidth in Hyperbranched Polymers Synthesized by ABm Step Polymerization
Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh: Exact Multi-Covering Problems with Geometric Sets.
Neeldhara Misra, Debanuj Nayak: On Fair Division with Binary Valuations Respecting Social Networks.
Neeldhara Misra, Saraswati Nanoti: Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs.
Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya: A parameterized perspective on protecting elections.
Neeldhara Misra, Harshil Mittal: Imbalance parameterized by twin cover revisited.
Neeldhara Misra, Aditi Sethia: Fair Division Is Hard Even for Amicable Agents.
Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan, Rohit Vaish: Equitable Division of a Path.
Neeldhara Misra, Debanuj Nayak: On Fair Division with Binary Valuations Respecting Social Networks.
Neeldhara Misra, Frances A. Rosamond, Meirav Zehavi: Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors.
Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy: Color spanning objects: Algorithms and hardness results.
Neeldhara Misra, Fahad Panolan, Saket Saurabh: Subexponential algorithm for d-cluster edge deletion: Exception or rule?
Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy: Parameterized complexity of happy coloring problems.
Chamanvir Kaur, Neeldhara Misra: On the Parameterized Complexity of Spanning Trees with Small Vertex Covers.
Neeldhara Misra, Harshil Mittal, Aditi Sethia: Red-Blue Point Separation for Points on a Circle.
Neeldhara Misra, Harshil Mittal: Imbalance Parameterized by Twin Cover Revisited.
Neeldhara Misra, Aditi Sethia: Fair Division is Hard even for Amicable Agents.
Chinmay Sonar, Palash Dey, Neeldhara Misra: On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules.
Kishen N. Gowda, Neeldhara Misra, Vraj Patel: A Parameterized Perspective on Attacking and Defending Elections.
Chinmay Sonar, Palash Dey, Neeldhara Misra: On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules.
Kishen N. Gowda, Neeldhara Misra, Vraj Patel: A Parameterized Perspective on Attacking and Defending Elections.
Neeldhara Misra, Harshil Mittal: Imbalance Parameterized by Twin Cover Revisited.
Neeldhara Misra, Harshil Mittal, Aditi Sethia: Red-Blue Point Separation for Points on a Circle.
Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh: Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.
Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura: On structural parameterizations of firefighting.
Palash Dey, Neeldhara Misra, Y. Narahari: Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers.
Neeldhara Misra: On the Parameterized Complexity of Party Nominations.
Pratyush Dayal, Neeldhara Misra: Deleting to Structured Trees.
Neeldhara Misra, Fahad Panolan, Saket Saurabh: On the Parameterized Complexity of Edge-Linked Paths.
Neeldhara Misra, Piyush Rathi: The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs.
Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya: A Parameterized Perspective on Protecting Elections.
Manoj Gupta, Hitesh Kumar, Neeldhara Misra: On the Complexity of Optimal Matching Reconfiguration.
Neeldhara Misra, Chinmay Sonar: Robustness Radius for Chamberlin-Courant on Restricted Domains.
Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya: A Parameterized Perspective on Protecting Elections.
Pratyush Dayal, Neeldhara Misra: Deleting to Structured Trees.
Palash Dey, Neeldhara Misra, Y. Narahari: Complexity of manipulation with partial information in voting.
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy: On Structural Parameterizations of Firefighting.
Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra: On the Complexity of Two Dots for Narrow Boards and Few Colors.
Neeldhara Misra: On the Parameterized Complexity of Colorful Components and Related Problems.
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný: Backdoors into heterogeneous classes of SAT and CSP.
Palash Dey, Neeldhara Misra, Y. Narahari: Frugal bribery in voting.
Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan: On the Complexity of Chamberlin-Courant on Almost Structured Profiles.
Palash Dey, Neeldhara Misra, Y. Narahari: Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers.
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy: On Structural Parameterizations of Graph Motif and Chromatic Number.
Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan: Saving Critical Nodes with Firefighters is FPT.
Neeldhara Misra, I. Vinod Reddy: The Parameterized Complexity of Happy Colorings.
Palash Dey, Neeldhara Misra: On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard.
Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan: Saving Critical Nodes with Firefighters is FPT.
Neeldhara Misra, I. Vinod Reddy: The Parameterized Complexity of Happy Colorings.
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy: On Structural Parameterizations of Firefighting.
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh: Hitting Forbidden Minors: Approximation and Kernelization.
Palash Dey, Neeldhara Misra, Y. Narahari: Kernelization complexity of possible winner and coalitional manipulation problems in voting.
Palash Dey, Neeldhara Misra, Y. Narahari: Frugal Bribery in Voting.
Shivaram Kalyanakrishnan, Neeldhara Misra, Aditya Gopalan: Randomised Procedures for Initialising and Switching Actions in Policy Iteration.
Rohit Vaish, Neeldhara Misra, Shivani Agarwal, Avrim Blum: On the Computational Hardness of Manipulating Pairwise Voting Rules.
Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy: Color Spanning Objects: Algorithms and Hardness Results.
Neeldhara Misra: Two Dots is NP-complete.
Palash Dey, Neeldhara Misra: Elicitation for Preferences Single Peaked on Trees.
Palash Dey, Neeldhara Misra: Preference Elicitation for Single Crossing Domain.
Palash Dey, Neeldhara Misra, Y. Narahari: Complexity of Manipulation with Partial Information in Voting.
Neeldhara Misra: Alternate Parameterizations.
Neeldhara Misra: Kernelization, Planar F-Deletion.
Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty: The Runaway Rectangle Escape Problem.
Palash Dey, Neeldhara Misra, Y. Narahari: Complexity of Manipulation with Partial Information in Voting.
Palash Dey, Neeldhara Misra: Elicitation for Preferences Single Peaked on Trees.
Palash Dey, Neeldhara Misra: Preference Elicitation For Single Crossing Domain.
Palash Dey, Neeldhara Misra: On the Exact Amount of Missing Information that makes Finding Possible Winners Hard.
Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger: On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.
Prachi Goyal, Neeldhara Misra, Fahad Panolan, Meirav Zehavi: Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets.
Palash Dey, Neeldhara Misra, Y. Narahari: Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting.
Neeldhara Misra, Arshed Nabeel, Harman Singh: On the Parameterized Complexity of Minimax Approval Voting.
Palash Dey, Neeldhara Misra, Y. Narahari: Detecting Possible Manipulators in Elections.
Vikram Kamat, Neeldhara Misra: Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints.
Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh: Unique Covering Problems with Geometric Sets.
Fedor V. Fomin, Saket Saurabh, Neeldhara Misra: Graph Modification Problems: A Modern Perspective.
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh: Solving d-SAT via Backdoors to Small Treewidth.
Palash Dey, Neeldhara Misra, Y. Narahari: Frugal Bribery in Voting.
Palash Dey, Neeldhara Misra, Y. Narahari: Manipulation is Harder with Incomplete Votes.
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný: Backdoors into Heterogeneous Classes of SAT and CSP.
Palash Dey, Neeldhara Misra, Y. Narahari: On Choosing Committees Based on Approval Votes in the Presence of Outliers.
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh: The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles.
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný: Backdoors into Heterogeneous Classes of SAT and CSP.
Aniket Basu Roy, Sathish Govindarajan, Neeldhara Misra, Shreyas Shetty: On the d-Runaway Rectangle Escape Problem.
Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra: Vertex Cover Gets Faster and Harder on Low Degree Graphs.
Palash Dey, Prachi Goyal, Neeldhara Misra: UNO Gets Easier for a Single Player.
Palash Dey, Neeldhara Misra, Y. Narahari: Detecting Possible Manipulators in Elections.
Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra: Vertex Cover Gets Faster and Harder on Low Degree Graphs.
Palash Dey, Neeldhara Misra, Y. Narahari: Complexity of Kernelization in the Possible Winner Problem.
Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: The Parameterized Complexity of Unique Coverage and Its Variants.
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh: Imbalance is fixed parameter tractable.
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh: Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles.
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar: Solving min ones 2-sat as fast as vertex cover.
Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra: Hitting and Piercing Rectangles Induced by a Point Set.
Prachi Goyal, Neeldhara Misra, Fahad Panolan: Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets.
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh: On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.
Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh: Hardness of r-dominating set on Graphs of Diameter (r + 1).
Prachi Goyal, Vikram Kamat, Neeldhara Misra: On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem.
Neeldhara Misra, Fahad Panolan, Saket Saurabh: Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider: Upper and Lower Bounds for Weak Backdoor Set Detection.
Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh: Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.
Vikram Kamat, Neeldhara Misra: An Erdős--Ko--Rado theorem for matchings in the complete graph
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider: Upper and Lower Bounds for Weak Backdoor Set Detection
Prachi Goyal, Vikram Kamat, Neeldhara Misra: On the Parameterized Complexity of the Maximum Edge Coloring Problem.
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: FPT algorithms for Connected Feedback Vertex Set.
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh: On Parameterized Independent Feedback Vertex Set.
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh: Kernelization - Preprocessing with a Guarantee.
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh: Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms.
Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger: On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh: Planar F-Deletion: Approximation and Optimal FPT Algorithms
Neeldhara Misra, Venkatesh Raman, Saket Saurabh: Lower bounds on kernelization.
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh: On Parameterized Independent Feedback Vertex Set.
S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh: Algorithmic Aspects of Dominator Colorings in Graphs.
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh: Hitting forbidden minors: Approximation and Kernelization.
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh: Imbalance Is Fixed Parameter Tractable.
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh: The effect of girth on the kernelization complexity of Connected Dominating Set.
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan: On the Kernelization Complexity of Colorful Motifs.
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar: Solving minones-2-sat as Fast as vertex cover.
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: FPT Algorithms for Connected Feedback Vertex Set.
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh: Hitting forbidden minors: Approximation and Kernelization
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh: The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.
Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: The Budgeted Unique Coverage Problem and Color-Coding.
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: FPT Algorithms for Connected Feedback Vertex Set
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh: Graph Layout Problems Parameterized by Vertex Cover.
Cheat Sheets for Hard Problems
Cheat Sheets for Hard Problems
Evolution of Trust
Evolution of Trust
Domain Restrictions and Multiwinner Elections
Domain Restrictions and Multiwinner Elections
Tournament Fixing and Superkings
Tournament Fixing and Superkings
Gibbard Satterthwaite Theorem
Gibbard Satterthwaite Theorem
Arrow's Theorem
Arrow's Theorem
An Introduction to Voting
An Introduction to Voting
Firefighting with Critical Nodes
Firefighting with Critical Nodes
Fair Division with Minimal Sharing
Fair Division with Minimal Sharing
Efficient algorithms for hard problems on structured electorates
Efficient algorithms for hard problems on structured electorates
Elicitation for Preferences Single Peaked on Trees
Elicitation for Preferences Single Peaked on Trees
Parameterized Graph Modification A Modern Perspective
Parameterized Graph Modification A Modern Perspective
Efficient Simplification: The (im)possibilities
Efficient Simplification: The (im)possibilities
An FPT Algorithm for the Maximum Edge Coloring Problem
An FPT Algorithm for the Maximum Edge Coloring Problem
An EKR theorem for matchings in the complete graph
An EKR theorem for matchings in the complete graph
Parameterized Complexity of Party Nominations
Parameterized Complexity of Party Nominations
How’s your term going?
How’s your term going?
New Mac
New Mac
On the Communication Complexity of Equality
On the Communication Complexity of Equality
Deleting to Structured Trees
Deleting to Structured Trees
