#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2003

2017

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

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran
- COCOON
- 2010

The largest eigenvalue of the adjacency matrix of a network (referred to as the spectral radius) is an important metric in its own right. Further, for several models of epidemic spread on networks (e.g., the 'flu-like' SIS model), it has been shown that an epidemic dies out quickly if the spectral radius of the graph is below a certain threshold that… (More)

- Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran
- Discrete Applied Mathematics
- 2010

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

In this paper we initiate an algorithmic study of Boxicity, a combina-torially well studied graph invariant, from the viewpoint of parameterized algorithms. The boxicity of an arbitrary graph G with the vertex set V (G) and the edge set E(G), denoted by box(G), is the minimum number of interval graphs on the same set of vertices such that the intersection… (More)

- Abhijin Adiga, Anil Vullikanti
- ECML/PKDD
- 2013

The k-core is commonly used as a measure of importance and well connectedness for nodes in diverse applications in social networks and bioinformatics. Since network data is commonly noisy and incomplete, a fundamental issue is to understand how robust the core decomposition is to noise. Further, in many settings, such as online social media networks,… (More)

Simple diffusion processes on networks have been used to model, analyze and predict diverse phenomena such as spread of diseases, information and memes. More often than not, the underlying network data is noisy and sampled. This prompts the following natural question: how sensitive are the diffusion dynamics and subsequent conclusions to uncertainty in the… (More)

- Abhijin Adiga, L. Sunil Chandran
- Journal of Graph Theory
- 2009

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × I b , where each Ii is a closed interval of unit length on the real line. The cubicity of G, denoted by cub(G) is the minimum positive integer b such that the vertices in G can be mapped to axis… (More)

- Abhijin Adiga, L. Sunil Chandran, Naveen Sivadasan
- Combinatorica
- 2014

An axis-parallel b-dimensional box is a Cartesian product R1 × R2 × · · · × R b where Ri is a closed interval of the form [ai, bi] on the real line. For a graph G, its boxicity box(G) is the minimum dimension b, such that G is representable as the intersection graph of boxes in b-dimensional space. Although boxicity was introduced in 1969 and studied… (More)

- Sudip Saha, Abhijin Adiga, Anil Vullikanti
- AAAI
- 2014

The spread of epidemics and malware is commonly modeled by diffusion processes on networks. Protective interventions such as vaccinations or installing anti-virus software are used to contain their spread. Typically, each node in the network has to decide its own strategy of securing itself, and its benefit depends on which other nodes are secure, making… (More)

- Yao Zhang, Abhijin Adiga, Anil Vullikanti, B. Aditya Prakash
- 2015 IEEE International Conference on Data Mining
- 2015

Given a network with groups, such as a contact-network grouped by ages, which are the best groups to immunize to control the epidemic? Equivalently, how to best choose communities in social networks like Facebook to stop rumors from spreading? Immunization is an important problem in multiple different domains like epidemiology, public health, cyber security… (More)