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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Efficient filtering for the unary resource with family-based transition times
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (ASTRA)
2016 (English)In: Principles and Practice of Constraint Programming: CP 2016, Springer, 2016, 520-535 p.Conference paper (Refereed)
Place, publisher, year, edition, pages
Springer, 2016. 520-535 p.
Series
Lecture Notes in Computer Science, 9892
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-309521DOI: 10.1007/978-3-319-44953-1_33ISBN: 978-3-319-44952-4 (print)OAI: oai:DiVA.org:uu-309521DiVA: diva2:1051969
Conference
CP 2016, September 5–9, Toulouse, France
Available from: 2016-08-23 Created: 2016-12-05 Last updated: 2016-12-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Monette, Jean-Noël
By organisation
Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 118 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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