21. 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: 1983; Prenosov: 119 Povezava na celotno besedilo |
22. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremAdemir Hujdurović, Martin Milanič, Edin Husić, Romeo Rizzi, Alexandru I. Tomescu, 2018, 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: 1908; Prenosov: 78 Celotno besedilo (1,44 MB) Gradivo ima več datotek! Več... |
23. MIPUP : minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILPEdin Husić, Xinyue Li, Ademir Hujdurović, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanič, Alexandru I. Tomescu, 2018, izvirni znanstveni članek Ključne besede: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, integer linear programming Objavljeno v RUP: 17.09.2018; Ogledov: 2061; Prenosov: 112 Povezava na celotno besedilo |
24. Ma, Xuanlong, Fu, Ruiqin, Lu, Xuefei: On the independence number of the power graph of a finite group. (English summary). - Indag. Math. (N.S.) 29 (2018), no. 2, 794-806. (electronic)Ademir Hujdurović, 2018, recenzija, prikaz knjige, kritika Objavljeno v RUP: 31.07.2018; Ogledov: 1790; Prenosov: 16 Povezava na celotno besedilo |
25. |
26. Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theoremAdemir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2018, izvirni znanstveni članek Ključne besede: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness Objavljeno v RUP: 08.05.2018; Ogledov: 2361; Prenosov: 154 Povezava na celotno besedilo |
27. |
28. |
29. |
30. |