Fast Recognition of Fibonacci Cubes. - Andrej Taranenko; Aleksander Vesel (Algorithmica, 2007)

Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs. - Andrej Taranenko; Aleksander Vesel (Discret. Appl. Math., 2008)

Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems. - Sandi Klavzar; Khaled Salem; Andrej Taranenko (Comput. Math. Appl., 2010)

1-factors and characterization of reducible faces of plane elementary bipartite graphs. - Andrej Taranenko; Aleksander Vesel (Discuss. Math. Graph Theory, 2012)

On the vertex kk-path cover. - Bostjan Bresar; Marko Jakovac; Ján Katrenic; Gabriel Semanisin; Andrej Taranenko (Discret. Appl. Math., 2013)

On the k-path vertex cover of some graph products. - Marko Jakovac; Andrej Taranenko (Discret. Math., 2013)

A new characterization and a recognition algorithm of Lucas cubes. - Andrej Taranenko (Discret. Math. Theor. Comput. Sci., 2013)

The partition dimension of strong product graphs and Cartesian product graphs. - Ismael González Yero; Marko Jakovac; Dorota Kuziak; Andrej Taranenko (Discret. Math., 2014)

Mixed metric dimension of graphs. - Aleksander Kelenc; Dorota Kuziak; Andrej Taranenko; Ismael González Yero (Appl. Math. Comput., 2017)

A note on the Thue chromatic number of lexicographic produts of graphs. - Erika Fecková Skrabul'áková; Iztok Peterin; Jens Schreyer; Andrej Taranenko (Discuss. Math. Graph Theory, 2018)

On graphs with the maximum edge metric dimension. - Enqiang Zhu; Andrej Taranenko; Zehui Shao; Jin Xu 002 (Discret. Appl. Math., 2019)

Daisy cubes: A characterization and a generalization. - Andrej Taranenko (Eur. J. Comb., 2020)

Daisy Hamming graphs. - Tanja Dravec; Andrej Taranenko (Discuss. Math. Graph Theory, 2023)

Span of a Graph: Keeping the Safety Distance. - Iztok Banic; Andrej Taranenko (Discret. Math. Theor. Comput. Sci., 2023)

The strong vertex span of trees. - Mateja Grasic; Chris Mouron; Andrej Taranenko (CoRR, 2024)

Graphs with span 1 and shortest optimal walks. - Tanja Dravec; Mirjana Mikalacki; Andrej Taranenko (Appl. Math. Comput., 2025)