31. |
32. 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: 1471; Prenosov: 98 Povezava na celotno besedilo |
33. |
34. |
35. Linear separation of connected dominating sets in graphsNina Chiarelli, Martin Milanič, 2019, izvirni znanstveni članek Ključne besede: connected dominating set, connected domination, connected-domishold graph, forbidden induced subgraph characterization, split graph, chordal graph, minimal cutset, minimal separator, 1-Sperner hypergraph, threshold hypergraph, threshold Boolean function, polynomial-time algorithm Objavljeno v RUP: 04.04.2019; Ogledov: 1921; Prenosov: 158 Celotno besedilo (648,51 KB) |
36. Weighted lambda superstrings applied to vaccine designLuis Martínez, Martin Milanič, Iker Malaina, Carmen Álvarez, Martín-Blas Pérez, Ildefonso M. de la Fuente, 2019, izvirni znanstveni članek Ključne besede: vaccine design, bioinformatics, combinatorial optimization problem, weighted lambda-superstring, integer programming formulation, genetic algorithm, Nef protein Objavljeno v RUP: 13.02.2019; Ogledov: 2336; Prenosov: 165 Povezava na celotno besedilo |
37. |
38. |
39. Decomposing 1-Sperner hypergraphs, with applications to graphs, Journée-séminaire de combinatoire (équipe CALIN du LIPN, Université Paris-Nord, Villetaneuse), 11. 9. 2018Martin Milanič, 2018, predavanje na tuji univerzi Ključne besede: 1-Sperner hypergraph, threshold hypergraph, decomposition, threshold graph, clique-width Objavljeno v RUP: 30.09.2018; Ogledov: 1532; Prenosov: 19 Povezava na celotno besedilo |
40. Decomposing 1-Sperner hypergraphs, with applications to graphs, Séminaires du Pôle 2 : Optimisation combinatoire, algorithmique", LAMSADE, Université Paris-Dauphine, 17. 9. 2018Martin Milanič, 2018, predavanje na tuji univerzi Ključne besede: 1-Sperner hypergraph, threshold hypergraph, decomposition, threshold graph, clique-width Objavljeno v RUP: 30.09.2018; Ogledov: 1747; Prenosov: 20 Povezava na celotno besedilo |