Focke, J., Hörsch, F., Li, S., & Marx, D. (2025). Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. Discrete & Computational Geometry, 1-60. https://doi.org/10.1007/s00454-025-00782-x
ISO-690 (author-date, English)FOCKE, Jacob, HÖRSCH, Florian, LI, Shaohua and MARX, Dániel, 2025. Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. Discrete & Computational Geometry. 22 October 2025. P. 1-60. DOI 10.1007/s00454-025-00782-x.
Modern Language Association 9th editionFocke, J., F. Hörsch, S. Li, and D. Marx. “Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern”. Discrete & Computational Geometry, Oct. 2025, pp. 1-60, https://doi.org/10.1007/s00454-025-00782-x.
Mohr Siebeck - Recht (Deutsch - Österreich)Focke, Jacob/Hörsch, Florian/Li, Shaohua/Marx, Dániel: Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern, Discrete & Computational Geometry 2025, 1-60.
Emerald - HarvardFocke, J., Hörsch, F., Li, S. and Marx, D. (2025), “Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern”, Discrete & Computational Geometry, pp. 1-60.