2009 |
12 | EE | Ch. Sobhan Babu,
Ajit A. Diwan:
Disjoint cycles with chords in graphs.
Journal of Graph Theory 60(2): 87-98 (2009) |
2008 |
11 | EE | Ajit A. Diwan,
Sreyash Kenkre,
Sundar Vishwanathan:
Circumference, Chromatic Number and Online Coloring
CoRR abs/0809.1710: (2008) |
10 | EE | Ch. Sobhan Babu,
Ajit A. Diwan:
Subdivisions of graphs: A generalization of paths and cycles.
Discrete Mathematics 308(19): 4479-4486 (2008) |
2007 |
9 | EE | Rahul Gupta,
Ajit A. Diwan,
Sunita Sarawagi:
Efficient inference with cardinality-based clique potentials.
ICML 2007: 329-336 |
2006 |
8 | EE | Ravindra Guravannavar,
S. Sudarshan,
Ajit A. Diwan,
Ch. Sobhan Babu:
Reducing Order Enforcement Cost in Complex Query Plans
CoRR abs/cs/0611094: (2006) |
2005 |
7 | EE | Ch. Sobhan Babu,
Ajit A. Diwan:
Degree conditions for forests in graphs.
Discrete Mathematics 301(2-3): 228-231 (2005) |
6 | EE | Ch. Sobhan Babu,
Ajit A. Diwan:
Oriented Forests in Directed Graphs.
Electronic Notes in Discrete Mathematics 22: 141-145 (2005) |
2003 |
5 | EE | Narendra Agarwal,
Ajit A. Diwan:
Triangle-factors in powers of graphs.
Electronic Notes in Discrete Mathematics 15: 23-25 (2003) |
2002 |
4 | EE | Ajit A. Diwan,
Manish P. Kurhekar:
Plane triangulations are 6-partitionable.
Discrete Mathematics 256(1-2): 91-103 (2002) |
3 | EE | Ajit A. Diwan:
Disconnected 2-Factors in Planar Cubic Bridgeless Graphs.
J. Comb. Theory, Ser. B 84(2): 249-259 (2002) |
1996 |
2 | EE | Ajit A. Diwan,
Sanjeeva Rane,
S. Seshadri,
S. Sudarshan:
Clustering Techniques for Minimizing External Path Length.
VLDB 1996: 342-353 |
1995 |
1 | | Ajit A. Diwan,
N. Usharani:
A Condition for the Three Colourability of Planar Locally Path Graphs.
FSTTCS 1995: 52-61 |