Home
Pranabendu Misra's picture

Pranabendu Misra

Researcher
Journal articles
  • Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav. 2018. Polylogarithmic approximation algorithms for weighted-F-Deletion problems. Leibniz International Proceedings in Informatics. 116. doi: 10.4230/LIPIcs.APPROX-RANDOM.2018.1
  • Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav. 2018. Erdos-Posa property of obstructions to interval graphs. Leibniz International Proceedings in Informatics. 96: 1-15. doi: 10.4230/LIPIcs.STACS.2018.7
  • Goyal, Prachi; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket. 2018. Finding even subgraphs even faster. Journal of computer and system sciences (Print). 97: 1-13. doi: 10.1016/j.jcss.2018.03.001
  • Jain, Pallavi; Kanesh, Lawqueen; Misra, Pranabendu. 2018. Conflict free version of covering problems on graphs: Classical and parameterized. Lecture Notes in Computer Science. 10846 LNCS: 194-206. doi: 10.1007/978-3-319-90530-3_17
  • Krithika, R; Misra, Pranabendu; Tale, Prafullkumar. 2018. An FPT Algorithm for Contraction to Cactus. Lecture Notes in Computer Science. LNCS 10976: 341-352. doi: 10.1007/978-3-319-94776-1_29
  • Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav. 2018. Quasipolynomial representation of transversal matroids with applications in parameterized complexity. Leibniz International Proceedings in Informatics. 94: 1-13. doi: 10.4230/LIPIcs.ITCS.2018.32
  • Agrawal, Akanksha; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket. 2017. Fast exact algorithms for survivable network design with uniform requirements. Lecture Notes in Computer Science. 10389 LNCS: 25-36. doi: 10.1007/978-3-319-62127-2_3
  • Chitnis, Rajesh; Fomin, Fedor; Lokshtanov, Daniel; Misra, Pranabendu; Maadapuzhi Shridharan, Ramanujan; Saurabh, Saket. 2017. Faster exact algorithms for some terminal set problems. Journal of computer and system sciences (Print). 88: 195-207. doi: 10.1016/j.jcss.2017.04.003
  • Lokshtanov, Daniel; Misra, Pranabendu; Ramanujan, M. S.; Saurabh, Saket. 2017. Hitting selected (ODD) Cycles. SIAM Journal on Discrete Mathematics. 31: 1581-1615. doi: 10.1137/15M1041213
  • Misra, Pranabendu; Panolan, Fahad; Ramanujan, M. S.; Saurabh, Saket. 2017. Linear representation of transversal matroids and gammoids parameterized by rank. Lecture Notes in Computer Science. 10392 LNCS: 420-432. doi: 10.1007/978-3-319-62389-4_35
  • Meesum, Syed Mohammad; Misra, Pranabendu; Saurabh, Saket. 2016. Reducing rank of the adjacency matrix by graph modification. Theoretical Computer Science. 654: 70-79. doi: 10.1016/j.tcs.2016.02.020
  • Goyal, Prachi; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket. 2015. Finding even subgraphs even faster. Leibniz International Proceedings in Informatics. 45: 434-447. doi: 10.4230/LIPIcs.FSTTCS.2015.434
  • Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket. 2015. Deterministic truncation of linear matroids. Lecture Notes in Computer Science. 9134: 922-934. doi: 10.1007/978-3-662-47672-7_75
  • Meesum, Syed Mohammad; Misra, Pranabendu; Saurabh, Saket. 2015. Reducing rank of the adjacency matrix by graph modification. Lecture Notes in Computer Science. 9198: 361-373. doi: 10.1007/978-3-319-21398-9_29
  • Basavaraju, Manu; Fomin, Fedor; Golovach, Petr; Misra, Pranabendu; Maadapuzhi Shridharan, Ramanujan; Saurabh, Saket. 2014. Parameterized algorithms to preserve connectivity. Lecture Notes in Computer Science. 8572 LNCS: 800-811. doi: 10.1007/978-3-662-43948-7_66

More information in national current research information system (CRIStin)