Enumerating Branched Surface Coverings from Unbranched Ones. - Jin Ho Kwak; Jaeun Lee; Alexander D. Mednykh (LMS J. Comput. Math., 2003)

Enumerating branched coverings over surfaces with boundaries. - Jin Ho Kwak; Alexander D. Mednykh (Eur. J. Comb., 2004)

Enumeration of Branched Coverings of Nonorientable Surfaces With Cyclic Branch Points. - Jin Ho Kwak; Alexander D. Mednykh; Valery A. Liskovets (SIAM J. Discret. Math., 2005)

Enumeration of unrooted maps of a given genus. - Alexander D. Mednykh; Roman Nedela (J. Comb. Theory B, 2006)

Enumeration of unrooted hypermaps. - Alexander D. Mednykh; Roman Nedela (Electron. Notes Discret. Math., 2007)

On the number of connected and disconnected coverings over a manifold. - Valery A. Liskovets; Alexander D. Mednykh (Ars Math. Contemp., 2009)

Enumeration of unrooted hypermaps of a given genus. - Alexander D. Mednykh; Roman Nedela (Discret. Math., 2010)

Enumeration of maps regardless of genus: Geometric approach. - Antonio Breda d'Azevedo; Alexander D. Mednykh; Roman Nedela (Discret. Math., 2010)

Enumeration of genus-four maps by number of edges. - Alexander D. Mednykh; Alain Giorgetti (Ars Math. Contemp., 2011)

Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices. - Timothy R. S. Walsh; Alain Giorgetti; Alexander D. Mednykh (Discret. Math., 2012)

On Wiman's theorem for graphs. - Alexander D. Mednykh; Ilya A. Mednykh (Discret. Math., 2015)

On gamma-hyperellipticity of graphs. - Alexander D. Mednykh; Ilya A. Mednykh (Ars Math. Contemp., 2016)

Isospectral genus two graphs are isomorphic. - Alexander D. Mednykh; Ilya A. Mednykh (Ars Math. Contemp., 2016)

The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic. - Alexander D. Mednykh; Ilya A. Mednykh (Discret. Math., 2019)

On a representation of the automorphism group of a graph in a unimodular group. - István Estélyi; Ján Karabás; Roman Nedela; Alexander D. Mednykh (Discret. Math., 2021)

Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics. - Alexander D. Mednykh; Ilya A. Mednykh (Ars Math. Contemp., 2022)

A general construction of strictly Neumaier graphs and a related switching. - Rhys J. Evans; Sergey Goryainov; Elena V. Konstantinova; Alexander D. Mednykh (Discret. Math., 2023)

On the structure of Laplacian characteristic polynomial for circulant foliation. - Y. S. Kwon; Alexander D. Mednykh; Ilya A. Mednykh (Discret. Appl. Math., 2025)

The Jacobian of a graph and graph automorphisms. - István Estélyi; Ján Karabás; Alexander D. Mednykh; Roman Nedela (Discret. Math., 2025)

On the complexity of Cayley graphs on a dihedral group. - Bobo Hua; Alexander D. Mednykh; Ilya A. Mednykh; Lili Wang (Discret. Math., 2026)