Pranabendu Misra
Title
Cited by
Cited by
Year
Faster parameterized algorithms for deletion to split graphs
E Ghosh, S Kolay, M Kumar, P Misra, F Panolan, A Rai, MS Ramanujan
Algorithmica 71 (4), 989-1006, 2015
532015
Deterministic truncation of linear matroids
D Lokshtanov, P Misra, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 14 (2), 1-20, 2018
412018
Popular matching in roommates setting is NP-hard
S Gupta, P Misra, S Saurabh, M Zehavi
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
242019
Parameterized algorithms to preserve connectivity
M Basavaraju, FV Fomin, P Golovach, P Misra, MS Ramanujan, ...
International Colloquium on Automata, Languages, and Programming, 800-811, 2014
222014
Parameterized Algorithms for Even Cycle Transversal
P Misra, V Raman, MS Ramanujan, S Saurabh
Graph-Theoretic Concepts in Computer Science: 38th International Workshop …, 2012
212012
Feedback vertex set inspired kernel for chordal vertex deletion
A Agrawal, D Lokshtanov, P Misra, S Saurabh, M Zehavi
ACM Transactions on Algorithms (TALG) 15 (1), 1-28, 2018
192018
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems
A Agrawal, D Lokshtanov, P Misra, S Saurabh, M Zehavi
ACM Transactions on Algorithms (TALG) 16 (4), 1-38, 2020
172020
Lossy kernels for graph contraction problems
R Krithika, P Misra, A Rai, P Tale
36th IARCS Annual Conference on Foundations of Software Technology and …, 2016
162016
Finding even subgraphs even faster
P Goyal, P Misra, F Panolan, G Philip, S Saurabh
Journal of Computer and System Sciences 97, 1-13, 2018
112018
Faster exact algorithms for some terminal set problems
R Chitnis, FV Fomin, D Lokshtanov, P Misra, MS Ramanujan, S Saurabh
Journal of Computer and System Sciences 88, 195-207, 2017
10*2017
2-approximating feedback vertex set in tournaments
D Lokshtanov, P Misra, J Mukherjee, F Panolan, G Philip, S Saurabh
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
9*2020
Interval vertex deletion admits a polynomial kernel
A Agrawal, P Misra, S Saurabh, M Zehavi
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
92019
Reducing rank of the adjacency matrix by graph modification
SM Meesum, P Misra, S Saurabh
Theoretical Computer Science 654, 70-79, 2016
82016
Conflict free version of covering problems on graphs: Classical and parameterized
P Jain, L Kanesh, P Misra
Theory of Computing Systems 64 (6), 1067-1093, 2020
62020
An exponential time parameterized algorithm for planar disjoint paths
D Lokshtanov, P Misra, M Pilipczuk, S Saurabh, M Zehavi
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
6*2020
Parameterized algorithms for survivable network design with uniform demands
J Bang-Jensen, M Basavaraju, KV Klinkby, P Misra, MS Ramanujan, ...
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
62018
A polynomial kernel for feedback arc set on bipartite tournaments
P Misra, V Raman, MS Ramanujan, S Saurabh
Theory of Computing Systems 53 (4), 609-620, 2013
62013
Hitting selected (odd) cycles
D Lokshtanov, P Misra, MS Ramanujan, S Saurabh
SIAM Journal on Discrete Mathematics 31 (3), 1581-1615, 2017
52017
A (2+ ε)-factor approximation algorithm for split vertex deletion
D Lokshtanov, P Misra, F Panolan, G Philip, S Saurabh
47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020
42020
An FPT algorithm for contraction to cactus
R Krithika, P Misra, P Tale
International Computing and Combinatorics Conference, 341-352, 2018
42018
The system can't perform the operation now. Try again later.
Articles 1–20