


Остановите войну!
for scientists:
Neeldhara Misra
Person information

Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [j26]Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh:
Exact Multi-Covering Problems with Geometric Sets. Theory Comput. Syst. 66(1): 89-113 (2022) - [c65]Neeldhara Misra, Debanuj Nayak:
On Fair Division with Binary Valuations Respecting Social Networks. CALDAM 2022: 265-278 - [c64]N. R. Aravind, Neeldhara Misra, Harshil Mittal:
Chess Is Hard Even for a Single Player. FUN 2022: 5:1-5:20 - [i31]Neeldhara Misra, Saraswati Nanoti:
Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs. CoRR abs/2201.03820 (2022) - [i30]N. R. Aravind, Neeldhara Misra, Harshil Mittal:
Chess is hard even for a single player. CoRR abs/2203.14864 (2022) - 2021
- [j25]Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya:
A parameterized perspective on protecting elections. Theor. Comput. Sci. 874: 15-31 (2021) - [j24]Neeldhara Misra, Harshil Mittal:
Imbalance parameterized by twin cover revisited. Theor. Comput. Sci. 895: 1-15 (2021) - [c63]Neeldhara Misra, Aditi Sethia:
Fair Division Is Hard Even for Amicable Agents. SOFSEM 2021: 421-430 - [i29]Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan, Rohit Vaish:
Equitable Division of a Path. CoRR abs/2101.09794 (2021) - [i28]Neeldhara Misra, Debanuj Nayak:
On Fair Division with Binary Valuations Respecting Social Networks. CoRR abs/2111.11528 (2021) - 2020
- [j23]Neeldhara Misra, Frances A. Rosamond, Meirav Zehavi:
Special Issue "New Frontiers in Parameterized Complexity and Algorithms": Foreward by the Guest Editors. Algorithms 13(9): 236 (2020) - [j22]Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy
:
Color spanning objects: Algorithms and hardness results. Discret. Appl. Math. 280: 14-22 (2020) - [j21]Neeldhara Misra, Fahad Panolan
, Saket Saurabh:
Subexponential algorithm for d-cluster edge deletion: Exception or rule? J. Comput. Syst. Sci. 113: 150-162 (2020) - [j20]Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
, Juho Lauri, Neeldhara Misra, I. Vinod Reddy:
Parameterized complexity of happy coloring problems. Theor. Comput. Sci. 835: 58-81 (2020) - [c62]Chamanvir Kaur, Neeldhara Misra:
On the Parameterized Complexity of Spanning Trees with Small Vertex Covers. CALDAM 2020: 427-438 - [c61]Neeldhara Misra, Harshil Mittal, Aditi Sethia:
Red-Blue Point Separation for Points on a Circle. CCCG 2020: 266-272 - [c60]Neeldhara Misra, Harshil Mittal:
Imbalance Parameterized by Twin Cover Revisited. COCOON 2020: 162-173 - [c59]Neeldhara Misra, Aditi Sethia:
Fair Division is Hard even for Amicable Agents. ICTCS 2020: 202-207 - [c58]Chinmay Sonar, Palash Dey, Neeldhara Misra:
On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules. IJCAI 2020: 89-95 - [c57]Kishen N. Gowda
, Neeldhara Misra, Vraj Patel:
A Parameterized Perspective on Attacking and Defending Elections. IWOCA 2020: 277-288 - [i27]Chinmay Sonar, Palash Dey, Neeldhara Misra:
On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules. CoRR abs/2004.13933 (2020) - [i26]Kishen N. Gowda, Neeldhara Misra, Vraj Patel:
A Parameterized Perspective on Attacking and Defending Elections. CoRR abs/2005.03176 (2020) - [i25]Neeldhara Misra, Harshil Mittal:
Imbalance Parameterized by Twin Cover Revisited. CoRR abs/2005.03800 (2020) - [i24]Neeldhara Misra, Harshil Mittal, Aditi Sethia
:
Red-Blue Point Separation for Points on a Circle. CoRR abs/2005.06046 (2020)
2010 – 2019
- 2019
- [j19]Neeldhara Misra, Fahad Panolan
, Ashutosh Rai, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica 81(1): 26-46 (2019) - [j18]Bireswar Das, Murali Krishna Enduri
, Masashi Kiyomi
, Neeldhara Misra, Yota Otachi, I. Vinod Reddy
, Shunya Yoshimura:
On structural parameterizations of firefighting. Theor. Comput. Sci. 782: 79-90 (2019) - [j17]Palash Dey, Neeldhara Misra, Y. Narahari:
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers. Theor. Comput. Sci. 783: 53-70 (2019) - [c56]Neeldhara Misra:
On the Parameterized Complexity of Party Nominations. ADT 2019: 112-125 - [c55]Pratyush Dayal
, Neeldhara Misra
:
Deleting to Structured Trees. COCOON 2019: 128-139 - [c54]Neeldhara Misra, Fahad Panolan
, Saket Saurabh:
On the Parameterized Complexity of Edge-Linked Paths. CSR 2019: 286-298 - [c53]Neeldhara Misra, Piyush Rathi:
The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs. CSR 2019: 299-310 - [c52]Palash Dey, Neeldhara Misra, Swaprava Nath, Garima Shakya:
A Parameterized Perspective on Protecting Elections. IJCAI 2019: 238-244 - [c51]Manoj Gupta
, Hitesh Kumar, Neeldhara Misra:
On the Complexity of Optimal Matching Reconfiguration. SOFSEM 2019: 221-233 - [c50]Neeldhara Misra, Chinmay Sonar
:
Robustness Radius for Chamberlin-Courant on Restricted Domains. SOFSEM 2019: 341-353 - [i23]Palash Dey, Neeldhara Misra, Swaprava Nath
, Garima Shakya:
A Parameterized Perspective on Protecting Elections. CoRR abs/1905.11838 (2019) - [i22]Pratyush Dayal, Neeldhara Misra:
Deleting to Structured Trees. CoRR abs/1912.12765 (2019) - 2018
- [j16]Palash Dey, Neeldhara Misra, Y. Narahari:
Complexity of manipulation with partial information in voting. Theor. Comput. Sci. 726: 78-99 (2018) - [c49]Bireswar Das, Murali Krishna Enduri
, Neeldhara Misra, I. Vinod Reddy:
On Structural Parameterizations of Firefighting. CALDAM 2018: 221-234 - [c48]Davide Bilò
, Luciano Gualà, Stefano Leucci, Neeldhara Misra:
On the Complexity of Two Dots for Narrow Boards and Few Colors. FUN 2018: 7:1-7:15 - [c47]Neeldhara Misra:
On the Parameterized Complexity of Colorful Components and Related Problems. IWOCA 2018: 237-249 - 2017
- [j15]Serge Gaspers
, Neeldhara Misra, Sebastian Ordyniak
, Stefan Szeider, Stanislav Zivný:
Backdoors into heterogeneous classes of SAT and CSP. J. Comput. Syst. Sci. 85: 38-56 (2017) - [j14]Palash Dey, Neeldhara Misra, Y. Narahari:
Frugal bribery in voting. Theor. Comput. Sci. 676: 15-32 (2017) - [c46]Neeldhara Misra, Chinmay Sonar
, P. R. Vaidyanathan
:
On the Complexity of Chamberlin-Courant on Almost Structured Profiles. ADT 2017: 124-138 - [c45]Palash Dey, Neeldhara Misra, Y. Narahari:
Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers. AAMAS 2017: 42-50 - [c44]Bireswar Das, Murali Krishna Enduri
, Neeldhara Misra, I. Vinod Reddy:
On Structural Parameterizations of Graph Motif and Chromatic Number. CALDAM 2017: 118-129 - [c43]Jayesh Choudhari, Anirban Dasgupta
, Neeldhara Misra, M. S. Ramanujan:
Saving Critical Nodes with Firefighters is FPT. ICALP 2017: 135:1-135:13 - [c42]Neeldhara Misra, I. Vinod Reddy:
The Parameterized Complexity of Happy Colorings. IWOCA 2017: 142-153 - [c41]Palash Dey, Neeldhara Misra:
On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard. MFCS 2017: 57:1-57:14 - [i21]Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan:
Saving Critical Nodes with Firefighters is FPT. CoRR abs/1705.10923 (2017) - [i20]Neeldhara Misra, I. Vinod Reddy:
The Parameterized Complexity of Happy Colorings. CoRR abs/1708.03853 (2017) - [i19]Bireswar Das, Murali Krishna Enduri, Neeldhara Misra, I. Vinod Reddy:
On Structural Parameterizations of Firefighting. CoRR abs/1711.10227 (2017) - 2016
- [j13]Fedor V. Fomin
, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Hitting Forbidden Minors: Approximation and Kernelization. SIAM J. Discret. Math. 30(1): 383-410 (2016) - [j12]Palash Dey, Neeldhara Misra, Y. Narahari:
Kernelization complexity of possible winner and coalitional manipulation problems in voting. Theor. Comput. Sci. 616: 111-125 (2016) - [c40]Palash Dey, Neeldhara Misra, Y. Narahari:
Frugal Bribery in Voting. AAAI 2016: 2466-2472 - [c39]Shivaram Kalyanakrishnan, Neeldhara Misra, Aditya Gopalan:
Randomised Procedures for Initialising and Switching Actions in Policy Iteration. AAAI 2016: 3145-3151 - [c38]Rohit Vaish, Neeldhara Misra, Shivani Agarwal, Avrim Blum:
On the Computational Hardness of Manipulating Pairwise Voting Rules. AAMAS 2016: 358-367 - [c37]Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy:
Color Spanning Objects: Algorithms and Hardness Results. CALDAM 2016: 37-48 - [c36]Neeldhara Misra:
Two Dots is NP-complete. FUN 2016: 24:1-24:12 - [c35]Palash Dey, Neeldhara Misra:
Elicitation for Preferences Single Peaked on Trees. IJCAI 2016: 215-221 - [c34]Palash Dey, Neeldhara Misra:
Preference Elicitation for Single Crossing Domain. IJCAI 2016: 222-228 - [c33]Palash Dey, Neeldhara Misra, Y. Narahari:
Complexity of Manipulation with Partial Information in Voting. IJCAI 2016: 229-235 - [r2]Neeldhara Misra:
Alternate Parameterizations. Encyclopedia of Algorithms 2016: 64-67 - [r1]Neeldhara Misra:
Kernelization, Planar F-Deletion. Encyclopedia of Algorithms 2016: 1033-1036 - [i18]Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty:
The Runaway Rectangle Escape Problem. CoRR abs/1603.04210 (2016) - [i17]Palash Dey, Neeldhara Misra, Y. Narahari:
Complexity of Manipulation with Partial Information in Voting. CoRR abs/1604.04359 (2016) - [i16]Palash Dey, Neeldhara Misra:
Elicitation for Preferences Single Peaked on Trees. CoRR abs/1604.04403 (2016) - [i15]Palash Dey, Neeldhara Misra:
Preference Elicitation For Single Crossing Domain. CoRR abs/1604.05194 (2016) - [i14]Palash Dey, Neeldhara Misra:
On the Exact Amount of Missing Information that makes Finding Possible Winners Hard. CoRR abs/1610.08407 (2016) - 2015
- [j11]Pinar Heggernes
, Pim van 't Hof
, Dániel Marx, Neeldhara Misra, Yngve Villanger:
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. Algorithmica 72(3): 687-713 (2015) - [j10]Prachi Goyal, Neeldhara Misra, Fahad Panolan
, Meirav Zehavi
:
Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets. SIAM J. Discret. Math. 29(4): 1815-1836 (2015) - [c32]Palash Dey, Neeldhara Misra, Y. Narahari:
Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting. AAMAS 2015: 87-96 - [c31]Neeldhara Misra, Arshed Nabeel
, Harman Singh:
On the Parameterized Complexity of Minimax Approval Voting. AAMAS 2015: 97-105 - [c30]Palash Dey, Neeldhara Misra, Y. Narahari:
Detecting Possible Manipulators in Elections. AAMAS 2015: 1441-1450 - [c29]Vikram Kamat, Neeldhara Misra:
Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints. CIAC 2015: 249-260 - [c28]Pradeesha Ashok
, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh:
Unique Covering Problems with Geometric Sets. COCOON 2015: 548-558 - [c27]Fedor V. Fomin
, Saket Saurabh, Neeldhara Misra:
Graph Modification Problems: A Modern Perspective. FAW 2015: 3-6 - [c26]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh:
Solving d-SAT via Backdoors to Small Treewidth. SODA 2015: 630-641 - [i13]Palash Dey, Neeldhara Misra, Y. Narahari:
Frugal Bribery in Voting. CoRR abs/1504.08248 (2015) - [i12]Palash Dey, Neeldhara Misra, Y. Narahari:
Manipulation is Harder with Incomplete Votes. CoRR abs/1504.08256 (2015) - [i11]Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný:
Backdoors into Heterogeneous Classes of SAT and CSP. CoRR abs/1509.05725 (2015) - [i10]Palash Dey, Neeldhara Misra, Y. Narahari:
On Choosing Committees Based on Approval Votes in the Presence of Outliers. CoRR abs/1511.04190 (2015) - 2014
- [j9]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles. Algorithmica 68(2): 504-530 (2014) - [c25]Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak
, Stefan Szeider, Stanislav Zivný:
Backdoors into Heterogeneous Classes of SAT and CSP. AAAI 2014: 2652-2658 - [c24]Aniket Basu Roy, Sathish Govindarajan, Neeldhara Misra, Shreyas Shetty:
On the d-Runaway Rectangle Escape Problem. CCCG 2014 - [c23]Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra:
Vertex Cover Gets Faster and Harder on Low Degree Graphs. COCOON 2014: 179-190 - [c22]Palash Dey, Prachi Goyal, Neeldhara Misra:
UNO Gets Easier for a Single Player. FUN 2014: 147-157 - [i9]Palash Dey, Neeldhara Misra, Y. Narahari:
Detecting Possible Manipulators in Elections. CoRR abs/1404.2367 (2014) - [i8]Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra:
Vertex Cover Gets Faster and Harder on Low Degree Graphs. CoRR abs/1404.5566 (2014) - [i7]Palash Dey, Neeldhara Misra, Y. Narahari:
Complexity of Kernelization in the Possible Winner Problem. CoRR abs/1405.3865 (2014) - 2013
- [j8]Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
The Parameterized Complexity of Unique Coverage and Its Variants. Algorithmica 65(3): 517-544 (2013) - [j7]Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Imbalance is fixed parameter tractable. Inf. Process. Lett. 113(19-21): 714-718 (2013) - [j6]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. J. Graph Theory 74(4): 417-424 (2013) - [j5]Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar:
Solving min ones 2-sat as fast as vertex cover. Theor. Comput. Sci. 506: 115-121 (2013) - [c21]Ninad Rajgopal, Pradeesha Ashok
, Sathish Govindarajan, Abhijit Khopkar, Neeldhara Misra:
Hitting and Piercing Rectangles Induced by a Point Set. COCOON 2013: 221-232 - [c20]Prachi Goyal, Neeldhara Misra, Fahad Panolan
:
Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets. FSTTCS 2013: 237-248 - [c19]Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges. IPEC 2013: 243-254 - [c18]Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh:
Hardness of r-dominating set on Graphs of Diameter (r + 1). IPEC 2013: 255-267 - [c17]Prachi Goyal, Vikram Kamat, Neeldhara Misra:
On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem. MFCS 2013: 492-503 - [c16]Neeldhara Misra, Fahad Panolan
, Saket Saurabh:
Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? MFCS 2013: 679-690 - [c15]Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider:
Upper and Lower Bounds for Weak Backdoor Set Detection. SAT 2013: 394-402 - [c14]Neeldhara Misra, Fahad Panolan
, Ashutosh Rai, Venkatesh Raman, Saket Saurabh:
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. WG 2013: 370-381 - [i6]Vikram Kamat, Neeldhara Misra:
An Erdős--Ko--Rado theorem for matchings in the complete graph. CoRR abs/1303.4061 (2013) - [i5]Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider:
Upper and Lower Bounds for Weak Backdoor Set Detection. CoRR abs/1304.5518 (2013) - [i4]Prachi Goyal, Vikram Kamat, Neeldhara Misra:
On the Parameterized Complexity of the Maximum Edge Coloring Problem. CoRR abs/1306.2931 (2013) - 2012
- [j4]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
FPT algorithms for Connected Feedback Vertex Set. J. Comb. Optim. 24(2): 131-146 (2012) - [j3]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
On Parameterized Independent Feedback Vertex Set. Theor. Comput. Sci. 461: 65-75 (2012) - [c13]Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Kernelization - Preprocessing with a Guarantee. The Multivariate Algorithmic Revolution and Beyond 2012: 129-161 - [c12]Fedor V. Fomin
, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms. FOCS 2012: 470-479 - [c11]Pinar Heggernes
, Pim van 't Hof
, Dániel Marx, Neeldhara Misra, Yngve Villanger:
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. WG 2012: 332-343 - [i3]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Planar F-Deletion: Approximation and Optimal FPT Algorithms. CoRR abs/1204.4230 (2012) - 2011
- [j2]Neeldhara Misra, Venkatesh Raman, Saket Saurabh:
Lower bounds on kernelization. Discret. Optim. 8(1): 110-128 (2011) - [c10]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
On Parameterized Independent Feedback Vertex Set. COCOON 2011: 98-109 - [c9]S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Algorithmic Aspects of Dominator Colorings in Graphs. IWOCA 2011: 19-30 - [c8]Fedor V. Fomin
, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Hitting forbidden minors: Approximation and Kernelization. STACS 2011: 189-200 - 2010
- [c7]Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh:
Imbalance Is Fixed Parameter Tractable. COCOON 2010: 199-208 - [c6]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
The effect of girth on the kernelization complexity of Connected Dominating Set. FSTTCS 2010: 96-107 - [c5]Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan:
On the Kernelization Complexity of Colorful Motifs. IPEC 2010: 14-25 - [c4]Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar:
Solving minones-2-sat as Fast as vertex cover. MFCS 2010: 549-555 - [c3]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
FPT Algorithms for Connected Feedback Vertex Set. WALCOM 2010: 269-280 - [i2]Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Hitting forbidden minors: Approximation and Kernelization. CoRR abs/1010.1365 (2010)
2000 – 2009
- 2009
- [j1]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. Theory Comput. Syst. 45(4): 822-848 (2009) - [c2]Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
The Budgeted Unique Coverage Problem and Color-Coding. CSR 2009: 310-321 - [i1]Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
FPT Algorithms for Connected Feedback Vertex Set. CoRR abs/0909.3180 (2009) - 2008
- [c1]Michael R. Fellows
, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond
, Saket Saurabh:
Graph Layout Problems Parameterized by Vertex Cover. ISAAC 2008: 294-305