Ajit A. Diwan

41 papers A* 2Misc 1Journal 35Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
Planar cycle-extendable graphs.
Discret. Math. Theor. Comput. Sci.
Aditya Y. Dalwadi, Kapil R. Shenvi Pause, Ajit A. Diwan, Nishad Kothari
2024 J jnl
Cycles of weight divisible by
CoRR
Ajit A. Diwan
2024 J jnl
Extremal minimal bipartite matching covered graphs.
CoRR
Amit Kumar Mallik, Ajit A. Diwan, Nishad Kothari
2024 J jnl
Planar Cycle-Extendable Graphs.
CoRR
Aditya Y. Dalwadi, Kapil R. Shenvi Pause, Ajit A. Diwan, Nishad Kothari
2022 J jnl
Chords of 2-Factors in Planar Cubic Bridgeless Graphs.
Graphs Comb.
Ajit A. Diwan
2022 J jnl
Subdivisions of maximal 3-degenerate graphs of order d + 1 $d+1$ in graphs of minimum degree d $d$.
J. Graph Theory
Ajit A. Diwan
2021 J jnl
Another simple reformulation of the four color theorem.
CoRR
Ajit A. Diwan
2021 J jnl
Explicit Δ-edge-coloring of consecutive levels in a divisor lattice.
Discret. Math.
Ajit A. Diwan
2019 — conf
Drawing Bipartite Graphs in Two Layers with Specified Crossings.
CALDAM
Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh
2019 J jnl
The minimum forcing number of perfect matchings in the hypercube.
Discret. Math.
Ajit A. Diwan
2017 — conf
Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two.
CALDAM
Ajit A. Diwan, Sai Sandeep
2017 J jnl
On the Maximum Rate of Networked Computation in a Capacitated Network.
IEEE/ACM Trans. Netw.
Pooja Vyavahare, Nutan Limaye, Ajit A. Diwan, D. Manjunath
2017 J jnl
P
Discret. Appl. Math.
Ajit A. Diwan
2017 J jnl
Two-layer Drawings of Bipartite Graphs.
Electron. Notes Discret. Math.
Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh
2015 J jnl
Fragmented coloring of proper interval and split graphs.
Discret. Appl. Math.
Ajit A. Diwan, Soumitra Pal, Abhiram G. Ranade
2015 J jnl
The complexity of P
Discret. Math. Theor. Comput. Sci.
Ajit A. Diwan, Justine E. Dion, David J. Mendell, Michael Plantholt, Shailesh K. Tipnis
2013 J jnl
Circumference, chromatic number and online coloring.
Comb.
Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan
2012 J jnl
Balanced group-labeled graphs.
Discret. Math.
Manas Joglekar, Nisarg Shah, Ajit A. Diwan
2012 J jnl
Component Coloring of Proper Interval Graphs and Split Graphs
CoRR
Ajit A. Diwan, Soumitra Pal, Abhiram Ranade
2012 J jnl
Which sort orders are interesting?
VLDB J.
Ravindra Guravannavar, S. Sudarshan, Ajit A. Diwan, Ch. Sobhan Babu
2011 J jnl
A sufficient condition for the existence of an anti-directed 2-factor in a directed graph.
Discret. Math.
Ajit A. Diwan, Josh B. Frye, Michael Plantholt, Shailesh K. Tipnis
2011 J jnl
On joint triangulations of two sets of points in the plane
CoRR
Ajit A. Diwan, Subir Kumar Ghosh, Partha P. Goswami, Andrzej Lingas
2010 J jnl
Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials.
J. Mach. Learn. Res.
Rahul Gupta, Sunita Sarawagi, Ajit A. Diwan
2010 J jnl
Cycles of even lengths modulo
J. Graph Theory
Ajit A. Diwan
2009 J jnl
Disjoint cycles with chords in graphs.
J. Graph Theory
Ch. Sobhan Babu, Ajit A. Diwan
2009 J jnl
Generalized Collective Inference with Symmetric Clique Potentials
CoRR
Rahul Gupta, Sunita Sarawagi, Ajit A. Diwan
2009 J jnl
Non-separating trees in connected graphs.
Discret. Math.
Ajit A. Diwan, Namrata P. Tholiya
2008 J jnl
Circumference, Chromatic Number and Online Coloring
CoRR
Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan
2008 J jnl
Degree Condition for Subdivisions of Unicyclic Graphs.
Graphs Comb.
Ch. Sobhan Babu, Ajit A. Diwan
2008 J jnl
Subdivisions of graphs: A generalization of paths and cycles.
Discret. Math.
Ch. Sobhan Babu, Ajit A. Diwan
2007 A* conf
Efficient inference with cardinality-based clique potentials.
ICML
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
2006 J jnl
Reducing Order Enforcement Cost in Complex Query Plans
CoRR
Ravindra Guravannavar, S. Sudarshan, Ajit A. Diwan, Ch. Sobhan Babu
2006 Misc conf
Scheduling and Caching in MultiQuery Optimization.
COMAD
Dilys Thomas, Ajit A. Diwan, S. Sudarshan
2005 J jnl
Degree conditions for forests in graphs.
Discret. Math.
Ch. Sobhan Babu, Ajit A. Diwan
2005 J jnl
Oriented Forests in Directed Graphs.
Electron. Notes Discret. Math.
Ch. Sobhan Babu, Ajit A. Diwan
2003 J jnl
Triangle-factors in powers of graphs.
Electron. Notes Discret. Math.
Narendra Agarwal, Ajit A. Diwan
2002 J jnl
Disconnected 2-Factors in Planar Cubic Bridgeless Graphs.
J. Comb. Theory B
Ajit A. Diwan
2002 J jnl
Plane triangulations are 6-partitionable.
Discret. Math.
Ajit A. Diwan, Manish P. Kurhekar
2000 J jnl
Decomposing graphs with girth at least five under degree constraints.
J. Graph Theory
Ajit A. Diwan
1996 A* conf
Clustering Techniques for Minimizing External Path Length.
VLDB
Ajit A. Diwan, Sanjeeva Rane, S. Seshadri, S. Sudarshan
1995 — conf
A Condition for the Three Colourability of Planar Locally Path Graphs.
FSTTCS
Ajit A. Diwan, N. Usharani