Author:
Evans William,Köck Kassian,Kobourov Stephen
Publisher
Springer Nature Switzerland
Reference19 articles.
1. https://hubmapconsortium.github.io/ccf-asct-reporter/
2. Ahmed, R., et al.: Splitting vertices in 2-layer graph drawings. IEEE Comput. Graph. Appl. (2023)
3. Baumann, J., Pfretzschner, M., Rutter, I.: Parameterized complexity of vertex splitting to pathwidth at most 1. arXiv preprint arXiv:2302.14725 (2023)
4. LNCS;MA Bekos,2023
5. Bhat, K.V.S.: An $${O}(n^{2.5} \log _2 n)$$ time algorithm for the bottleneck assignment problem. unpublished. AT &T Bell Laboratories, Napiendle, IL (1984)