uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Solving necklace constraint problems
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (ASTRA)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. (ASTRA)
2009 (English)In: Journal of Algorithms, ISSN 0196-6774, E-ISSN 1090-2678, Vol. 64, no 2-3, 61-73 p.Article in journal (Refereed) Published
Place, publisher, year, edition, pages
2009. Vol. 64, no 2-3, 61-73 p.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-99476DOI: 10.1016/j.jalgor.2008.10.001ISI: 000266416200001OAI: oai:DiVA.org:uu-99476DiVA: diva2:207973
Available from: 2009-03-14 Created: 2009-03-14 Last updated: 2017-12-13Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Flener, PierrePearson, Justin

Search in DiVA

By author/editor
Flener, PierrePearson, Justin
By organisation
Computing ScienceComputer Systems
In the same journal
Journal of Algorithms
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 609 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf