default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Svob
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j32]Dean Crnkovic, Vedrana Mikulic Crnkovic, Andrea Svob, Matea Zubovic Zutolija:
Transitive regular q-analogs of graphs. Art Discret. Appl. Math. 8(1): 1 (2025)- 2024
- [j31]Dean Crnkovic
, Nina Mostarac, Andrea Svob:
Distance-regular graphs and new block designs obtained from the Mathieu groups. Appl. Algebra Eng. Commun. Comput. 35(2): 177-194 (2024) - [j30]Dean Crnkovic, Sanja Rukavina, Andrea Svob:
Self-orthogonal codes from equitable partitions of distance-regular graphs. Adv. Math. Commun. 18(3): 651-660 (2024) - [j29]Dean Crnkovic, Vedrana Mikulic Crnkovic, Francesco Pavese, Andrea Svob:
Construction of the projective plane PG(2, 2) from the unitary group PSU(3, q). Contributions Discret. Math. 19(3): 178-183 (2024) - [j28]Andries E. Brouwer, Dean Crnkovic, Andrea Svob:
A construction of directed strongly regular graphs with parameters (63,11,8,1,2). Discret. Math. 347(1): 114146 (2024) - [j27]Dean Crnkovic, Andrea Svob:
Self-Orthogonal Codes from Deza Graphs, Normally Regular Digraphs and Deza Digraphs. Graphs Comb. 40(2): 35 (2024) - [j26]Dean Crnkovic, Daniel R. Hawtin, Nina Mostarac, Andrea Svob:
Neighbour-transitive codes in Kneser graphs. J. Comb. Theory, Ser. A 204: 105850 (2024) - 2023
- [j25]Dean Crnkovic, Ana Grbac, Andrea Svob:
Formally self-dual LCD codes from two-class association schemes. Appl. Algebra Eng. Commun. Comput. 34(2): 183-200 (2023) - [j24]Andrea Svob:
LCD codes from equitable partitions of association schemes. Appl. Algebra Eng. Commun. Comput. 34(6): 889-896 (2023) - [j23]Dean Crnkovic, Francesco Pavese, Andrea Svob:
Intriguing sets of strongly regular graphs and their related structures. Contributions Discret. Math. 18(1): 66-89 (2023) - [j22]Dean Crnkovic, Andrea Svob:
LCD subspace codes. Des. Codes Cryptogr. 91(10): 3215-3226 (2023) - [j21]Dean Crnkovic, Andrea Svob:
Tolerance fuzzy graphs. J. Intell. Fuzzy Syst. 45(3): 4023-4029 (2023) - [j20]Dean Crnkovic, Vedrana Mikulic Crnkovic, Andrea Svob:
Construction of Transitive q-Analogs of Designs. Math. Comput. Sci. 17(1): 2 (2023) - 2022
- [j19]Dean Crnkovic, Daniel R. Hawtin, Andrea Svob:
Neighbour-transitive codes and partial spreads in generalised quadrangles. Des. Codes Cryptogr. 90(6): 1521-1533 (2022) - [j18]Dean Crnkovic, Andrea Svob:
Switching for 2-designs. Des. Codes Cryptogr. 90(7): 1585-1593 (2022) - [j17]Dean Crnkovic, Andrea Svob:
New Constructions of Divisible Design Cayley Graphs. Graphs Comb. 38(1): 17 (2022) - 2021
- [j16]Dean Crnkovic, Ronan Egan, Bernardo Gabriel Rodrigues, Andrea Svob:
LCD codes from weighing matrices. Appl. Algebra Eng. Commun. Comput. 32(2): 175-189 (2021) - [j15]Dean Crnkovic, Andrea Svob:
New symmetric 2-(176, 50, 14) designs. Discret. Math. 344(12): 112623 (2021) - [j14]Dean Crnkovic, Andrea Svob:
Application of Tolerance Graphs to Combat COVID-19 Pandemic. SN Comput. Sci. 2(2): 83 (2021) - 2020
- [j13]Dean Crnkovic, Ronan Egan, Andrea Svob:
Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs. Adv. Math. Commun. 14(4): 591-602 (2020) - [j12]Dean Crnkovic, Hadi Kharaghani, Andrea Svob:
Divisible design Cayley digraphs. Discret. Math. 343(4): 111784 (2020) - [j11]Jozefien D'haeseleer, Jonathan Mannaert, Leo Storme, Andrea Svob:
Cameron-Liebler line classes in AG(3, q). Finite Fields Their Appl. 67: 101706 (2020) - [j10]Dean Crnkovic, Francesco Pavese, Andrea Svob:
On the $\mathrm{PSU}(4, 2)$-Invariant Vertex-Transitive Strongly Regular (216, 40, 4, 8) Graph. Graphs Comb. 36(3): 503-513 (2020)
2010 – 2019
- 2019
- [j9]Dean Crnkovic, Vedrana Mikulic Crnkovic, Andrea Svob:
Block designs and strongly regular graphs admitting a transitive action of the Mathieu group M11. Australas. J Comb. 73: 149-161 (2019) - [j8]Dean Crnkovic, Andrea Svob, Vladimir D. Tonchev:
Cyclotomic Trace Codes. Algorithms 12(8): 168 (2019) - [j7]Andrea Svob:
Transitive distance-regular graphs from the unitary groups U(3,4), U(4,3) and U(5,2). Bull. ICA 87: 103-113 (2019) - [j6]Dean Crnkovic, Ronan Egan, Andrea Svob:
Constructing self-orthogonal and Hermitian self-orthogonal codes via weighing matrices and orbit matrices. Finite Fields Their Appl. 55: 64-77 (2019) - [j5]Maarten De Boeck, Morgan Rodgers, Leo Storme, Andrea Svob:
Cameron-Liebler sets of generators in finite classical polar spaces. J. Comb. Theory A 167: 340-388 (2019) - 2018
- [j4]Dean Crnkovic, Ronan Egan, Andrea Svob:
Orbit matrices of Hadamard matrices and related codes. Discret. Math. 341(5): 1199-1209 (2018) - [j3]Dean Crnkovic, Sanja Rukavina, Andrea Svob:
New strongly regular graphs from orthogonal groups O+(6, 2) and O-(6, 2). Discret. Math. 341(10): 2723-2728 (2018) - 2017
- [j2]Dean Crnkovic, Vedrana Mikulic Crnkovic, Andrea Svob:
New 3-designs and 2-designs having U(3, 3) as an automorphism group. Discret. Math. 340(10): 2507-2515 (2017) - 2016
- [j1]Maarten De Boeck, Leo Storme, Andrea Svob:
The Cameron-Liebler problem for sets. Discret. Math. 339(2): 470-474 (2016)
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 2025-03-24 00:30 CET 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:
