Please use this identifier to cite or link to this item:
http://hdl.handle.net/2067/38065
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Calamoneri, T. | en |
dc.contributor.author | Vocca, Paola | en |
dc.date.accessioned | 2020-10-20T23:00:50Z | - |
dc.date.available | 2020-10-20T23:00:50Z | - |
dc.date.issued | 2005 | en |
dc.identifier.uri | http://hdl.handle.net/2067/38065 | - |
dc.title | On the Approximability of the $L(h,k)$-Labelling Problem on Bipartite Graphs (Extended Abstract) | en |
dc.type | conferenceObject | en |
dc.identifier.doi | 10.1007/11429647_7 | en |
dc.relation.isbn | 3540260528 | en |
dc.relation.journal | Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings | en |
dc.relation.firstpage | 65 | en |
dc.relation.lastpage | 77 | en |
dc.relation.numberofpages | 13 | en |
dc.relation.conferencename | Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings | en |
dc.relation.volume | 3499 | en |
dc.relation.issue | 3499 | en |
dc.type.miur | 273 | en |
dc.publisher.name | Springer Verlag | en |
dc.publisher.place | BERLINO | en |
dc.publisher.country | DEU | en |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
item.openairetype | conferenceObject | - |
Appears in Collections: | D1. Contributo in Atti di convegno |
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