科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
M
Martin Milanič
University of Primorska
18
H指数
265
论文数
1.5K
被引数
0
相关解读
订阅
收录论文
9
发表时间
发表时间
IF
被引数
Treewidth Versus Clique Number. V. Further Connections With Tree-Independence Number
树宽与团数。V. 与树独立数的进一步联系
Journal of Graph Theory
IF
1
2026-07-01
0
PRE
AI
Hilaire, Claire; Milanic, Martin; Vasic, Dorde
分享
收藏
Linear colorings of graphs
图的线性着色
European Journal of Combinatorics
IF
0.9
2026-05-01
0
PRE
AI
Hilaire, Claire; Krnc, Matjaz; Milanic, Martin; Raymond, Jean-Florent
分享
收藏
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
在具有共同偏好图的不可分物品分配中:最小化总不满意
Networks
IF
1.3
2026-01-01
0
PRE
AI
Chiarelli, Nina; Dallard, Clement; Darmann, Andreas; Lendl, Stefan; Milanic, Martin; Mursic, Peter; Pferschy, Ulrich
分享
收藏
Induced minor models. I. Structural properties and algorithmic consequences
诱导的次级模型。I. 结构性质和算法结果
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
IF
0.9
2025-12-01
0
OA
AI
Bousquet, Nicolas; Dallard, Clement; Dumas, Mael; Hilaire, Claire; Milanic, Martin; Perez, Anthony; Trotignon, Nicolas
分享
收藏
Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph
在共同偏好图下,最小化不可分物品分配中的最大不满意程度
Discrete Optimization
IF
1.6
2025-10-01
0
PRE
AI
Chiarelli, Nina; Dallard, Clement; Darmann, Andreas; Lendl, Stefan; Milanic, Martin; Mursic, Peter; Pferschy, Ulrich
分享
收藏
Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples
从混合肿瘤样本中寻找完美系统发育的复杂性和算法
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS
IF
3.4
2018-01-01
6
OA
AI
Hujdurovic, Ademir; Kacar, Ursa; Milanic, Martin; Ries, Bernard; Tomescu, Alexandru I.
分享
收藏
Complexity results for equistable graphs and related classes
ANNALS OF OPERATIONS RESEARCH
IF
4.5
2010-02-21
10
PRE
AI
Milanic, Martin; Orlin, James; Rudolf, Gabor
分享
收藏
Competitive evaluation of threshold functions in the priced information model
ANNALS OF OPERATIONS RESEARCH
IF
4.5
2009-09-01
5
PRE
AI
Cicalese, Ferdinando; Milanic, Martin
分享
收藏
Perfect phylogenies via the Minimum Uncovering Branching Problem: Efficiently Solvable Cases
通过最小未揭示分支问题求解完美系统发育树:可高效求解的情况
IEEE Transactions on Computational Biology and Bioinformatics
IF
0
0
PRE
AI
Narmina Baghirova; Esther Galby; Martin Milanič
分享
收藏
研究方向
暂无研究方向
合作学者
合作期刊
J
James B. Orlin
H 指数: 59 · 论文数: 268
U
Ulrich Pferschy
H 指数: 34 · 论文数: 194
F
Ferdinando Cicalese
H 指数: 21 · 论文数: 177
B
Bernard Ries
H 指数: 18 · 论文数: 146
A
Alexandru I. Tomescu
H 指数: 18 · 论文数: 200
查看更多