default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAjit A. Diwan
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i12]Amit Kumar Mallik, Ajit A. Diwan, Nishad Kothari:
Extremal minimal bipartite matching covered graphs. CoRR abs/2404.06445 (2024)- [i11]Aditya Y. Dalwadi, Kapil R. Shenvi Pause, Ajit A. Diwan, Nishad Kothari:
Planar Cycle-Extendable Graphs. CoRR abs/2405.15416 (2024) - [i10]Ajit A. Diwan:
Cycles of weight divisible by k. CoRR abs/2407.01198 (2024) - 2022
- [j30]Ajit A. Diwan
:
Chords of 2-Factors in Planar Cubic Bridgeless Graphs. Graphs Comb. 38(6): 177 (2022) - [j29]Ajit A. Diwan:
Subdivisions of maximal 3-degenerate graphs of order d + 1 $d+1$ in graphs of minimum degree d $d$. J. Graph Theory 101(1): 142-160 (2022) - 2021
- [j28]Ajit A. Diwan:
Explicit Δ-edge-coloring of consecutive levels in a divisor lattice. Discret. Math. 344(8): 112485 (2021) - [i9]Ajit A. Diwan:
Another simple reformulation of the four color theorem. CoRR abs/2108.10512 (2021) - 2020
- [j27]Ajit Arvind Diwan, Bodhayan Roy:
On colouring point visibility graphs. Discret. Appl. Math. 286: 78-90 (2020)
2010 – 2019
- 2019
- [j26]Ajit A. Diwan:
The minimum forcing number of perfect matchings in the hypercube. Discret. Math. 342(4): 1060-1062 (2019) - [c10]Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh:
Drawing Bipartite Graphs in Two Layers with Specified Crossings. CALDAM 2019: 97-108 - 2017
- [j25]Ajit A. Diwan:
P3-decomposition of directed graphs. Discret. Appl. Math. 228: 73-79 (2017) - [j24]Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh:
Two-layer Drawings of Bipartite Graphs. Electron. Notes Discret. Math. 61: 351-357 (2017) - [j23]Pooja Vyavahare, Nutan Limaye, Ajit A. Diwan, D. Manjunath:
On the Maximum Rate of Networked Computation in a Capacitated Network. IEEE/ACM Trans. Netw. 25(4): 2444-2458 (2017) - [c9]Ajit Arvind Diwan, Bodhayan Roy:
On Colouring Point Visibility Graphs. CALDAM 2017: 156-165 - [c8]Ajit A. Diwan, Sai Sandeep:
Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two. CALDAM 2017: 166-176 - 2016
- [c7]Ajit Arvind Diwan, Bodhayan Roy:
Partitions of planar point sets into polygons. CCCG 2016: 147-154 - [i8]Ajit Arvind Diwan, Bodhayan Roy:
Partitions of planar point sets into polygons. CoRR abs/1605.05546 (2016) - [i7]Ajit Arvind Diwan, Bodhayan Roy:
On colouring point visibility graphs. CoRR abs/1610.00952 (2016) - 2015
- [j22]Ajit A. Diwan, Soumitra Pal, Abhiram G. Ranade:
Fragmented coloring of proper interval and split graphs. Discret. Appl. Math. 193: 110-118 (2015) - [j21]Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy:
Four-Connected Triangulations of Planar Point Sets. Discret. Comput. Geom. 53(4): 713-746 (2015) - [j20]Ajit A. Diwan, Justine E. Dion, David J. Mendell, Michael Plantholt, Shailesh K. Tipnis:
The complexity of P4-decomposition of regular graphs and multigraphs. Discret. Math. Theor. Comput. Sci. 17(2): 63-76 (2015) - 2013
- [j19]Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan:
Circumference, chromatic number and online coloring. Comb. 33(3): 319-334 (2013) - [i6]Ajit Arvind Diwan, Subir Kumar Ghosh, Bodhayan Roy:
Four-connected triangulations of planar point sets. CoRR abs/1310.1726 (2013) - 2012
- [j18]Manas Joglekar, Nisarg Shah, Ajit A. Diwan:
Balanced group-labeled graphs. Discret. Math. 312(9): 1542-1549 (2012) - [j17]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
- [j16]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. Discret. Math. 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
- [j15]Ajit A. Diwan:
Cycles of even lengths modulo k. J. Graph Theory 65(3): 246-252 (2010) - [j14]Rahul Gupta, Sunita Sarawagi, Ajit A. Diwan:
Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials. J. Mach. Learn. Res. 11: 3097-3135 (2010)
2000 – 2009
- 2009
- [j13]Ajit A. Diwan, Namrata P. Tholiya:
Non-separating trees in connected graphs. Discret. Math. 309(16): 5235-5237 (2009) - [j12]Ch. Sobhan Babu, Ajit A. Diwan:
Disjoint cycles with chords in graphs. J. 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
- [j11]Ch. Sobhan Babu, Ajit A. Diwan:
Subdivisions of graphs: A generalization of paths and cycles. Discret. Math. 308(19): 4479-4486 (2008) - [j10]Ch. Sobhan Babu, Ajit A. Diwan:
Degree Condition for Subdivisions of Unicyclic Graphs. Graphs Comb. 24(6): 495-509 (2008) - [j9]Marién Abreu, Ajit Arvind Diwan, Bill Jackson, Domenico Labbate, John Sheehan:
Pseudo 2-factor isomorphic regular bipartite graphs. J. Comb. Theory B 98(2): 432-442 (2008) - [i2]Ajit A. Diwan, Sreyash Kenkre, Sundar Vishwanathan:
Circumference, Chromatic Number and Online Coloring. CoRR abs/0809.1710 (2008) - 2007
- [c6]Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi:
Efficient inference with cardinality-based clique potentials. ICML 2007: 329-336 - 2006
- [c5]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
- [j8]Ch. Sobhan Babu, Ajit A. Diwan:
Degree conditions for forests in graphs. Discret. Math. 301(2-3): 228-231 (2005) - [j7]Ch. Sobhan Babu, Ajit A. Diwan:
Oriented Forests in Directed Graphs. Electron. Notes Discret. Math. 22: 141-145 (2005) - 2003
- [j6]Narendra Agarwal, Ajit A. Diwan:
Triangle-factors in powers of graphs. Electron. Notes Discret. Math. 15: 23-25 (2003) - 2002
- [j5]Ajit A. Diwan, Manish P. Kurhekar:
Plane triangulations are 6-partitionable. Discret. Math. 256(1-2): 91-103 (2002) - [j4]Ajit A. Diwan:
Disconnected 2-Factors in Planar Cubic Bridgeless Graphs. J. Comb. Theory B 84(2): 249-259 (2002) - 2000
- [j3]Ajit A. Diwan:
Decomposing graphs with girth at least five under degree constraints. J. Graph Theory 33(4): 237-239 (2000)
1990 – 1999
- 1996
- [c4]Ajit A. Diwan, Sanjeeva Rane, S. Seshadri, S. Sudarshan:
Clustering Techniques for Minimizing External Path Length. VLDB 1996: 342-353 - 1995
- [c3]Ajit A. Diwan, N. Usharani:
A Condition for the Three Colourability of Planar Locally Path Graphs. FSTTCS 1995: 52-61 - [c2]M. Chandramouli, Ajit Arvind Diwan:
Upward Numbering Testing for Triconnected Graphs. GD 1995: 140-151 - 1993
- [j2]Vinaya Kumar Singh, Ajit Arvind Diwan:
A heuristic for decomposition in multilevel logic optimization. IEEE Trans. Very Large Scale Integr. Syst. 1(4): 441-445 (1993) - [c1]Vinaya Kumar Singh, Ajit Arvind Diwan:
A Heuristic for Decomposition in Multi-Level Logic Optimization. VLSI Design 1993: 5-8 - 1991
- [j1]R. V. Subramaniyam, Ajit Arvind Diwan:
A Counterexample for the Sufficiency of Edge Guards in Star Polygons. Inf. Process. Lett. 40(2): 97-99 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 20:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
