default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAleksander Malnic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j42]Aleksander Malnic, Boris Zgrablic:
Coverings of Graphoids: Existence Theorem and Decomposition Theorems. Symmetry 16(3): 375 (2024)- 2022
- [j41]Andrej Brodnik, Aleksander Malnic, Rok Pozar:
A subquadratic algorithm for the simultaneous conjugacy problem. J. Graph Theory 100(4): 630-637 (2022) - 2021
- [j40]Andrej Brodnik
, Aleksander Malnic, Rok Pozar:
The simultaneous conjugacy problem in the symmetric group. Math. Comput. 90(332): 2977-2995 (2021) - 2020
- [j39]Marston D. E. Conder, Asia Ivic Weiss, Aleksander Malnic:
The Petra Šparl Award 2020. Ars Math. Contemp. 18(1) (2020) - [i2]Andrej Brodnik, Aleksander Malnic, Rok Pozar:
A subquadratic algorithm for the simultaneous conjugacy problem. CoRR abs/2007.05870 (2020)
2010 – 2019
- 2019
- [j38]Marston D. E. Conder, Asia Ivic Weiss, Aleksander Malnic:
Petra Šparl Award 2020: Call for Nominations. Ars Math. Contemp. 16(2) (2019) - [j37]Aleksander Malnic, Rok Pozar:
On split liftings with sectional complements. Math. Comput. 88(316): 983-1005 (2019) - [i1]Andrej Brodnik, Aleksander Malnic, Rok Pozar:
Fast permutation-word multiplication and the simultaneous conjugacy problem. CoRR abs/1907.07889 (2019) - 2018
- [j36]Marston D. E. Conder, Asia Ivic Weiss, Aleksander Malnic:
The 2018 Petra Šparl Award. Ars Math. Contemp. 14(2) (2018) - [j35]Bostjan Kuzman, Aleksander Malnic, Primoz Potocnik:
Tetravalent vertex- and edge-transitive graphs over doubled cycles. J. Comb. Theory B 131: 109-137 (2018) - 2016
- [j34]Aleksander Malnic, Rok Pozar:
On the split structure of lifted groups. Ars Math. Contemp. 10(1): 113-134 (2016) - [j33]Aleksander Malnic:
Norbert Seifter is 60! Ars Math. Contemp. 11(2) (2016) - 2015
- [j32]Aleksander Malnic, Primoz Potocnik, Norbert Seifter, Primoz Sparl:
Reachability relations, transitive digraphs and groups. Ars Math. Contemp. 8(1): 83-94 (2015) - [j31]Aleksander Malnic, Tomaz Pisanski, Arjana Zitnik:
The clone cover. Ars Math. Contemp. 8(1): 95-113 (2015) - 2012
- [j30]Aleksander Malnic, Roman Nedela, Martin Skoviera:
Regular maps with nilpotent automorphism groups. Eur. J. Comb. 33(8): 1974-1986 (2012) - [j29]István Kovács, Bostjan Kuzman, Aleksander Malnic, Steve Wilson:
Characterization of edge-transitive 4-valent bicirculants. J. Graph Theory 69(4): 441-463 (2012)
2000 – 2009
- 2009
- [j28]Klavdija Kutnar, Aleksander Malnic, Dragan Marusic, Stefko Miklavic:
The strongly distance-balanced property of the generalized Petersen graphs. Ars Math. Contemp. 2(1): 41-47 (2009) - [j27]István Kovács, Aleksander Malnic, Dragan Marusic, Stefko Miklavic:
One-matching bi-Cayley graphs over abelian groups. Eur. J. Comb. 30(2): 602-616 (2009) - 2008
- [j26]Aleksander Malnic, Dragan Marusic, Norbert Seifter, Primoz Sparl, Boris Zgrablic:
Reachability relations in digraphs. Eur. J. Comb. 29(7): 1566-1581 (2008) - [j25]Yan-Quan Feng, Klavdija Kutnar, Aleksander Malnic, Dragan Marusic:
On 2-fold covers of graphs. J. Comb. Theory B 98(2): 324-341 (2008) - [j24]Shao-Fei Du, Aleksander Malnic, Dragan Marusic:
Classification of 2-arc-transitive dihedrants. J. Comb. Theory B 98(6): 1349-1372 (2008) - 2007
- [j23]Edward Dobson, Aleksander Malnic, Dragan Marusic, Lewis A. Nowitz:
Minimal normal subgroups of transitive permutation groups of square-free degree. Discret. Math. 307(3-5): 373-385 (2007) - [j22]Aleksander Malnic, Dragan Marusic, Primoz Sparl, Bostjan Frelih:
Symmetry structure of bicirculants. Discret. Math. 307(3-5): 409-414 (2007) - [j21]Robert Jajcay, Aleksander Malnic, Dragan Marusic:
On the number of closed walks in vertex-transitive graphs. Discret. Math. 307(3-5): 484-493 (2007) - [j20]Aleksander Malnic, Dragan Marusic, Stefko Miklavic, Primoz Potocnik:
Semisymmetric elementary abelian covers of the Möbius-Kantor graph. Discret. Math. 307(17-18): 2156-2175 (2007) - [j19]Aleksander Malnic, Dragan Marusic, Primoz Sparl:
On strongly regular bicirculants. Eur. J. Comb. 28(3): 891-900 (2007) - [j18]Edward Dobson, Aleksander Malnic, Dragan Marusic, Lewis A. Nowitz:
Semiregular automorphisms of vertex-transitive graphs of certain valencies. J. Comb. Theory B 97(3): 371-380 (2007) - 2006
- [j17]Klavdija Kutnar, Aleksander Malnic, Dragan Marusic, Stefko Miklavic:
Distance-balanced graphs: Symmetry conditions. Discret. Math. 306(16): 1881-1894 (2006) - [j16]Aleksander Malnic, Primoz Potocnik:
Invariant subspaces, duality, and covers of the Petersen graph. Eur. J. Comb. 27(6): 971-989 (2006) - 2005
- [j15]Aleksander Malnic, Dragan Marusic, Rögnvaldur G. Möller, Norbert Seifter, Vladimir Ivanovich Trofimov, Boris Zgrablic:
Highly arc transitive digraphs: reachability, topological groups. Eur. J. Comb. 26(1): 19-28 (2005) - [j14]Klavdija Kutnar, Aleksander Malnic, Dragan Marusic:
Chirality of Toroidal Molecular Graphs. J. Chem. Inf. Model. 45(6): 1527-1535 (2005) - [j13]Marston D. E. Conder, Aleksander Malnic, Dragan Marusic, Tomaz Pisanski, Primoz Potocnik:
The edge-transitive but not vertex-transitive cubic graph on 112 vertices. J. Graph Theory 50(1): 25-42 (2005) - 2004
- [j12]Aleksander Malnic, Dragan Marusic, Changqun Wang:
Cubic edge-transitive graphs of order 2p3. Discret. Math. 274(1-3): 187-198 (2004) - [j11]Aleksander Malnic, Dragan Marusic, Primoz Potocnik, Changqun Wang:
An infinite family of cubic edge- but not vertex-transitive graphs. Discret. Math. 280(1-3): 133-148 (2004) - 2002
- [j10]Aleksander Malnic, Dragan Marusic, Norbert Seifter, Boris Zgrablic:
Highly Arc-Transitive Digraphs With No Homomorphism Onto Z. Comb. 22(3): 435-443 (2002) - [j9]Aleksander Malnic:
Action graphs and coverings. Discret. Math. 244(1-3): 299-322 (2002) - [j8]Aleksander Malnic, Dragan Marusic:
Constructing 1/2-arc-transitive graphs of valency 4 and vertex stabilizer Z2×Z2. Discret. Math. 245(1-3): 203-216 (2002) - [j7]Aleksander Malnic, Roman Nedela, Martin Skoviera:
Regular Homomorphisms and Regular Map. Eur. J. Comb. 23(4): 449-461 (2002) - 2000
- [j6]Aleksander Malnic, Roman Nedela, Martin Skoviera:
Lifting Graph Automorphisms by Voltage Assignments. Eur. J. Comb. 21(7): 927-947 (2000)
1990 – 1999
- 1999
- [j5]Aleksander Malnic, Dragan Marusic, Norbert Seifter:
Constructing Infinite One-regular Graphs. Eur. J. Comb. 20(8): 845-853 (1999) - [j4]Aleksander Malnic, Dragan Marusic:
Constructing 4-Valent 1/2-Transitive Graphs with a Nonsolvable Automorphism Group. J. Comb. Theory B 75(1): 46-55 (1999) - 1998
- [j3]Aleksander Malnic:
Group actions, coverings and lifts of automorphisms. Discret. Math. 182(1-3): 203-218 (1998) - 1996
- [j2]Martin Juvan, Aleksander Malnic, Bojan Mohar:
Systems of Curves on Surfaces. J. Comb. Theory, Ser. B 68(1): 7-22 (1996) - 1992
- [j1]Aleksander Malnic, Bojan Mohar:
Generating locally cyclic triangulations of surfaces. J. Comb. Theory B 56(2): 147-164 (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-23 19:20 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:
