Meyer auf der Heide, F. (1988). Fast algorithms for N-dimensional restrictions of hard problems. Journal of the ACM (JACM), 740–747.https://doi.org/10.1145/44483.44490 
LibreCat: /record/16764
DOI: 10.1145/44483.44490

Meyer auf der Heide, F. (1985). Lower bounds for solving linear diophantine equations on random access machines. Journal of the ACM (JACM), 929–937.https://doi.org/10.1145/4221.4250 
LibreCat: /record/16780
DOI: 10.1145/4221.4250

Meyer auf der Heide, F. (1984). A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem. Journal of the ACM (JACM), 668–676.https://doi.org/10.1145/828.322450 
LibreCat: /record/16785
DOI: 10.1145/828.322450