#### Filter Results:

- Full text PDF available (21)

#### Publication Year

2000

2018

- This year (3)
- Last 5 years (20)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert E. Tarjan
- ACM Trans. Algorithms
- 2012

We present two online algorithms for maintaining a topological order of a directed <i>n</i>-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithmâ€¦ (More)

- L. Sunil Chandran, Rogers Mathew
- Discrete Mathematics & Theoretical Computerâ€¦
- 2013

Let k be an integer and k â‰¥ 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class ofâ€¦ (More)

- R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan
- Discrete Mathematics
- 2013

Characterization of k-chordal graphs based on the existence of a simplicial path was shown in [ChvÃ¡tal et al. Note: Dirac-type characterizations of graphs without long chordless cycles. Discreteâ€¦ (More)

- Tushar Kalra, Rogers Mathew, Sudebkumar Prasant Pal, Vijay Pandey
- CALDAM
- 2017

Given a graph G, a non-negative integer k, and a weight function that maps each vertex in G to a positive real number, the Maximum Weighted Budgeted Independent Set (MWBIS) problem is about finding aâ€¦ (More)

- Xueliang Li, Sujuan Liu, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
- Electr. J. Comb.
- 2012

The rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one path in which noâ€¦ (More)

- Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
- SIAM J. Discrete Math.
- 2015

The separation dimension of a graph G is the smallest natural number k for which the vertices of G can be embedded in Rk such that any pair of disjoint edges in G can be separated by a hyperplaneâ€¦ (More)

- Arijit Bishnu, Arijit Ghosh, Rogers Mathew, Gopinath Mishra, Subhabrata Paul
- ArXiv
- 2017

The grid obstacle representation of a graph G = (V,E) is an injective function f : V â†’ Z and a set of point obstacles O on the grid points of Z (where V has not been mapped) such that uv is an edgeâ€¦ (More)

- Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad
- Algorithmica
- 2015

Separation dimension of a hypergraph H, denoted by $$\pi (H)$$ Ï€ ( H ) , is the smallest natural number k so that the vertices of H can be embedded in $$\mathbb {R}^k$$ R k such that any two disjointâ€¦ (More)

We present two online algorithms for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm takes O(m) amortizedâ€¦ (More)

- Telikepalli Kavitha, Rogers Mathew
- ArXiv
- 2007

We present two algorithms for maintaining the topological order of a directed a yclic graph with n vertices, under an online edge insertion sequence of m edges. Efficient algorithms for onlineâ€¦ (More)