Darko Dimitrov

Publication Activity (10 Years)

Years Active: 2005-2023
Publications (10 Years): 25

Top Topics

Bipartite Graph

Structural Properties

Top Venues

Discret. Appl. Math.

Appl. Math. Comput.

Publications

Darko Dimitrov, Dragan Stevanovic
-irregularity and the inverse irregularity problem. Appl. Math. Comput. 441 (2023)
Darko Dimitrov, Zhibin Du
Complete characterization of the minimal-ABC trees. Discret. Appl. Math. 336 (2023)
Zhibin Du, Darko Dimitrov, Carlos M. da Fonseca
New strong divisibility sequences. Ars Math. Contemp. 22 (1) (2022)
Darko Dimitrov, Zhibin Du
A solution of the conjecture about big vertices of minimal-ABC trees. Appl. Math. Comput. 397 (2021)
Zhibin Du, Darko Dimitrov
The minimal-ABC trees with $$B_2$$-branches. Comput. Appl. Math. 39 (2) (2020)
Akbar Ali, Darko Dimitrov, Zhibin Du, Faiza Ishfaq
On the extremal graphs for general sum-connectivity index (χα) with given cyclomatic number when α>1. Discret. Appl. Math. 257 (2019)
Riste Skrekovski, Darko Dimitrov, Jiemei Zhong, Hualong Wu, Wei Gao
Remarks on Multiplicative Atom-Bond Connectivity Index. IEEE Access 7 (2019)
Darko Dimitrov, Barbara Ikica, Riste Skrekovski
Maximum external Wiener index of graphs. Discret. Appl. Math. 257 (2019)
Hosam Abdo, Darko Dimitrov, Ivan Gutman
Graph irregularity and its measures. Appl. Math. Comput. 357 (2019)
Wenshui Lin, Jianfeng Chen, Zhixi Wu, Darko Dimitrov, Linshan Huang
index. Appl. Math. Comput. 338 (2018)
Hosam Abdo, Darko Dimitrov, Ivan Gutman
Graphs with maximal σ irregularity. Discret. Appl. Math. 250 (2018)
Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca
Some forbidden combinations of branches in minimal-ABC trees. Discret. Appl. Math. 236 (2018)
Zehui Shao, Pu Wu, Xiujun Zhang, Darko Dimitrov, Jia-Bao Liu
On the Maximum ABC Index of Graphs With Prescribed Size and Without Pendent Vertices. IEEE Access 6 (2018)
Akbar Ali, Darko Dimitrov
On the extremal graphs with respect to bond incident degree indices. Discret. Appl. Math. 238 (2018)
Jianzhang Wu, Jiabin Yuan, Darko Dimitrov
Graph-based feasibility analysis of resource dispatching in NFV networks. J. Intell. Fuzzy Syst. 35 (4) (2018)
Zhibin Du, Darko Dimitrov
-Branches II. IEEE Access 6 (2018)
Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca
Forbidden branches in trees with minimal atom-bond connectivity index. CoRR (2017)
Darko Dimitrov, Barbara Ikica, Riste Skrekovski
Remarks on the Graovac-Ghorbani index of bipartite graphs. Appl. Math. Comput. 293 (2017)
Darko Dimitrov, Barbara Ikica, Riste Skrekovski
Remarks on maximum atom-bond connectivity index with given graph parameters. Discret. Appl. Math. 222 (2017)
Darko Dimitrov
On structural properties of trees with minimal atom-bond connectivity index IV: Solving a conjecture about the pendent paths of length three. CoRR (2017)
Darko Dimitrov
On structural properties of trees with minimal atom-bond connectivity index IV: Solving a conjecture about the pendent paths of length three. Appl. Math. Comput. 313 (2017)
Hosam Abdo, Darko Dimitrov, Wei Gao
On the Irregularity of Some Molecular Structures. CoRR (2016)
Darko Dimitrov
-branches. Discret. Appl. Math. 204 (2016)
Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca
On structural properties of trees with minimal atom-bond connectivity index III: Trees with pendent paths of length three. Appl. Math. Comput. 282 (2016)
Darko Dimitrov, Barbara Ikica, Riste Skrekovski
Remarks on the maximum atom-bond connectivity index of graphs with given parameters. CoRR (2016)
Darko Dimitrov, Riste Skrekovski
Comparing the irregularity and the total irregularity of graphs. Ars Math. Contemp. 9 (1) (2015)
Hosam Abdo, Darko Dimitrov, Ivan Gutman
On extremal trees with respect to the $F$-index. CoRR (2015)
Darko Dimitrov
On structural properties of trees with minimal atom-bond connectivity index II. CoRR (2015)
Hosam Abdo, Stephan Brandt, Darko Dimitrov
The Total Irregularity of a Graph. Discret. Math. Theor. Comput. Sci. 16 (1) (2014)
Hosam Abdo, Darko Dimitrov
Non-regular graphs with minimal total irregularity. CoRR (2014)
Darko Dimitrov
On structural properties of trees with minimal atom-bond connectivity index. CoRR (2014)
Darko Dimitrov
On structural properties of trees with minimal atom-bond connectivity index. Discret. Appl. Math. 172 (2014)
Hosam Abdo, Darko Dimitrov
The irregularity of graphs under graph operations. Discuss. Math. Graph Theory 34 (2) (2014)
Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
Linear time construction of a compressed Gray code. Eur. J. Comb. 34 (1) (2013)
Darko Dimitrov
Efficient computation of trees with minimal atom-bond connectivity index. Appl. Math. Comput. 224 (2013)
Hosam Abdo, Darko Dimitrov
The Total Irregularity of Graphs under Graph Operations CoRR (2013)
Darko Dimitrov
Efficient computation of trees with minimal atom-bond connectivity index CoRR (2013)
Hosam Abdo, Darko Dimitrov
The total irregularity of a graph CoRR (2012)
Hosam Abdo, Darko Dimitrov, Ivan Gutman
On the Zagreb indices equality. Discret. Appl. Math. 160 (1-2) (2012)
Hosam Abdo, Nathann Cohen, Darko Dimitrov
Bounds and Computation of Irregularity of a Graph CoRR (2012)
Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk, Riste Skrekovski
On the Zagreb index inequality of graphs with prescribed vertex degrees. Discret. Appl. Math. 159 (8) (2011)
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
Efficient Dynamical Computation of Principal Components. GRAPP (2011)
Hosam Abdo, Darko Dimitrov, Ivan Gutman
On the Zagreb Indices Equality CoRR (2011)
Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
Gray Codes Avoiding Matchings. Discret. Math. Theor. Comput. Sci. 11 (2) (2009)
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
Computing Principal Components Dynamically CoRR (2009)
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
Bounds on the quality of the PCA bounding boxes. Comput. Geom. 42 (8) (2009)
Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
Gray Code Compression. IWOCA (2009)
Darko Dimitrov, Elad Horev, Roi Krakovski
Polychromatic colorings of rectangular partitions. Discret. Math. 309 (9) (2009)
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms. VISIGRAPP (Selected Papers) (2008)
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
Experimental Study of Bounding Box Algorithms. GRAPP (2008)
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn
Approximate Point-to-Surface Registration with a Single Characteristic Point. VISAPP (1) (2008)
Darko Dimitrov, Klaus Kriegel
Detection of perfect and approximate reflective symmetry in arbitrary dimension. VISAPP (2) (2007)
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
. SCG (2007)
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn
Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation. FAW (2007)
Darko Dimitrov, Christian Knauer, Klaus Kriegel
Registration of 3D - patterns and shapes with characteristic points. VISAPP (1) (2006)
Darko Dimitrov, Christian Knauer, Klaus Kriegel
Matching surfaces with characteristic points. EuroCG (2005)