Pranabendu Misra

Orcid: 0000-0002-7086-5590

According to our database¹, Pranabendu Misra authored at least 50 papers between 2012 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Parameterized approximation algorithms for weighted vertex cover.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

Meta-theorems for Parameterized Streaming Algorithms‡.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Kernelization of Counting Problems.

[BibT_eX]

[DOI]

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number.

[BibT_eX]

[DOI]

Algorithmica, July, 2023

Polynomial Kernel for Interval Vertex Deletion.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, April, 2023

Erdős-Pósa property of obstructions to interval graphs.

[BibT_eX]

[DOI]

J. Graph Theory, April, 2023

A single exponential-time FPT algorithm for cactus contraction.

[BibT_eX]

[DOI]

R. Krithika

Pranabendu Misra

Prafullkumar Tale

Theor. Comput. Sci., 2023

An ETH-Tight Algorithm for Bidirected Steiner Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

Kristine Vitting Klinkby

Pranabendu Misra

Saket Saurabh

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Improving Order with Queues.

[BibT_eX]

[DOI]

CoRR, 2022

Parameterized Complexity of Directed Spanner Problems.

[BibT_eX]

[DOI]

Algorithmica, 2022

Fast Exact Algorithms for Survivable Network Design with Uniform Requirements.

[BibT_eX]

[DOI]

Algorithmica, 2022

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

2-Approximating Feedback Vertex Set in Tournaments.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

FPT-approximation for FPT Problems.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Strong Connectivity Augmentation is FPT.

[BibT_eX]

[DOI]

Kristine Vitting Klinkby

Pranabendu Misra

Saket Saurabh

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Improving EFX Guarantees through Rainbow Cycle Number.

[BibT_eX]

[DOI]

Bhaskar Ray Chaudhury

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020

Linear representation of transversal matroids and gammoids parameterized by rank.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized.

[BibT_eX]

[DOI]

Pallavi Jain

Lawqueen Kanesh

Pranabendu Misra

Theory Comput. Syst., 2020

Faster Graph bipartization.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

Popular Matching in Roommates Setting is NP-hard.

[BibT_eX]

[DOI]

Bull. EATCS, 2020

On Fault Tolerant Feedback Vertex Set.

[BibT_eX]

[DOI]

Pranabendu Misra

CoRR, 2020

An exponential time parameterized algorithm for planar disjoint paths.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Quick Separation in Chordal and Split Graphs.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Fault Tolerant Subgraphs with Applications in Kernelization.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

On the Complexity of Recovering Incidence Matrices.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

A Brief Note on Single Source Fault Tolerant Reachability.

[BibT_eX]

[DOI]

CoRR, 2019

Interval Vertex Deletion Admits a Polynomial Kernel.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

An Erdős-Pósa Theorem on Neighborhoods and Domination Number.

[BibT_eX]

[DOI]

Jayakrishnan Madathil

Pranabendu Misra

Saket Saurabh

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

Deterministic Truncation of Linear Matroids.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Finding even subgraphs even faster.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments.

[BibT_eX]

[DOI]

CoRR, 2018

Parameterized Algorithms for Survivable Network Design with Uniform Demands.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

Manu Basavaraju

Kristine Vitting Klinkby

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Exploring the Kernelization Borders for Hitting Cycles.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

An FPT Algorithm for Contraction to Cactus.

[BibT_eX]

[DOI]

R. Krithika

Pranabendu Misra

Prafullkumar Tale

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Hitting Selected (Odd) Cycles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Faster exact algorithms for some terminal set problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

On finding highly connected spanning subgraphs.

[BibT_eX]

[DOI]

CoRR, 2017

Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Reducing rank of the adjacency matrix by graph modification.

[BibT_eX]

[DOI]

Syed Mohammad Meesum

Pranabendu Misra

Saket Saurabh

Theor. Comput. Sci., 2016

Lossy Kernels for Graph Contraction Problems.

[BibT_eX]

[DOI]

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Faster Parameterized Algorithms for Deletion to Split Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2015

2014

Parameterized Approximations via d-Skew-Symmetric Multicut.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Parameterized Algorithms to Preserve Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

2012

Parameterized Algorithms for Even Cycle Transversal.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Pranabendu Misra

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...