11. 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: 1739; Downloads: 16 Link to full text |
12. 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: 2068; Downloads: 156 Link to full text |
13. |
14. 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: 1703; Downloads: 20 Link to full text |
15. 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: 1897; Downloads: 22 Link to full text |
16. |
17. |
18. |