Publisher
Springer Science and Business Media LLC
Subject
Library and Information Sciences,Statistics, Probability and Uncertainty,Psychology (miscellaneous),Mathematics (miscellaneous)
Reference40 articles.
1. Alam, M.J., Fink, M., Pupyrev, S. (2016). The bundled crossing number (pp. 399–412). Cham: Springer International Publishing.
https://doi.org/10.1007/978-3-319-50106-2_31
. ISBN 978-3-319-50106-2.
2. Aronov, B., Erdős, P., Goddard, W., Kleitman, D.J., Klugerman, M., Pach, J., Schulman, L.J. (1994). Crossing families. Combinatorica, 14(2), 127–134.
https://doi.org/10.1007/BF01215345
. ISSN 1439-6912.
3. Bailey, R.F., Newman, M., Stevens, B. (2014). A note on packing spanning trees in graphs and bases in matroids. Australasian Journal of Combinatorics, 59(1), 24–38.
4. Berry, A., & Bordat, J.-P. (1998). Separability generalizes Dirac’s theorem. Discrete Applied Mathematics, 84(1–3), 43–53.
https://doi.org/10.1016/S0166-218X(98)00005-5
. ISSN 0166-218X.
5. Bertsekas, D.P., & Castañon, D.A. (1992). A forward/reverse auction algorithm for asymmetric assignment problems. Computational Optimization and Applications, 1 (3), 277–297. ISSN 0926-6003.