Statistics of DKUM

Bibliography of the person, including all types of documents, not only theses.

PhD theses (1)

1. Andrej Taranenko: Elementarni benzenoidni grafi in nad njimi definirani grafi : doktorska disertacija

MSc theses (3)

1. Andrej Zobovič: Kockovni komplementi posplošenih Fibonaccijevih kock
2. Karmen Bregač: Barvanje povezav grafa z najmanjšim številom palet
3. Anže Jeromel: (d, n)-pakirno barvanje za posplošene grafe Sierpińskega

BSc theses (1)

1. Vesna Viltužnik: Algoritmi v teoriji grafov : diplomsko delo

Other documents (42)

1. Aleksander Vesel: The palette index of some Cartesian products of graphs
2. Danilo Korže, Aleksander Vesel: Mutual-visibility and general position sets in Sierpiński triangle graphs
3. Danilo Korže, Aleksander Vesel: Variety of mutual-visibility problems in hypercubes
4. Aleksander Vesel: Efficient proper embedding of a daisy cube
5. Aleksander Vesel: Linear algorithms for the Hosoya index and Hosoya matrix of a tree
6. Danilo Korže, Aleksander Vesel: Mutual-visibility sets in cartesian products of paths and cycles
7. Aleksander Vesel: Binary coding of resonance graphs of catacondensed polyhexes
8. Danilo Korže, Aleksander Vesel: General Position Sets in Two Families of Cartesian Product Graphs
9. Yoomi Rho, Aleksander Vesel: Linear recognition of generalized Fibonacci cubes $Q_h (111)$
10. Zehui Shao, Aleksander Vesel: L(2,1)-labeling of the strong product of paths and cycles
11. Andrej Taranenko, Aleksander Vesel: 1-factors and characterization of reducible faces of plane elementary bipartite graphs
12. Aleksander Vesel: Računalniki RISC
13. Zehui Shao, Aleksander Vesel: A note on the chromatic number of the square of the Cartesian product of two cycles
14. Aleksander Vesel: Gutman, Ivan(SE-KRASC): Hyperenergetic and hypoenergetic graphs. (English summary). - Zb. Rad. (Beogr.) 14(22) (2011), Selected topics on applications of graph spectra, 113-135. ISBN: 978-86-80593-44-9
15. Aleksander Vesel: Goel, Ashish(1-STF-MGE); Kapralov, Michael(1-STF-CPE); Khanna, Sanjeev(1-PA-C): Perfect matchings in O(n log n) time in regular bipartite graphs. (English summary). - STOC'10-Proceedings of the 2010 ACM International Symposium on Theory of Computing, 39-46, ACM, New York, 2010
16. Aleksander Vesel: Gutman, Ivan(SE-KRASC); Salem, Khaled: A fully benzenoid system has a unique maximum cardinality resonant set. (English summary). - Acta Appl. Math. 112 (2010), no. 1, 15-19
17. Aleksander Vesel: Müller, Haiko(4-LEED-C); Urner, Ruth(3-WTRL-SC): On a disparity between relative cliquewidth and relative NLC-width. (English summary). - Discrete Appl. Math. 158 (2010), no. 7, 828-840
18. Aleksander Vesel: Bartha, Miklós(3-NF); Krész, Miklós(H-SZEG): Deciding the deterministic property for soliton graphs. (English summary). - Ars Math. Contemp. 2 (2009), no. 1, 121-136
19. Aleksander Vesel: Du, Wenxue(PRC-NNK-PMC); Li, Xueliang(PRC-NNK-PMC); Shi, Yongtang(PRC-NNK-PMC): Algorithms and extremal problem on Wiener polarity index. (English summary). ž MATCH Commun. Math. Comput. Chem. 62 (2009), no. 1, 235-244.
20. Aleksander Vesel: Bryś, Krzysztof(PL-WASWTM); Lonc, Zbigniew(PL-WASWTM) Polynomial cases of graph decomposition: a complete solution of Holyer's problem. (English summary). - Discrete Math. 309 (2009), no. 6, 1294-1326
21. Aleksander Vesel: Xu, Shoujun (PRC-LAN-SSM); Zhang, Heping (PRC-LAN-SSM): The Hosoya polynomial decomposition for catacondensed benzenoid graphs. (English summary). - Discrete Appl. Math. 156 (2008), no. 15, 2930--2938
22. Aleksander Vesel: Caramia, Massimiliano (I-ROME2-EIM); Dell'Olmo, Paolo (I-ROME-PB): Embedding a novel objective function in a two-phased local search for robust vertex coloring. (English summary). - European J. Oper. Res. 189 (2008), no. 3, 1358--1380
23. Aleksander Vesel: Gurski, Frank (D-DSLD-II); Wanke, Egon (D-DSLD-II): Line graphs of bounded clique-width. (English summary). - Discrete Math. 307 (2007), no. 22, 2734--2754
24. Aleksander Vesel: Polat, Norbert (F-LYON3-IA): Netlike partial cubes. I. General properties. (English summary). - Discrete Math. 307 (2007), no. 22, 2704--2722
25. Aleksander Vesel: On the Fibonacci dimension of partial cubes
26. Aleksander Vesel: John, Peter E. (D-ILTU); Khadikar, Padmakar V.; Singh, Jyoti (6-APS-K): A method of computing the PI index of benzenoid hydrocarbons using orthogonal cuts. (English summary). - J. Math. Chem. 42 (2007), no. 1, 37--45
27. Aleksander Vesel: Ahuja, Nitin (D-BRNS-MOP); Baltz, Andreas (D-KIEL-C); Doerr, Benjamin (D-MPI-I); Přívětivý, Aleš (CZ-KARL-AM); Srivastav, Anand (D-KIEL-C): On the minimum load coloring problem. (English summary). - J. Discrete Algorithms 5 (2007), no. 3, 533--545
28. Aleksander Vesel: Tsai, Yin-Te; Lin, Yaw-Ling; Hsu, F. R. (RC-FECH-DIE): Efficient algorithms for the minimum connected domination on trapezoid graphs. (English summary). - Inform. Sci. 177 (2007), no. 12, 2405--2417
29. Aleksander Vesel: Ghosh, Prabir K. (6-VIDY-AMO); Pal, Madhumangal (6-VIDY-AMO): An optimal algorithm to solve 2-neighbourhood covering problem on trapezoid graphs. (English summary). - Adv. Model. Optim. 9 (2007), no. 1, 15--36 (electronic)
30. Aleksander Vesel: Escoffier, Bruno (F-PARIS9-LA); Paschos, Vangelis Th. (F-PARIS9-LA): On-line models and algorithms for max independent set. (English summary). - RAIRO Oper. Res. 40 (2006), no. 2, 129--142
31. Aleksander Vesel: Lozin, Vadim V. (1-RTG-OR); Mosca, Raffaele (I-DAN2-SC): Polar graphs and maximal independent sets. (English summary). - Discrete Math. 306 (2006), no. 22, 2901--2908
32. Aleksander Vesel: Küpper, Beate (D-AACH-M2); Volkmann, Lutz (D-AACH-M2): Upper bounds on the domination number of a graph in terms of order, diameter and minimum degree. (English summary). - Australas. J. Combin. 35 (2006), 133--140
33. Aleksander Vesel: Yan, Weigen (PRC-JMU-SS); Yeh, Yeong-Nan (RC-AST): Connections between Wiener index and matchings. (English summary). - J. Math. Chem. 39 (2006), no. 2, 389--399
34. Aleksander Vesel: Campbell, Ann Melissa (1-IA-MG); Lowe, Timothy J. (1-PAS-SIB); Zhang, Li (1-CITA): Upgrading arcs to minimize the maximum travel time in a network. (English summary). - Networks 47 (2006), no. 2, 72--80
35. Aleksander Vesel: Lozin, V. V. (1-RTG-OR); Rautenbach, D. (D-BONN-DM): The tree- and clique-width of bipartite graphs in special classes. (English summary). - Australas. J. Combin. 34 (2006), 57--67
36. Aleksander Vesel: Vikas, Narayan (3-SFR-SC): A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results. (English summary). - J. Comput. System Sci. 71 (2005), no. 4, 406--439
37. Aleksander Vesel: Demange, Marc; Paschos, Vangelis (F-PARIS9-LA): Improved approximations for weighted and unweighted graph problems. (English. English summary. - Theory Comput. Syst. 38 (2005), no. 6, 763--787.
38. Danilo Korže, Aleksander Vesel: On the packing chromatic number of square and hexagonal lattice
39. Aleksander Vesel: Embedding of complete and nearly complete binary trees into hypercubes
40. Aleksander Vesel, Janez Žerovnik: How good can ants color graphs?
41. Igor Pesek, Aleksander Vesel: Visualization of the resonance graphs of benzenoid graphs
42. Aleksander Vesel: Embedding of complete and nearly complete binary trees into hypercubes