Darko Dimitrov

According to our database, Darko Dimitrov authored at least 52 papers between 2005 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Complete characterization of the minimal-ABC trees.

Darko Dimitrov, Zhibin Du

Discret. Appl. Math., September, 2023

On the σ_t-irregularity and the inverse irregularity problem.

Darko Dimitrov, Dragan Stevanovic

Appl. Math. Comput., 2023

2022

New strong divisibility sequences.

Zhibin Du, Darko Dimitrov, Carlos M. da Fonseca

Ars Math. Contemp., 2022

2021

A solution of the conjecture about big vertices of minimal-ABC trees.

Darko Dimitrov, Zhibin Du

Appl. Math. Comput., 2021

2020

The minimal-ABC trees with $$B_2$$-branches.

Zhibin Du, Darko Dimitrov

Comput. Appl. Math., 2020

2019

Maximum external Wiener index of graphs.

Darko Dimitrov, Barbara Ikica, Riste Skrekovski

Discret. Appl. Math., 2019

On the extremal graphs for general sum-connectivity index (χα) with given cyclomatic number when α>1.

Akbar Ali, Darko Dimitrov, Zhibin Du, Faiza Ishfaq

Discret. Appl. Math., 2019

Graph irregularity and its measures.

Hosam Abdo, Darko Dimitrov, Ivan Gutman

Appl. Math. Comput., 2019

Remarks on Multiplicative Atom-Bond Connectivity Index.

Riste Skrekovski, Darko Dimitrov, Jiemei Zhong, Hualong Wu, Wei Gao

IEEE Access, 2019

2018

Graph-based feasibility analysis of resource dispatching in NFV networks.

Jianzhang Wu, Jiabin Yuan, Darko Dimitrov

J. Intell. Fuzzy Syst., 2018

Some forbidden combinations of branches in minimal-ABC trees.

Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca

Discret. Appl. Math., 2018

On the extremal graphs with respect to bond incident degree indices.

Akbar Ali, Darko Dimitrov

Discret. Appl. Math., 2018

Graphs with maximal σ irregularity.

Hosam Abdo, Darko Dimitrov, Ivan Gutman

Discret. Appl. Math., 2018

Computer search for large trees with minimal <i>ABC</i> index.

Wenshui Lin, Jianfeng Chen, Zhixi Wu, Darko Dimitrov, Linshan Huang

Appl. Math. Comput., 2018

On the Maximum ABC Index of Graphs With Prescribed Size and Without Pendent Vertices.

Zehui Shao, Pu Wu, Xiujun Zhang, Darko Dimitrov, Jia-Bao Liu

IEEE Access, 2018

The Minimal-ABC Trees With <i>B</i>-Branches II.

Zhibin Du, Darko Dimitrov

IEEE Access, 2018

2017

Remarks on maximum atom-bond connectivity index with given graph parameters.

Darko Dimitrov, Barbara Ikica, Riste Skrekovski

Discret. Appl. Math., 2017

Forbidden branches in trees with minimal atom-bond connectivity index.

Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca

CoRR, 2017

Remarks on the Graovac-Ghorbani index of bipartite graphs.

Darko Dimitrov, Barbara Ikica, Riste Skrekovski

Appl. Math. Comput., 2017

On structural properties of trees with minimal atom-bond connectivity index IV: Solving a conjecture about the pendent paths of length three.

Darko Dimitrov

Appl. Math. Comput., 2017

2016

On structural properties of trees with minimal atom-bond connectivity index II: Bounds on B₁- and B₂-branches.

Darko Dimitrov

Discret. Appl. Math., 2016

Remarks on the maximum atom-bond connectivity index of graphs with given parameters.

Darko Dimitrov, Barbara Ikica, Riste Skrekovski

CoRR, 2016

On the Irregularity of Some Molecular Structures.

Hosam Abdo, Darko Dimitrov, Wei Gao

CoRR, 2016

