Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikhail H. Klin
Person information
- affiliation: Matej Bel University, Banska Bystrica, Slovakia
- affiliation: Ben Gurion University of the Negev, Department of Mathematics, Beer-Sheva, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
[j18]Stefan Gyürki, Mikhail H. Klin:
Some new non-Schurian association schemes on 2p2 points, p an odd prime, and related combinatorial structures. Australas. J Comb. 67: 394-437 (2017)- [j17]Mikhail H. Klin, Matan Ziv-Av:
A non-Schurian coherent configuration on 14 points exists. Des. Codes Cryptogr. 84(1-2): 203-221 (2017) - 2012
- [j16]Mikhail H. Klin, István Kovács:
Automorphism Groups of Rational Circulant Graphs. Electron. J. Comb. 19(1): 35 (2012) - [j15]Mikhail H. Klin, Josef Lauri, Matan Ziv-Av
:
Links between two semisymmetric graphs on 112 vertices via association schemes. J. Symb. Comput. 47(10): 1175-1191 (2012) - 2011
- [j14]Mikhail H. Klin, Christian Pech:
A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices. Ars Math. Contemp. 4(2): 205-243 (2011) - 2010
- [j13]Mikhail H. Klin, Christian Pech, Sven Reichard, Andrew J. Woldar, Matan Ziv-Av:
Examples of computer experimentation in algebraic combinatorics. Ars Math. Contemp. 3(2): 237-258 (2010) - 2007
- [j12]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
- [j11]Aiso Heinze, Mikhail H. Klin:
Links between Latin squares, nets, graphs and groups: Work inspired by a paper of A. Barlotti and K. Strambach. Electron. Notes Discret. Math. 23: 13-21 (2005) - 2004
- [j10]Norman L. Biggs, Mikhail H. Klin, P. Reinfeld:
Algebraic methods for chromatic polynomials. Eur. J. Comb. 25(2): 147-160 (2004) - 2003
- [j9]Leif K. Jørgensen, Mikhail H. Klin:
Switching of Edges in Strongly Regular Graphs I: A Family of Partial Difference Sets on 100 Vertices. Electron. J. Comb. 10 (2003) - [j8]Andries E. Brouwer, Jack H. Koolen, Mikhail H. Klin:
A Root Graph that is Locally the Line Graph of the Peterson Graph. Discret. Math. 264(1-3): 13-24 (2003) - 2002
- [j7]Frank Fiedler, Mikhail H. Klin, Mikhail E. Muzychuk:
Small vertex-transitive directed strongly regular graphs. Discret. Math. 255(1-3): 87-115 (2002) - [j6]Gareth A. Jones, Mikhail H. Klin, Yossi Moshe:
Primitivity of Permutation Groups, Coherent Algebras and Matrices. J. Comb. Theory A 98(1): 210-217 (2002) - 1999
- [j5]Anton Betten, Mikhail H. Klin, Reinhard Laue, Alfred Wassermann:
Graphical t-designs via polynomial Kramer-Mesner matrices. Discret. Math. 197-198: 83-109 (1999) - 1998
- [j4]Mikhail E. Muzychuk, Mikhail H. Klin:
On graphs with three eigenvalues. Discret. Math. 189(1-3): 191-207 (1998) - 1996
- [j3]Mikhail E. Muzychuk, Mikhail H. Klin, Nikolai S. Zefirov:
on the Mathematical Model of Triangulanes. Discret. Appl. Math. 67(1-3): 175-187 (1996) - 1990
- [j2]I. A. Faradzev, Alexandre A. Ivanov, Mikhail H. Klin:
Galois correspondence between permutation groups and cellular rings (association schemes). Graphs Comb. 6(4): 303-332 (1990) - 1989
- [j1]Andries E. Brouwer, A. V. Ivanov, Mikhail H. Klin:
Some new strongly regular graphs . Comb. 9(4): 339-344 (1989)
Conference and Workshop Papers
- 2014
- [c5]Stefan Gyürki, Mikhail H. Klin:
Sporadic Examples of Directed Strongly Regular Graphs Obtained By Computer Algebra Experimentation. CASC 2014: 155-170 - 2013
- [c4]Mikhail H. Klin, Matan Ziv-Av:
Enumeration of Schur Rings over the Group A 5. CASC 2013: 219-230 - [c3]Matan Ziv-Av, Mikhail H. Klin:
Computer algebra investigation of known primitive triangle-free strongly regular graphs. SCSS 2013: 108-123 - 1999
- [c2]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 - 1991
- [c1]I. A. Faradzev, Mikhail H. Klin:
For Computations with Coherent Configurations. ISSAC 1991: 219-223
Parts in Books or Collections
- 2009
- [p2]Aiso Heinze, Mikhail H. Klin:
Loops, Latin Squares and Strongly Regular Graphs: An Algorithmic Approach via Algebraic Combinatorics. Algorithmic Algebraic Combinatorics and Gröbner Bases 2009: 3-65 - [p1]Mikhail H. Klin, Sven Reichard, Andrew J. Woldar:
Siamese Combinatorial Objects via Computer Algebra Experimentation. Algorithmic Algebraic Combinatorics and Gröbner Bases 2009: 67-112
Editorship
- 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]
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:
