11. 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: 1739; Prenosov: 16 Povezava na celotno besedilo |
12. |
13. 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: 2068; Prenosov: 156 Povezava na celotno besedilo |
14. 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: 1597; Prenosov: 99 Povezava na celotno besedilo |
15. |
16. 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: 2092; Prenosov: 158 Celotno besedilo (648,51 KB) |
17. |
18. In situ assessment of structural timber using stress-wave measurementsUlrike Dackermann, Keith Crews, Bohumil Kasal, Jianchun Li, Mariapaola Riggio, Frank Rinn, T. Tannert, 2014, izvirni znanstveni članek Ključne besede: timber structures, assessment, stress waves, time-of-flight, tomography, ultrasonic echo Objavljeno v RUP: 19.11.2018; Ogledov: 1995; Prenosov: 176 Povezava na celotno besedilo |
19. |
20. 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: 1994; Prenosov: 67 Povezava na celotno besedilo |