VILIM, P., BARTAK, R., & CEPEK, O. (2005, Januar 1). Extension of O(n log n) filtering algorithms for the unary resource constraint to optional activities. 10(4). Heidelberg: Springer, 2005. Abgerufen von http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17266049
ISO-690 (author-date, English)VILIM, Petr, BARTAK, Roman und CEPEK, Ondrej, 2005. Extension of O(n log n) filtering algorithms for the unary resource constraint to optional activities. In: [online]. Heidelberg: Springer, 2005. 1 Januar 2005. Available from: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17266049
Modern Language Association 9th editionVILIM, P., R. BARTAK, und O. CEPEK. Extension of O(n log n) filtering algorithms for the unary resource constraint to optional activities. Nr. 4, Heidelberg: Springer, 2005., 2005, http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17266049.
Mohr Siebeck - Recht (Deutsch - Österreich)Emerald - Harvard
VILIM, P., BARTAK, R. und CEPEK, O. (2005), „Extension of O(n log n) filtering algorithms for the unary resource constraint to optional activities“, in , Bd. 10, Heidelberg: Springer, 2005., verfügbar unter: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17266049.