default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMitsugu Hirasaka
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j20]Alexander L. Gavrilyuk
, Mitsugu Hirasaka, Vladislav V. Kabanov:
A Note on Moore Cayley Digraphs. Graphs Comb. 37(5): 1509-1520 (2021)- 2020
- [j19]Wasim Abbas, Mitsugu Hirasaka:
Association schemes with a certain type of p-subschemes. Ars Math. Contemp. 19(1): 51-60 (2020)
2010 – 2019
- 2017
- [j18]Reza Sharafdini, Mitsugu Hirasaka:
Coherent configurations over copies of association schemes of prime order. Ars Math. Contemp. 12(1): 111-126 (2017) - [j17]Mitsugu Hirasaka, Kijung Kim, Semin Oh:
Association schemes all of whose symmetric fusion schemes are integral. Ars Math. Contemp. 13(2): 331-341 (2017) - 2016
- [j16]Mitsugu Hirasaka, Kijung Kim, Hyonju Yu:
Isomorphism classes of association schemes induced by Hadamard matrices. Eur. J. Comb. 51: 37-46 (2016) - 2015
- [j15]Mitsugu Hirasaka, Kyoung-Tark Kim, Yoshihiro Mizoguchi:
Uniqueness of Butson Hadamard matrices of small degrees. J. Discrete Algorithms 34: 70-77 (2015) - 2011
- [j14]Mitsugu Hirasaka, Kyoung-Tark Kim:
On p-covalenced association schemes. J. Comb. Theory A 118(1): 1-8 (2011)
2000 – 2009
- 2009
- [j13]Mitsugu Hirasaka:
On imprimitive multiplicity-free permutation groups the degree of which is the product of two distinct primes. Eur. J. Comb. 30(1): 30-38 (2009) - 2008
- [j12]Sejeong Bang, Hyun Kwang Kim, Jack H. Koolen, Mitsugu Hirasaka, Sung Yell Song:
Preface. Discret. Math. 308(14): 2925 (2008) - [j11]Mitsugu Hirasaka:
Nilpotent closed subsets of association schemes. Eur. J. Comb. 29(2): 418-422 (2008) - [j10]Mitsugu Hirasaka, Hanguk Kang, Kijung Kim:
Equitable Partitions of Flat Association Schemes. Graphs Comb. 24(2): 81-89 (2008) - 2006
- [j9]Mitsugu Hirasaka, Hanguk Kang, Kijung Kim:
Characterization of association schemes by equitable partitions. Eur. J. Comb. 27(2): 139-152 (2006) - [j8]Mitsugu Hirasaka:
Upper bounds given by equitable partitions of a primitive association scheme. Eur. J. Comb. 27(6): 841-849 (2006) - 2005
- [j7]Mitsugu Hirasaka:
On Meta-Thin Association Schemes. Des. Codes Cryptogr. 34(2-3): 187-201 (2005) - [j6]Sejeong Bang, Mitsugu Hirasaka:
Construction of association schemes from difference sets. Eur. J. Comb. 26(1): 59-74 (2005) - 2003
- [j5]Mitsugu Hirasaka, Paul-Hermann Zieschang:
Sufficient conditions for a scheme to originate from a group. J. Comb. Theory A 104(1): 17-27 (2003) - 2002
- [j4]Mitsugu Hirasaka, Mikhail E. Muzychuk:
Association schemes generated by a non-symmetric relation of valency 2. Discret. Math. 244(1-3): 109-135 (2002) - [j3]Mitsugu Hirasaka, Mikhail E. Muzychuk:
On Quasi-thin Association Schemes. J. Comb. Theory A 98(1): 17-32 (2002) - 2001
- [j2]Mitsugu Hirasaka, Mikhail E. Muzychuk:
An Elementary Abelian Group of Rank 4 Is a CI-Group. J. Comb. Theory A 94(2): 339-362 (2001) - 2000
- [j1]Mitsugu Hirasaka:
Primitive Commutative Association Schemes with a Non-symmetric Relation of Valency 3. J. Comb. Theory A 90(1): 27-48 (2000)
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:31 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:
