American Psychological Association 6th edition

Kamiński, M., & Milanič, M. (2015). On the complexity of the identifiable subgraph problem. Discrete Applied Mathematics, 182, 25-33. https://doi.org/10.1016/j.dam.2014.10.021

ISO-690 (author-date, English)

KAMIŃSKI, Marcin and MILANIČ, Martin, 2015. On the complexity of the identifiable subgraph problem. Discrete Applied Mathematics. 19 February 2015. Vol. 182, , p. 25-33. DOI 10.1016/j.dam.2014.10.021.

Modern Language Association 9th edition

Kamiński, M., and M. Milanič. “On the Complexity of the Identifiable Subgraph Problem”. Discrete Applied Mathematics, vol. 182, Feb. 2015, pp. 25-33, https://doi.org/10.1016/j.dam.2014.10.021.

Mohr Siebeck - Recht (Deutsch - Österreich)

Kamiński, Marcin/Milanič, Martin: On the complexity of the identifiable subgraph problem, Discrete Applied Mathematics 2015, 25-33.

Emerald - Harvard

Kamiński, M. and Milanič, M. (2015), “On the complexity of the identifiable subgraph problem”, Discrete Applied Mathematics, Vol. 182, pp. 25-33.

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