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: 1932; Prenosov: 20 Povezava na celotno besedilo |
32. |
33. 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: 2001; Prenosov: 67 Povezava na celotno besedilo |
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: 2382; Prenosov: 154 Povezava na celotno besedilo |
35. On split liftings with sectional complementsAleksander Malnič, Rok Požar, 2018, izvirni znanstveni članek Ključne besede: algorithm, Cayley voltages, covering projection, graph, group presentation, invariant section, lifting automorphisms, linear systems over the integers, split extension Objavljeno v RUP: 02.03.2018; Ogledov: 2539; Prenosov: 175 Povezava na celotno besedilo |
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: 2718; Prenosov: 275 Povezava na celotno besedilo Gradivo ima več datotek! Več... |
37. |
38. |
39. |
40. |