Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAleksander Vesel
Person information
- affiliation: University of Maribor, Faculty of Natural Sciences and Mathematics, Slovenia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j34]Danilo Korze, Zehui Shao, Aleksander Vesel
:
New results on radio k-labelings of distance graphs. Discret. Appl. Math. 319: 472-479 (2022)- 2021
- [j33]Aleksander Vesel:
Efficient proper embedding of a daisy cube. Ars Math. Contemp. 21(2) (2021) - [j32]Zehui Shao, Enqiang Zhu, Jin Xu, Aleksander Vesel, Xiujun Zhang:
Optimizing distance constraints frequency assignment with relaxation. RAIRO Oper. Res. 55(Supplement): S1355-S1367 (2021) - 2019
- [j31]Danilo Korze, Ziga Markus, Aleksander Vesel:
A heuristic approach for searching (d, n)-packing colorings of infinite lattices. Discret. Appl. Math. 257: 353-358 (2019) - [j30]Aleksander Vesel:
Cube-complements of generalized Fibonacci cubes. Discret. Math. 342(4): 1139-1146 (2019) - [j29]Danilo Korze, Aleksander Vesel:
Packing coloring of generalized Sierpinski graphs. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - 2018
- [j28]Danilo Korze, Aleksander Vesel:
(d, n)-packing colorings of infinite lattices. Discret. Appl. Math. 237: 97-108 (2018) - [j27]Zehui Shao, Huiqin Jiang, Aleksander Vesel:
L(2, 1)-labeling of the Cartesian and strong product of two directed cycles. Math. Found. Comput. 1(1): 49-61 (2018) - 2017
- [j26]Zehui Shao, Aleksander Vesel, Jin Xu:
Frequency assignment problem in networks with limited spectrum. Central Eur. J. Oper. Res. 25(3): 699-723 (2017) - [j25]Aleksander Vesel:
Regular coronoids and 4-tilings. Discret. Appl. Math. 231: 217-227 (2017) - 2016
- [j24]Yoomi Rho, Aleksander Vesel:
Linear recognition of generalized Fibonacci cubes Qh(111). Discret. Math. Theor. Comput. Sci. 17(3) (2016) - 2015
- [j23]Aleksander Vesel:
Linear Recognition and Embedding of Fibonacci Cubes. Algorithmica 71(4): 1021-1034 (2015) - [j22]Zehui Shao, Aleksander Vesel:
\(L(3, 2, 1)\) -labeling of triangular and toroidal grids. Central Eur. J. Oper. Res. 23(3): 659-673 (2015) - 2014
- [j21]Danilo Korze, Aleksander Vesel:
On the packing chromatic number of square and hexagonal lattice. Ars Math. Contemp. 7(1): 13-22 (2014) - [j20]Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Sandi Klavzar, Aleksander Vesel, Petra Zigert Pletersek:
Equal opportunity networks, distance-balanced graphs, and Wiener game. Discret. Optim. 12: 150-154 (2014) - 2013
- [j19]Aleksander Vesel:
Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs. Discret. Appl. Math. 161(13-14): 2158-2168 (2013) - [j18]Zehui Shao, Aleksander Vesel:
A note on the chromatic number of the square of the Cartesian product of two cycles. Discret. Math. 313(9): 999-1001 (2013) - [j17]Zehui Shao, Aleksander Vesel:
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. IET Commun. 7(8) (2013) - 2012
- [j16]Danilo Korze, Aleksander Vesel:
A note on the independence number of strong products of odd cycles. Ars Comb. 106: 473-481 (2012) - [j15]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) - 2009
- [j14]Khaled Salem, Sandi Klavzar, Aleksander Vesel, Petra Zigert:
The Clar formulas of a benzenoid system and the resonance graph. Discret. Appl. Math. 157(11): 2565-2569 (2009) - 2008
- [j13]Andrej Taranenko, Aleksander Vesel:
Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs. Discret. Appl. Math. 156(10): 1711-1724 (2008) - 2007
- [j12]Andrej Taranenko, Aleksander Vesel:
Fast Recognition of Fibonacci Cubes. Algorithmica 49(2): 81-93 (2007) - 2005
- [j11]Pranava K. Jha, Sandi Klavzar, Aleksander Vesel:
L(2, 1)-labeling of direct product of paths and cycles. Discret. Appl. Math. 145(2): 317-325 (2005) - [j10]Pranava K. Jha, Sandi Klavzar, Aleksander Vesel:
Optimal L(d, 1)-labelings of certain direct products of cycles and Cartesian products of cycles. Discret. Appl. Math. 152(1-3): 257-265 (2005) - [j9]Danilo Korze, Aleksander Vesel:
L(2, 1)-labeling of strong products of cycles. Inf. Process. Lett. 94(4): 183-190 (2005) - 2003
- [j8]Sandi Klavzar, Aleksander Vesel:
Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers. Discret. Appl. Math. 129(2-3): 449-460 (2003) - 2002
- [j7]Aleksander Vesel:
Recognizing pseudo-median graphs. Discret. Appl. Math. 116(3): 261-269 (2002) - [j6]Aleksander Vesel, Janez Zerovnik:
Improved lower bound on the Shannon capacity of C7. Inf. Process. Lett. 81(5): 277-282 (2002) - 2001
- [j5]Sandi Klavzar, Aleksander Vesel, Petra Zigert, Ivan Gutman:
Binary Coding of Kekulé Structures of Catacondensed Benzenoid Hydrocarbons. Comput. Chem. 25(6): 569-575 (2001) - 2000
- [j4]Aleksander Vesel, Janez Zerovnik:
On the linear K-arboricity of cubic graphs. Int. J. Comput. Math. 75(4): 431-444 (2000) - 1998
- [j3]Wilfried Imrich, Sandi Klavzar, Aleksander Vesel:
A characterization of halved cubes. Ars Comb. 48 (1998) - [j2]Aleksander Vesel, Janez Zerovnik:
The independence number of the strong product of odd cycles. Discret. Math. 182(1-3): 333-336 (1998) - 1995
- [j1]Wilfried Imrich, Sandi Klavzar, Aleksander Vesel:
Recognizing halved cubes in a constant time per edge. Eur. J. Comb. 16(6): 617-621 (1995)
Conference and Workshop Papers
- 1992
- [c2]Borut Zalik, Nikola Guid, Aleksander Vesel:
Parametric Design Using Constraint Description Graph. Rechnerunterstütztes Entwerfen und Konstruieren (CAD) 1992: 329-344 - [c1]Borut Zalik, Nikola Guid, Aleksander Vesel:
Representing Geometric Objects Using Constraint Description Graphs. IEA/AIE 1992: 505-514
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-25 01:11 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:
