Parametric Design Using Constraint Description Graph. - Borut Zalik; Nikola Guid; Aleksander Vesel (Rechnerunterstütztes Entwerfen und Konstruieren (CAD), 1992)

Representing Geometric Objects Using Constraint Description Graphs. - Borut Zalik; Nikola Guid; Aleksander Vesel (IEA/AIE, 1992)

Recognizing halved cubes in a constant time per edge. - Wilfried Imrich; Sandi Klavzar; Aleksander Vesel (Eur. J. Comb., 1995)

A characterization of halved cubes. - Wilfried Imrich; Sandi Klavzar; Aleksander Vesel (Ars Comb., 1998)

The independence number of the strong product of odd cycles. - Aleksander Vesel; Janez Zerovnik (Discret. Math., 1998)

On the linear K-arboricity of cubic graphs. - Aleksander Vesel; Janez Zerovnik (Int. J. Comput. Math., 2000)

Binary Coding of Kekulé Structures of Catacondensed Benzenoid Hydrocarbons. - Sandi Klavzar; Aleksander Vesel; Petra Zigert; Ivan Gutman (Comput. Chem., 2001)

Recognizing pseudo-median graphs. - Aleksander Vesel (Discret. Appl. Math., 2002)

Improved lower bound on the Shannon capacity of C7. - Aleksander Vesel; Janez Zerovnik (Inf. Process. Lett., 2002)

Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers. - Sandi Klavzar; Aleksander Vesel (Discret. Appl. Math., 2003)

L(2, 1)-labeling of direct product of paths and cycles. - Pranava K. Jha; Sandi Klavzar; Aleksander Vesel (Discret. Appl. Math., 2005)

Optimal L(d, 1)-labelings of certain direct products of cycles and Cartesian products of cycles. - Pranava K. Jha; Sandi Klavzar; Aleksander Vesel (Discret. Appl. Math., 2005)

L(2, 1)-labeling of strong products of cycles. - Danilo Korze; Aleksander Vesel (Inf. Process. Lett., 2005)

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)

The Clar formulas of a benzenoid system and the resonance graph. - Khaled Salem; Sandi Klavzar; Aleksander Vesel; Petra Zigert (Discret. Appl. Math., 2009)

A note on the independence number of strong products of odd cycles. - Danilo Korze; Aleksander Vesel (Ars Comb., 2012)

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

Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs. - Aleksander Vesel (Discret. Appl. Math., 2013)

A note on the chromatic number of the square of the Cartesian product of two cycles. - Zehui Shao; Aleksander Vesel (Discret. Math., 2013)

Integer linear programming model and satisfiability test reduction for distance constrained labellings of graphs: the case of L(3, 2, 1)labelling for products of paths and cycles. - Zehui Shao; Aleksander Vesel (IET Commun., 2013)

On the packing chromatic number of square and hexagonal lattice. - Danilo Korze; Aleksander Vesel (Ars Math. Contemp., 2014)

Equal opportunity networks, distance-balanced graphs, and Wiener game. - Kannan Balakrishnan; Bostjan Bresar; Manoj Changat; Sandi Klavzar; Aleksander Vesel; Petra Zigert Pletersek (Discret. Optim., 2014)

Linear Recognition and Embedding of Fibonacci Cubes. - Aleksander Vesel (Algorithmica, 2015)

(L(3, 2, 1) ) -labeling of triangular and toroidal grids. - Zehui Shao; Aleksander Vesel (Central Eur. J. Oper. Res., 2015)

Linear recognition of generalized Fibonacci cubes Qh(111). - Yoomi Rho; Aleksander Vesel (Discret. Math. Theor. Comput. Sci., 2016)

Frequency assignment problem in networks with limited spectrum. - Zehui Shao; Aleksander Vesel; Jin Xu 002 (Central Eur. J. Oper. Res., 2017)

Regular coronoids and 4-tilings. - Aleksander Vesel (Discret. Appl. Math., 2017)

(d, n)-packing colorings of infinite lattices. - Danilo Korze; Aleksander Vesel (Discret. Appl. Math., 2018)

L(2, 1)-labeling of the Cartesian and strong product of two directed cycles. - Zehui Shao; Huiqin Jiang; Aleksander Vesel (Math. Found. Comput., 2018)

A heuristic approach for searching (d, n)-packing colorings of infinite lattices. - Danilo Korze; Ziga Markus; Aleksander Vesel (Discret. Appl. Math., 2019)

Cube-complements of generalized Fibonacci cubes. - Aleksander Vesel (Discret. Math., 2019)

Packing coloring of generalized Sierpinski graphs. - Danilo Korze; Aleksander Vesel (Discret. Math. Theor. Comput. Sci., 2019)

Efficient proper embedding of a daisy cube. - Aleksander Vesel (Ars Math. Contemp., 2021)

Optimizing distance constraints frequency assignment with relaxation. - Zehui Shao; Enqiang Zhu; Jin Xu 002; Aleksander Vesel; Xiujun Zhang (RAIRO Oper. Res., 2021)

New results on radio k-labelings of distance graphs. - Danilo Korze; Zehui Shao; Aleksander Vesel (Discret. Appl. Math., 2022)

Variety of mutual-visibility problems in hypercubes. - Danilo Korze; Aleksander Vesel (Appl. Math. Comput., 2025)