#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2013

2017

- This year (1)
- Last 5 years (6)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Davis Issac, Ragesh Jaiswal
- ArXiv
- 2013

We give an O∗(1.0821n)-time, polynomial space algorithm for computing Maximum Independent Set in graphs with bounded degree 3. This improves all the previous running time bounds known for the problem.

- Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar
- Algorithmica
- 2015

Space efficient algorithms play an important role in dealing with large amount of data. In such settings, one would like to analyze the large data using small amount of “working space”. One of the key steps in many algorithms for analyzing large data is to maintain a (or a small number) random sample from the data points. In this paper, we consider two… (More)

- L. Sunil Chandran, Davis Issac, Sanming Zhou
- COCOON
- 2016

- L. Sunil Chandran, Davis Issac, Andreas Karrenbauer
- IPEC
- 2016

Given a bipartite graph G, we consider the decision problem called BicliqueCover for a fixed positive integer parameter k where we are asked whether the edges of G can be covered with at most k complete bipartite subgraphs (a.k.a. bicliques). In the BicliquePartition problem, we have the additional constraint that each edge should appear in exactly one of… (More)

- L. Sunil Chandran, Davis Issac, Sanming Zhou
- ArXiv
- 2016

Hadwiger’s conjecture states that for every graph G, χ(G) ≤ η(G), where χ(G) is the chromatic number and η(G) is the size of the largest clique minor in G. In this work, we show that to prove Hadwiger’s conjecture in general, it is sufficient to prove Hadwiger’s conjecture for the class of graphs F defined as follows: F is the set of all graphs that can be… (More)

- L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen
- ArXiv
- 2017

A well-studied coloring problem is to assign colors to the edges of a graph so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors. The minimum number of colors necessary in such a coloring is the strong rainbow connection number (src(G)) of a graph. When proving upper bounds on src(G), it is… (More)

- ‹
- 1
- ›