21. |
22. Avoidable vertices and edges in graphsJesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanič, Mary Agnes Milanič, 2019, objavljeni znanstveni prispevek na konferenci Ključne besede: simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph Objavljeno v RUP: 20.08.2019; Ogledov: 2068; Prenosov: 156 Povezava na celotno besedilo |
23. |
24. |
25. Weighted lambda superstrings applied to vaccine designLuis Martínez, Martin Milanič, Iker Malaina, Carmen Álvarez, Martín-Blas Pérez, Ildefonso M. de la Fuente, 2019, izvirni znanstveni članek Ključne besede: vaccine design, bioinformatics, combinatorial optimization problem, weighted lambda-superstring, integer programming formulation, genetic algorithm, Nef protein Objavljeno v RUP: 13.02.2019; Ogledov: 2550; Prenosov: 165 Povezava na celotno besedilo |
26. O ekstremnih grafih z dano stopnjo in premerom/ožino : doktorska disertacijaSlobodan Filipovski, 2018, doktorska disertacija Ključne besede: adjacency matrix, antipodal graphs, cages, excess, defect, Ramanujan graphs, selfrepeats, degree/diameter problem, spectrum, Moore graphs, asymptotic density, distance matrices, Bermond and Bollobas problem Objavljeno v RUP: 21.01.2019; Ogledov: 2684; Prenosov: 0 |
27. |
28. |
29. 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 |
30. 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č... |