Publications

Research

Interests ⸱ Publications ⸱ TalksWorkshops and SchoolsPhD ThesisMasters Thesis

Publications

Conferences

5 views

Conferences

Journals

Preprints

Other

All

conf/caldam/MisraN22
Neeldhara Misra, Debanuj Nayak: On Fair Division with Binary Valuations Respecting Social Networks.
conf/sofsem/MisraS21
Neeldhara Misra, Aditi Sethia: Fair Division Is Hard Even for Amicable Agents.
conf/caldam/KaurM20
Chamanvir Kaur, Neeldhara Misra: On the Parameterized Complexity of Spanning Trees with Small Vertex Covers.
conf/cccg/MisraMS20
Neeldhara Misra, Harshil Mittal, Aditi Sethia: Red-Blue Point Separation for Points on a Circle.
CCCG : 266-272 (2020)
conf/cocoon/MisraM20
Neeldhara Misra, Harshil Mittal: Imbalance Parameterized by Twin Cover Revisited.
conf/ictcs/MisraS20
Neeldhara Misra, Aditi Sethia: Fair Division is Hard even for Amicable Agents.
conf/ijcai/SonarDM20
Chinmay Sonar, Palash Dey, Neeldhara Misra: On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules.
conf/iwoca/GowdaMP20
Kishen N. Gowda, Neeldhara Misra, Vraj Patel: A Parameterized Perspective on Attacking and Defending Elections.
conf/aldt/Misra19
Neeldhara Misra: On the Parameterized Complexity of Party Nominations.
conf/cocoon/DayalM19
Pratyush Dayal, Neeldhara Misra: Deleting to Structured Trees.
conf/csr/MisraP019
Neeldhara Misra, Fahad Panolan, Saket Saurabh: On the Parameterized Complexity of Edge-Linked Paths.
conf/csr/MisraR19
Neeldhara Misra, Piyush Rathi: The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs.
conf/ijcai/DeyMNS19
Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya: A Parameterized Perspective on Protecting Elections.
conf/sofsem/GuptaKM19
Manoj Gupta, Hitesh Kumar, Neeldhara Misra: On the Complexity of Optimal Matching Reconfiguration.
conf/sofsem/MisraS19
Neeldhara Misra, Chinmay Sonar: Robustness Radius for Chamberlin-Courant on Restricted Domains.
conf/caldam/DasEMR18
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy: On Structural Parameterizations of Firefighting.
conf/fun/BiloG0M18
Davide Bilò, Luciano Gualà, Stefano Leucci, Neeldhara Misra: On the Complexity of Two Dots for Narrow Boards and Few Colors.
conf/iwoca/Misra18
Neeldhara Misra: On the Parameterized Complexity of Colorful Components and Related Problems.
conf/aldt/MisraSV17
Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan: On the Complexity of Chamberlin-Courant on Almost Structured Profiles.
conf/atal/DeyMN17
Palash Dey, Neeldhara Misra, Y. Narahari: Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers.
conf/caldam/DasEMR17
Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy: On Structural Parameterizations of Graph Motif and Chromatic Number.
conf/icalp/ChoudhariDMR17
Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan: Saving Critical Nodes with Firefighters is FPT.
conf/iwoca/MisraR17
Neeldhara Misra, I. Vinod Reddy: The Parameterized Complexity of Happy Colorings.
conf/mfcs/DeyM17
Palash Dey, Neeldhara Misra: On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard.
conf/aaai/DeyMN16
Palash Dey, Neeldhara Misra, Y. Narahari: Frugal Bribery in Voting.
conf/aaai/Kalyanakrishnan16
Shivaram Kalyanakrishnan, Neeldhara Misra, Aditya Gopalan: Randomised Procedures for Initialising and Switching Actions in Policy Iteration.
conf/atal/VaishM0B16
Rohit Vaish, Neeldhara Misra, Shivani Agarwal, Avrim Blum: On the Computational Hardness of Manipulating Pairwise Voting Rules.
conf/caldam/BanerjeeMN16
Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy: Color Spanning Objects: Algorithms and Hardness Results.
conf/fun/Misra16
Neeldhara Misra: Two Dots is NP-complete.
conf/ijcai/DeyM16
Palash Dey, Neeldhara Misra: Elicitation for Preferences Single Peaked on Trees.
conf/ijcai/DeyM16a
Palash Dey, Neeldhara Misra: Preference Elicitation for Single Crossing Domain.
conf/ijcai/DeyMN16
Palash Dey, Neeldhara Misra, Y. Narahari: Complexity of Manipulation with Partial Information in Voting.
conf/atal/DeyMN15
Palash Dey, Neeldhara Misra, Y. Narahari: Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting.
conf/atal/MisraNS15
Neeldhara Misra, Arshed Nabeel, Harman Singh: On the Parameterized Complexity of Minimax Approval Voting.
conf/atal/DeyMN15a
Palash Dey, Neeldhara Misra, Y. Narahari: Detecting Possible Manipulators in Elections.
conf/ciac/KamatM15
Vikram Kamat, Neeldhara Misra: Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints.
conf/cocoon/AshokKMS15
Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh: Unique Covering Problems with Geometric Sets.
conf/faw/FominSM15
Fedor V. Fomin, Saket Saurabh, Neeldhara Misra: Graph Modification Problems: A Modern Perspective.
conf/soda/FominLMRS15
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh: Solving d-SAT via Backdoors to Small Treewidth.
conf/aaai/GaspersMOSZ14
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný: Backdoors into Heterogeneous Classes of SAT and CSP.
conf/cccg/RoyGMS14
Aniket Basu Roy, Sathish Govindarajan, Neeldhara Misra, Shreyas Shetty: On the d-Runaway Rectangle Escape Problem.
conf/cocoon/AgrawalGM14
Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra: Vertex Cover Gets Faster and Harder on Low Degree Graphs.
conf/fun/DeyGM14
Palash Dey, Prachi Goyal, Neeldhara Misra: UNO Gets Easier for a Single Player.
conf/cocoon/RajgopalAGKM13
Ninad Rajgopal, Pradeesha Ashok, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra: Hitting and Piercing Rectangles Induced by a Point Set.
conf/fsttcs/GoyalMP13
Prachi Goyal, Neeldhara Misra, Fahad Panolan: Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets.
conf/iwpec/LokshtanovMS13
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh: On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.
conf/iwpec/LokshtanovMPRS13
Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh: Hardness of r-dominating set on Graphs of Diameter (r + 1).
conf/mfcs/GoyalKM13
Prachi Goyal, Vikram Kamat, Neeldhara Misra: On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem.
conf/mfcs/MisraPS13
Neeldhara Misra, Fahad Panolan, Saket Saurabh: Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?
conf/sat/MisraORS13
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider: Upper and Lower Bounds for Weak Backdoor Set Detection.
conf/wg/MisraPRRS13
Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh: Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.
conf/birthday/LokshtanovMS12
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh: Kernelization - Preprocessing with a Guarantee.
conf/focs/FominLMS12
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh: Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms.
conf/wg/HeggernesHMMV12
Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger: On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties.
conf/cocoon/MisraPRS11
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh: On Parameterized Independent Feedback Vertex Set.
conf/iwoca/ArumugamCMPS11
S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh: Algorithmic Aspects of Dominator Colorings in Graphs.
conf/stacs/FominLMPS11
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh: Hitting forbidden minors: Approximation and Kernelization.
conf/cocoon/LokshtanovMS10
Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh: Imbalance Is Fixed Parameter Tractable.
conf/fsttcs/MisraPRS10
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh: The effect of girth on the kernelization complexity of Connected Dominating Set.
conf/iwpec/AmbalathBHKMPR10
conf/mfcs/MisraNRS10
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar: Solving minones-2-sat as Fast as vertex cover.
conf/walcom/MisraPRSS10
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: FPT Algorithms for Connected Feedback Vertex Set.
conf/csr/MisraRSS09
Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar: The Budgeted Unique Coverage Problem and Color-Coding.
conf/isaac/FellowsLMRS08
Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh: Graph Layout Problems Parameterized by Vertex Cover.