科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
university of banja luka (unibl)
0
H指数
51
论文数
0
被引数
0
相关解读
订阅
收录论文
10
发表时间
发表时间
IF
被引数
A learning search algorithm for the Restricted Longest Common Subsequence problem
受限最长公共子序列问题的学习搜索算法
EXPERT SYSTEMS WITH APPLICATIONS
IF
7.5
2025-07-01
0
OA
AI
Djukanovic, Marko; Reixach, Jaume; Nikolikj, Ana; Eftimov, Tome; Kartelj, Aleksandar; Blum, Christian
分享
收藏
Graph protection under multiple simultaneous attacks: A heuristic approach
KNOWLEDGE-BASED SYSTEMS
IF
7.6
2025-01-01
0
PRE
AI
Djukanovic, Marko; Kapunac, Stefan; Kartelj, Aleksandar; Matic, Dragan
分享
收藏
Signed double Roman domination on cubic graphs
APPLIED MATHEMATICS AND COMPUTATION
IF
3.4
2024-06-01
0
OA
AI
Iurlano, Enrico; Zec, Tatjana; Djukanovic, Marko; Raidl, Guenther R.
分享
收藏
Self-adaptive CMSA for solving the multidimensional multi-way number partitioning problem
EXPERT SYSTEMS WITH APPLICATIONS
IF
7.5
2023-12-01
3
PRE
AI
Djukanovic, Marko; Kartelj, Aleksandar; Blum, Christian
分享
收藏
Variable neighborhood search for weighted total domination problem and its application in social network information spreading
APPLIED SOFT COMPUTING
IF
6.6
2023-08-01
2
PRE
AI
Kapunac, Stefan; Kartelj, Aleksandar; Djukanovic, Marko
分享
收藏
RILS-ROLS: robust symbolic regression via iterated local search and ordinary least squares
JOURNAL OF BIG DATA
IF
6.4
2023-05-22
5
OA
AI
Kartelj, Aleksandar; Djukanovic, Marko
分享
收藏
Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences
APPLIED SOFT COMPUTING
IF
6.6
2022-06-01
2
OA
AI
Djukanovic, Marko; Kartelj, Aleksandar; Matic, Dragan; Grbic, Milana; Blum, Christian; Raidl, Guenther R.
分享
收藏
Solving longest common subsequence problems via a transformation to the maximum clique problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2021-01-01
12
PRE
AI
Blum, Christian; Djukanovic, Marko; Santini, Alberto; Jiang, Hua; Li, Chu-Min; Manya, Felip; Raidl, Guenter R.
分享
收藏
Finding Longest Common Subsequences: New anytime A* search results
APPLIED SOFT COMPUTING
IF
6.6
2020-10-01
10
PRE
AI
Djukanovic, Marko; Raidl, Guenther R.; Blum, Christian
分享
收藏
Anytime algorithms for the longest common palindromic subsequence problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2020-02-01
4
PRE
AI
Djukanovic, Marko; Raidl, Guenther R.; Blum, Christian
分享
收藏
研究方向
暂时未获取到该数据
合作学者
合作期刊
C
Christian Blum
H 指数: 42 · 论文数: 437
G
Günther R. Raidl
H 指数: 40 · 论文数: 319
F
Felip Manyà
H 指数: 26 · 论文数: 162
T
Tome Eftimov
H 指数: 24 · 论文数: 259
H
Hua Jiang
H 指数: 20 · 论文数: 88
查看更多