default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDarko Dimitrov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j33]Martin Knor, Riste Skrekovski
, Slobodan Filipovski, Darko Dimitrov:
Extremizing antiregular graphs by modifying total σ-irregularity. Appl. Math. Comput. 490: 129199 (2025)- 2023
- [j32]Darko Dimitrov, Dragan Stevanovic:
On the σt-irregularity and the inverse irregularity problem. Appl. Math. Comput. 441: 127709 (2023) - [j31]Darko Dimitrov, Zhibin Du:
Complete characterization of the minimal-ABC trees. Discret. Appl. Math. 336: 148-194 (2023) - 2022
- [j30]Zhibin Du, Darko Dimitrov, Carlos M. da Fonseca:
New strong divisibility sequences. Ars Math. Contemp. 22(1): 1 (2022) - 2021
- [j29]Darko Dimitrov, Zhibin Du:
A solution of the conjecture about big vertices of minimal-ABC trees. Appl. Math. Comput. 397: 125818 (2021) - 2020
- [j28]Zhibin Du, Darko Dimitrov:
The minimal-ABC trees with $$B_2$$-branches. Comput. Appl. Math. 39(2) (2020)
2010 – 2019
- 2019
- [j27]Riste Skrekovski, Darko Dimitrov, Jiemei Zhong, Hualong Wu, Wei Gao:
Remarks on Multiplicative Atom-Bond Connectivity Index. IEEE Access 7: 76806-76811 (2019) - [j26]Hosam Abdo, Darko Dimitrov, Ivan Gutman:
Graph irregularity and its measures. Appl. Math. Comput. 357: 317-324 (2019) - [j25]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: 19-30 (2019) - [j24]Darko Dimitrov, Barbara Ikica, Riste Skrekovski:
Maximum external Wiener index of graphs. Discret. Appl. Math. 257: 331-337 (2019) - 2018
- [j23]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: 27604-27616 (2018) - [j22]Zhibin Du, Darko Dimitrov:
The Minimal-ABC Trees With B-Branches II. IEEE Access 6: 66350-66366 (2018) - [j21]Wenshui Lin, Jianfeng Chen, Zhixi Wu, Darko Dimitrov, Linshan Huang:
Computer search for large trees with minimal ABC index. Appl. Math. Comput. 338: 221-230 (2018) - [j20]Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca:
Some forbidden combinations of branches in minimal-ABC trees. Discret. Appl. Math. 236: 165-182 (2018) - [j19]Akbar Ali, Darko Dimitrov:
On the extremal graphs with respect to bond incident degree indices. Discret. Appl. Math. 238: 32-40 (2018) - [j18]Hosam Abdo, Darko Dimitrov, Ivan Gutman:
Graphs with maximal σ irregularity. Discret. Appl. Math. 250: 57-64 (2018) - [j17]Jianzhang Wu, Jiabin Yuan, Darko Dimitrov:
Graph-based feasibility analysis of resource dispatching in NFV networks. J. Intell. Fuzzy Syst. 35(4): 4487-4494 (2018) - 2017
- [j16]Darko Dimitrov, Barbara Ikica, Riste Skrekovski:
Remarks on the Graovac-Ghorbani index of bipartite graphs. Appl. Math. Comput. 293: 370-376 (2017) - [j15]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: 418-430 (2017) - [j14]Darko Dimitrov, Barbara Ikica, Riste Skrekovski:
Remarks on maximum atom-bond connectivity index with given graph parameters. Discret. Appl. Math. 222: 222-226 (2017) - [i15]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 abs/1706.08587 (2017) - [i14]Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca:
Forbidden branches in trees with minimal atom-bond connectivity index. CoRR abs/1706.08680 (2017) - 2016
- [j13]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: 276-290 (2016) - [j12]Darko Dimitrov:
On structural properties of trees with minimal atom-bond connectivity index II: Bounds on B1- and B2-branches. Discret. Appl. Math. 204: 90-116 (2016) - [i13]Hosam Abdo, Darko Dimitrov, Wei Gao:
On the Irregularity of Some Molecular Structures. CoRR abs/1608.05235 (2016) - [i12]Darko Dimitrov, Barbara Ikica, Riste Skrekovski:
Remarks on the maximum atom-bond connectivity index of graphs with given parameters. CoRR abs/1610.02574 (2016) - 2015
- [j11]Darko Dimitrov, Riste Skrekovski:
Comparing the irregularity and the total irregularity of graphs. Ars Math. Contemp. 9(1): 45-50 (2015) - [i11]Darko Dimitrov:
On structural properties of trees with minimal atom-bond connectivity index II. CoRR abs/1501.05752 (2015) - [i10]Hosam Abdo, Darko Dimitrov, Ivan Gutman:
On extremal trees with respect to the $F$-index. CoRR abs/1509.03574 (2015) - 2014
- [j10]Darko Dimitrov:
On structural properties of trees with minimal atom-bond connectivity index. Discret. Appl. Math. 172: 28-44 (2014) - [j9]Hosam Abdo, Darko Dimitrov:
The irregularity of graphs under graph operations. Discuss. Math. Graph Theory 34(2): 263-278 (2014) - [j8]Hosam Abdo, Stephan Brandt, Darko Dimitrov:
The Total Irregularity of a Graph. Discret. Math. Theor. Comput. Sci. 16(1): 201-206 (2014) - [i9]Darko Dimitrov:
On structural properties of trees with minimal atom-bond connectivity index. CoRR abs/1401.0279 (2014) - [i8]Hosam Abdo, Darko Dimitrov:
Non-regular graphs with minimal total irregularity. CoRR abs/1407.1276 (2014) - 2013
- [j7]Darko Dimitrov:
Efficient computation of trees with minimal atom-bond connectivity index. Appl. Math. Comput. 224: 663-670 (2013) - [j6]Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski:
Linear time construction of a compressed Gray code. Eur. J. Comb. 34(1): 69-81 (2013) - [i7]Hosam Abdo, Darko Dimitrov:
The Total Irregularity of Graphs under Graph Operations. CoRR abs/1304.0185 (2013) - [i6]Darko Dimitrov:
Efficient computation of trees with minimal atom-bond connectivity index. CoRR abs/1305.1155 (2013) - 2012
- [j5]Hosam Abdo, Darko Dimitrov, Ivan Gutman:
On the Zagreb indices equality. Discret. Appl. Math. 160(1-2): 1-8 (2012) - [i5]Hosam Abdo, Nathann Cohen, Darko Dimitrov:
Bounds and Computation of Irregularity of a Graph. CoRR abs/1207.4804 (2012) - [i4]Hosam Abdo, Darko Dimitrov:
The total irregularity of a graph. CoRR abs/1207.5267 (2012) - 2011
- [j4]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): 852-858 (2011) - [c9]Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel:
Efficient Dynamical Computation of Principal Components. GRAPP 2011: 85-93 - [i3]Hosam Abdo, Darko Dimitrov, Ivan Gutman:
On the Zagreb Indices Equality. CoRR abs/1106.1809 (2011)
2000 – 2009
- 2009
- [j3]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote:
Bounds on the quality of the PCA bounding boxes. Comput. Geom. 42(8): 772-789 (2009) - [j2]Darko Dimitrov, Elad Horev, Roi Krakovski:
Polychromatic colorings of rectangular partitions. Discret. Math. 309(9): 2957-2960 (2009) - [j1]Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski:
Gray Codes Avoiding Matchings. Discret. Math. Theor. Comput. Sci. 11(2): 123-148 (2009) - [c8]Darko Dimitrov, Tomás Dvorák, Petr Gregor, Riste Skrekovski:
Gray Code Compression. IWOCA 2009: 183-193 - [i2]Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel:
Computing Principal Components Dynamically. CoRR abs/0912.5380 (2009) - 2008
- [c7]Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel:
Experimental Study of Bounding Box Algorithms. GRAPP 2008: 15-22 - [c6]Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel:
Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms. VISIGRAPP (Selected Papers) 2008: 26-40 - [c5]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn:
Approximate Point-to-Surface Registration with a Single Characteristic Point. VISAPP (1) 2008: 188-195 - 2007
- [c4]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote:
New upper bounds on the quality of the PCA bounding boxes in r2 and r3. SCG 2007: 275-283 - [c3]Darko Dimitrov, Christian Knauer, Klaus Kriegel, Fabian Stehn:
Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation. FAW 2007: 26-37 - [c2]Darko Dimitrov, Klaus Kriegel:
Detection of perfect and approximate reflective symmetry in arbitrary dimension. VISAPP (2) 2007: 128-136 - 2006
- [c1]Darko Dimitrov, Christian Knauer, Klaus Kriegel:
Registration of 3D - patterns and shapes with characteristic points. VISAPP (1) 2006: 393-400 - 2005
- [i1]Darko Dimitrov, Christian Knauer, Klaus Kriegel:
Matching surfaces with characteristic points. EuroCG 2005: 49-51
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-12-02 22:33 CET 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:
