91. 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č... |
92. 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 |
93. |
94. 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 |
95. MIPUP : minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILPEdin Husić, Xinyue Li, Ademir Hujdurović, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanič, Alexandru I. Tomescu, 2018, izvirni znanstveni članek Ključne besede: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, integer linear programming Objavljeno v RUP: 17.09.2018; Ogledov: 2076; Prenosov: 112 Povezava na celotno besedilo |
96. |
97. |
98. 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 |
99. A three-person deterministic graphical game without Nash equilibriaEndre Boros, Vladimir Gurvich, Martin Milanič, Vladimir Oudalov, Jernej Vičič, 2018, izvirni znanstveni članek Opis: We give an example of a three-person deterministic graphical game that has no Nash equilibrium in pure stationary strategies. The game has seven positions, four outcomes (a unique cycle and three terminal positions), and its normal form is of size only. Thus, the example strengthens significantly the one obtained in 2014 by Gurvich and Oudalov; the latter has four players, five terminals, and normal form of size . Furthermore, our example is minimal with respect to the number of players. Somewhat similar examples were known since 1975, but they were not related to deterministic graphical games. The small size of our example allows us to verify that it has no Nash equilibrium not only in pure but also in independently mixed (so-called behavioral) strategies. For independently mixed strategies two distinct effective payoffs can be considered: along with the classical Markovian evaluation, we also consider a priori evaluation, which may be a better fit for playing in behavioral strategies Ključne besede: deterministic graphical multi-person game, perfect information, Nash equilibrium, directed cycle, terminal position, pure stationary strategy Objavljeno v RUP: 30.03.2018; Ogledov: 3461; Prenosov: 173 Povezava na celotno besedilo |
100. On two extensions of equimatchable graphsZakir Deniz, Tinaz Ekim, Tatiana Romina Hartinger, Martin Milanič, Mordechai Shalom, 2017, izvirni znanstveni članek Ključne besede: minimum maximal matching, equimatchable graph, edge dominating set, Gallai-Edmonds decomposition, parameterized complexity Objavljeno v RUP: 29.01.2018; Ogledov: 2276; Prenosov: 146 Povezava na celotno besedilo |