J. Rauch, D. Rautenbach. A greedy heuristic for one-sided crossing minimization based on relative crossing counts. // Information Processing Letters. – 2027. – DOI: 10.1016/j.ipl.2026.106679. – URL: https://doi.org/10.1016/j.ipl.2026.106679
J. Rauch & D. Rautenbach (2027). A greedy heuristic for one-sided crossing minimization based on relative crossing counts. Information Processing Letters. https://doi.org/10.1016/j.ipl.2026.106679
J. Rauch and D. Rautenbach. “A greedy heuristic for one-sided crossing minimization based on relative crossing counts.” Information Processing Letters, 2027. doi:10.1016/j.ipl.2026.106679.
@article{Rauch2027,
title = {A greedy heuristic for one-sided crossing minimization based on relative crossing counts},
author = {Rauch, J. and Rautenbach, D.},
journal = {Information Processing Letters},
year = {2027},
doi = {10.1016/j.ipl.2026.106679},
url = {https://doi.org/10.1016/j.ipl.2026.106679}
}