Citace podle APA (7th ed.)

Chalermsook, P., Laekhanukit, B., & Nanongkai, D. (2013, October). Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. Annual Symposium on Foundations of Computer Science, 370-379. https://doi.org/10.1109/FOCS.2013.47

Citace podle Chicago (17th ed.)

Chalermsook, Parinya, Bundit Laekhanukit, a Danupon Nanongkai. "Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses." Annual Symposium on Foundations of Computer Science Oct. 2013: 370-379. https://doi.org/10.1109/FOCS.2013.47.

Citace podle MLA (9th ed.)

Chalermsook, Parinya, et al. "Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses." Annual Symposium on Foundations of Computer Science, Oct. 2013, pp. 370-379, https://doi.org/10.1109/FOCS.2013.47.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..