Please use this identifier to cite or link to this item: http://hdl.handle.net/2067/38065
DC FieldValueLanguage
dc.contributor.authorCalamoneri, T.en
dc.contributor.authorVocca, Paolaen
dc.date.accessioned2020-10-20T23:00:50Z-
dc.date.available2020-10-20T23:00:50Z-
dc.date.issued2005en
dc.identifier.urihttp://hdl.handle.net/2067/38065-
dc.titleOn the Approximability of the $L(h,k)$-Labelling Problem on Bipartite Graphs (Extended Abstract)en
dc.typeconferenceObjecten
dc.identifier.doi10.1007/11429647_7en
dc.relation.isbn3540260528en
dc.relation.journalStructural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedingsen
dc.relation.firstpage65en
dc.relation.lastpage77en
dc.relation.numberofpages13en
dc.relation.conferencenameStructural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedingsen
dc.relation.volume3499en
dc.relation.issue3499en
dc.type.miur273en
dc.publisher.nameSpringer Verlagen
dc.publisher.placeBERLINOen
dc.publisher.countryDEUen
item.fulltextNo Fulltext-
item.openairetypeconferenceObject-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Appears in Collections:D1. Contributo in Atti di convegno
Show simple item record

Page view(s)

82
Last Week
0
Last month
0
checked on Apr 20, 2024

Google ScholarTM

Check

Altmetric


All documents in the "Unitus Open Access" community are published as open access.
All documents in the community "Prodotti della Ricerca" are restricted access unless otherwise indicated for specific documents