#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2015

2017

- This year (2)
- Last 5 years (5)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh
- IPEC
- 2015

Vertex Cover is one of the most well studied problems in the realm of parameterized algorithms and admits a kernel with O(`2) edges and 2` vertices. Here, ` denotes the size of a vertex cover we are seeking for. A natural question is whether Vertex Cover admits a polynomial kernel (or a parameterized algorithm) with respect to a parameter k, that is,… (More)

- Diptapriyo Majumdar
- IPEC
- 2016

A feedback vertex set in an undirected graph is a subset of vertices whose removal results in an acyclic graph. It is well-known that the problem of finding a minimum sized (or k-sized in case of decision version of) feedback vertex set (FVS) is polynomial time solvable in (sub)-cubic graphs, in pseudo-forests (graphs where each component has at most one… (More)

- Diptapriyo Majumdar, Venkatesh Raman
- FAW
- 2017

A key result in the field of kernelization, a subfield of parameterized complexity, states that the classic Disjoint Cycle Packing problem, i.e. finding k vertex disjoint cycles in a given graph G, admits no polynomial kernel unless NP ⊆ coNP/poly. However, very little is known about this problem beyond the aforementioned kernelization lower bound (within… (More)

- Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, Prafullkumar Tale
- CALDAM
- 2017

- ‹
- 1
- ›