APA (7th ed.) Citation

Binucci, C., Liotta, G., Montecchiani, F., Ortali, G., & Piselli, T. (2025). On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. Journal of graph algorithms and applications, 29(1), 247-266. https://doi.org/10.7155/jgaa.v29i1.2921

Chicago Style (17th ed.) Citation

Binucci, Carla, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, and Tommaso Piselli. "On the Parameterized Complexity of Computing St-Orientations with Few Transitive Edges." Journal of Graph Algorithms and Applications 29, no. 1 (2025): 247-266. https://doi.org/10.7155/jgaa.v29i1.2921.

MLA (9th ed.) Citation

Binucci, Carla, et al. "On the Parameterized Complexity of Computing St-Orientations with Few Transitive Edges." Journal of Graph Algorithms and Applications, vol. 29, no. 1, 2025, pp. 247-266, https://doi.org/10.7155/jgaa.v29i1.2921.