Artykuły udostępnione publicznie: - Pranabendu MisraWięcej informacji
Niedostępne w żadnym miejscu: 8
Parameterized algorithms to preserve connectivity
M Basavaraju, FV Fomin, P Golovach, P Misra, MS Ramanujan, ...
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
Upoważnienia: European Commission
Hitting selected (odd) cycles
D Lokshtanov, P Misra, MS Ramanujan, S Saurabh
SIAM Journal on Discrete Mathematics 31 (3), 1581-1615, 2017
Upoważnienia: European Commission
Fast exact algorithms for survivable network design with uniform requirements
A Agrawal, P Misra, F Panolan, S Saurabh
Algorithmica 84 (9), 2622-2641, 2022
Upoważnienia: European Commission
Fast exact algorithms for survivable network design with uniform requirements
A Agrawal, P Misra, F Panolan, S Saurabh
Workshop on Algorithms and Data Structures, 25-36, 2017
Upoważnienia: European Commission
Parameterized approximation algorithms for weighted vertex cover
S Mandal, P Misra, A Rai, S Saurabh
Theoretical Computer Science 1021, 114870, 2024
Upoważnienia: European Commission
An ETH-Tight Algorithm for Bidirected Steiner Connectivity
D Lokshtanov, P Misra, F Panolan, S Saurabh, M Zehavi
Algorithms and Data Structures Symposium, 588-604, 2023
Upoważnienia: US National Science Foundation
A single exponential-time FPT algorithm for cactus contraction
R Krithika, P Misra, P Tale
Theoretical Computer Science 954, 113803, 2023
Upoważnienia: Department of Science & Technology, India
An Erdős–Pósa Theorem on Neighborhoods and Domination Number
J Madathil, P Misra, S Saurabh
Computing and Combinatorics: 25th International Conference, COCOON 2019, Xi …, 2019
Upoważnienia: European Commission
Dostępne w jakimś miejscu: 26
Deterministic truncation of linear matroids
D Lokshtanov, P Misra, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 14 (2), 1-20, 2018
Upoważnienia: European Commission
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
Upoważnienia: US National Science Foundation
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
Upoważnienia: European Commission
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
Upoważnienia: European Commission
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
Upoważnienia: US National Science Foundation, European Commission
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
Upoważnienia: European Commission, Research Council of Norway
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
Upoważnienia: US National Science Foundation, European Commission
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
Upoważnienia: European Commission
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
Upoważnienia: US National Science Foundation, European Commission
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
Upoważnienia: US National Science Foundation, US Department of Defense, European Commission
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
Upoważnienia: Department of Science & Technology, India, European Commission, Federal …
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
Upoważnienia: Department of Science & Technology, India
Informacje na temat publikacji i finansowania automatycznie określa program komputerowy