default search action
Damir Vukicevic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j29]Marina Crnjac Zizic
, Ivica Veza, Damir Vukicevic, Marko Mladineo
APPINT algorithm for decision-making based on information integration in the assembly of personalized products. J. Ind. Inf. Integr. 38: 100560 (2024) - 2021
- [j28]Suzana Antunovic
Evaluating topological ordering in directed acyclic graphs. Electron. J. Graph Theory Appl. 9(2): 567-580 (2021) - 2020
- [j27]Nicola Milosavljevic', Dragan Stevanovic
A few examples and counterexamples in spectral graph theory. Discuss. Math. Graph Theory 40(2): 637-662 (2020)
2010 – 2019
- 2019
- [j26]Suzana Antunovic
Exponential generalised network descriptors. Adv. Math. Commun. 13(3): 405-420 (2019) - 2018
- [j25]Damir Vukicevic, Jelena Sedlar
On indices of Wiener and anti-Wiener type. Discret. Appl. Math. 251: 290-298 (2018) - [j24]Damir Vukicevic, Shuang Zhao, Jelena Sedlar
Global forcing number for maximal matchings. Discret. Math. 341(3): 801-809 (2018) - 2017
- [j23]Damir Vukicevic, Riste Skrekovski, Aleksandra Tepeh:
Relative edge betweenness centrality. Ars Math. Contemp. 12(2): 261-270 (2017) - 2016
- [j22]Jelena Govorcin, Riste Skrekovski
A measure for a balanced workload and its extremal values. Discret. Appl. Math. 200: 59-66 (2016) - 2015
- [j21]Mara Kozic, Damir Vukicevic, Juraj Simunic, Tomislav Roncevic
Predicting the Minimal Inhibitory Concentration for Antimicrobial Peptides with Rana-Box Domain. J. Chem. Inf. Model. 55(10): 2275-2287 (2015) - 2014
- [j20]Jelena Sedlar, Damir Vukicevic, Franco Cataldo, Ottorino Ori, Ante Graovac:
Compression ratio of Wiener index in 2-d rectangular and polygonal lattices. Ars Math. Contemp. 7(1): 1-12 (2014) - [c1]Ljiljana Despalatovic, Tanja Vojkovic
Community structure in networks: Girvan-Newman algorithm improvement. MIPRO 2014: 997-1002 - 2013
- [j19]Damir Vukicevic, Gilles Caporossi:
Network descriptors based on betweenness centrality and transmission and their extremal values. Discret. Appl. Math. 161(16-17): 2678-2686 (2013) - 2012
- [j18]Boris Furtula
Computer search for trees with minimal ABC index. Appl. Math. Comput. 219(2): 767-772 (2012) - [j17]Milan Randic, Damir Vukicevic, Alexandru T. Balaban, Marjan Vracko, Dejan Plavsic:
Conjugated circuits currents in hexabenzocoronene and its derivatives formed by joining proximal carbons. J. Comput. Chem. 33(11): 1111-1122 (2012) - [j16]Nédia Kamech, Damir Vukicevic, Ali Ladram
Improving the Selectivity of Antimicrobial Peptides from Anuran Skin. J. Chem. Inf. Model. 52(12): 3341-3351 (2012) - 2011
- [j15]Jelena Sedlar
Using size for bounding expressions of graph invariants. Ann. Oper. Res. 188(1): 415-427 (2011) - [p1]Damir Vukicevic:
Applications of Perfect Matchings in Chemistry. Structural Analysis of Complex Networks 2011: 463-482 - 2010
- [j14]Sarah Michele Rajtmajer, Damir Vukicevic:
A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks. Appl. Math. Comput. 217(7): 3516-3521 (2010) - [j13]Damir Vukicevic, Tomaz Pisanski:
On the extremal values of ratios of number of paths. Ars Math. Contemp. 3(2): 215-235 (2010) - [j12]Damir Vukicevic:
Which generalized Randic indices are suitable measures of molecular branching? Discret. Appl. Math. 158(18): 2056-2065 (2010) - [j11]Jelena Sedlar, Damir Vukicevic, Mustapha Aouchiche, Pierre Hansen:
Variable Neighborhood Search for Extremal Graphs, 24. Results about the clique number. Stud. Inform. Univ. 8(2): 281-316 (2010)
2000 – 2009
- 2009
- [j10]Boris Furtula
Atom-bond connectivity index of trees. Discret. Appl. Math. 157(13): 2828-2835 (2009) - [j9]Pierre Hansen, Damir Vukicevic:
Variable neighborhood search for extremal graphs. 23. On the Randic index and the chromatic number. Discret. Math. 309(13): 4228-4234 (2009) - [j8]Davor Juretic
Computational Design of Highly Selective Antimicrobial Peptides. J. Chem. Inf. Model. 49(12): 2873-2882 (2009) - 2008
- [j7]Damir Vukicevic, Petra Zigert:
Binary coding of algebraic Kekulé structures of catacondensed benzenoid graphs. Appl. Math. Lett. 21(7): 712-716 (2008) - 2007
- [j6]Damir Vukicevic, Tomislav Doslic:
Global forcing number of grid graphs. Australas. J Comb. 38: 47-62 (2007) - [j5]Tomislav Doslic, Damir Vukicevic:
Computing the bipartite edge frustration of fullerene graphs. Discret. Appl. Math. 155(10): 1294-1301 (2007) - [j4]Qi Dai, Xiao-Qing Liu, Tian-Ming Wang, Damir Vukicevic:
Linear regression model of DNA sequences and its application. J. Comput. Chem. 28(8): 1434-1445 (2007) - [j3]Milan Randic, Harry W. Kroto, Damir Vukicevic:
Numerical Kekulé Structures of Fullerenes and Partitioning of π-Electrons to Pentagonal and Hexagonal Rings. J. Chem. Inf. Model. 47(3): 897-904 (2007) - 2004
- [j2]Ivan Gutman
Algebraic Kekulé Structures of Benzenoid Hydrocarbons. J. Chem. Inf. Model. 44(2): 296-299 (2004) - 2003
- [j1]Damir Vukicevic:
Decomposition of complete graphs into factors of diameter two and three. Discuss. Math. Graph Theory 23(1): 37-54 (2003)
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-10-07 22:22 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: