default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrej Taranenko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j14]Tanja Dravec, Andrej Taranenko:
Daisy Hamming graphs. Discuss. Math. Graph Theory 43(2): 421-436 (2023)- [j13]Iztok Banic, Andrej Taranenko:
Span of a Graph: Keeping the Safety Distance. Discret. Math. Theor. Comput. Sci. 25 (2023) - 2020
- [j12]Andrej Taranenko
:
Daisy cubes: A characterization and a generalization. Eur. J. Comb. 85 (2020) - 2019
- [j11]Enqiang Zhu, Andrej Taranenko, Zehui Shao, Jin Xu:
On graphs with the maximum edge metric dimension. Discret. Appl. Math. 257: 317-324 (2019) - 2018
- [j10]Erika Fecková Skrabul'áková, Iztok Peterin, Jens Schreyer, Andrej Taranenko:
A note on the Thue chromatic number of lexicographic produts of graphs. Discuss. Math. Graph Theory 38(3): 635-643 (2018) - 2017
- [j9]Aleksander Kelenc, Dorota Kuziak, Andrej Taranenko, Ismael González Yero:
Mixed metric dimension of graphs. Appl. Math. Comput. 314: 429-438 (2017) - 2014
- [j8]Ismael González Yero, Marko Jakovac, Dorota Kuziak, Andrej Taranenko:
The partition dimension of strong product graphs and Cartesian product graphs. Discret. Math. 331: 43-52 (2014) - 2013
- [j7]Bostjan Bresar, Marko Jakovac, Ján Katrenic, Gabriel Semanisin, Andrej Taranenko:
On the vertex kk-path cover. Discret. Appl. Math. 161(13-14): 1943-1949 (2013) - [j6]Marko Jakovac, Andrej Taranenko:
On the k-path vertex cover of some graph products. Discret. Math. 313(1): 94-100 (2013) - [j5]Andrej Taranenko:
A new characterization and a recognition algorithm of Lucas cubes. Discret. Math. Theor. Comput. Sci. 15(3): 31-40 (2013) - 2012
- [j4]Andrej Taranenko, Aleksander Vesel:
1-factors and characterization of reducible faces of plane elementary bipartite graphs. Discuss. Math. Graph Theory 32(2): 289-297 (2012) - 2010
- [j3]Sandi Klavzar, Khaled Salem, Andrej Taranenko:
Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems. Comput. Math. Appl. 59(1): 506-513 (2010) - 2008
- [j2]Andrej Taranenko, Aleksander Vesel:
Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs. Discret. Appl. Math. 156(10): 1711-1724 (2008) - 2007
- [j1]Andrej Taranenko, Aleksander Vesel:
Fast Recognition of Fibonacci Cubes. Algorithmica 49(2): 81-93 (2007)
Informal and Other Publications
- 2019
- [i1]Andrej Taranenko:
Daisy cubes: a characterization and a generalization. CoRR abs/1905.07243 (2019)
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-04-24 23:09 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:
