81. |
82. Engineered bamboo scrimber: Influence of density on the mechanical and water absorption propertiesAnuj Kumar, Tomáš Vlach, Lenka Laiblová, Martin Hrouda, Bohumil Kasal, Jan Tywoniak, Petr Hajek, 2016, izvirni znanstveni članek Ključne besede: biocomposite, mechanical properties, strength, ultrasonics, bamboo scrimber Objavljeno v RUP: 19.11.2018; Ogledov: 1782; Prenosov: 357 Povezava na celotno besedilo |
83. |
84. |
85. |
86. 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: 1669; Prenosov: 20 Povezava na celotno besedilo |
87. 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: 1876; Prenosov: 22 Povezava na celotno besedilo |
88. Branchings in acyclic digraphs, a generalization of Dilworth's theorem, and an application to tumor sequencing : EURO/ALIO, 25-27 June 2018, BologneAdemir Hujdurović, Edin Husić, Xinyue Li, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2018, prispevek na konferenci brez natisa Objavljeno v RUP: 17.09.2018; Ogledov: 1873; Prenosov: 26 Povezava na celotno besedilo |
89. |
90. Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theoremAdemir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2017, objavljeni povzetek znanstvenega prispevka na konferenci Ključne besede: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Objavljeno v RUP: 17.09.2018; Ogledov: 1990; Prenosov: 119 Povezava na celotno besedilo |