1. |
2. |
3. |
4. Strong cliques in diamond-free graphsNina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, izvirni znanstveni članek Ključne besede: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, strongly perfect graph, CIS graph, NP-hard problem, polynomial-time algorithm, Erdős-Hajnal property Objavljeno v RUP: 17.12.2020; Ogledov: 1744; Prenosov: 77 Povezava na celotno besedilo |
5. Mind the independence gapTinaz Ekim, Didem Gozüpek, Ademir Hujdurović, Martin Milanič, 2020, izvirni znanstveni članek Ključne besede: maximal independent set, independent dominating set, well-covered graph, hereditary independence gap, polynomial-time algorithm, NP-hard problem Objavljeno v RUP: 18.05.2020; Ogledov: 2131; Prenosov: 58 Povezava na celotno besedilo |
6. |
7. Generalizations of simplicial vertices and a new polynomially solvable case of the maximum weight clique problem, National Research University Higher School of Economics, Faculty of Computer Science, Moscow, 21. 8. 19Martin Milanič, 2019, predavanje na tuji univerzi Ključne besede: simplicial vertex, avoidable vertex, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph Objavljeno v RUP: 03.09.2019; Ogledov: 2059; Prenosov: 17 Povezava na celotno besedilo |
8. Avoidable vertices and edges in graphsJesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanič, Mary Agnes Milanič, 2019, objavljeni znanstveni prispevek na konferenci Ključne besede: simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph Objavljeno v RUP: 20.08.2019; Ogledov: 2326; Prenosov: 158 Povezava na celotno besedilo |
9. Bipartite graphs of small readabilityRayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nithin Varma, 2019, izvirni znanstveni članek Ključne besede: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph Objavljeno v RUP: 26.07.2019; Ogledov: 1950; Prenosov: 100 Povezava na celotno besedilo |
10. |