1. |
2. Scaffolding problems revisited : complexity, approximation and fixed parameter tractable algorithms, and some special casesMathias Weller, Annie Chateau, Clément Jean Dallard, Rodolphe Giroudeau, 2018, izvirni znanstveni članek Ključne besede: complexity, approximation, lower bound, kernel, scaffolding, {ISK4, wheel}-free graph Objavljeno v RUP: 11.02.2020; Ogledov: 1419; Prenosov: 61 Povezava na celotno besedilo |
3. |
4. |
5. 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: 2009; Prenosov: 119 Povezava na celotno besedilo |
6. 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: 1936; Prenosov: 78 Celotno besedilo (1,44 MB) Gradivo ima več datotek! Več... |
7. 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 |
8. 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 |
9. 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č... |
10. On geometric Lagrange interpolation by quadratic parametric patchesGašper Jaklič, Jernej Kozak, Marjetka Knez, Vito Vitrih, Emil Žagar, 2008, izvirni znanstveni članek Opis: In the paper, the geometric Lagrange interpolation by quadratic parametric patches is considered. The freedom of parameterization is used to raise the number of interpolated points from the usual 6 up to 10, i.e., the number of points commonly interpolated by a cubic patch. At least asymptotically, the existence of a quadratic geometric interpolant is confirmed for data taken on a parametric surface with locally nonzero Gaussian curvature and interpolation points based upon a three-pencil lattice. Also, the asymptotic approximation order 4 is established. Ključne besede: numerična analiza, interpolacija, aproksimacija, parametrična ploskev, numerical analysis, interpolation, approximation, parametric surface Objavljeno v RUP: 03.04.2017; Ogledov: 2271; Prenosov: 138 Povezava na celotno besedilo |