Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Misra, Pranabendu
78  Ergebnisse:
Personensuche X
?
1

Parameterized Approximation Algorithms for Weighted Vertex ..:

, In: Lecture Notes in Computer Science; LATIN 2024: Theoretical Informatics,
Mandal, Soumen ; Misra, Pranabendu ; Rai, Ashutosh. - p. 177-192 , 2024
Link: https://doi.org/10.1007/..
 
?
2

Parameterized Approximation Algorithms for Weighted Vertex ..:

Mandal, Soumen ; Misra, Pranabendu ; Rai, Ashutosh.
Theoretical Computer Science.  , 2024
Link: https://doi.org/10.1016/..
 
?
3

Polynomial Kernel for Interval Vertex Deletion:

Agrawal, Akanksha ; Lokshtanov, Daniel ; Misra, Pranabendu..
ACM Transactions on Algorithms.  19 (2023)  2 - p. 1-68 , 2023
Link: https://doi.org/10.1145/..
 
?
4

Sub-exponential Time Parameterized Algorithms for Graph Lay..:

Misra, Pranabendu ; Saurabh, Saket ; Sharma, Roohani.
Algorithmica.  85 (2023)  7 - p. 2065-2086 , 2023
Link: https://doi.org/10.1007/..
 
?
5

An ETH-Tight Algorithm for Bidirected Steiner Connectivity:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Lokshtanov, Daniel ; Misra, Pranabendu ; Panolan, Fahad.. - p. 588-604 , 2023
Link: https://doi.org/10.1007/..
 
?
6

A single exponential-time FPT algorithm for cactus contract..:

Krithika, R. ; Misra, Pranabendu ; Tale, Prafullkumar
Theoretical Computer Science.  954 (2023)  - p. 113803 , 2023
Link: https://doi.org/10.1016/..
 
?
7

Fast Exact Algorithms for Survivable Network Design with Un..:

Agrawal, Akanksha ; Misra, Pranabendu ; Panolan, Fahad.
Algorithmica.  84 (2022)  9 - p. 2622-2641 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Erdős–Pósa property of obstructions to interval graphs:

Agrawal, Akanksha ; Lokshtanov, Daniel ; Misra, Pranabendu..
Journal of Graph Theory.  102 (2022)  4 - p. 702-727 , 2022
Link: https://doi.org/10.1002/..
 
?
9

Popular Matching in Roommates Setting Is NP-hard:

Gupta, Sushmita ; Misra, Pranabendu ; Saurabh, Saket.
ACM Transactions on Computation Theory.  13 (2021)  2 - p. 1-20 , 2021
Link: https://doi.org/10.1145/..
 
?
10

Improving EFX Guarantees through Rainbow Cycle Number:

, In: Proceedings of the 22nd ACM Conference on Economics and Computation,
Chaudhury, Bhaskar Ray ; Garg, Jugal ; Mehlhorn, Kurt.. - p. 310-311 , 2021
Link: https://dl.acm.org/doi/1..
 
?
11

Strong connectivity augmentation is FPT:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Klinkby, Kristine Vitting ; Misra, Pranabendu ; Saurabh, Saket - p. 219-234 , 2021
Link: https://dl.acm.org/doi/1..
 
?
12

2-Approximating Feedback Vertex Set in Tournaments:

Lokshtanov, Daniel ; Misra, Pranabendu ; Mukherjee, Joydeep...
ACM Transactions on Algorithms.  17 (2021)  2 - p. 1-14 , 2021
Link: https://doi.org/10.1145/..
 
?
13

Strong Connectivity Augmentation is FPT:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Klinkby, Kristine Vitting ; Misra, Pranabendu ; Saurabh, Saket - p. 219-234 , 2021
Link: https://doi.org/10.1137/..
 
?
14

FPT-approximation for FPT Problems:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Lokshtanov, Daniel ; Misra, Pranabendu ; Ramanujan, M. S... - p. 199-218 , 2021
Link: https://doi.org/10.1137/..
 
?
15

Popular Matching in Roommates Setting Is NP-hard:

Gupta, Sushmita ; Misra, Pranabendu ; Saurabh, Saket.
ACM Transactions on Computation Theory (TOCT).  13 (2021)  2 - p. 1-20 , 2021
Link: https://dl.acm.org/doi/1..
 
1-15