1. |
2. |
3. Point-ellipse configurations and related topicsGábor Gévay, Nino Bašić, Jurij Kovič, Tomaž Pisanski, 2021, izvirni znanstveni članek Ključne besede: point-line configuration, conic section, point-ellipse configuration, point-conic configuration, Levi graph, Carnot's theorem
Objavljeno v RUP: 18.10.2021; Ogledov: 1253; Prenosov: 21
 Povezava na celotno besedilo |
4. |
5. Chandgotia, Nishant, Pak, Igor, Tassy, Martin: Kirszbraun-type theorems for graphs. (English summary). - J. Combin. Theory Ser. B 137 (2019), 10-24Safet Penjić, 2020, recenzija, prikaz knjige, kritika Ključne besede: G-Kirszbraun graphs, vertex-transitive graph, Kirszbraun theorem
Objavljeno v RUP: 16.04.2020; Ogledov: 1472; Prenosov: 20
Povezava na celotno besedilo |
6. |
7. 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: 1962; Prenosov: 119
Povezava na celotno besedilo |
8. 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: 1888; Prenosov: 78
 Celotno besedilo (1,44 MB)
Gradivo ima več datotek! Več... |
9. 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: 1882; Prenosov: 20
Povezava na celotno besedilo |
10. 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: 2342; Prenosov: 154
Povezava na celotno besedilo |
