APA (7th ed.) Citation

Ibraheem, A., Kiani, N., Tegner, J., Goos, G., Hartmanis, J., Bertino, E., . . . Karaca, Y. (2027). Algorithmic Complexity Underpins When Path Information Improves Graph Neural Networks Performance on Molecular Graphs. Computational Science and Its Applications – ICCSA 2026 : 26th International Conference, Braga, Portugal, June 30 – July 3, 2026, Proceedings, Part I, 16767, 18. https://doi.org/10.1007/978-3-032-30491-9_2

Chicago Style (17th ed.) Citation

Ibraheem, Abdulrahman, et al. "Algorithmic Complexity Underpins When Path Information Improves Graph Neural Networks Performance on Molecular Graphs." Computational Science and Its Applications – ICCSA 2026 : 26th International Conference, Braga, Portugal, June 30 – July 3, 2026, Proceedings, Part I 16767 (2027): 18. https://doi.org/10.1007/978-3-032-30491-9_2.

MLA (9th ed.) Citation

Ibraheem, Abdulrahman, et al. "Algorithmic Complexity Underpins When Path Information Improves Graph Neural Networks Performance on Molecular Graphs." Computational Science and Its Applications – ICCSA 2026 : 26th International Conference, Braga, Portugal, June 30 – July 3, 2026, Proceedings, Part I, vol. 16767, 2027, p. 18, https://doi.org/10.1007/978-3-032-30491-9_2.