Publications

Journal Publications

DBLP ⸱ Conferences ⸱ Journals ⸱ ArXiV ⸱ Other

 

Agrawal, A., N. R. Aravind, S. Kalyanasundaram, A. S. Kare, J. Lauri, N. Misra, and I. V. Reddy. (2020): “Parameterized complexity of happy coloring problems,” Theor. Comput. Sci., 835, 58–81.

Ashok, P., S. Kolay, N. Misra, and S. Saurabh. (2022): “Exact multi-covering problems with geometric sets,” Theory Comput. Syst., 66, 89–113.

Banerjee, S., N. Misra, and S. C. Nandy. (2020): “Color spanning objects: Algorithms and hardness results,” Discret. Appl. Math., 280, 14–22.

Das, B., M. K. Enduri, M. Kiyomi, N. Misra, Y. Otachi, I. V. Reddy, and S. Yoshimura. (2019): “On structural parameterizations of firefighting,” Theor. Comput. Sci., 782, 79–90.

Dey, P., N. Misra, and Y. Narahari. (2016): “Kernelization complexity of possible winner and coalitional manipulation problems in voting,” Theor. Comput. Sci., 616, 111–25.

---. (2017): “Frugal bribery in voting,” Theor. Comput. Sci., 676, 15–32.

---. (2018): “Complexity of manipulation with partial information in voting,” Theor. Comput. Sci., 726, 78–99.

---. (2019): “Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers,” Theor. Comput. Sci., 783, 53–70.

Dey, P., N. Misra, S. Nath, and G. Shakya. (2021): “A parameterized perspective on protecting elections,” Theor. Comput. Sci., 874, 15–31.

Fellows, M. R., D. Lokshtanov, N. Misra, M. Mnich, F. A. Rosamond, and S. Saurabh. (2009): “The complexity ecology of parameters: An illustration using bounded max leaf number,” Theory Comput. Syst., 45, 822–48.

Fomin, F. V., D. Lokshtanov, N. Misra, G. Philip, and S. Saurabh. (2013): “Quadratic upper bounds on the erdős-pósa property for a generalization of packing and covering cycles,” J. Graph Theory, 74, 417–24.

---. (2016): “Hitting forbidden minors: Approximation and kernelization,” SIAM J. Discret. Math., 30, 383–410.

Gaspers, S., N. Misra, S. Ordyniak, S. Szeider, and S. Zivný. (2017): “Backdoors into heterogeneous classes of SAT and CSP,” J. Comput. Syst. Sci., 85, 38–56.

Goyal, P., N. Misra, F. Panolan, and M. Zehavi. (2015): “Deterministic algorithms for matching and packing problems based on representative sets,” SIAM J. Discret. Math., 29, 1815–36.

Heggernes, P., P. van ’t Hof, D. Marx, N. Misra, and Y. Villanger. (2015): “On the parameterized complexity of finding separators with non-hereditary properties,” Algorithmica, 72, 687–713.

Lokshtanov, D., N. Misra, and S. Saurabh. (2013): “Imbalance is fixed parameter tractable,” Inf. Process. Lett., 113, 714–18.

Misra, N., and H. Mittal. (2021): “Imbalance parameterized by twin cover revisited,” Theor. Comput. Sci., 895, 1–15.

Misra, N., H. Moser, V. Raman, S. Saurabh, and S. Sikdar. (2013): “The parameterized complexity of unique coverage and its variants,” Algorithmica, 65, 517–44.

Misra, N., N. S. Narayanaswamy, V. Raman, and B. S. Shankar. (2013): “Solving min ones 2-sat as fast as vertex cover,” Theor. Comput. Sci., 506, 115–21.

Misra, N., F. Panolan, A. Rai, V. Raman, and S. Saurabh. (2019): “Parameterized algorithms for max colorable induced subgraph problem on perfect graphs,” Algorithmica, 81, 26–46.

Misra, N., F. Panolan, and S. Saurabh. (2020): “Subexponential algorithm for d-cluster edge deletion: Exception or rule?” J. Comput. Syst. Sci., 113, 150–62.

Misra, N., G. Philip, V. Raman, and S. Saurabh. (2012): “On parameterized independent feedback vertex set,” Theor. Comput. Sci., 461, 65–75.

---. (2014): “The kernelization complexity of connected domination in graphs with (no) small cycles,” Algorithmica, 68, 504–30.

Misra, N., G. Philip, V. Raman, S. Saurabh, and S. Sikdar. (2012): “FPT algorithms for connected feedback vertex set,” J. Comb. Optim., 24, 131–46.

Misra, N., V. Raman, and S. Saurabh. (2011): “Lower bounds on kernelization,” Discret. Optim., 8, 110–28.

Misra, N., F. A. Rosamond, and M. Zehavi. (2020): “Special issue "new frontiers in parameterized complexity and algorithms": Foreward by the guest editors,” Algorithms, 13, 236.