Ajit A. Diwan

According to our database1, Ajit A. Diwan
  • authored at least 37 papers between 1995 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
On the Maximum Rate of Networked Computation in a Capacitated Network.
IEEE/ACM Trans. Netw., 2017

Two-layer Drawings of Bipartite Graphs.
Electronic Notes in Discrete Mathematics, 2017

P3-decomposition of directed graphs.
Discrete Applied Mathematics, 2017

Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

On Colouring Point Visibility Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
On colouring point visibility graphs.
CoRR, 2016

Partitions of planar point sets into polygons.
CoRR, 2016

Partitions of planar point sets into polygons.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
The complexity of P4-decomposition of regular graphs and multigraphs.
Discrete Mathematics & Theoretical Computer Science, 2015

Four-Connected Triangulations of Planar Point Sets.
Discrete & Computational Geometry, 2015

Fragmented coloring of proper interval and split graphs.
Discrete Applied Mathematics, 2015

2013
Four-connected triangulations of planar point sets.
CoRR, 2013

Circumference, chromatic number and online coloring.
Combinatorica, 2013

2012
Which sort orders are interesting?
VLDB J., 2012

Balanced group-labeled graphs.
Discrete Mathematics, 2012

Component Coloring of Proper Interval Graphs and Split Graphs
CoRR, 2012

2011
A sufficient condition for the existence of an anti-directed 2-factor in a directed graph.
Discrete Mathematics, 2011

On joint triangulations of two sets of points in the plane
CoRR, 2011

2010
Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials.
Journal of Machine Learning Research, 2010

Cycles of even lengths modulo k.
Journal of Graph Theory, 2010

2009
Disjoint cycles with chords in graphs.
Journal of Graph Theory, 2009

Non-separating trees in connected graphs.
Discrete Mathematics, 2009

Generalized Collective Inference with Symmetric Clique Potentials
CoRR, 2009

2008
Degree Condition for Subdivisions of Unicyclic Graphs.
Graphs and Combinatorics, 2008

Subdivisions of graphs: A generalization of paths and cycles.
Discrete Mathematics, 2008

Circumference, Chromatic Number and Online Coloring
CoRR, 2008

2007
Efficient inference with cardinality-based clique potentials.
Proceedings of the Machine Learning, 2007

2006
Reducing Order Enforcement Cost in Complex Query Plans
CoRR, 2006

Scheduling and Caching in MultiQuery Optimization.
Proceedings of the 13th International Conference on Management of Data, 2006

2005
Oriented Forests in Directed Graphs.
Electronic Notes in Discrete Mathematics, 2005

Degree conditions for forests in graphs.
Discrete Mathematics, 2005

2003
Triangle-factors in powers of graphs.
Electronic Notes in Discrete Mathematics, 2003

2002
Disconnected 2-Factors in Planar Cubic Bridgeless Graphs.
J. Comb. Theory, Ser. B, 2002

Plane triangulations are 6-partitionable.
Discrete Mathematics, 2002

2000
Decomposing graphs with girth at least five under degree constraints.
Journal of Graph Theory, 2000

1996
Clustering Techniques for Minimizing External Path Length.
Proceedings of the VLDB'96, 1996

1995
A Condition for the Three Colourability of Planar Locally Path Graphs.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995


  Loading...