[1]
Binucci, C. et al. 2025. On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. Journal of Graph Algorithms and Applications. 29, 1 (Aug. 2025), 247–266. DOI:https://doi.org/10.7155/jgaa.v29i1.2921.