default search action
Ademir Hujdurovic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j30]Ademir Hujdurovic, István Kovács, Klavdija Kutnar, Dragan Marusic:
Intersection density of transitive groups with small cyclic point stabilizers. Eur. J. Comb. 124: 104079 (2025) - 2024
- [j29]Ademir Hujdurovic
, Ðorde Mitrovic
Some conditions implying stability of graphs. J. Graph Theory 105(1): 98-109 (2024) - 2022
- [j28]Ademir Hujdurovic
On maximum intersecting sets in direct and wreath product of groups. Eur. J. Comb. 103: 103523 (2022) - [j27]Blas Fernández, Ademir Hujdurovic:
On some problems regarding distance-balanced graphs. Eur. J. Comb. 106: 103593 (2022) - [j26]Ademir Hujdurovic
On intersection density of transitive groups of degree a product of two odd primes. Finite Fields Their Appl. 78: 101975 (2022) - [j25]Blas Fernández, Ademir Hujdurovic
Canonical double covers of circulants. J. Comb. Theory B 154: 49-59 (2022) - [j24]Ademir Hujdurovic
Three local actions in 6-valent arc-transitive graphs. J. Graph Theory 99(2): 207-216 (2022) - 2021
- [j23]Ademir Hujdurovic
On Automorphisms of the Double Cover of a Circulant Graph. Electron. J. Comb. 28(4) (2021) - 2020
- [j22]Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic
Mind the independence gap. Discret. Math. 343(9): 111943 (2020) - [j21]Ademir Hujdurovic
Strong cliques in vertex-transitive graphs. J. Graph Theory 95(4): 543-564 (2020)
2010 – 2019
- 2019
- [j20]Yan-Quan Feng
Quasi-semiregular automorphisms of cubic and tetravalent arc-transitive graphs. Appl. Math. Comput. 353: 329-337 (2019) - [j19]Edin Husic
MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP. Bioinform. 35(5): 769-777 (2019) - [j18]Ademir Hujdurovic
Graphs with Cayley canonical double covers. Discret. Math. 342(9): 2542-2548 (2019) - [j17]Ademir Hujdurovic
Detecting strong cliques. Discret. Math. 342(9): 2738-2750 (2019) - 2018
- [j16]Ademir Hujdurovic
On normality of n-Cayley graphs. Appl. Math. Comput. 332: 469-476 (2018) - [j15]Ademir Hujdurovic
Enumerating graphs via even/odd dichotomy. Discret. Appl. Math. 247: 252-262 (2018) - [j14]Ademir Hujdurovic
Graphs vertex-partitionable into strong cliques. Discret. Math. 341(5): 1392-1405 (2018) - [j13]Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
On Almost Well-Covered Graphs of Girth at Least 6. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [j12]Ademir Hujdurovic
Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem. ACM Trans. Algorithms 14(2): 20:1-20:26 (2018) - [j11]Ademir Hujdurovic
Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples. IEEE ACM Trans. Comput. Biol. Bioinform. 15(1): 96-108 (2018) - [i8]Ademir Hujdurovic, Martin Milanic, Bernard Ries:
Detecting strong cliques. CoRR abs/1808.08817 (2018) - [i7]Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
Mind the Independence Gap. CoRR abs/1812.05316 (2018) - 2017
- [j10]Ted Dobson, Ademir Hujdurovic, Klavdija Kutnar, Joy Morris:
Vertex-transitive digraphs with extra automorphisms that preserve the natural arc-colouring. Australas. J Comb. 67: 88-100 (2017) - [j9]Amirabbas Abedi, Mehdi Alaeiyan, Ademir Hujdurovic
Quasi-λ-distance-balanced graphs. Discret. Appl. Math. 227: 21-28 (2017) - [j8]Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [c3]Ademir Hujdurovic
The Minimum Conflict-Free Row Split Problem Revisited. WG 2017: 303-315 - [i6]Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
The minimum conflict-free row split problem revisited: a branching formulation and (in)approximability issues. CoRR abs/1701.05492 (2017) - [i5]Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
Minimal dominating sets in lexicographic product graphs. CoRR abs/1701.05886 (2017) - [i4]Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
Almost Well-Covered Graphs Without Short Cycles. CoRR abs/1708.04632 (2017) - 2016
- [j7]Ademir Hujdurovic, Klavdija Kutnar, Dragan Marusic
Odd automorphisms in vertex-transitive graphs. Ars Math. Contemp. 10(2): 427-437 (2016) - [j6]Ademir Hujdurovic, Klavdija Kutnar, Dave Witte Morris, Joy Morris:
On colour-preserving automorphisms of Cayley graphs. Ars Math. Contemp. 11(1): 189-213 (2016) - [i3]Ademir Hujdurovic, Martin Milanic, Bernard Ries:
On graphs vertex-partitionable into strong cliques. CoRR abs/1609.06961 (2016) - 2015
- [j5]Edward Dobson, Ademir Hujdurovic
Vertex-transitive CIS graphs. Eur. J. Comb. 44: 87-98 (2015) - [j4]Ademir Hujdurovic
Vertex-transitive generalized Cayley graphs which are not Cayley graphs. Eur. J. Comb. 46: 45-50 (2015) - [j3]Ratko Darda, Ademir Hujdurovic
On Bounds for the Product Irregularity Strength of Graphs. Graphs Comb. 31(5): 1347-1357 (2015) - [c2]Ademir Hujdurovic
Finding a Perfect Phylogeny from Mixed Tumor Samples. WABI 2015: 80-92 - [i2]Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu:
Finding a perfect phylogeny from mixed tumor samples. CoRR abs/1506.07675 (2015) - 2014
- [j2]Ademir Hujdurovic
Half-arc-transitive group actions with a small number of alternets. J. Comb. Theory A 124: 114-129 (2014) - [i1]Edward Dobson, Ademir Hujdurovic, Martin Milanic, Gabriel Verret:
Vertex-transitive CIS graphs. CoRR abs/1405.7874 (2014) - 2013
- [j1]Ademir Hujdurovic:
Quasi m-Cayley circulants. Ars Math. Contemp. 6(1): 147-154 (2013) - [c1]Ademir Hujdurovic
On Prime-Valent Symmetric Bicirculants and Cayley Snarks. GSI 2013: 196-203
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-11-04 20:43 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: