default search action
Dinesh G. Sarvate
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j39]Dinesh G. Sarvate, Pramod N. Shinde:
Missing blocks of two designs in Hanani's paper. Bull. ICA 94: 73-78 (2022)
2010 – 2019
- 2018
- [j38]Shahab Faruqi, S. A. Katre, Dinesh G. Sarvate:
Decompositions Of λKv Into Multigraphs With Four Vertices And Five Edges. Ars Comb. 136: 287-316 (2018) - [j37]Dinesh G. Sarvate, Mary Nanfuka:
Group divisible designs with block size 4 and number of groups 2 or 3. Ars Comb. 141: 229-241 (2018) - [j36]Dinesh G. Sarvate, Wilbroad Bezire:
3-GDDs with block size 4. Bull. ICA 82: 56-71 (2018) - [j35]Dinesh G. Sarvate, William Cowden:
A simple construction of 3-GDDs with block size 4 using SQS(v). Bull. ICA 84: 40-44 (2018) - 2017
- [j34]Dinesh G. Sarvate, Li Zhang:
Decompositions of λKn into LOE and OLE Graphs. Ars Comb. 133: 93-105 (2017) - 2016
- [j33]Dinesh G. Sarvate, Li Zhang:
Group divisible designs of three groups and block size five with configuration (1, 2, 2). Australas. J Comb. 66: 333-343 (2016) - [j32]Spencer P. Hurd, Dinesh G. Sarvate:
Graph Decompositions of K(v, λ) into Modified Triangles Using Langford and Skolem Sequences. Ars Comb. 129: 403-416 (2016) - [j31]Issa Ndungo
, Dinesh G. Sarvate:
GDD(n, 2, 4; λ1, λ2) with equal number of even and odd blocks. Discret. Math. 339(4): 1344-1354 (2016) - 2015
- [j30]Dinesh G. Sarvate, Li Zhang:
Decomposition of a 2K10t into H3 Graphs. Ars Comb. 121: 315-319 (2015) - 2013
- [j29]Dinesh G. Sarvate, Li Zhang:
Decomposition of a 3K8t into H2 Graphs. Ars Comb. 110: 23-32 (2013) - 2011
- [j28]Hau Chan, Dinesh G. Sarvate:
On 1-Sarvate-Beam designs. Discret. Math. 311(10-11): 856-865 (2011) - [j27]Spencer P. Hurd, Dinesh G. Sarvate:
Group divisible designs with three unequal groups and larger first index. Discret. Math. 311(16): 1851-1859 (2011) - 2010
- [j26]Hau Chan, Dinesh G. Sarvate:
A non-existence result and large sets for Sarvate-Beam designs. Ars Comb. 95 (2010)
2000 – 2009
- 2008
- [j25]Spencer P. Hurd, Dinesh G. Sarvate:
On c-Bhaskar Rao Designs and tight embeddings for path designs. Discret. Math. 308(13): 2659-2662 (2008) - [j24]Spencer P. Hurd, Dinesh G. Sarvate:
Group divisible designs with block size four and two groups. Discret. Math. 308(13): 2663-2673 (2008) - 2007
- [j23]Spencer P. Hurd, Nutan Mishra, Dinesh G. Sarvate:
A New Construction For Group Divisible Designs With Block Size Five and Few Groups. Ars Comb. 84 (2007) - [j22]Devin Henson, Dinesh G. Sarvate, Spencer P. Hurd:
Group divisible designs with three groups and block size four. Discret. Math. 307(14): 1693-1706 (2007) - 2006
- [j21]Devin Henson, Dinesh G. Sarvate:
A Family of Group Divisible Designs of Block Size Four and Three Groups With l1=2 and l2=1 Using MOLS. Ars Comb. 78 (2006) - 2004
- [j20]Malcolm Greig, Spencer P. Hurd, Dinesh G. Sarvate:
General constructions of c-Bhaskar Rao designs and the (c, lambda) spectrum of a c-BRD(v, k, lambda). Discret. Math. 274(1-3): 77-92 (2004) - [j19]Spencer P. Hurd, Dinesh G. Sarvate:
Odd and even group divisible designs with two groups and block size four. Discret. Math. 284(1-3): 189-196 (2004) - 2003
- [j18]Spencer P. Hurd, Dinesh G. Sarvate:
Embeddings and faithful enclosings of GDDs with a constant number of groups. Australas. J Comb. 27: 213-222 (2003) - [j17]Spencer P. Hurd, Patrick Munson, Dinesh G. Sarvate:
Minimal Enclosings of Triple Systems I: Adding One Point. Ars Comb. 68 (2003) - [j16]Spencer P. Hurd, Dinesh G. Sarvate:
Minimal Enclosings of Triple Systems II: Increasing The Index By 1. Ars Comb. 68 (2003) - [j15]Spencer P. Hurd, Dinesh G. Sarvate:
An application of partition of indices to enclosings of triple systems. Discret. Math. 261(1-3): 337-346 (2003) - 2002
- [j14]Spencer P. Hurd, Dinesh G. Sarvate:
Correction to "All c-Bhaskar Rao designs with block size 3 and c >= -1 exist". Ars Comb. 62 (2002) - [j13]Spencer P. Hurd, Dinesh G. Sarvate:
On c-Hadamard matrices. Ars Comb. 63 (2002) - 2001
- [j12]Spencer P. Hurd, Dinesh G. Sarvate:
All c-Bhaskar Rao Designs With Block Size 3 and c >= -1 Exist. Ars Comb. 59 (2001)
1990 – 1999
- 1999
- [j11]L. F. Fitina, Jennifer Seberry, Dinesh G. Sarvate:
On F-squares and their critical sets. Australas. J Comb. 19: 209-230 (1999) - [j10]Hung-Lin Fu, Christopher A. Rodger, Dinesh G. Sarvate:
The existence of group divisible designs with first and second associates, having block size 3. Ars Comb. 54 (1999) - 1998
- [j9]Margaret Ann Francel, Dinesh G. Sarvate:
One and Two-Block Configurations in Balanced Ternary Designs. Ars Comb. 49 (1998) - 1996
- [j8]Margaret Ann Francel, Dinesh G. Sarvate:
Ternary designs with the maximum or near maximum number of replication numbers. Australas. J Comb. 13: 283-294 (1996) - 1995
- [j7]Dinesh G. Sarvate:
Note on parameters of balanced ternary designs. Australas. J Comb. 11: 177-180 (1995) - [j6]Thomas Kunkle, Dinesh G. Sarvate:
On ternary designs with a specified number of blocks with repeated elements. Ars Comb. 40 (1995) - 1993
- [j5]R. C. Hamm, Dinesh G. Sarvate:
On row-column directed block designs. Australas. J Comb. 8: 123-126 (1993) - 1992
- [j4]Joseph Hammer, Dinesh G. Sarvate:
Generalizations of results of Stanton on BIBDs. Discret. Math. 102(2): 149-154 (1992) - 1991
- [j3]Dinesh G. Sarvate:
Bhaskar Rao ternary designs and applications. Australas. J Comb. 3: 165-190 (1991) - [j2]Dinesh G. Sarvate, R. C. Hamm:
Row-column directed block designs. Discret. Math. 92(1-3): 321-328 (1991)
1980 – 1989
- 1987
- [j1]Joseph Hammer, Dinesh G. Sarvate:
Encryption using Hungarian rings. Discret. Appl. Math. 16(2): 151-155 (1987)
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-04-24 23:08 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: