Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDRoman Nedela
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j54]Yan-Quan Feng, Kan Hu, Roman Nedela, Martin Skoviera, Na-Er Wang:
Complete regular dessins and skew-morphisms of cyclic groups. Ars Math. Contemp. 18(2): 289-307 (2020)- [i6]Alexander L. Gavrilyuk, Roman Nedela, Ilia Ponomarenko:
The Weisfeiler-Leman dimension of distance-hereditary graphs. CoRR abs/2005.11766 (2020) - [i5]Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, Peter Zeman:
Automorphism groups of maps in linear time. CoRR abs/2008.01616 (2020)
2010 – 2019
- 2019
- [j53]Kan Hu, Roman Nedela, Na-Er Wang
:
Complete regular dessins of odd prime power order. Discret. Math. 342(2): 314-325 (2019) - 2018
- [j52]Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
3-connected reduction for regular graph covers. Eur. J. Comb. 73: 170-210 (2018) - [j51]Roman Nedela, Carl Pomerance:
Density of Singular Pairs of Integers. Integers 18: A82 (2018) - 2017
- [i4]Roman Nedela, Ilia Ponomarenko:
Recognizing and testing isomorphism of Cayley graphs over an abelian group of order $4p$ in polynomial time. CoRR abs/1706.06145 (2017) - 2016
- [j50]Mariusz Meszka, Roman Nedela, Alexander Rosa, Martin Skoviera:
Decompositions of complete graphs into circulants. Discret. Math. 339(10): 2471-2480 (2016) - [j49]Kan Hu, Gareth A. Jones, Roman Nedela, Na-Er Wang:
Non-abelian almost totally branched coverings over the platonic maps. Eur. J. Comb. 51: 1-11 (2016) - [i3]Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
Algorithmic Aspects of Regular Graph Covers. CoRR abs/1609.03013 (2016) - 2015
- [j48]Kan Hu, Roman Nedela, Martin Skoviera, Naer Wang:
Regular embeddings of cycles with multiple edges revisited. Ars Math. Contemp. 8(1): 177-194 (2015) - [j47]Dan Archdeacon, Michal Kotrbcík, Roman Nedela, Martin Skoviera:
Maximum genus, connectivity, and Nebeský's Theorem. Ars Math. Contemp. 9(1): 51-61 (2015) - [j46]Antonio Breda d'Azevedo, Domenico Antonino Catalano, Ján Karabás, Roman Nedela:
Maps of Archimedean class and operations on dessins. Discret. Math. 338(10): 1814-1825 (2015) - [j45]Robert Jajcay, Roman Nedela:
Half-Regular Cayley Maps. Graphs Comb. 31(4): 1003-1018 (2015) - [i2]Pavel Klavík, Roman Nedela:
Automorphism Groups of Planar Graphs. CoRR abs/1506.06488 (2015) - 2014
- [j44]Kan Hu, Roman Nedela, Na-Er Wang:
Branched cyclic regular coverings over platonic maps. Eur. J. Comb. 36: 531-549 (2014) - [c1]Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. ICALP (1) 2014: 489-501 - [i1]Jirí Fiala, Pavel Klavík, Jan Kratochvíl, Roman Nedela:
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs. CoRR abs/1402.3774 (2014) - 2013
- [j43]Shaofei Du, Gareth A. Jones, Jin Ho Kwak, Roman Nedela, Martin Skoviera:
2-Groups that factorise as products of cyclic groups, and regular embeddings of complete bipartite graphs. Ars Math. Contemp. 6(1): 155-170 (2013) - [j42]Ján Karabás, Edita Mácajová, Roman Nedela:
6-decomposition of snarks. Eur. J. Comb. 34(1): 111-122 (2013) - 2012
- [j41]Michael Drmota, Roman Nedela:
Asymptotic enumeration of reversible maps regardless of genus. Ars Math. Contemp. 5(1): 77-97 (2012) - [j40]Aleksander Malnic, Roman Nedela, Martin Skoviera:
Regular maps with nilpotent automorphism groups. Eur. J. Comb. 33(8): 1974-1986 (2012) - [j39]Marston D. E. Conder, Roman Nedela, Jozef Sirán:
Classification of regular maps of Euler characteristic -3p. J. Comb. Theory, Ser. B 102(4): 967-981 (2012) - [j38]Ján Karabás, Roman Nedela:
Archimedean maps of higher genera. Math. Comput. 81(277): 569-583 (2012) - 2011
- [j37]István Kovács, Roman Nedela:
Decomposition of skew-morphisms of cyclic groups. Ars Math. Contemp. 4(2): 329-349 (2011) - [j36]Roman Nedela, Martin Skoviera:
GEMS 2009. Ars Math. Contemp. 4(2) (2011) - 2010
- [j35]Alexander D. Mednykh, Roman Nedela:
Enumeration of unrooted hypermaps of a given genus. Discret. Math. 310(3): 518-526 (2010) - [j34]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) - [j33]Domenico Antonino Catalano, Roman Nedela:
A characterization of regular embeddings of n-dimensional cubes. Discret. Math. 310(17-18): 2364-2371 (2010) - [j32]Shao-Fei Du, Gareth A. Jones, Jin Ho Kwak, Roman Nedela, Martin Skoviera:
Regular embeddings of Kn, n where n is a power of 2. II: The non-metacyclic case. Eur. J. Comb. 31(7): 1946-1956 (2010)
2000 – 2009
- 2008
- [j31]Mariusz Meszka, Roman Nedela, Alexander Rosa:
The chromatic number of 5-valent circulants. Discret. Math. 308(24): 6269-6284 (2008) - [j30]Gareth A. Jones, Roman Nedela, Martin Skoviera:
Complete bipartite graphs with a unique regular embedding. J. Comb. Theory, Ser. B 98(2): 241-248 (2008) - 2007
- [j29]Shao-Fei Du, Jin Ho Kwak, Roman Nedela:
Classification of regular embeddings of hypercubes of odd dimension. Discret. Math. 307(1): 119-124 (2007) - [j28]Young Soo Kwon, Roman Nedela:
Non-existence of nonorientable regular embeddings of n-dimensional cubes. Discret. Math. 307(3-5): 511-516 (2007) - [j27]Ján Karabás, Peter Malicky, Roman Nedela:
Three-manifolds with Heegaard genus at most two represented by crystallisations with at most 42 vertices. Discret. Math. 307(21): 2569-2590 (2007) - [j26]Shao-Fei Du, Gareth A. Jones, Jin Ho Kwak, Roman Nedela, Martin Skoviera:
Regular embeddings of Kn, n where n is a power of 2. I: Metacyclic case. Eur. J. Comb. 28(6): 1595-1609 (2007) - [j25]Gareth A. Jones, Roman Nedela, Martin Skoviera:
Regular embeddings of Kn, n where n is an odd prime power. Eur. J. Comb. 28(6): 1863-1875 (2007) - [j24]Petr Hlinený, Jan Kratochvíl, Roman Nedela, Martin Skoviera:
Preface. Electron. Notes Discret. Math. 28: 1 (2007) - [j23]Alexander D. Mednykh, Roman Nedela:
Enumeration of unrooted hypermaps. Electron. Notes Discret. Math. 28: 207-214 (2007) - [j22]Ján Karabás, Roman Nedela:
Archimedean solids of genus two. Electron. Notes Discret. Math. 28: 331-339 (2007) - [j21]Marston D. E. Conder, Roman Nedela:
Symmetric cubic graphs of small girth. J. Comb. Theory, Ser. B 97(5): 757-768 (2007) - 2006
- [j20]Ana Breda, Antonio Breda d'Azevedo, Roman Nedela:
Chirality group and chirality index of Coxeter chiral maps. Ars Comb. 81 (2006) - [j19]Alexander D. Mednykh, Roman Nedela:
Enumeration of unrooted maps of a given genus. J. Comb. Theory, Ser. B 96(5): 706-729 (2006) - 2005
- [j18]Shao-Fei Du, Jin Ho Kwak, Roman Nedela:
Regular embeddings of complete multipartite graphs. Eur. J. Comb. 26(3-4): 505-519 (2005) - 2004
- [j17]Peter Horák, Roman Nedela, Alexander Rosa:
The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors. Discret. Math. 284(1-3): 181-188 (2004) - [j16]Antonio Breda d'Azevedo, Roman Nedela:
Half-arc-transitive graphs and chiral hypermaps. Eur. J. Comb. 25(3): 423-436 (2004) - 2002
- [j15]Roman Nedela, Martin Skoviera, Andrej Zlatos:
Regular embeddings of complete bipartite graphs. Discret. Math. 258(1-3): 379-381 (2002) - [j14]Aleksander Malnic, Roman Nedela, Martin Skoviera:
Regular Homomorphisms and Regular Map. Eur. J. Comb. 23(4): 449-461 (2002) - 2001
- [j13]Roman Nedela, Martin Skoviera:
Cayley Snarks and Almost Simple Groups. Comb. 21(4): 583-590 (2001) - [j12]Roman Nedela, Martin Skoviera:
Regular Maps on Surfaces with Large Planar Width. Eur. J. Comb. 22(2): 243-262 (2001) - 2000
- [j11]Aleksander Malnic, Roman Nedela, Martin Skoviera:
Lifting Graph Automorphisms by Voltage Assignments. Eur. J. Comb. 21(7): 927-947 (2000) - [j10]Luigi Grasselli, Michele Mulazzani, Roman Nedela:
2-Symmetric Transformations for 3-Manifolds of Genus 2. J. Comb. Theory, Ser. B 79(2): 105-130 (2000)
1990 – 1999
- 1998
- [j9]Alfonz Haviar, Roman Nedela:
On varieties of graphs. Discuss. Math. Graph Theory 18(2): 209-223 (1998) - [j8]Dragan Marusic, Roman Nedela:
Maps and Half-transitive Graphs of Valency 4. Eur. J. Comb. 19(3): 345-354 (1998) - 1997
- [j7]Roman Nedela, Martin Skoviera:
Regular Maps from Voltage Assignments and Exponent Groups. Eur. J. Comb. 18(7): 807-823 (1997) - 1996
- [j6]Roman Nedela, Martin Skoviera:
Regular Embeddings of Canonical Double Coverings of Graphs. J. Comb. Theory, Ser. B 67(2): 249-277 (1996) - [j5]Roman Nedela, Martin Skoviera:
Decompositions and reductions of snarks. J. Graph Theory 22(3): 253-279 (1996) - 1995
- [j4]Roman Nedela, Martin Skoviera:
Which generalized petersen graphs are cayley graphs? J. Graph Theory 19(1): 1-11 (1995) - 1994
- [j3]Roman Nedela:
Covering projections of graphs preserving links of vertices and edges. Discret. Math. 134(1-3): 111-124 (1994) - 1993
- [j2]Roman Nedela:
Covering spaces of locally homogeneous graphs. Discret. Math. 121(1-3): 177-188 (1993)
1980 – 1989
- 1989
- [j1]Martin Skoviera, Roman Nedela:
The maximum genus of vertex-transitive graphs. Discret. Math. 78(1-2): 179-186 (1989)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-02-18 22:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
