31. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremMartin Milanič, 2018, objavljeni povzetek znanstvenega prispevka na konferenci (vabljeno predavanje) Ključne besede: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Objavljeno v RUP: 17.09.2018; Ogledov: 1929; Prenosov: 20 Povezava na celotno besedilo |
32. 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: 2075; Prenosov: 112 Povezava na celotno besedilo |
33. |
34. 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: 2381; Prenosov: 154 Povezava na celotno besedilo |
35. |
36. The minimum conflict-free row split problem revisitedAdemir Hujdurović, Edin Husić, Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2016, objavljeni znanstveni prispevek na konferenci Ključne besede: #the #minimum conflict-free row split problem, branching, Dilworth's theorem, min-max theorem, approximation algorithm, APX-hardness Objavljeno v RUP: 14.11.2017; Ogledov: 2714; Prenosov: 275 Povezava na celotno besedilo Gradivo ima več datotek! Več... |
37. |
38. |
39. Set graphs. II. Complexity of set graph recognition and similar problemsMartin Milanič, Romeo Rizzi, Alexandru I. Tomescu, 2014, izvirni znanstveni članek Ključne besede: acyclic orientation, extensionality, set graphs, NP-complete problem, #P-complete problem, hyper-extensional digraphs, separating code, open-out-separating code Objavljeno v RUP: 03.04.2017; Ogledov: 2331; Prenosov: 131 Povezava na celotno besedilo |
40. |