Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPranabendu Misra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c40]Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Kernelization of Counting Problems. ITCS 2024: 77:1-77:23- [c39]Soumen Mandal, Pranabendu Misra, Ashutosh Rai, Saket Saurabh:
Parameterized Approximation Algorithms for Weighted Vertex Cover. LATIN (2) 2024: 177-192 - [c38]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Meta-theorems for Parameterized Streaming Algorithms‡. SODA 2024: 712-739 - 2023
- [j21]Pranabendu Misra, Saket Saurabh, Roohani Sharma
, Meirav Zehavi:
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. Algorithmica 85(7): 2065-2086 (2023) - [j20]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Erdős-Pósa property of obstructions to interval graphs. J. Graph Theory 102(4): 702-727 (2023) - [j19]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polynomial Kernel for Interval Vertex Deletion. ACM Trans. Algorithms 19(2): 11:1-11:68 (2023) - [j18]R. Krithika, Pranabendu Misra, Prafullkumar Tale:
A single exponential-time FPT algorithm for cactus contraction. Theor. Comput. Sci. 954: 113803 (2023) - [c37]Jørgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh:
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands. ESA 2023: 13:1-13:15 - [c36]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS 2023: 588-604 - [i15]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Meta-theorems for Parameterized Streaming Algorithms. CoRR abs/2308.01598 (2023) - [i14]Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Kernelization of Counting Problems. CoRR abs/2308.02188 (2023) - 2022
- [j17]Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma:
Parameterized Complexity of Directed Spanner Problems. Algorithmica 84(8): 2292-2308 (2022) - [j16]Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh:
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. Algorithmica 84(9): 2622-2641 (2022) - [c35]Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale:
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. SODA 2022: 2085-2127 - [i13]Andreas Karrenbauer, Leonie Krull, Kurt Mehlhorn, Pranabendu Misra, Paolo Luigi Rinaldi, Anna Twelsiek:
Improving Order with Queues. CoRR abs/2207.02476 (2022) - 2021
- [j15]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
2-Approximating Feedback Vertex Set in Tournaments. ACM Trans. Algorithms 17(2): 11:1-11:14 (2021) - [j14]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting Is NP-hard. ACM Trans. Comput. Theory 13(2): 9:1-9:20 (2021) - [c34]Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra:
Improving EFX Guarantees through Rainbow Cycle Number. EC 2021: 310-311 - [c33]Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
FPT-approximation for FPT Problems. SODA 2021: 199-218 - [c32]Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh:
Strong Connectivity Augmentation is FPT. SODA 2021: 219-234 - [i12]Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn, Ruta Mehta, Pranabendu Misra:
Improving EFX Guarantees through Rainbow Cycle Number. CoRR abs/2103.01628 (2021) - [i11]Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi:
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths. CoRR abs/2103.17041 (2021) - [i10]Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale:
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. CoRR abs/2110.15098 (2021) - 2020
- [j13]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting is NP-hard. Bull. EATCS 130 (2020) - [j12]Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster Graph bipartization. J. Comput. Syst. Sci. 109: 45-55 (2020) - [j11]Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra:
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. Theory Comput. Syst. 64(6): 1067-1093 (2020) - [j10]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems. ACM Trans. Algorithms 16(4): 51:1-51:38 (2020) - [j9]Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Linear representation of transversal matroids and gammoids parameterized by rank. Theor. Comput. Sci. 818: 51-59 (2020) - [c31]Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan:
On the Complexity of Recovering Incidence Matrices. ESA 2020: 50:1-50:13 - [c30]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. ICALP 2020: 80:1-80:16 - [c29]William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Fault Tolerant Subgraphs with Applications in Kernelization. ITCS 2020: 47:1-47:22 - [c28]Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma:
Parameterized Complexity of Directed Spanner Problems. IPEC 2020: 12:1-12:11 - [c27]Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma:
Quick Separation in Chordal and Split Graphs. MFCS 2020: 70:1-70:14 - [c26]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
2-Approximating Feedback Vertex Set in Tournaments. SODA 2020: 1010-1018 - [c25]Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi:
An exponential time parameterized algorithm for planar disjoint paths. STOC 2020: 1307-1316 - [i9]Pranabendu Misra:
On Fault Tolerant Feedback Vertex Set. CoRR abs/2009.06063 (2020)
2010 – 2019
- 2019
- [j8]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. ACM Trans. Algorithms 15(1): 11:1-11:28 (2019) - [c24]Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh:
An Erdős-Pósa Theorem on Neighborhoods and Domination Number. COCOON 2019: 437-444 - [c23]Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Interval Vertex Deletion Admits a Polynomial Kernel. SODA 2019: 1711-1730 - [c22]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting is NP-hard. SODA 2019: 2810-2822 - [i8]Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
A Brief Note on Single Source Fault Tolerant Reachability. CoRR abs/1904.08150 (2019) - 2018
- [j7]Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Finding even subgraphs even faster. J. Comput. Syst. Sci. 97: 1-13 (2018) - [j6]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh:
Deterministic Truncation of Linear Matroids. ACM Trans. Algorithms 14(2): 14:1-14:20 (2018) - [c21]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems. APPROX-RANDOM 2018: 1:1-1:15 - [c20]R. Krithika, Pranabendu Misra, Prafullkumar Tale:
An FPT Algorithm for Contraction to Cactus. COCOON 2018: 341-352 - [c19]Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra:
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. CSR 2018: 194-206 - [c18]Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. FSTTCS 2018: 35:1-35:19 - [c17]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. ITCS 2018: 32:1-32:13 - [c16]Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh:
Exploring the Kernelization Borders for Hitting Cycles. IPEC 2018: 14:1-14:14 - [c15]Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi:
Parameterized Algorithms for Survivable Network Design with Uniform Demands. SODA 2018: 2838-2850 - [c14]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Erdös-Pósa Property of Obstructions to Interval Graphs. STACS 2018: 7:1-7:15 - [i7]Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Popular Matching in Roommates Setting is NP-hard. CoRR abs/1803.09370 (2018) - [i6]Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh:
A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. CoRR abs/1809.08437 (2018) - 2017
- [j5]Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster exact algorithms for some terminal set problems. J. Comput. Syst. Sci. 88: 195-207 (2017) - [j4]Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Hitting Selected (Odd) Cycles. SIAM J. Discret. Math. 31(3): 1581-1615 (2017) - [c13]Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. COCOON 2017: 420-432 - [c12]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. SODA 2017: 1383-1398 - [c11]Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh:
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. WADS 2017: 25-36 - [i5]Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
On finding highly connected spanning subgraphs. CoRR abs/1701.02853 (2017) - [i4]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems. CoRR abs/1707.04908 (2017) - [i3]Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. CoRR abs/1707.04917 (2017) - 2016
- [j3]Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh:
Reducing rank of the adjacency matrix by graph modification. Theor. Comput. Sci. 654: 70-79 (2016) - [c10]R. Krithika, Pranabendu Misra, Ashutosh Rai, Prafullkumar Tale:
Lossy Kernels for Graph Contraction Problems. FSTTCS 2016: 23:1-23:14 - 2015
- [j2]Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan:
Faster Parameterized Algorithms for Deletion to Split Graphs. Algorithmica 71(4): 989-1006 (2015) - [c9]Syed Mohammad Meesum, Pranabendu Misra, Saket Saurabh:
Reducing Rank of the Adjacency Matrix by Graph Modification. COCOON 2015: 361-373 - [c8]Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Finding Even Subgraphs Even Faster. FSTTCS 2015: 434-447 - [c7]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh:
Deterministic Truncation of Linear Matroids. ICALP (1) 2015: 922-934 - 2014
- [c6]Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Parameterized Algorithms to Preserve Connectivity. ICALP (1) 2014: 800-811 - [c5]Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Parameterized Approximations via d-Skew-Symmetric Multicut. MFCS (2) 2014: 457-468 - [i2]Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh:
Deterministic Truncation of Linear Matroids. CoRR abs/1404.4506 (2014) - [i1]Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Finding Even Subgraphs Even Faster. CoRR abs/1409.4935 (2014) - 2013
- [j1]Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. Theory Comput. Syst. 53(4): 609-620 (2013) - [c4]Rajesh Hemant Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster Exact Algorithms for Some Terminal Set Problems. IPEC 2013: 150-162 - 2012
- [c3]Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan:
Faster Parameterized Algorithms for Deletion to Split Graphs. SWAT 2012: 107-118 - [c2]Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Parameterized Algorithms for Even Cycle Transversal. WG 2012: 172-183 - 2011
- [c1]Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments. ISAAC 2011: 333-343
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
