11. 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: 2094; Prenosov: 158 Celotno besedilo (648,51 KB) |
12. |
13. |
14. Bipartite graphs of small readabilityRayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nidhi Varma Srivastava, 2018, objavljeni znanstveni prispevek na konferenci Ključne besede: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph Objavljeno v RUP: 17.09.2018; Ogledov: 1995; Prenosov: 67 Povezava na celotno besedilo |
15. |
16. |
17. Spread of influence in weighted networks under time and budget constraintsFerdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanič, Joseph Peters, Ugo Vaccaro, 2015, izvirni znanstveni članek Ključne besede: social networks, spread of influence, viral marketing, dynamic monopolies, exact polynomial time algorithm Objavljeno v RUP: 15.10.2015; Ogledov: 2690; Prenosov: 192 Povezava na celotno besedilo |
18. |
19. |