default search action
Marko Djukanovic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Enrico Iurlano
, Tatjana Zec
Signed double Roman domination on cubic graphs. Appl. Math. Comput. 471: 128612 (2024) - [c10]Jaume Reixach
A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem. EvoStar 2024: 1-15 - [c9]Marko Djukanovic
Efficient Search Algorithms for the Restricted Longest Common Subsequence Problem. ICCS (5) 2024: 58-73 - [i4]Marko Djukanovic, Stefan Kapunac, Aleksandar Kartelj, Dragan Matic:
Graph Protection under Multiple Simultaneous Attacks: A Heuristic Approach. CoRR abs/2403.17108 (2024) - [i3]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) - [i2]Marko Djukanovic, Jaume Reixach, Ana Nikolikj, Tome Eftimov, Aleksandar Kartelj, Christian Blum:
A Learning Search Algorithm for the Restricted Longest Common Subsequence Problem. CoRR abs/2410.12031 (2024) - 2023
- [j9]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) - [j8]Marko Djukanovic
Self-adaptive CMSA for solving the multidimensional multi-way number partitioning problem. Expert Syst. Appl. 232: 120762 (2023) - [j7]Aleksandar Kartelj, Marko Djukanovic:
RILS-ROLS: robust symbolic regression via iterated local search and ordinary least squares. J. Big Data 10(1): 71 (2023) - [c8]Milan Predojevic
Variable neighborhood search for solving the k-domination problem. GECCO Companion 2023: 239-242 - [i1]Enrico Iurlano, Tatjana Zec, Marko Djukanovic, Günther R. Raidl:
Signed double Roman domination on cubic graphs. CoRR abs/2308.01109 (2023) - 2022
- [j6]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) - [j5]Bojan Nikolic
New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem. Comput. Appl. Math. 41(3) (2022) - [c7]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 - 2021
- [j4]Christian Blum
Solving longest common subsequence problems via a transformation to the maximum clique problem. Comput. Oper. Res. 125: 105089 (2021) - [j3]Marko Djukanovic, Christoph Berger, Günther R. Raidl
An A⁎ search algorithm for the constrained longest common subsequence problem. Inf. Process. Lett. 166: 106041 (2021) - [c6]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
- [j2]Marko Djukanovic
Finding Longest Common Subsequences: New anytime A∗ search results. Appl. Soft Comput. 95: 106499 (2020) - [j1]Marko Djukanovic
Anytime algorithms for the longest common palindromic subsequence problem. Comput. Oper. Res. 114 (2020) - [c5]Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum:
On Solving a Generalized Constrained Longest Common Subsequence Problem. OPTIMA 2020: 55-70 - [c4]Matthias Horn, Marko Djukanovic, Christian Blum, Günther R. Raidl:
On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. OPTIMA 2020: 134-149
2010 – 2019
- 2019
- [c3]Marko Djukanovic, Günther R. Raidl, Christian Blum:
A Heuristic Approach for Solving the Longest Common Square Subsequence Problem. EUROCAST (1) 2019: 429-437 - [c2]Marko Djukanovic, Günther R. Raidl, Christian Blum
A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. LOD 2019: 154-167 - 2018
- [c1]Marko Djukanovic, Günther R. Raidl, Christian Blum
Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem. LION 2018: 199-214
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-11-25 22:48 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: