Dr Simone Linz
Simone Linz is a Senior Lecturer in the School of Computer Science at the University of Auckland and an Associate Investigator of Te Pūnaha Matatini - The Centre for Complex Systems and Networks (CoRE).
Prior to joining the University of Auckland, she was a Marie Curie Fellow in the School of Mathematics and Statistics at the University of Canterbury and in the Center for Bioinformatics at the University of Tübingen, funded by a Marie Curie International Outgoing Fellowship and awarded by the European Commission.
For more details, see my external homepage.
Research | Current
Mathematical and computational biology; in particular algorithmic and combinatorial problems arising in phylogenetics, i.e. the reconstruction and analysis of evolutionary trees and networks.
Teaching | Current
2020 S1 COMPSCI 720
2120 S2 COMPSCI 220
All teaching material is available on Canvas.
Current PhD students:
- Nguyet Tran (as co-supervisor)
Completed PhD stduents:
- Jonathan Klawitter (as senior supervisor)
- Paul Cordue (as associate supervisor, University of Canterbury)
2019 Co-organizer of a Dagstuhl Seminar on Algorithms and Complexity in Phylogenetics (proposal accepted 02/2019). Co-organizers: Prof. Magnus Bordewich (Durham, UK), Dr Britta Dorn (Tübingen, Germany), and Prof. Rolf Niedermeier (Berlin, Germany). Final Report: here.
2015 Marsden Fund Fast-Start Grant (PI) for three years, awarded by the Royal Society of New Zealand.
2015 Selected participant of the year-long Women in Leadership Programme 2016 at the University of Auckland.
2011 Marie Curie International Outgoing Fellowship for three years, awarded by the European Commission.
School of Computer Science (current only):
- Deputy Head of School (Academic), since 02/2020
- Executive Committee, since 02/2020
- Academic Committee, since 2017 (in various roles including chair since 02/2020)
Faculty of Science (current only):
- Pacific Reference Group, since 02/2020
Selected publications and creative works (Research Outputs)
- Linz, S., & Semple, C. (2020). Caterpillars on three and four leaves are sufficient to reconstruct binary normal networks. Journal of mathematical biology, 81 (4-5), 961-980. 10.1007/s00285-020-01533-7
- Kelk, S., & Linz, S. (2020). New Reduction Rules for the Tree Bisection and Reconnection Distance. ANNALS OF COMBINATORICS, 24 (3), 475-502. 10.1007/s00026-020-00502-7
- Doecker, J., Dorn, B., Linz, S., & Semple, C. (2020). Placing quantified variants of 3-SAT and NOT-ALL-EQUAL 3-SAT in the polynomial hierarchy. THEORETICAL COMPUTER SCIENCE, 822, 72-91. 10.1016/j.tcs.2020.04.003
- Tran, N., Dinneen, M. J., & Linz, S. (2020). Computing close to optimal weighted shortest paths in practice. Proceedings International Conference on Automated Planning and Scheduling, ICAPS.
- Doecker, J., Linz, S., & Semple, C. (2019). Displaying trees across two phylogenetic networks. THEORETICAL COMPUTER SCIENCE, 796, 129-146. 10.1016/j.tcs.2019.09.003
- Kelk, S., & Linz, S. (2019). A tight kernel for computing the tree bisection and reconnection distance between two phylogenetic trees. SIAM Journal on Discrete Mathematics, 33 (3), 1556-1574. 10.1137/18M122724X
- Doecker, J., van Iersel, L., Kelk, S., & Linz, S. (2019). Deciding the existence of a cherry-picking sequence is hard on two trees. DISCRETE APPLIED MATHEMATICS, 260, 131-143. 10.1016/j.dam.2019.01.031
- Klawitter, J., & Linz, S. (2019). On the Subnet Prune and Regraft Distance. ELECTRONIC JOURNAL OF COMBINATORICS, 26 (2)