American Psychological Association 6th edition

MIELIKÄINEN, T., & UKKONEN, E. (2006, January 1). The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization. 154(4). Amsterdam; Lausanne; New York, NY: Elsevier, 2006. Retrieved from http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17554865

ISO-690 (author-date, English)

MIELIKÄINEN, Taneli and UKKONEN, Esko, 2006. The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization. In: [online]. Amsterdam; Lausanne; New York, NY: Elsevier, 2006. 1 January 2006. Available from: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17554865

Modern Language Association 9th edition

MIELIKÄINEN, T., and E. UKKONEN. The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization. no. 4, Amsterdam; Lausanne; New York, NY: Elsevier, 2006., 2006, http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17554865.

Mohr Siebeck - Recht (Deutsch - Österreich)

Emerald - Harvard

MIELIKÄINEN, T. and UKKONEN, E. (2006), “The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization”, in , Vol. 154, Amsterdam; Lausanne; New York, NY: Elsevier, 2006., available at: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=17554865.

Warning: These citations may not always be 100% accurate.