Show simple item record

Authordc.contributor.authorMerino A., Wiese A.
Admission datedc.date.accessioned2022-12-27T15:47:12Z
Available datedc.date.available2022-12-27T15:47:12Z
Publication datedc.date.issued2020
Identifierdc.identifier.issn18688969
Identifierdc.identifier.other10.4230/LIPIcs.ICALP.2020.84
Identifierdc.identifier.urihttps://repositorio.uchile.cl/handle/2250/191039
Lenguagedc.language.isoen
Publisherdc.publisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Type of licensedc.rightsAttribution-NonCommercial-NoDerivs 3.0 Chile
Link to Licensedc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/
Sourcedc.sourceLeibniz International Proceedings in Informatics, LIPIcs
Títulodc.titleOn the two-dimensional knapsack problem for convex polygons
Document typedc.typeArtículo de revista
Catalogueruchile.catalogadorSCOPUS
Indexationuchile.indexArtículo de publicación ISI
Indexationuchile.indexArtículo de publicación SCOPUS
Indexationuchile.indexArtículo de publicación SCIELO
uchile.cosechauchile.cosechaSI


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Chile
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Chile