8 Result(s)
within
Chapter
Conference Paper
Pranabendu Misra
Numeric Computing
-
Chapter and Conference Paper
An Erdős–Pósa Theorem on Neighborhoods and Domination Number
The neighborhood packing number of a graph is the maximum number of...
-
Chapter and Conference Paper
An FPT Algorithm for Contraction to Cactus
For a collection \(\mathcal {F}\) of graphs, given a graph G and an integer k, the
-
Chapter and Conference Paper
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized
Let \(\mathrm{\Pi }\) be a family of graphs. In the classical
-
Chapter and Conference Paper
Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank
Given a bipartite graph \(G=(U\uplus V,E)\) , a linear representation of the transversal matroid associated ...
-
Chapter and Conference Paper
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements
We design exact algorithms for the following two problems in survivable network design: (i) designing a minimum cost network with a desired value of edge connectivity, which is called Minimum Weight ...
-
Chapter and Conference Paper
Parameterized Approximations via d-Skew-Symmetric Multicut
In this paper we design polynomial time approximation algorithms for several parameterized problems such as Odd Cycle Transversal, Almost 2-SAT, Above Guarantee Vertex Cover and Deletion q-Horn Backdoor Set Detec...
-
Chapter and Conference Paper
Faster Exact Algorithms for Some Terminal Set Problems
Many problems on graphs can be expressed in the following language: given a graph G = (V,E) and a terminal set T ⊆ V, find a minimum size set S ⊆ V which intersects all “structures” (such as cycles or paths) pass...
-
Chapter and Conference Paper
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
In the k -Feedback Arc/Vertex Set problem we are given a directed graph D and a positive integer k and the objective is to check whether it is possible to delete at most k arcs/vertices from D to ...
