- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j15 |      | Manas Joglekar, Nisarg Shah, Ajit A. Diwan: Balanced group-labeled graphs. Discrete Mathematics 312(9): 1542-1549 (2012) |
| j14 | | Ravindra Guravannavar, S. Sudarshan, Ajit A. Diwan, Ch. Sobhan Babu: Which sort orders are interesting? VLDB J. 21(1): 145-165 (2012) |
| i5 | | Ajit A. Diwan, Soumitra Pal, Abhiram Ranade: Component Coloring of Proper Interval Graphs and Split Graphs. CoRR abs/1201.3273 (2012) |
| 2011 | ||
| j13 | | 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) |
| i4 | | 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) |
| 2010 | ||
| j12 | | |
| j11 | | 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 | ||
| j10 | | Ajit A. Diwan, Namrata P. Tholiya: Non-separating trees in connected graphs. Discrete Mathematics 309(16): 5235-5237 (2009) |
| j9 | | Ch. Sobhan Babu, Ajit A. Diwan: Disjoint cycles with chords in graphs. Journal of Graph Theory 60(2): 87-98 (2009) |
| i3 | | Rahul Gupta, Sunita Sarawagi, Ajit A. Diwan: Generalized Collective Inference with Symmetric Clique Potentials. CoRR abs/0907.0589 (2009) |
| 2008 | ||
| j8 | | Ch. Sobhan Babu, Ajit A. Diwan: Subdivisions of graphs: A generalization of paths and cycles. Discrete Mathematics 308(19): 4479-4486 (2008) |
| j7 | | Ch. Sobhan Babu, Ajit A. Diwan: Degree Condition for Subdivisions of Unicyclic Graphs. Graphs and Combinatorics 24(6): 495-509 (2008) |
| i2 | | Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan: Circumference, Chromatic Number and Online Coloring. CoRR abs/0809.1710 (2008) |
| 2007 | ||
| c4 | | Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi: Efficient inference with cardinality-based clique potentials. ICML 2007: 329-336 |
| 2006 | ||
| c3 | | Dilys Thomas, Ajit A. Diwan, S. Sudarshan: Scheduling and Caching in MultiQuery Optimization. COMAD 2006: 150-153 |
| i1 | | Ravindra Guravannavar, S. Sudarshan, Ajit A. Diwan, Ch. Sobhan Babu: Reducing Order Enforcement Cost in Complex Query Plans. CoRR abs/cs/0611094 (2006) |
| 2005 | ||
| j6 | | Ch. Sobhan Babu, Ajit A. Diwan: Degree conditions for forests in graphs. Discrete Mathematics 301(2-3): 228-231 (2005) |
| j5 | | Ch. Sobhan Babu, Ajit A. Diwan: Oriented Forests in Directed Graphs. Electronic Notes in Discrete Mathematics 22: 141-145 (2005) |
| 2003 | ||
| j4 | | Narendra Agarwal, Ajit A. Diwan: Triangle-factors in powers of graphs. Electronic Notes in Discrete Mathematics 15: 23-25 (2003) |
| 2002 | ||
| j3 | | Ajit A. Diwan, Manish P. Kurhekar: Plane triangulations are 6-partitionable. Discrete Mathematics 256(1-2): 91-103 (2002) |
| j2 | | Ajit A. Diwan: Disconnected 2-Factors in Planar Cubic Bridgeless Graphs. J. Comb. Theory, Ser. B 84(2): 249-259 (2002) |
| 2000 | ||
| j1 | | Ajit A. Diwan: Decomposing graphs with girth at least five under degree constraints. Journal of Graph Theory 33(4): 237-239 (2000) |
| 1996 | ||
| c2 | | Ajit A. Diwan, Sanjeeva Rane, S. Seshadri, S. Sudarshan: Clustering Techniques for Minimizing External Path Length. VLDB 1996: 342-353 |
| 1995 | ||
| c1 | | Ajit A. Diwan, N. Usharani: A Condition for the Three Colourability of Planar Locally Path Graphs. FSTTCS 1995: 52-61 |
Colors in the list of coauthors
Last update Tue May 21 08:09:36 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page