![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Dragan Matic
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Julyan H. E. Cartwright
, Jitka Cejková, Elena Fimmel, Simone Giannerini, Diego Luis Gonzalez, Greta Goracci, Clara Grácio
, Jeanine J. Houwing-Duistermaat, Dragan Matic, Natasa Z. Misic, Frans A. A. Mulder, Oreste Piro:
Information, Coding, and Biological Function: The Dynamics of Life. Artif. Life 30(1): 16-27 (2024) - [i5]Marko Djukanovic, Stefan Kapunac, Aleksandar Kartelj, Dragan Matic:
Graph Protection under Multiple Simultaneous Attacks: A Heuristic Approach. CoRR abs/2403.17108 (2024) - 2022
- [j13]Marko Djukanovic, Aleksandar Kartelj, Dragan Matic, Milana Grbic, Christian Blum
, Günther R. Raidl
:
Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences. Appl. Soft Comput. 122: 108844 (2022) - [j12]Bojan Nikolic
, Marko Djukanovic, Dragan Matic:
New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem. Comput. Appl. Math. 41(3) (2022) - [j11]Milana Grbic, Vukasin Crnogorac, Milan Predojevic, Aleksandar Kartelj, Dragan Matic:
Supportness of the protein complex standards in PPI networks. J. Inf. Telecommun. 6(1): 6-26 (2022) - [c5]Marko Djukanovic, Dragan Matic, Christian Blum, Aleksandar Kartelj:
Application of A* to the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings. ICPRAI (2) 2022: 53-64 - [i4]Vladimir Filipovic, Dragan Matic, Aleksandar Kartelj:
Solving the signed Roman domination and signed total Roman domination problems with exact and heuristic methods. CoRR abs/2201.00394 (2022) - 2021
- [c4]Tatjana Zec, Aleksandar Kartelj, Marko Djukanovic, Milana Grbic, Dragan Matic:
Statistical analysis of correlation between weather parameters and new COVID-19 cases: a case study of Bosnia and Herzegovina. INISTA 2021: 1-6 - 2020
- [j10]Milana Grbic, Dragan Matic, Aleksandar Kartelj, Savka Jankovic, Vladimir Filipovic
:
A three-phase method for identifying functionally related protein groups in weighted PPI networks. Comput. Biol. Chem. 86: 107246 (2020) - [j9]Milana Grbic
, Aleksandar Kartelj
, Savka Jankovic, Dragan Matic, Vladimir Filipovic
:
Variable Neighborhood Search for Partitioning Sparse Biological Networks into the Maximum Edge-Weighted $k$k-Plexes. IEEE ACM Trans. Comput. Biol. Bioinform. 17(5): 1822-1831 (2020) - [c3]Milana Grbic, Vukasin Crnogorac, Milan Predojevic, Aleksandar Kartelj, Dragan Matic:
How well are known protein complexes supported in PPI networks? INISTA 2020: 1-7
2010 – 2019
- 2019
- [i3]Jozef Kratica, Vladimir Filipovic
, Dragan Matic, Aleksandar Kartelj:
An Integer Linear Programming Formulation for the Convex Dominating Set Problems. CoRR abs/1904.02541 (2019) - 2018
- [j8]Zoran Maksimovic, Jozef Kratica, Aleksandar Savic, Dragan Matic:
Solving the Multidimensional Maximum Bisection Problem by a Genetic Algorithm and Variable Neighborhood Search. J. Multiple Valued Log. Soft Comput. 31(4): 323-358 (2018) - [i2]Milana Grbic, Aleksandar Kartelj, Savka Jankovic, Dragan Matic, Vladimir Filipovic:
Variable neighborhood search for partitioning sparse biological networks into the maximum edge-weighted k-plexes. CoRR abs/1807.01160 (2018) - 2017
- [j7]Dragan Matic, Jozef Kratica
, Zoran Maksimovic
:
Solving the minimum edge-dilation k-center problem by genetic algorithms. Comput. Ind. Eng. 113: 282-293 (2017) - [j6]Dragan Matic, Jozef Kratica
, Vladimir Filipovic
:
Variable neighborhood search for solving bandwidth coloring problem. Comput. Sci. Inf. Syst. 14(2): 309-327 (2017) - [c2]Vladimir Bugarski, Dragan Matic, Filip Kulic:
Classification of hotel guests by predicted additional spending with ANN decision support system. SISY 2017: 71-76 - 2015
- [j5]Angel Sapena-Bano, Manuel Pineda-Sánchez
, Ruben Puche-Panadero
, Javier Martínez-Román, Dragan Matic:
Fault Diagnosis of Rotating Electrical Machines in Transient Regime Using a Single Stator Current's FFT. IEEE Trans. Instrum. Meas. 64(11): 3137-3146 (2015) - [i1]Dragan Matic, Jozef Kratica, Vladimir Filipovic:
Variable Neighborhood Search for solving Bandwidth Coloring Problem. CoRR abs/1505.06032 (2015) - 2014
- [j4]Dragan Matic:
A mixed integer linear programming model and variable neighborhood search for Maximally Balanced Connected Partition Problem. Appl. Math. Comput. 237: 85-97 (2014) - 2013
- [j3]Vladimir Filipovic
, Aleksandar Kartelj
, Dragan Matic:
An electromagnetism metaheuristic for solving the Maximum Betweenness Problem. Appl. Soft Comput. 13(2): 1303-1313 (2013) - 2012
- [j2]Dragan Matic, Jozef Kratica, Vladimir Filipovic
, Djordje Dugosija:
Variable neighborhood search for Multiple Level Warehouse Layout Problem. Electron. Notes Discret. Math. 39: 161-168 (2012) - [j1]Dragan Matic, Filip Kulic, Manuel Pineda-Sánchez
, Ilija Kamenko
:
Support vector machine classifier for diagnosis in electrical machines: Application to broken bar. Expert Syst. Appl. 39(10): 8681-8689 (2012) - [c1]Dragan Matic, Filip Kulic, Ilija Kamenko
, Vladimir Bugarski
, Perica Nikolic:
Design of support vector machine classifier for broken bar detection. CCA 2012: 1670-1673
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-05-08 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint