D
Deepak Rajendraprasad
Researcher at Indian Institutes of Technology
Publications - 72
Citations - 566
Deepak Rajendraprasad is an academic researcher from Indian Institutes of Technology. The author has contributed to research in topics: Chordal graph & Dimension (graph theory). The author has an hindex of 13, co-authored 67 publications receiving 513 citations. Previous affiliations of Deepak Rajendraprasad include University of Haifa & Indian Institute of Science.
Papers
More filters
Book ChapterDOI
An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter
TL;DR: By extending the method used for diameter $d$ graphs, along with an asymmetric extension of a technique used by Chvatal and Thomassen, the upper bound on the maximum oriented diameter of the family of $2-edge connected graphs of diameter d is improved to $21.
Posted Content
Boxicity and separation dimension
Manu Basavaraju,L. Sunil Chandran,Martin Charles Golumbic,Rogers Mathew,Deepak Rajendraprasad +4 more
TL;DR: It is shown that the separation dimension of a hypergraph H is equal to the 'boxicity' of the line graph of H, and this connection helps in borrowing results and techniques from the extensive literature on boxicity to study the concept of separation dimension.
Journal ArticleDOI
Edge-intersection graphs of boundary-generated paths in a grid
TL;DR: It is shown that ∂ EPG graphs can be covered by two collections of vertex-disjoint co-bipartite chain graphs and also an almost tight upper bound on the equivalence covering number of general ∂EPG graphs.
Book ChapterDOI
Induced Separation Dimension
TL;DR: This article begins a study of a new dimensional parameter, the induced separation dimension of graphs which can be embedded on a line so that every pair of strongly independent edges are disjoint line segments, and gives characterizations for chordal graphs in this class.
Posted Content
Characterization and a 2D Visualization of B$_0$-VPG Cocomparability Graphs
TL;DR: This work characterizes B$_0$-VPG cocomparability graphs and develops a drawing algorithm for the class that can distinguish comparable pairs from incomparable ones and identify which among a comparable pair is larger in $P$ from this visualization.