Folgen
Pranabendu Misra
Pranabendu Misra
Assistant Professor at Chennai Mathematical Institute
Bestätigte E-Mail-Adresse bei cmi.ac.in - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
662015
Deterministic truncation of linear matroids
D Lokshtanov, P Misra, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 14 (2), 1-20, 2018
632018
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
462019
Improving EFX guarantees through rainbow cycle number
BR Chaudhury, J Garg, K Mehlhorn, R Mehta, P Misra
Proceedings of the 22nd ACM Conference on Economics and Computation, 310-311, 2021
442021
Parameterized algorithms to preserve connectivity
M Basavaraju, FV Fomin, P Golovach, P Misra, MS Ramanujan, ...
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
362014
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
352018
Parameterized Algorithms for Even Cycle Transversal
P Misra, V Raman, MS Ramanujan, S Saurabh
Graph-Theoretic Concepts in Computer Science: 38th International Workshop …, 2012
322012
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
242020
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
232016
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
21*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
202019
FPT-approximation for FPT problems
D Lokshtanov, P Misra, MS Ramanujan, S Saurabh, M Zehavi
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
172021
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
16*2020
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
14*2017
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
132020
Hitting selected (odd) cycles
D Lokshtanov, P Misra, MS Ramanujan, S Saurabh
SIAM Journal on Discrete Mathematics 31 (3), 1581-1615, 2017
132017
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
122018
Faster graph bipartization
S Kolay, P Misra, MS Ramanujan, S Saurabh
Journal of Computer and System Sciences 109, 45-55, 2020
11*2020
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
P Misra, V Raman, MS Ramanujan, S Saurabh
Theory of Computing Systems 53, 609-620, 2013
112013
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
92018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20