 | 2012 |
| 23 |  | Ajit A. Diwan,
Soumitra Pal,
Abhiram Ranade:
Component Coloring of Proper Interval Graphs and Split Graphs
CoRR abs/1201.3273: (2012) |
| 22 |  | Manas Joglekar,
Nisarg Shah,
Ajit A. Diwan:
Balanced group-labeled graphs.
Discrete Mathematics 312(9): 1542-1549 (2012) |
| 21 |  | Ravindra Guravannavar,
S. Sudarshan,
Ajit A. Diwan,
Ch. Sobhan Babu:
Which sort orders are interesting?
VLDB J. 21(1): 145-165 (2012) |
| 2011 |
| 20 |  | Ajit A. Diwan,
Subir Kumar Ghosh,
Partha P. Goswami,
Andrzej Lingas:
On joint triangulations of two sets of points in the plane
CoRR abs/1102.1235: (2011) |
| 19 |  | Ajit A. Diwan,
Josh B. Frye,
Michael Plantholt,
Shailesh K. Tipnis:
A sufficient condition for the existence of an anti-directed 2-factor in a directed graph.
Discrete Mathematics 311(21): 2556-2562 (2011) |
| 2010 |
| 18 |  | Ajit A. Diwan:
Cycles of even lengths modulo k.
Journal of Graph Theory 65(3): 246-252 (2010) |
| 17 |  | Rahul Gupta,
Sunita Sarawagi,
Ajit A. Diwan:
Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials.
Journal of Machine Learning Research 11: 3097-3135 (2010) |
| 2009 |
| 16 |  | Rahul Gupta,
Sunita Sarawagi,
Ajit A. Diwan:
Generalized Collective Inference with Symmetric Clique Potentials
CoRR abs/0907.0589: (2009) |
| 15 |  | Ajit A. Diwan,
Namrata P. Tholiya:
Non-separating trees in connected graphs.
Discrete Mathematics 309(16): 5235-5237 (2009) |
| 14 |  | Ch. Sobhan Babu,
Ajit A. Diwan:
Disjoint cycles with chords in graphs.
Journal of Graph Theory 60(2): 87-98 (2009) |
| 2008 |
| 13 |  | Ajit A. Diwan,
Sreyash Kenkre,
Sundar Vishwanathan:
Circumference, Chromatic Number and Online Coloring
CoRR abs/0809.1710: (2008) |
| 12 |  | Ch. Sobhan Babu,
Ajit A. Diwan:
Subdivisions of graphs: A generalization of paths and cycles.
Discrete Mathematics 308(19): 4479-4486 (2008) |
| 11 |  | Ch. Sobhan Babu,
Ajit A. Diwan:
Degree Condition for Subdivisions of Unicyclic Graphs.
Graphs and Combinatorics 24(6): 495-509 (2008) |
| 2007 |
| 10 |  | Rahul Gupta,
Ajit A. Diwan,
Sunita Sarawagi:
Efficient inference with cardinality-based clique potentials.
ICML 2007: 329-336 |
| 2006 |
| 9 |  | Dilys Thomas,
Ajit A. Diwan,
S. Sudarshan:
Scheduling and Caching in MultiQuery Optimization.
COMAD 2006: 150-153 |
| 8 |  | 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 |  | Ch. Sobhan Babu,
Ajit A. Diwan:
Degree conditions for forests in graphs.
Discrete Mathematics 301(2-3): 228-231 (2005) |
| 6 |  | Ch. Sobhan Babu,
Ajit A. Diwan:
Oriented Forests in Directed Graphs.
Electronic Notes in Discrete Mathematics 22: 141-145 (2005) |
| 2003 |
| 5 |  | Narendra Agarwal,
Ajit A. Diwan:
Triangle-factors in powers of graphs.
Electronic Notes in Discrete Mathematics 15: 23-25 (2003) |
| 2002 |
| 4 |  | Ajit A. Diwan,
Manish P. Kurhekar:
Plane triangulations are 6-partitionable.
Discrete Mathematics 256(1-2): 91-103 (2002) |
| 3 |  | Ajit A. Diwan:
Disconnected 2-Factors in Planar Cubic Bridgeless Graphs.
J. Comb. Theory, Ser. B 84(2): 249-259 (2002) |
| 1996 |
| 2 |  | 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 |