Damir Vukicevic

According to our database1, Damir Vukicevic authored at least 31 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
APPINT algorithm for decision-making based on information integration in the assembly of personalized products.
J. Ind. Inf. Integr., March, 2024

2021
Evaluating topological ordering in directed acyclic graphs.
Electron. J. Graph Theory Appl., 2021

2020
A few examples and counterexamples in spectral graph theory.
Discuss. Math. Graph Theory, 2020

2019
Exponential generalised network descriptors.
Adv. Math. Commun., 2019

2018
Global forcing number for maximal matchings.
Discret. Math., 2018

On indices of Wiener and anti-Wiener type.
Discret. Appl. Math., 2018

2017
Relative edge betweenness centrality.
Ars Math. Contemp., 2017

2016
A measure for a balanced workload and its extremal values.
Discret. Appl. Math., 2016

2015
Predicting the Minimal Inhibitory Concentration for Antimicrobial Peptides with Rana-Box Domain.
J. Chem. Inf. Model., 2015

2014
Compression ratio of Wiener index in 2-d rectangular and polygonal lattices.
Ars Math. Contemp., 2014

Community structure in networks: Girvan-Newman algorithm improvement.
Proceedings of the 37th International Convention on Information and Communication Technology, 2014

2013
Network descriptors based on betweenness centrality and transmission and their extremal values.
Discret. Appl. Math., 2013

2012
Improving the Selectivity of Antimicrobial Peptides from Anuran Skin.
J. Chem. Inf. Model., 2012

Conjugated circuits currents in hexabenzocoronene and its derivatives formed by joining proximal carbons.
J. Comput. Chem., 2012

Computer search for trees with minimal ABC index.
Appl. Math. Comput., 2012

2011
Using size for bounding expressions of graph invariants.
Ann. Oper. Res., 2011

Applications of Perfect Matchings in Chemistry.
Proceedings of the Structural Analysis of Complex Networks, 2011

2010
Variable Neighborhood Search for Extremal Graphs, 24. Results about the clique number.
Stud. Inform. Univ., 2010

Which generalized Randic indices are suitable measures of molecular branching?
Discret. Appl. Math., 2010

On the extremal values of ratios of number of paths.
Ars Math. Contemp., 2010

A note on the Estrada-Hatano communicability algorithm for detecting community structure in complex networks.
Appl. Math. Comput., 2010

2009
Computational Design of Highly Selective Antimicrobial Peptides.
J. Chem. Inf. Model., 2009

Variable neighborhood search for extremal graphs. 23. On the Randic index and the chromatic number.
Discret. Math., 2009

Atom-bond connectivity index of trees.
Discret. Appl. Math., 2009

2008
Binary coding of algebraic Kekulé structures of catacondensed benzenoid graphs.
Appl. Math. Lett., 2008

2007
Numerical Kekulé Structures of Fullerenes and Partitioning of π-Electrons to Pentagonal and Hexagonal Rings.
J. Chem. Inf. Model., 2007

Linear regression model of DNA sequences and its application.
J. Comput. Chem., 2007

Computing the bipartite edge frustration of fullerene graphs.
Discret. Appl. Math., 2007

Global forcing number of grid graphs.
Australas. J Comb., 2007

2004
Algebraic Kekulé Structures of Benzenoid Hydrocarbons.
J. Chem. Inf. Model., 2004

2003
Decomposition of complete graphs into factors of diameter two and three.
Discuss. Math. Graph Theory, 2003


  Loading...