1. |
2. |
3. Point-ellipse configurations and related topicsGábor Gévay, Nino Bašić, Jurij Kovič, Tomaž Pisanski, 2021, original scientific article Keywords: point-line configuration, conic section, point-ellipse configuration, point-conic configuration, Levi graph, Carnot's theorem Published in RUP: 18.10.2021; Views: 1158; Downloads: 20 Link to full text |
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, review, book review, critique Keywords: G-Kirszbraun graphs, vertex-transitive graph, Kirszbraun theorem Published in RUP: 16.04.2020; Views: 1331; Downloads: 20 Link to full text |
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, published scientific conference contribution abstract Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Published in RUP: 17.09.2018; Views: 1852; Downloads: 119 Link to full text |
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, published scientific conference contribution abstract Keywords: perfect phylogeny, NP-hard problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Published in RUP: 17.09.2018; Views: 1816; Downloads: 77 Full text (1,44 MB) This document has more files! More... |
9. Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theoremMartin Milanič, 2018, published scientific conference contribution abstract (invited lecture) Keywords: perfect phylogeny, NP-hard problem, graph coloring, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, heuristic Published in RUP: 17.09.2018; Views: 1806; Downloads: 20 Link to full text |
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, original scientific article Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, chain partition, Dilworth's theorem, min-max theorem, approximation algorithm, APXhardness Published in RUP: 08.05.2018; Views: 2257; Downloads: 154 Link to full text |