Deepak Rajendraprasad

Orcid: 0000-0001-9101-8967

According to our database1, Deepak Rajendraprasad authored at least 45 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
New bounds on the anti-Ramsey numbers of star graphs via maximum edge <i>q</i>-coloring.
Discret. Math., April, 2024

Disjoint total dominating sets in near-triangulations.
J. Graph Theory, January, 2024

Packing arc-disjoint cycles in oriented graphs.
J. Comput. Syst. Sci., 2024

Maximal Independent Sets in Planar Triangulations.
CoRR, 2024

Arborescences and Shortest Path Trees when Colors Matter.
CoRR, 2024

Face-hitting Dominating Sets in Planar Graphs.
CoRR, 2024

2023
Improved bounds for the oriented radius of mixed multigraphs.
J. Graph Theory, August, 2023

B0-VPG Representation of AT-free Outerplanar Graphs.
J. Graph Algorithms Appl., 2023

2022
Characterization of B0-VPG Cocomparability Graphs and a 2D Visualization of their Posets.
Order, October, 2022

Oriented diameter of star graphs.
Discret. Appl. Math., 2022

On graphs whose eternal vertex cover number and vertex cover number coincide.
Discret. Appl. Math., 2022

Packing Arc-Disjoint 4-Cycles in Oriented Graphs.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

B<sub>0</sub>-VPG Representation of AT-free Outerplanar Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021
Dimension of CPT Posets.
Order, 2021

Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes.
J. Comb. Theory B, 2021

New bounds on the Ramsey number r(Im, Ln).
Discret. Math., 2021

An improvement to Chvátal and Thomassen's upper bound for oriented diameter.
Discret. Appl. Math., 2021

On Coupon Coloring of Cartesian Product of Some Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020
A Note on Arc-Disjoint Cycles in Bipartite Tournaments.
CoRR, 2020

Characterization and a 2D Visualization of B<sub>0</sub>-VPG Cocomparability Graphs.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019
Testing for forbidden order patterns in an array.
Random Struct. Algorithms, 2019

On Graphs with Minimal Eternal Vertex Cover Number.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018
Edge-intersection graphs of boundary-generated paths in a grid.
Discret. Appl. Math., 2018

Approximation bounds on maximum edge 2-coloring of dense graphs.
CoRR, 2018

The Induced Separation Dimension of a Graph.
Algorithmica, 2018

2017
Rainbow colouring of split graphs.
Discret. Appl. Math., 2017

2016
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number.
Discret. Math., 2016

Separation Dimension of Graphs and Hypergraphs.
Algorithmica, 2016

Induced Separation Dimension.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

2015
Separation Dimension of Bounded Degree Graphs.
SIAM J. Discret. Math., 2015

Boxicity and cubicity of product graphs.
Eur. J. Comb., 2015

Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs.
Eur. J. Comb., 2015

Partial List Colouring of Certain Graphs.
Electron. J. Comb., 2015

2014
2-Connecting outerplanar graphs without blowing up the pathwidth.
Theor. Comput. Sci., 2014

Rainbow Connection Number of Graph Power and Graph Products.
Graphs Comb., 2014

Rainbow Connection Number and Radius.
Graphs Comb., 2014

On Additive Combinatorics of Permutations of ℤ<sub>n</sub>.
Discret. Math. Theor. Comput. Sci., 2014

Separation dimension of sparse graphs.
CoRR, 2014

Approximating the Cubicity of Trees.
CoRR, 2014

Boxicity and Separation Dimension.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013
Product Dimension of Forests and Bounded Treewidth Graphs.
Electron. J. Comb., 2013

Inapproximability of Rainbow Colouring.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
Rainbow connection number and connected dominating sets.
J. Graph Theory, 2012

Rainbow Connection Number and Connectivity.
Electron. J. Comb., 2012

Rainbow Colouring of Split and Threshold Graphs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012


  Loading...