Publications

Back to staff profile

  • M. Brazil, M Volz, M Zachariasen, C. Ras, D Thomas. Computing minimum 2-edge-connected Steiner networks in the Euclidean plane. Networks, 89-103, 2018. doi: 10.1002/net.21835.

  • M. Brazil, M Volz, M Zachariasen, C. Ras, D Thomas. New pruning rules for the Steiner tree problem and 2-connected Steiner network problem. Computational Geometry: Theory and Applications, 37-49, 2018. doi: 10.1016/j.comgeo.2018.10.003.

  • C. Ras, C. Burt, A. Costa. Algorithms for the power-p Steiner tree problem in the Euclidean plane. Revista de informatica teorica e aplicada, 25, 28-42, 2018.

  • C. Ras, Konrad Swanepoel, Doreen Anne Thomas. Approximate Euclidean Steiner Trees. Journal of Optimization Theory and Applications, 172, 845-873, 2017. doi: 10.1007/s10957-016-1036-5.

  • Patrick J Andersen, C. Ras. Minimum Bottleneck Spanning Trees with Degree Bounds. Networks, 68, 302-314, 2016. doi: 10.1002/net.21710.

  • M Brazil, C. Ras, DA Thomas. An exact algorithm for the bottleneck 2-connected k-Steiner network problem in L-p planes. Discrete Applied Mathematics, 201, 47-69, 2016. doi: 10.1016/j.dam.2015.07.029.

  • Andrei Kelarev, C. Ras, S. Zhou. Distance labellings of Cayley graphs of semigroups. Semigroup Forum, 91, 611-624, 2015. doi: 10.1007/s00233-015-9748-7.

  • C. Ras. Survivable minimum bottleneck networks. Computational Geometry-Theory and Applications, 50, 17-23, 2015. doi: 10.1016/j.comgeo.2015.06.002.

  • Marcus Brazil, C. Ras, Konrad J Swanepoel, Doreen A Thomas. Generalised k-Steiner Tree Problems in Normed Planes. Algorithmica, 71, 66-86, 2015. doi: 10.1007/s00453-013-9780-5.

  • M. Brazil, C. Ras, D. Thomas. A flow-dependent quadratic Steiner tree problem in the Euclidean plane. Networks, 64, 18-28, 2014. doi: 10.1002/net.21553.

  • M. Brazil, C. Ras, KJ Swanepoel, D. Thomas. The centroid as an estimate for the quadratic min-power centre. University of Groningen, 2014.

  • M. Brazil, C. Ras, D. Thomas. A geometric characterisation of the quadratic min-power centre. European Journal of Operational Research, 233, 34-42, 2014. doi: 10.1016/j.ejor.2013.09.004.

  • MG Volz, M. Brazil, C. Ras, KJ Swanepoel, D. Thomas. The Gilbert arborescence problem. Networks, 61, 238-247, 2013. doi: 10.1002/net.21475.

  • M. Brazil, C. Ras, D. Thomas. Relay augmentation for lifetime extension of wireless sensor networks. IET Wireless Sensor Systems, 3, 145-152, 2013. doi: 10.1049/iet-wss.2012.0126.

  • M. Brazil, C. Ras, D. Thomas. The Bottleneck Biconnected Steiner Network Problem. Proceedings of the 20th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2012), 2012.

  • M. Brazil, C. Ras, D. Thomas. The bottleneck 2-connected k-Steiner network problem for k<2. Discrete Applied Mathematics, 160, 1028-1038, 2012. doi: 10.1016/j.dam.2012.01.006.

  • D. King, C. Ras, S. Zhou. The L(h,1,1)-labelling problem for trees. European Journal of Combinatorics, 31, 1295-1306, 2010. doi: 10.1016/j.ejc.2009.11.006.

  • M. Brazil, C. Ras, D. Thomas. Approximating Minimum Steiner Point Trees in Minkowski Planes. Networks, 56, 244-254, 2010. doi: 10.1002/net.20376.

  • M. Brazil, C. Ras, D. Thomas. A New Algorithm for the Euclidean k-Bottleneck Steiner Problem. Proceedings of the 19th International Symposium on Mathematical Theory of Networks and Systems 2010, 155-160, 2010.

  • E Jonck, JH Hattingh, C. Ras. A characterization of λd,1-minimal trees and other attainable classes. Discrete Mathematics, 309, 2340-2348, 2009. doi: 10.1016/j.disc.2008.05.009.

  • JH Hattinge, E Jonck, C. Ras, JH Hattingh. A class of full $(d,1)$-colorable trees. Australasian Journal of Combinatorics, 45, 277-289, 2009.

  • M. Brazil, C. Ras, D. Thomas. Deterministic deployment of wireless sensor networks. Proceedings of the World Congress on Engineering 2009, 1, 863-868, 2009.

  • JH Hattingh, E Jonck, C. Ras. A class of full (d,1)-colorable trees. Australasian Journal of Combinatorics, 45, 277-289, 2009.

  • E Jonck, JH Hattingh, C. Ras. A characterization of λd, 1-minimal trees and other attainable classes. Discrete Mathematics, 309, 2340-2348, 2009. doi: 10.1016/j.disc.2008.05.009.

  • E Jonck, JH Hattingh, C. Ras. The L(d,1)-hole index of paths and cycles. Utilitas Mathematica: international journal of discrete and combinatorial mathematics and statistical design, 69, 55-64, 2006.