default search action
Aleksandar Kartelj
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c6]Marko Djukanovic
, Aleksandar Kartelj
Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem. ICCS (5) 2024: 58-73 - [i6]Marko Djukanovic, Stefan Kapunac, Aleksandar Kartelj, Dragan Matic:
Graph Protection under Multiple Simultaneous Attacks: A Heuristic Approach. CoRR abs/2403.17108 (2024) - [i5]Alireza Abdi, Marko Djukanovic, Hesam Tahmasebi Boldaji, Hadis Salehi, Aleksandar Kartelj:
A Three-Stage Algorithm for the Closest String Problem on Artificial and Real Gene Sequences. CoRR abs/2407.13023 (2024) - 2023
- [j14]Stefan Kapunac, Aleksandar Kartelj, Marko Djukanovic:
Variable neighborhood search for weighted total domination problem and its application in social network information spreading. Appl. Soft Comput. 143: 110387 (2023) - [j13]Marko Djukanovic
Self-adaptive CMSA for solving the multidimensional multi-way number partitioning problem. Expert Syst. Appl. 232: 120762 (2023) - [j12]Aleksandar Kartelj, Marko Djukanovic:
RILS-ROLS: robust symbolic regression via iterated local search and ordinary least squares. J. Big Data 10(1): 71 (2023) - [j11]Zoran Babovic
Research in computing-intensive simulations for nature-oriented civil-engineering and related scientific fields, using machine learning and big data: an overview of open problems. J. Big Data 10(1): 73 (2023) - [j10]Zoran Babovic
Teaching computing for complex problems in civil engineering and geosciences using big data and machine learning: synergizing four different computing paradigms and four different management domains. J. Big Data 10(1): 89 (2023) - [c5]Milan Predojevic
Variable neighborhood search for solving the k-domination problem. GECCO Companion 2023: 239-242 - 2022
- [j9]Marko Djukanovic, Aleksandar Kartelj, Dragan Matic, Milana Grbic, Christian Blum
Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences. Appl. Soft Comput. 122: 108844 (2022) - [j8]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) - [c4]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
- [c3]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
- [j7]Milan Bankovic
Chapter One - Teaching graduate students how to review research articles and respond to reviewer comments. Adv. Comput. 116: 1-63 (2020) - [j6]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) - [j5]Milana Grbic
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) - [c2]Milana Grbic, Vukasin Crnogorac, Milan Predojevic, Aleksandar Kartelj, Dragan Matic:
How well are known protein complexes supported in PPI networks? INISTA 2020: 1-7 - [i3]Aleksandar Kartelj, Vladimir Filipovic, Sinisa T. Vrecica, Rade T. Zivaljevic:
Topologically sensitive metaheuristics. CoRR abs/2002.11164 (2020)
2010 – 2019
- 2019
- [i2]Jozef Kratica, Vladimir Filipovic
An Integer Linear Programming Formulation for the Convex Dominating Set Problems. CoRR abs/1904.02541 (2019) - 2018
- [i1]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) - 2015
- [j4]Aleksandar Kartelj:
An Improved Electromagnetism-like Method for Feature Selection. J. Multiple Valued Log. Soft Comput. 25(2-3): 169-187 (2015) - 2014
- [j3]Aleksandar Kartelj
Case-based reasoning and electromagnetism-like method in construction management. Kybernetes 43(2): 265-280 (2014) - [j2]Aleksandar Kartelj
Electromagnetism-like algorithm for support vector machine parameter tuning. Soft Comput. 18(10): 1985-1998 (2014) - 2013
- [j1]Vladimir Filipovic
An electromagnetism metaheuristic for solving the Maximum Betweenness Problem. Appl. Soft Comput. 13(2): 1303-1313 (2013) - 2012
- [c1]Aleksandar Kartelj, Vladimir Filipovic, Veljko M. Milutinovic:
Novel approaches to automated personality classification: Ideas and their potentials. MIPRO 2012: 1017-1022
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-10-07 22:17 CEST 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: