<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Ahuja, Nitin (D-BRNS-MOP); Baltz, Andreas (D-KIEL-C); Doerr, Benjamin (D-MPI-I); Přívětivý, Aleš (CZ-KARL-AM); Srivastav, Anand (D-KIEL-C): On the minimum load coloring problem. (English summary). - J. Discrete Algorithms 5 (2007), no. 3, 533--545</dc:title><dc:creator>Vesel,	Aleksander	(Avtor)
	</dc:creator><dc:date>2008</dc:date><dc:date>2015-07-10 15:03:21</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>51692</dc:identifier><dc:identifier>UDK: 519.17(049.3)</dc:identifier><dc:identifier>OceCobissID: 50093825</dc:identifier><dc:identifier>COBISS_ID: 14838873</dc:identifier><dc:identifier>NUK URN: URN:SI:UM:DK:CPHUOASC</dc:identifier><dc:language>sl</dc:language></metadata>
