Ajit A. Diwan

CoRR, 2024

Planar Cycle-Extendable Graphs.

[BibT_eX]

[DOI]

Aditya Y. Dalwadi

Kapil R. Shenvi Pause

Nishad Kothari

CoRR, 2024

Extremal minimal bipartite matching covered graphs.

[BibT_eX]

[DOI]

Amit Kumar Mallik

Nishad Kothari

CoRR, 2024

2022

Subdivisions of maximal 3-degenerate graphs of order d + 1 $d+1$ in graphs of minimum degree d $d$.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Chords of 2-Factors in Planar Cubic Bridgeless Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2022

2021

Explicit Δ-edge-coloring of consecutive levels in a divisor lattice.

[BibT_eX]

[DOI]

Discret. Math., 2021

Another simple reformulation of the four color theorem.

[BibT_eX]

[DOI]

CoRR, 2021

2020

On colouring point visibility graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

The minimum forcing number of perfect matchings in the hypercube.

[BibT_eX]

[DOI]

Discret. Math., 2019

Drawing Bipartite Graphs in Two Layers with Specified Crossings.

[BibT_eX]

[DOI]

Subir Kumar Ghosh

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2017

On the Maximum Rate of Networked Computation in a Capacitated Network.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2017

Two-layer Drawings of Bipartite Graphs.

[BibT_eX]

[DOI]

Subir Kumar Ghosh

Electron. Notes Discret. Math., 2017

P3-decomposition of directed graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two.

[BibT_eX]

[DOI]

Sai Sandeep

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Partitions of planar point sets into polygons.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

The complexity of P4-decomposition of regular graphs and multigraphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2015

Four-Connected Triangulations of Planar Point Sets.

[BibT_eX]

[DOI]

Subir Kumar Ghosh

Discret. Comput. Geom., 2015

Fragmented coloring of proper interval and split graphs.

[BibT_eX]

[DOI]

Soumitra Pal

Abhiram G. Ranade

Discret. Appl. Math., 2015

2013

Circumference, chromatic number and online coloring.

[BibT_eX]

[DOI]

Sreyash Kenkre

Sundar Vishwanathan

Comb., 2013

2012

Which sort orders are interesting?

[BibT_eX]

[DOI]

Ravindra Guravannavar

S. Sudarshan

VLDB J., 2012

Balanced group-labeled graphs.

[BibT_eX]

[DOI]

Manas Joglekar

Nisarg Shah

Discret. Math., 2012

Component Coloring of Proper Interval Graphs and Split Graphs

[BibT_eX]

[DOI]

Soumitra Pal

Abhiram Ranade

CoRR, 2012

2011

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

[BibT_eX]

[DOI]

Discret. Math., 2011

On joint triangulations of two sets of points in the plane

[BibT_eX]

[DOI]

CoRR, 2011

2010

Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials.

[BibT_eX]

[DOI]

Rahul Gupta

Sunita Sarawagi

J. Mach. Learn. Res., 2010

Cycles of even lengths modulo k.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

2009

Disjoint cycles with chords in graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2009

Non-separating trees in connected graphs.

[BibT_eX]

[DOI]

Namrata P. Tholiya

Discret. Math., 2009

Generalized Collective Inference with Symmetric Clique Potentials

[BibT_eX]

[DOI]

Rahul Gupta

Sunita Sarawagi

CoRR, 2009

2008

Pseudo 2-factor isomorphic regular bipartite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Degree Condition for Subdivisions of Unicyclic Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2008

Subdivisions of graphs: A generalization of paths and cycles.

[BibT_eX]

[DOI]

Discret. Math., 2008

2007

Efficient inference with cardinality-based clique potentials.

[BibT_eX]

[DOI]

Rahul Gupta

Sunita Sarawagi

Proceedings of the Machine Learning, 2007

2006

Reducing Order Enforcement Cost in Complex Query Plans

[BibT_eX]

[DOI]

Ravindra Guravannavar

S. Sudarshan

CoRR, 2006

Scheduling and Caching in MultiQuery Optimization.

[BibT_eX]

[DOI]

Dilys Thomas

S. Sudarshan

Proceedings of the 13th International Conference on Management of Data, 2006

2005

Oriented Forests in Directed Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Degree conditions for forests in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2005

2003

Triangle-factors in powers of graphs.

[BibT_eX]

[DOI]

Narendra Agarwal

Electron. Notes Discret. Math., 2003

2002

Disconnected 2-Factors in Planar Cubic Bridgeless Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2002

Plane triangulations are 6-partitionable.

[BibT_eX]

[DOI]

Manish P. Kurhekar

Discret. Math., 2002

2000

Decomposing graphs with girth at least five under degree constraints.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

1996

Clustering Techniques for Minimizing External Path Length.

[BibT_eX]

[DOI]

Proceedings of the VLDB'96, 1996

1995

Upward Numbering Testing for Triconnected Graphs.

[BibT_eX]

[DOI]

M. Chandramouli

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

A Condition for the Three Colourability of Planar Locally Path Graphs.

[BibT_eX]

[DOI]

N. Usharani

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

1993

A heuristic for decomposition in multilevel logic optimization.

[BibT_eX]

[DOI]

Vinaya Kumar Singh

IEEE Trans. Very Large Scale Integr. Syst., 1993

A Heuristic for Decomposition in Multi-Level Logic Optimization.

[BibT_eX]

[DOI]

Vinaya Kumar Singh

Proceedings of the Sixth International Conference on VLSI Design, 1993

1991

A Counterexample for the Sufficiency of Edge Guards in Star Polygons.

[BibT_eX]

[DOI]

R. V. Subramaniyam