#### Filter Results:

- Full text PDF available (20)

#### Publication Year

2009

2018

- This year (4)
- Last 5 years (24)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

A Fixed-Parameter Tractable (FPT) ρ-approximation algorithm for a minimization (resp. maximization) parameterized problem P is an FPT-algorithm that, given an instance (x, k) ∈ P computes a solution… (More)

- Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi, Marcin Pilipczuk, Michal Pilipczuk
- 2012 IEEE 53rd Annual Symposium on Foundations of…
- 2012

We introduce a new technique for designing fixed-parameter algorithms for cut problems, namely randomized contractions. With our framework: (1) We obtain the first FPT algorithm for the parameterized… (More)

Given a directed graph G, a set of k terminals, and an integer p, the Directed Vertex Multiway Cut problem asks whether there is a set S of at most p (nonterminal) vertices whose removal disconnects… (More)

Given a graph <i>G</i> and an integer <i>k</i>, the <scp>Feedback Vertex Set</scp> (FVS) problem asks if there is a vertex set <i>T</i> of size at most <i>k</i> that hits all cycles in the graph. The… (More)

- Abhijin Adiga, Rajesh Hemant Chitnis, Saket Saurabh
- ISAAC
- 2010

In this paper we initiate an algorithmic study of Boxicity, a combinatorially well studied graph invariant, from the viewpoint of parameterized algorithms. The boxicity of an arbitrary graph G with… (More)

- Rajesh Hemant Chitnis, Graham Cormode, +4 authors Sofya Vorotnikova
- ArXiv
- 2015

In this paper we present a simple but powerful subgraph sampling primitive that is applicable in a variety of computational models including dynamic graph streams (where the input graph is defined by… (More)

The behavior of users in social networks is often observed to be affected by the actions of their friends. Bhawalkar et al. (Bhawalkar et al. 2012) introduced a formal mathematical model for user… (More)

- Rajesh Hemant Chitnis, Graham Cormode, +4 authors Sofya Vorotnikova
- SODA
- 2016

In this paper we present a simple but powerful subgraph sampling primitive that is applicable in a variety of computational models including dynamic graph streams (where the input graph is defined by… (More)

- Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach
- FSTTCS
- 2013

Motivated by the study of unraveling processes in social networks, Bhawalkar, Kleinberg, Lewi, Roughgarden, and Sharma [ICALP 2012] introduced the Anchored k-Core problem, where the task is for a… (More)

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… (More)