Search the repository

A- | A+ | Print

Query:	search in
	search in
	search in
	search in
Work type:	* old and bologna study programme
Language:
Search in:
Options:	Show only hits with full text
	Reset

1 - 3 / 3

Banff designs: difference methods for coloring incidence graphs
Marco Buratti, Francesca Merola, Anamari Nakić, Christian Rubio-Montiel, 2025, original scientific article

Abstract: We present some results on the harmonious colourings of the Levi graph of a 2-design, focusing on Steiner 2-design. It is easily seen that the harmonious chromatic number of such a Levi graph is at least the number of points of the design: we study and construct Banff designs, that is designs such that this lower bound is attained.
Keywords: Harmonious chromatic number, Levi graph, combinatorial design
Published in RUP: 03.11.2025; Views: 383; Downloads: 6
Full text (426,74 KB)

Weighted lambda superstrings applied to vaccine design
Luis Martínez, Martin Milanič, Iker Malaina, Carmen Álvarez, Martín-Blas Pérez, Ildefonso M. de la Fuente, 2019, original scientific article

Keywords: vaccine design, bioinformatics, combinatorial optimization problem, weighted lambda-superstring, integer programming formulation, genetic algorithm, Nef protein
Published in RUP: 13.02.2019; Views: 6044; Downloads: 172
Link to full text

A combinatorial approach to the design of vaccines
Luis Martínez, Martin Milanič, Leire Legarreta Solaguren, Paul Medvedev, Iker Malaina, Ildefonso M. de la Fuente, 2015, original scientific article

Keywords: razvoj cepiv, kombinatorična optimizacija, celoštevilsko programiranje, hevristika "hillclimbing", problem najkrajšega skupnega nadniza, problem pokritja z množicami, vaccine design, combinatorial optimization, integer programming, hill-climbing, shortest common superstring problem, set cover problem
Published in RUP: 15.10.2015; Views: 5182; Downloads: 147
Link to full text

Search done in 0 sec.