Login
Lupa
First page / Search the repository

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


11 - 18 / 18
First pagePrevious page12Next pageLast page
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. 19
Martin 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
URL Link to full text

12.
Avoidable vertices and edges in graphs
Jesse 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: 2065; Downloads: 156
URL Link to full text

13.
Detecting strong cliques
Ademir Hujdurović, Martin Milanič, Bernard Ries, 2019, original scientific article

Keywords: strong clique, weakly chordal graph, line graph, cubic graph
Published in RUP: 30.06.2019; Views: 2305; Downloads: 208
URL Link to full text

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. 2018
Martin 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: 1682; Downloads: 20
URL 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. 2018
Martin 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: 1886; Downloads: 22
URL Link to full text

16.
Graph classes with and without powers of bounded clique-width
Flavia Bonomo, Luciano Grippo, Martin Milanič, Martin Dario Safe, 2016, original scientific article

Keywords: clique-width, power of a graph, hereditary graph class, power-bounded clique-width
Published in RUP: 03.04.2017; Views: 2273; Downloads: 148
URL Link to full text

17.
Ligand-protein binding and ligand-based virtual screening using maximum clique algorithm
Dušanka Janežič, Janez Konc, 2015, published scientific conference contribution abstract

Keywords: ligand-protein binding, virtual screening, clique algorithm
Published in RUP: 08.08.2016; Views: 2969; Downloads: 39
URL Link to full text

18.
Graphs of separability at most 2
Ferdinando Cicalese, Martin Milanič, 2012, published scientific conference contribution

Keywords: separability, hereditary class, separating clique, decomposition, induced subgraph, induced minor, parsimony haplotyping
Published in RUP: 15.10.2013; Views: 2513; Downloads: 85
URL Link to full text
Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica