default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander D. Mednykh
Person information
- affiliation: Novosibirsk State University, Sobolev Institute of Mathematics, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j18]István Estélyi, Ján Karabás
, Alexander D. Mednykh, Roman Nedela:
The Jacobian of a graph and graph automorphisms. Discret. Math. 348(2): 114259 (2025)- 2023
- [j17]Rhys J. Evans, Sergey Goryainov, Elena V. Konstantinova, Alexander D. Mednykh:
A general construction of strictly Neumaier graphs and a related switching. Discret. Math. 346(7): 113384 (2023) - 2022
- [j16]Alexander D. Mednykh, Ilya A. Mednykh:
Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics. Ars Math. Contemp. 23(1) (2022) - 2021
- [j15]István Estélyi, Ján Karabás, Roman Nedela, Alexander D. Mednykh:
On a representation of the automorphism group of a graph in a unimodular group. Discret. Math. 344(12): 112606 (2021) - 2019
- [j14]Alexander D. Mednykh, Ilya A. Mednykh:
The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic. Discret. Math. 342(6): 1772-1781 (2019) - 2016
- [j13]Alexander D. Mednykh, Ilya A. Mednykh:
On gamma-hyperellipticity of graphs. Ars Math. Contemp. 10(1): 183-192 (2016) - [j12]Alexander D. Mednykh, Ilya A. Mednykh:
Isospectral genus two graphs are isomorphic. Ars Math. Contemp. 10(2): 223-235 (2016) - 2015
- [j11]Alexander D. Mednykh, Ilya A. Mednykh:
On Wiman's theorem for graphs. Discret. Math. 338(10): 1793-1800 (2015) - 2012
- [j10]Timothy R. S. Walsh, Alain Giorgetti, Alexander D. Mednykh:
Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices. Discret. Math. 312(17): 2660-2671 (2012) - 2011
- [j9]Alexander D. Mednykh, Alain Giorgetti:
Enumeration of genus-four maps by number of edges. Ars Math. Contemp. 4(2): 351-361 (2011) - 2010
- [j8]Alexander D. Mednykh, Roman Nedela:
Enumeration of unrooted hypermaps of a given genus. Discret. Math. 310(3): 518-526 (2010) - [j7]Antonio Breda d'Azevedo, Alexander D. Mednykh, Roman Nedela:
Enumeration of maps regardless of genus: Geometric approach. Discret. Math. 310(6-7): 1184-1203 (2010) - 2009
- [j6]Valery A. Liskovets, Alexander D. Mednykh:
On the number of connected and disconnected coverings over a manifold. Ars Math. Contemp. 2(2): 181-189 (2009) - 2007
- [j5]Alexander D. Mednykh, Roman Nedela:
Enumeration of unrooted hypermaps. Electron. Notes Discret. Math. 28: 207-214 (2007) - 2006
- [j4]Alexander D. Mednykh, Roman Nedela:
Enumeration of unrooted maps of a given genus. J. Comb. Theory B 96(5): 706-729 (2006) - 2005
- [j3]Jin Ho Kwak, Alexander D. Mednykh, Valery A. Liskovets:
Enumeration of Branched Coverings of Nonorientable Surfaces With Cyclic Branch Points. SIAM J. Discret. Math. 19(2): 388-398 (2005) - 2004
- [j2]Jin Ho Kwak, Alexander D. Mednykh:
Enumerating branched coverings over surfaces with boundaries. Eur. J. Comb. 25(1): 23-34 (2004) - 2003
- [j1]Jin Ho Kwak, Jaeun Lee, Alexander D. Mednykh:
Enumerating Branched Surface Coverings from Unbranched Ones. LMS J. Comput. Math. 6: 89-104 (2003)
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-09-22 00:39 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:
