Darko Dimitrov

59 papers C 2Misc 1Journal 49Unranked 7
YearRankTypeTitle / Venue / Authors
2026 J jnl
The σ -irregularity of trees with maximum degree 5.
Discret. Appl. Math.
Darko Dimitrov, Zana Kovijanic Vukicevic, Goran Popivoda, Jelena Sedlar, Riste Skrekovski, Sasa Vujosevic
2025 J jnl
Degree scaling irregularities.
J. Appl. Math. Comput.
Ali Ghalavand, Darko Dimitrov, Mardjan Hakimi-Nezhaad
2025 J jnl
Extremizing antiregular graphs by modifying total σ-irregularity.
Appl. Math. Comput.
Martin Knor, Riste Skrekovski, Slobodan Filipovski, Darko Dimitrov
2023 J jnl
Complete characterization of the minimal-ABC trees.
Discret. Appl. Math.
Darko Dimitrov, Zhibin Du
2023 J jnl
On the σ
Appl. Math. Comput.
Darko Dimitrov, Dragan Stevanovic
2022 J jnl
New strong divisibility sequences.
Ars Math. Contemp.
Zhibin Du, Darko Dimitrov, Carlos M. da Fonseca
2021 J jnl
A solution of the conjecture about big vertices of minimal-ABC trees.
Appl. Math. Comput.
Darko Dimitrov, Zhibin Du
2020 J jnl
The minimal-ABC trees with $$B_2$$-branches.
Comput. Appl. Math.
Zhibin Du, Darko Dimitrov
2019 J jnl
Graph irregularity and its measures.
Appl. Math. Comput.
Hosam Abdo, Darko Dimitrov, Ivan Gutman
2019 J jnl
Maximum external Wiener index of graphs.
Discret. Appl. Math.
Darko Dimitrov, Barbara Ikica, Riste Skrekovski
2019 J jnl
On the extremal graphs for general sum-connectivity index (χα) with given cyclomatic number when α>1.
Discret. Appl. Math.
Akbar Ali, Darko Dimitrov, Zhibin Du, Faiza Ishfaq
2019 J jnl
Remarks on Multiplicative Atom-Bond Connectivity Index.
IEEE Access
Riste Skrekovski, Darko Dimitrov, Jiemei Zhong, Hualong Wu, Wei Gao
2018 J jnl
Computer search for large trees with minimal
Appl. Math. Comput.
Wenshui Lin, Jianfeng Chen, Zhixi Wu, Darko Dimitrov, Linshan Huang
2018 J jnl
Graph-based feasibility analysis of resource dispatching in NFV networks.
J. Intell. Fuzzy Syst.
Jianzhang Wu, Jiabin Yuan, Darko Dimitrov
2018 J jnl
Graphs with maximal σ irregularity.
Discret. Appl. Math.
Hosam Abdo, Darko Dimitrov, Ivan Gutman
2018 J jnl
On the Maximum ABC Index of Graphs With Prescribed Size and Without Pendent Vertices.
IEEE Access
Zehui Shao, Pu Wu, Xiujun Zhang, Darko Dimitrov, Jia-Bao Liu
2018 J jnl
On the extremal graphs with respect to bond incident degree indices.
Discret. Appl. Math.
Akbar Ali, Darko Dimitrov
2018 J jnl
Some forbidden combinations of branches in minimal-ABC trees.
Discret. Appl. Math.
Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca
2018 J jnl
The Minimal-ABC Trees With
IEEE Access
Zhibin Du, Darko Dimitrov
2017 J jnl
Forbidden branches in trees with minimal atom-bond connectivity index.
CoRR
Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca
2017 J jnl
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.
Darko Dimitrov
2017 J jnl
On structural properties of trees with minimal atom-bond connectivity index IV: Solving a conjecture about the pendent paths of length three.
CoRR
Darko Dimitrov
2017 J jnl
Remarks on maximum atom-bond connectivity index with given graph parameters.
Discret. Appl. Math.
Darko Dimitrov, Barbara Ikica, Riste Skrekovski
2017 J jnl
Remarks on the Graovac-Ghorbani index of bipartite graphs.
Appl. Math. Comput.
Darko Dimitrov, Barbara Ikica, Riste Skrekovski
2016 J jnl
On structural properties of trees with minimal atom-bond connectivity index II: Bounds on B
Discret. Appl. Math.
Darko Dimitrov
2016 J jnl
On structural properties of trees with minimal atom-bond connectivity index III: Trees with pendent paths of length three.
Appl. Math. Comput.
Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca
2016 J jnl
On the Irregularity of Some Molecular Structures.
CoRR
Hosam Abdo, Darko Dimitrov, Wei Gao
2016 J jnl
Remarks on the maximum atom-bond connectivity index of graphs with given parameters.
CoRR
Darko Dimitrov, Barbara Ikica, Riste Skrekovski
2015 J jnl
Comparing the irregularity and the total irregularity of graphs.
Ars Math. Contemp.
Darko Dimitrov, Riste Skrekovski
2015 J jnl
On extremal trees with respect to the $F$-index.
CoRR
Hosam Abdo, Darko Dimitrov, Ivan Gutman
2015 J jnl
On structural properties of trees with minimal atom-bond connectivity index II.
CoRR
Darko Dimitrov
2014 J jnl
Non-regular graphs with minimal total irregularity.
CoRR
Hosam Abdo, Darko Dimitrov
2014 J jnl
On structural properties of trees with minimal atom-bond connectivity index.
CoRR
Darko Dimitrov
2014 J jnl
On structural properties of trees with minimal atom-bond connectivity index.
Discret. Appl. Math.
Darko Dimitrov
2014 J jnl
The Total Irregularity of a Graph.
Discret. Math. Theor. Comput. Sci.
Hosam Abdo, Stephan Brandt, Darko Dimitrov
2014 J jnl
The irregularity of graphs under graph operations.
Discuss. Math. Graph Theory
Hosam Abdo, Darko Dimitrov
2013 J jnl
Efficient computation of trees with minimal atom-bond connectivity index
CoRR
Darko Dimitrov
2013 J jnl
Efficient computation of trees with minimal atom-bond connectivity index.
Appl. Math. Comput.
Darko Dimitrov
2013 J jnl
Linear time construction of a compressed Gray code.
Eur. J. Comb.
Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
2013 J jnl
The Total Irregularity of Graphs under Graph Operations
CoRR
Hosam Abdo, Darko Dimitrov
2012 J jnl
Bounds and Computation of Irregularity of a Graph
CoRR
Hosam Abdo, Nathann Cohen, Darko Dimitrov
2012 J jnl
On the Zagreb indices equality.
Discret. Appl. Math.
Hosam Abdo, Darko Dimitrov, Ivan Gutman
2012 J jnl
The total irregularity of a graph
CoRR
Hosam Abdo, Darko Dimitrov
2011 — conf
Efficient Dynamical Computation of Principal Components.
GRAPP
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
2011 J jnl
On the Zagreb Indices Equality
CoRR
Hosam Abdo, Darko Dimitrov, Ivan Gutman
2011 J jnl
On the Zagreb index inequality of graphs with prescribed vertex degrees.
Discret. Appl. Math.
Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk, Riste Skrekovski
2009 J jnl
Bounds on the quality of the PCA bounding boxes.
Comput. Geom.
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
2009 J jnl
Computing Principal Components Dynamically
CoRR
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
2009 C conf
Gray Code Compression.
IWOCA
Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
2009 J jnl
Gray Codes Avoiding Matchings.
Discret. Math. Theor. Comput. Sci.
Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski
2009 J jnl
Polychromatic colorings of rectangular partitions.
Discret. Math.
Darko Dimitrov, Elad Horev, Roi Krakovski
2008 — conf
Approximate Point-to-Surface Registration with a Single Characteristic Point.
VISAPP (1)
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn
2008 — conf
Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms.
VISIGRAPP (Selected Papers)
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
2008 — conf
Experimental Study of Bounding Box Algorithms.
GRAPP
Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel
2007 Misc conf
Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation.
FAW
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn
2007 — conf
Detection of perfect and approximate reflective symmetry in arbitrary dimension.
VISAPP (2)
Darko Dimitrov, Klaus Kriegel
2007 — conf
New upper bounds on the quality of the PCA bounding boxes in r
SCG
Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote
2006 — conf
Registration of 3D - patterns and shapes with characteristic points.
VISAPP (1)
Darko Dimitrov, Christian Knauer, Klaus Kriegel
2005 C conf
Matching surfaces with characteristic points.
EuroCG
Darko Dimitrov, Christian Knauer, Klaus Kriegel