On structural properties of trees with minimal atom-bond connectivity index III: Trees with pendent paths of length three.

Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca

Appl. Math. Comput., 2016

2015

On structural properties of trees with minimal atom-bond connectivity index II.

Darko Dimitrov

CoRR, 2015

On extremal trees with respect to the $F$-index.

Hosam Abdo, Darko Dimitrov, Ivan Gutman

CoRR, 2015

Comparing the irregularity and the total irregularity of graphs.

Darko Dimitrov, Riste Skrekovski

Ars Math. Contemp., 2015

2014

The Total Irregularity of a Graph.

Hosam Abdo, Stephan Brandt, Darko Dimitrov

Discret. Math. Theor. Comput. Sci., 2014

The irregularity of graphs under graph operations.

Hosam Abdo, Darko Dimitrov

Discuss. Math. Graph Theory, 2014

On structural properties of trees with minimal atom-bond connectivity index.

Darko Dimitrov

Discret. Appl. Math., 2014

Non-regular graphs with minimal total irregularity.

Hosam Abdo, Darko Dimitrov

CoRR, 2014

2013

Linear time construction of a compressed Gray code.

Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski

Eur. J. Comb., 2013

The Total Irregularity of Graphs under Graph Operations

Hosam Abdo, Darko Dimitrov

CoRR, 2013

Efficient computation of trees with minimal atom-bond connectivity index.

Darko Dimitrov

Appl. Math. Comput., 2013

2012

On the Zagreb indices equality.

Hosam Abdo, Darko Dimitrov, Ivan Gutman

Discret. Appl. Math., 2012

The total irregularity of a graph

Hosam Abdo, Darko Dimitrov

CoRR, 2012

Bounds and Computation of Irregularity of a Graph

Hosam Abdo, Nathann Cohen, Darko Dimitrov

CoRR, 2012

2011

On the Zagreb index inequality of graphs with prescribed vertex degrees.

Vesna Andova, Saso Bogoev, Darko Dimitrov, Marcin Pilipczuk, Riste Skrekovski

Discret. Appl. Math., 2011

Efficient Dynamical Computation of Principal Components.

Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel

Proceedings of the GRAPP 2011, 2011

2009

Gray Codes Avoiding Matchings.

Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski

Discret. Math. Theor. Comput. Sci., 2009

Polychromatic colorings of rectangular partitions.

Darko Dimitrov, Elad Horev, Roi Krakovski

Discret. Math., 2009

Computing Principal Components Dynamically

Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel

CoRR, 2009

Bounds on the quality of the PCA bounding boxes.

Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote

Comput. Geom., 2009

Gray Code Compression.

Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Approximate Point-to-Surface Registration with a Single Characteristic Point.

Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn

Proceedings of the VISAPP 2008: Proceedings of the Third International Conference on Computer Vision Theory and Applications, Funchal, Madeira, Portugal, January 22-25, 2008, 2008

Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms.

Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel

Proceedings of the Computer Vision and Computer Graphics. Theory and Applications, 2008

Experimental Study of Bounding Box Algorithms.

Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel

Proceedings of the GRAPP 2008, 2008

2007

Detection of perfect and approximate reflective symmetry in arbitrary dimension.

Darko Dimitrov, Klaus Kriegel

Proceedings of the VISAPP 2007: Proceedings of the Second International Conference on Computer Vision Theory and Applications, Barcelona, Spain, March 8-11, 2007, 2007

Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation.

Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn

Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

New upper bounds on the quality of the PCA bounding boxes in r² and r³.

Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

Registration of 3D - patterns and shapes with characteristic points.

Darko Dimitrov, Christian Knauer, Klaus Kriegel

Proceedings of the VISAPP 2006: Proceedings of the First International Conference on Computer Vision Theory and Applications, 2006

2005

Matching surfaces with characteristic points.

Darko Dimitrov, Christian Knauer, Klaus Kriegel

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005