default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikhail E. Muzychuk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Mikhail E. Muzychuk, Grigory Ryabov:
Constructing linked systems of relative difference sets via Schur rings. Des. Codes Cryptogr. 92(9): 2615-2637 (2024)- [j34]Mikhail E. Muzychuk:
On balanced automorphisms of abelian groups. Eur. J. Comb. 117: 103823 (2024) - 2023
- [j33]István Kovács, Mikhail E. Muzychuk, Péter P. Pálfy, Grigory Ryabov
, Gábor Somlai:
CI-property of Cp2×Cn and Cp2×Cq2 for digraphs. J. Comb. Theory A 196: 105738 (2023) - 2022
- [j32]Ted Dobson, Mikhail E. Muzychuk, Pablo Spiga:
Generalized dihedral CI-groups. Ars Math. Contemp. 22(2): 2 (2022) - 2021
- [j31]Mikhail E. Muzychuk:
A classification of one-dimensional affine rank three graphs. Discret. Math. 344(7): 112400 (2021) - 2020
- [j30]Mikhail E. Muzychuk, Ilia Ponomarenko:
Testing isomorphism of circulant objects in polynomial time. J. Comb. Theory A 169 (2020)
2010 – 2019
- 2019
- [j29]Hiroki Koike, István Kovács, Dragan Marusic, Mikhail E. Muzychuk:
Cyclic groups are CI-groups for balanced configurations. Des. Codes Cryptogr. 87(6): 1227-1235 (2019) - 2018
- [j28]Mikhail E. Muzychuk, Gábor Somlai:
The Cayley Isomorphism Property for Cayley Maps. Electron. J. Comb. 25(1): 1 (2018) - [i1]Mikhail E. Muzychuk, Ilia N. Ponomarenko:
Testing isomorphism of circulant objects in polynomial time. CoRR abs/1812.06246 (2018) - 2014
- [j27]Dima Grigoriev, Mikhail E. Muzychuk, Ilia N. Ponomarenko:
Tensor Rank: Matching Polynomials and Schur Rings. Found. Comput. Math. 14(3): 457-481 (2014) - 2013
- [j26]Edwin R. van Dam, William J. Martin, Mikhail E. Muzychuk:
Uniformity in association schemes and coherent configurations: Cometric Q-antipodal schemes and linked systems. J. Comb. Theory A 120(7): 1401-1439 (2013) - 2012
- [j25]Mikhail E. Muzychuk, Ilia N. Ponomarenko:
On pseudocyclic association schemes. Ars Math. Contemp. 5(1): 1-25 (2012) - 2010
- [j24]Edwin R. van Dam, Mikhail E. Muzychuk:
Some implications on amorphic association schemes. J. Comb. Theory A 117(2): 111-127 (2010)
2000 – 2009
- 2009
- [j23]Mikhail E. Muzychuk:
A wedge product of association schemes. Eur. J. Comb. 30(3): 705-715 (2009) - [j22]Mikhail E. Muzychuk, Ilia N. Ponomarenko:
Schur rings. Eur. J. Comb. 30(6): 1526-1539 (2009) - [e1]Mikhail H. Klin, Gareth A. Jones, Aleksandar Jurisic, Mikhail E. Muzychuk, Ilia Ponomarenko:
Algorithmic Algebraic Combinatorics and Gröbner Bases. Springer 2009, ISBN 978-3-642-01959-3 [contents] - 2008
- [j21]Mikhail E. Muzychuk, Paul-Hermann Zieschang:
On association schemes all elements of which have valency 1 or 2. Discret. Math. 308(14): 3097-3103 (2008) - [j20]Mikhail E. Muzychuk:
On balanced Cayley maps over abelian groups. Electron. Notes Discret. Math. 31: 115-118 (2008) - 2007
- [j19]Mikhail H. Klin, Mikhail E. Muzychuk, Christian Pech, Andrew J. Woldar, Paul-Hermann Zieschang:
Association schemes on 28 points as mergings of a half-homogeneous coherent configuration. Eur. J. Comb. 28(7): 1994-2025 (2007) - 2005
- [j18]Mikhail E. Muzychuk, István Kovács:
A Solution of a Problem of A. E. Brouwer. Des. Codes Cryptogr. 34(2-3): 249-264 (2005) - [j17]Yefim I. Leifman, Mikhail E. Muzychuk:
Strongly regular Cayley graphs over the group Zpn sumset Zpn. Discret. Math. 305(1-3): 219-239 (2005) - 2003
- [j16]Mikhail E. Muzychuk:
An Elementary Abelian Group of Large rank is not a CI-group. Discret. Math. 264(1-3): 167-186 (2003) - 2002
- [j15]Mitsugu Hirasaka, Mikhail E. Muzychuk:
Association schemes generated by a non-symmetric relation of valency 2. Discret. Math. 244(1-3): 109-135 (2002) - [j14]Frank Fiedler, Mikhail H. Klin, Mikhail E. Muzychuk:
Small vertex-transitive directed strongly regular graphs. Discret. Math. 255(1-3): 87-115 (2002) - [j13]Mitsugu Hirasaka, Mikhail E. Muzychuk:
On Quasi-thin Association Schemes. J. Comb. Theory A 98(1): 17-32 (2002) - 2001
- [j12]Mikhail E. Muzychuk:
On normal quotients of transitive graphs. Ars Comb. 59 (2001) - [j11]Mikhail E. Muzychuk, Gottfried Tinhofer:
Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes. Electron. J. Comb. 8(1) (2001) - [j10]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)
1990 – 1999
- 1999
- [j9]Mikhail E. Muzychuk:
On the isomorphism problem for cyclic combinatorial objects. Discret. Math. 197-198: 589-606 (1999) - [c1]Mikhail E. Muzychuk, Mikhail H. Klin, Reinhard Pöschel:
The isomorphism problem for circulant graphs via Schur ring theory. Codes and Association Schemes 1999: 241-264 - 1998
- [j8]Mikhail E. Muzychuk, Gottfried Tinhofer:
Recognizing Circulant Graphs of Prime Order in Polynomial Time. Electron. J. Comb. 5 (1998) - [j7]Mikhail E. Muzychuk, Mikhail H. Klin:
On graphs with three eigenvalues. Discret. Math. 189(1-3): 191-207 (1998) - 1997
- [j6]Mikhail E. Muzychuk:
On Ádám's conjecture for circulant graphs. Discret. Math. 167-168: 497-510 (1997) - [j5]Mikhail E. Muzychuk:
On Ádám's conjecture for circulant graphs. Discret. Math. 176(1-3): 285-298 (1997) - 1996
- [j4]Mikhail E. Muzychuk, Mikhail H. Klin, Nikolai S. Zefirov:
on the Mathematical Model of Triangulanes. Discret. Appl. Math. 67(1-3): 175-187 (1996) - 1995
- [j3]Mikhail E. Muzychuk:
Ádám's Conjecture is True in the Square-Free Case. J. Comb. Theory A 72(1): 118-134 (1995) - 1993
- [j2]Mikhail E. Muzychuk:
The Structure of Rational Schur Rings over Cyclic Groups. Eur. J. Comb. 14(5): 479-490 (1993) - 1992
- [j1]Mikhail E. Muzychuk:
Subschemes of the Johnson scheme. Eur. J. Comb. 13(3): 187-193 (1992)
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-08-20 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:
