13 citations · 18 across the 6 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CC2019★ 2 cited
The Packed Interval Covering Problem is NP-complete
Abdallah Saffidine, Sébastien Lê Cong, Sophie Pinchinat +1
We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.
cs.AI2019★ 3 cited
Foundations of Digital Archæoludology
Cameron Browne, Dennis J. N. J. Soemers, Éric Piette +15
Digital Archaeoludology (DAL) is a new field of study involving the analysis and reconstruction of ancient games from incomplete descriptions and archaeological evidence using mode…