American Psychological Association 6th edition

KASPERSKI, A., & ZIELIŃSKIP. (2011). On the approximability of robust spanning tree problems. Theoretical Computer Science, 412(4-5), 365-374.

ISO-690 (author-date, English)

KASPERSKI, Adam and ZIELIŃSKIPawel, 2011. On the approximability of robust spanning tree problems. Theoretical computer science. 1 January 2011. Vol. 412, no. 4-5, p. 365-374.

Modern Language Association 9th edition

KASPERSKI, A., and ZIELIŃSKIP. “On the Approximability of Robust Spanning Tree Problems”. Theoretical Computer Science, vol. 412, no. 4-5, Jan. 2011, pp. 365-74.

Mohr Siebeck - Recht (Deutsch - Österreich)

KASPERSKI, Adam/ZIELIŃSKIPawel: On the approximability of robust spanning tree problems, Theoretical computer science 2011, 365-374.

Emerald - Harvard

KASPERSKI, A. and ZIELIŃSKIP. (2011), “On the approximability of robust spanning tree problems”, Theoretical Computer Science, Vol. 412 No. 4-5, pp. 365-374.

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