Bojikian, N., Chekan, V., Hegerfeld, F., Kratsch, S., & Kratsch, N. B. a. V. C. a. F. H. a. S. (2023). Tight Bounds for Connectivity Problems Parameterized by Cutwidth. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Chicago Style (17th ed.) CitationBojikian, Narek, Vera Chekan, Falko Hegerfeld, Stefan Kratsch, and Narek Bojikian and Vera Chekan and Falko Hegerfeld and Stefan Kratsch. Tight Bounds for Connectivity Problems Parameterized by Cutwidth. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023.
MLA (9th ed.) CitationBojikian, Narek, et al. Tight Bounds for Connectivity Problems Parameterized by Cutwidth. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023.
Warning: These citations may not always be 100% accurate.