1. |
2. |
3. Strong cliques in diamond-free graphsNina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, original scientific article Keywords: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, strongly perfect graph, CIS graph, NP-hard problem, polynomial-time algorithm, Erdős-Hajnal property Published in RUP: 17.12.2020; Views: 1312; Downloads: 43 Link to full text |
4. |
5. Strong cliques in diamond-free graphsNina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, published scientific conference contribution Keywords: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, CIS graph, NP-hard problem, linear-time algorithm, Erdős-Hajnal property Published in RUP: 10.11.2020; Views: 1402; Downloads: 39 Link to full text |
6. Edge elimination and weighted graph classesJesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaž Krnc, Martin Milanič, Nevena Pivač, Robert Scheffler, Martin Strehler, 2020, published scientific conference contribution Keywords: edge elimination, weighted graph, split graph, threshold graph, chain graph, linear-time recognition algorithm Published in RUP: 10.11.2020; Views: 1408; Downloads: 34 Link to full text |
7. Dokaz in identifikacija bakterije Borrelia burgdorferi sensu lato v klopih obalno-kraške in primorsko-notranjske regije : magistrsko deloJana Šušnjar, 2020, master's thesis Keywords: klopi, Borrelia burgdorferi sensu lato, Lajmska borelioza, Ixodes ricinus, kultivacija in osamitev, PCR v realnem času, ticks, Borrelia burgdorferi sensu lato, Lyme borreliosis, Ixodes ricinus, cultivation and isolation, real time PCR Published in RUP: 02.10.2020; Views: 2172; Downloads: 31 Link to full text |
8. |
9. Mind the independence gapTinaz Ekim, Didem Gozüpek, Ademir Hujdurović, Martin Milanič, 2020, original scientific article Keywords: maximal independent set, independent dominating set, well-covered graph, hereditary independence gap, polynomial-time algorithm, NP-hard problem Published in RUP: 19.05.2020; Views: 1653; Downloads: 57 Link to full text |
10. |