default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDeepak Rajendraprasad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]L. Sunil Chandran, Talha Hashim, Dalu Jacob, Rogers Mathew, Deepak Rajendraprasad, Nitin Singh:
New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring. Discret. Math. 347(4): 113894 (2024)- [j29]Jasine Babu, Ajay Saju Jacob, R. Krithika
, Deepak Rajendraprasad:
Packing arc-disjoint cycles in oriented graphs. J. Comput. Syst. Sci. 143: 103530 (2024) - [j28]P. Francis, Abraham M. Illickan, Lijo M. Jose, Deepak Rajendraprasad:
Disjoint total dominating sets in near-triangulations. J. Graph Theory 105(1): 68-77 (2024) - [i24]P. Francis, Abraham M. Illickan, Lijo M. Jose, Deepak Rajendraprasad:
Face-hitting Dominating Sets in Planar Graphs. CoRR abs/2403.02808 (2024) - [i23]P. S. Ardra, Jasine Babu, Kritika Kashyap, R. Krithika, Sreejith K. Pallathumadam, Deepak Rajendraprasad:
Arborescences and Shortest Path Trees when Colors Matter. CoRR abs/2403.06580 (2024) - 2023
- [j27]Sparsh Jain, Sreejith K. Pallathumadam, Deepak Rajendraprasad:
B0-VPG Representation of AT-free Outerplanar Graphs. J. Graph Algorithms Appl. 27(9): 853-869 (2023) - [j26]Jasine Babu, Deepu Benson, Deepak Rajendraprasad:
Improved bounds for the oriented radius of mixed multigraphs. J. Graph Theory 103(4): 674-689 (2023) - 2022
- [j25]Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier:
On graphs whose eternal vertex cover number and vertex cover number coincide. Discret. Appl. Math. 319: 171-182 (2022) - [j24]K. S. Ajish Kumar, Deepak Rajendraprasad, K. S. Sudeep:
Oriented diameter of star graphs. Discret. Appl. Math. 319: 362-371 (2022) - [j23]Sreejith K. Pallathumadam, Deepak Rajendraprasad:
Characterization of B0-VPG Cocomparability Graphs and a 2D Visualization of their Posets. Order 39(3): 465-484 (2022) - [c13]Sparsh Jain, Sreejith K. Pallathumadam, Deepak Rajendraprasad:
B0-VPG Representation of AT-free Outerplanar Graphs. CALDAM 2022: 103-114 - [c12]Jasine Babu, R. Krithika, Deepak Rajendraprasad:
Packing Arc-Disjoint 4-Cycles in Oriented Graphs. FSTTCS 2022: 5:1-5:16 - [i22]P. Francis, Abraham M. Illickan, Lijo M. Jose, Deepak Rajendraprasad:
Disjoint Total Dominating Sets in Near-Triangulations. CoRR abs/2205.06464 (2022) - [i21]Sparsh Jain, Sreejith K. Pallathumadam, Deepak Rajendraprasad:
B0-VPG Representation of AT-free Outerplanar Graphs. CoRR abs/2209.08269 (2022) - 2021
- [j22]Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka:
An improvement to Chvátal and Thomassen's upper bound for oriented diameter. Discret. Appl. Math. 304: 432-440 (2021) - [j21]Ferdinand Ihringer, Deepak Rajendraprasad, Thilo Weinert:
New bounds on the Ramsey number r(Im, Ln). Discret. Math. 344(3): 112268 (2021) - [j20]Rogers Mathew, Ilan Newman, Yuri Rabinovich, Deepak Rajendraprasad:
Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes. J. Comb. Theory B 150: 119-143 (2021) - [j19]Atrayee Majumder, Rogers Mathew, Deepak Rajendraprasad:
Dimension of CPT Posets. Order 38(1): 13-19 (2021) - [c11]P. Francis, Deepak Rajendraprasad:
On Coupon Coloring of Cartesian Product of Some Graphs. CALDAM 2021: 309-316 - [i20]Jasine Babu, Deepu Benson, Deepak Rajendraprasad:
Improved Bounds for the Oriented Radius of Mixed Multigraphs. CoRR abs/2105.02356 (2021) - 2020
- [c10]K. S. Ajish Kumar, Deepak Rajendraprasad, K. S. Sudeep:
Oriented Diameter of Star Graphs. CALDAM 2020: 307-317 - [c9]Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka:
An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter. CSR 2020: 117-129 - [c8]Sreejith K. Pallathumadam, Deepak Rajendraprasad:
Characterization and a 2D Visualization of B0-VPG Cocomparability Graphs. GD 2020: 191-204 - [i19]Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka:
An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter. CoRR abs/2001.03448 (2020) - [i18]Jasine Babu, Ajay Saju Jacob, R. Krithika, Deepak Rajendraprasad:
A Note on Arc-Disjoint Cycles in Bipartite Tournaments. CoRR abs/2002.06912 (2020) - [i17]Sreejith K. Pallathumadam, Deepak Rajendraprasad:
Characterization and a 2D Visualization of B0-VPG Cocomparability Graphs. CoRR abs/2008.02173 (2020)
2010 – 2019
- 2019
- [j18]Ilan Newman, Yuri Rabinovich, Deepak Rajendraprasad, Christian Sohler:
Testing for forbidden order patterns in an array. Random Struct. Algorithms 55(2): 402-426 (2019) - [c7]Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier:
On Graphs with Minimal Eternal Vertex Cover Number. CALDAM 2019: 263-273 - [i16]K. S. Ajish Kumar, Deepak Rajendraprasad, K. S. Sudeep:
Oriented Diameter of Star Graphs. CoRR abs/1911.10340 (2019) - 2018
- [j17]Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart:
The Induced Separation Dimension of a Graph. Algorithmica 80(10): 2834-2848 (2018) - [j16]Martin Charles Golumbic, Gila Morgenstern, Deepak Rajendraprasad:
Edge-intersection graphs of boundary-generated paths in a grid. Discret. Appl. Math. 236: 214-222 (2018) - [i15]Atrayee Majumder, Rogers Mathew, Deepak Rajendraprasad:
Dimension of CPT posets. CoRR abs/1802.09326 (2018) - [i14]L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Nitin Singh:
Approximation bounds on maximum edge 2-coloring of dense graphs. CoRR abs/1810.00624 (2018) - [i13]Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier:
On Graphs with Minimal Eternal Vertex Cover Number. CoRR abs/1812.05125 (2018) - 2017
- [j15]L. Sunil Chandran, Deepak Rajendraprasad, Marek Tesar:
Rainbow colouring of split graphs. Discret. Appl. Math. 216: 98-113 (2017) - [c6]Ilan Newman, Yuri Rabinovich, Deepak Rajendraprasad, Christian Sohler:
Testing for Forbidden Order Patterns in an Array. SODA 2017: 1582-1597 - 2016
- [j14]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Separation Dimension of Graphs and Hypergraphs. Algorithmica 75(1): 187-204 (2016) - [j13]L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number. Discret. Math. 339(2): 443-446 (2016) - [c5]Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart:
Induced Separation Dimension. WG 2016: 121-132 - 2015
- [j12]Jeannette C. M. Janssen, Rogers Mathew, Deepak Rajendraprasad:
Partial List Colouring of Certain Graphs. Electron. J. Comb. 22(3): 3 (2015) - [j11]L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and cubicity of product graphs. Eur. J. Comb. 48: 100-109 (2015) - [j10]Jasine Babu, L. Sunil Chandran, Deepak Rajendraprasad:
Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs. Eur. J. Comb. 48: 110-126 (2015) - [j9]Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Separation Dimension of Bounded Degree Graphs. SIAM J. Discret. Math. 29(1): 59-64 (2015) - 2014
- [j8]L. Sunil Chandran, Deepak Rajendraprasad, Nitin Singh:
On Additive Combinatorics of Permutations of ℤn. Discret. Math. Theor. Comput. Sci. 16(2): 35-40 (2014) - [j7]Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number and Radius. Graphs Comb. 30(2): 275-285 (2014) - [j6]Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number of Graph Power and Graph Products. Graphs Comb. 30(6): 1363-1382 (2014) - [j5]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad:
2-Connecting outerplanar graphs without blowing up the pathwidth. Theor. Comput. Sci. 554: 119-134 (2014) - [c4]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and Separation Dimension. WG 2014: 81-92 - [i12]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Naveen Sivadasan:
Approximating the Cubicity of Trees. CoRR abs/1402.6310 (2014) - [i11]L. Sunil Chandran, Deepak Rajendraprasad, Marek Tesar:
Rainbow Colouring of Split Graphs. CoRR abs/1404.4478 (2014) - [i10]Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Separation dimension of sparse graphs. CoRR abs/1404.4484 (2014) - [i9]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and separation dimension. CoRR abs/1404.4486 (2014) - [i8]Noga Alon, Manu Basavaraju, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Separation dimension of bounded degree graphs. CoRR abs/1407.5075 (2014) - 2013
- [j4]L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma:
Product Dimension of Forests and Bounded Treewidth Graphs. Electron. J. Comb. 20(3): 42 (2013) - [c3]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad:
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth. COCOON 2013: 626-637 - [c2]L. Sunil Chandran, Deepak Rajendraprasad:
Inapproximability of Rainbow Colouring. FSTTCS 2013: 153-162 - [i7]L. Sunil Chandran, Wilfried Imrich, Rogers Mathew, Deepak Rajendraprasad:
Boxicity and Cubicity of Product Graphs. CoRR abs/1305.5233 (2013) - 2012
- [j3]Xueliang Li, Sujuan Liu, L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Rainbow Connection Number and Connectivity. Electron. J. Comb. 19(1): 20 (2012) - [j2]L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma:
Rainbow connection number and connected dominating sets. J. Graph Theory 71(2): 206-218 (2012) - [c1]L. Sunil Chandran, Deepak Rajendraprasad:
Rainbow Colouring of Split and Threshold Graphs. COCOON 2012: 181-192 - [i6]L. Sunil Chandran, Deepak Rajendraprasad:
Rainbow Colouring of Split and Threshold Graphs. CoRR abs/1205.1670 (2012) - [i5]L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma:
Product Dimension of Forests and Bounded Treewidth Graphs. CoRR abs/1209.2218 (2012) - [i4]Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad:
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth. CoRR abs/1212.6382 (2012) - 2011
- [j1]L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma:
Rainbow Connection Number and Connected Dominating Sets. Electron. Notes Discret. Math. 38: 239-244 (2011) - [i3]Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number of Graph Power and Graph Products. CoRR abs/1104.4190 (2011) - 2010
- [i2]L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma:
Rainbow Connection Number and Connected Dominating Sets. CoRR abs/1010.2296 (2010) - [i1]Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number and Radius. CoRR abs/1011.0620 (2010)
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-10-07 22:10 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:
