Ajit A. Diwan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2022

Subdivisions of maximal 3-degenerate graphs of order d + 1 $d+1$ in graphs of minimum degree d $d$Ajit A. Diwan. jgt, 101(1):142-160, 2022. [doi]

Chords of 2-Factors in Planar Cubic Bridgeless GraphsAjit A. Diwan. gc, 38(6):177, 2022. [doi]

2021

Explicit Δ-edge-coloring of consecutive levels in a divisor latticeAjit A. Diwan. DM, 344(8):112485, 2021. [doi]

2019

The minimum forcing number of perfect matchings in the hypercubeAjit A. Diwan. DM, 342(4):1060-1062, 2019. [doi]

Drawing Bipartite Graphs in Two Layers with Specified CrossingsAjit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh. caldam 2019: 97-108 [doi]

2017

2015

Fragmented coloring of proper interval and split graphsAjit A. Diwan, Soumitra Pal, Abhiram G. Ranade. DAM, 193:110-118, 2015. [doi]

4-decomposition of regular graphs and multigraphsAjit A. Diwan, Justine E. Dion, David J. Mendell, Michael Plantholt, Shailesh K. Tipnis. dmtcs, 17(2):63-76, 2015. [doi]

2013

Circumference, chromatic number and online coloringAjit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan. combinatorica, 33(3):319-334, 2013. [doi]

2012

Which sort orders are interesting?Ravindra Guravannavar, S. Sudarshan 0001, Ajit A. Diwan, Ch. Sobhan Babu. vldb, 21(1):145-165, 2012. [doi]

Balanced group-labeled graphsManas Joglekar, Nisarg Shah, Ajit A. Diwan. DM, 312(9):1542-1549, 2012. [doi]

2011

A sufficient condition for the existence of an anti-directed 2-factor in a directed graphAjit A. Diwan, Josh B. Frye, Michael Plantholt, Shailesh K. Tipnis. DM, 311(21):2556-2562, 2011. [doi]

2010

Cycles of even lengths modulo ::::k::::Ajit A. Diwan. jgt, 65(3):246-252, 2010. [doi]

Collective Inference for Extraction MRFs Coupled with Symmetric Clique PotentialsRahul Gupta, Sunita Sarawagi, Ajit A. Diwan. jmlr, 11:3097-3135, 2010. [doi]

2009

Disjoint cycles with chords in graphsCh. Sobhan Babu, Ajit A. Diwan. jgt, 60(2):87-98, 2009. [doi]

Non-separating trees in connected graphsAjit A. Diwan, Namrata P. Tholiya. DM, 309(16):5235-5237, 2009. [doi]

2008

Degree Condition for Subdivisions of Unicyclic GraphsCh. Sobhan Babu, Ajit A. Diwan. gc, 24(6):495-509, 2008. [doi]

Subdivisions of graphs: A generalization of paths and cyclesCh. Sobhan Babu, Ajit A. Diwan. DM, 308(19):4479-4486, 2008. [doi]

2007

Efficient inference with cardinality-based clique potentialsRahul Gupta, Ajit A. Diwan, Sunita Sarawagi. icml 2007: 329-336 [doi]

2006

Scheduling and Caching in MultiQuery OptimizationDilys Thomas, Ajit A. Diwan, S. Sudarshan. comad 2006: 150-153 [doi]

2005

Oriented Forests in Directed GraphsCh. Sobhan Babu, Ajit A. Diwan. endm, 22:141-145, 2005. [doi]

Degree conditions for forests in graphsCh. Sobhan Babu, Ajit A. Diwan. DM, 301(2-3):228-231, 2005. [doi]

2003

Triangle-factors in powers of graphsNarendra Agarwal, Ajit A. Diwan. endm, 15:23-25, 2003. [doi]

2002

Disconnected 2-Factors in Planar Cubic Bridgeless GraphsAjit A. Diwan. JCT, 84(2):249-259, 2002. [doi]

Plane triangulations are 6-partitionableAjit A. Diwan, Manish P. Kurhekar. DM, 256(1-2):91-103, 2002. [doi]

2000

Decomposing graphs with girth at least five under degree constraintsAjit A. Diwan. jgt, 33(4):237-239, 2000. [doi]

1996

Clustering Techniques for Minimizing External Path LengthAjit A. Diwan, Sanjeeva Rane, S. Seshadri, S. Sudarshan. VLDB 1996: 342-353 [doi]

1995

A Condition for the Three Colourability of Planar Locally Path GraphsAjit A. Diwan, N. Usharani. fsttcs 1995: 52-61

Sign in or sign up to see more results.

runs on WebDSL