11. |
12. Generalizations of simplicial vertices and a new polynomially solvable case of the maximum weight clique problem, National Research University Higher School of Economics, Faculty of Computer Science, Moscow, 21. 8. 19Martin Milanič, 2019, invited lecture at foreign university Keywords: simplicial vertex, avoidable vertex, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph Published in RUP: 03.09.2019; Views: 1738; Downloads: 16 Link to full text |
13. Avoidable vertices and edges in graphsJesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanič, Mary Agnes Milanič, 2019, published scientific conference contribution Keywords: simplicial vertex, avoidable vertex, avoidable edge, avoidable path, maximum weight clique problem, polynomial-time algorithm, hole-cyclically orientable graph Published in RUP: 20.08.2019; Views: 2067; Downloads: 156 Link to full text |
14. Bipartite graphs of small readabilityRayan Chikhi, Vladan Jovičić, Stefan Kratsch, Paul Medvedev, Martin Milanič, Sofya Raskhodnikova, Nithin Varma, 2019, original scientific article Keywords: bipartite graph, readability, bipartite chain graph, polynomial-time algorithm, grid graph Published in RUP: 26.07.2019; Views: 1594; Downloads: 99 Link to full text |
15. |
16. Linear separation of connected dominating sets in graphsNina Chiarelli, Martin Milanič, 2019, original scientific article Keywords: connected dominating set, connected domination, connected-domishold graph, forbidden induced subgraph characterization, split graph, chordal graph, minimal cutset, minimal separator, 1-Sperner hypergraph, threshold hypergraph, threshold Boolean function, polynomial-time algorithm Published in RUP: 04.04.2019; Views: 2086; Downloads: 158 Full text (648,51 KB) |
17. |
18. |
19. 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: 1925; Downloads: 20 Link to full text |
20. |