121. |
122. Decomposing 1-Sperner hypergraphs, with applications to graphs, Journée-séminaire de combinatoire (équipe CALIN du LIPN, Université Paris-Nord, Villetaneuse), 11. 9. 2018Martin Milanič, 2018, invited lecture at foreign university Keywords: 1-Sperner hypergraph, threshold hypergraph, decomposition, threshold graph, clique-width Published in RUP: 30.09.2018; Views: 1670; Downloads: 20 Link to full text |
123. Decomposing 1-Sperner hypergraphs, with applications to graphs, Séminaires du Pôle 2 : Optimisation combinatoire, algorithmique", LAMSADE, Université Paris-Dauphine, 17. 9. 2018Martin Milanič, 2018, invited lecture at foreign university Keywords: 1-Sperner hypergraph, threshold hypergraph, decomposition, threshold graph, clique-width Published in RUP: 30.09.2018; Views: 1881; Downloads: 22 Link to full text |
124. |
125. |
126. |
127. 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: 1903; Downloads: 20 Link to full text |
128. |
129. Bipartite graphs of small readabilityRayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nidhi Varma Srivastava, 2018, published scientific conference contribution Keywords: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph Published in RUP: 17.09.2018; Views: 1958; Downloads: 67 Link to full text |
130. |