default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanpei Kageyama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j27]Kazuki Matsubara, Sanpei Kageyama:
Pairwise additive 1-rotational BIB designs with λ=1. Australas. J Comb. 68: 202-217 (2017)- [j26]Kazuki Matsubara, Masanori Sawa, Sanpei Kageyama:
Existence on Splitting-Balanced Block Designs with Resolvability. Graphs Comb. 33(3): 561-572 (2017)
2000 – 2009
- 2007
- [j25]Rajender Parsad, Sanpei Kageyama, V. K. Gupta:
Use of complementary property of block designs in PBIB designs. Ars Comb. 85 (2007) - 2006
- [j24]Kazuki Matsubara, Masanori Sawa, Daichi Matsumoto, Hiroyuki Kiyama, Sanpei Kageyama:
An addition structure on incidence matrices of a BIB design. Ars Comb. 78 (2006) - [i1]R. N. Mohan, Sanpei Kageyama, Moon Ho Lee, Gao Yang:
Certain new M-matrices and their properties and applications. CoRR abs/cs/0604035 (2006) - 2005
- [j23]Ashish Das, Aloke Dey, Sanpei Kageyama, Kishore Sinha:
A-efficient balanced treatment incomplete block designs. Australas. J Comb. 32: 243-252 (2005) - [j22]Sarita Rudra, Shakti Banerjee, Sanpei Kageyama:
Constructions of 3-resolvable nested 3-designs and 3-wise balanced designs. Australas. J Comb. 33: 77-86 (2005) - [j21]Miho Kimura, Sanpei Kageyama:
Recursive constructions on large sets of some balanced incomplete block designs. Ars Comb. 75 (2005) - 2004
- [j20]Kishore Sinha, Sanpei Kageyama, Ashish Das, G. M. Saha:
Some series of block designs with nested rows and columns. Australas. J Comb. 29: 337- (2004) - 2003
- [j19]Tomoko Adachi, Masakazu Jimbo, Sanpei Kageyama:
Combinatorial structure of group divisible designs without alpha-resolution classes in each group. Discret. Math. 265(1-3): 1-11 (2003) - 2002
- [j18]Mithilesh Kumar Singh, Kishore Sinha, Sanpei Kageyama:
A construction of Hadamard matrices from BIBD (2k2-2k+1, k, 1). Australas. J Comb. 26: 93-98 (2002) - [j17]Ryoh Fuji-Hara, Sanpei Kageyama, Shinya Kuriki, Ying Miao, Shigenobu Shinohara:
Balanced nested designs and balanced arrays. Discret. Math. 259(1-3): 91-119 (2002) - 2001
- [j16]Sanpei Kageyama, Tsutomu Shimata:
A combinatorial structure of affine (a1, ..., at)-resolvable (r, l)-designs. Ars Comb. 58 (2001)
1990 – 1999
- 1999
- [j15]Ying Miao, Sanpei Kageyama:
Two classes of q-ary codes based on group divisible association schemes. Discret. Math. 195(1-3): 269-276 (1999) - 1998
- [j14]Miwako Mishima, Ying Miao, Sanpei Kageyama, Masakazu Jimbo:
Constructions of nested directed BIB designs. Australas. J Comb. 18: 157-172 (1998) - [j13]Kishore Sinha, Byron Jones, Sanpei Kageyama:
A Series of quasi-multiple BIB Designs from Hadamard Matrices. Ars Comb. 50 (1998) - [j12]Sanpei Kageyama, Ying Miao:
A Construction for Resolvable Designs and Its Generalizations. Graphs Comb. 14(1): 11-24 (1998) - 1996
- [j11]Sanpei Kageyama, Ying Miao:
Some constructions of semiframes. Ars Comb. 43 (1996) - [j10]Sanpei Kageyama, Ying Miao:
Some Non-embeddable Quasi-Derived Designs. J. Comb. Theory A 76(2): 295-304 (1996) - [p1]Tadeusz Calinski, Sanpei Kageyama:
22 Block designs: Their combinatorial and statistical properties. Design and analysis of experiments 1996: 809-873 - 1995
- [c1]Kaoru Kurosawa, Sanpei Kageyama:
New Bound for Afine Resolvable Designs and Its Application to Authentication Codes. COCOON 1995: 292-302 - 1993
- [j9]Sanpei Kageyama:
The family of block designs with some combinatorial properties. Discret. Math. 116(1-3): 17-54 (1993) - [j8]Sanpei Kageyama:
Robustness of some balanced block designs. Discret. Math. 116(1-3): 159-181 (1993) - [j7]Sanpei Kageyama:
Experimental design: methods and applications an updated bibliography of books in English. Discret. Math. 116(1-3): 369-403 (1993) - 1991
- [j6]Sanpei Kageyama, Kishore Sinha:
Constructions of partially balanced bipartite block designs. Discret. Math. 92(1-3): 137-144 (1991)
1980 – 1989
- 1986
- [j5]Bhagwandas, Sanpei Kageyama, Rahul Mukerjee:
Symmetry and classification of certain regular group divisible designs. Graphs Comb. 2(1): 15-20 (1986) - 1983
- [j4]Sanpei Kageyama, R. N. Mohan:
On mu-resolvable BIB designs. Discret. Math. 45(1): 113-121 (1983)
1970 – 1979
- 1978
- [j3]Sanpei Kageyama:
Improved inequalities for balanced incomplete block designs. Discret. Math. 21(2): 177-188 (1978) - 1977
- [j2]Sanpei Kageyama:
Classifications of Certain t-Designs. J. Comb. Theory A 22(2): 163-168 (1977) - 1974
- [j1]Sanpei Kageyama:
On the Incomplete Block Designs Derivable from the Association Schemes. J. Comb. Theory A 17(2): 269-272 (1974)
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-06-10 20:30 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:
