Kerri Morgan
Kerri Morgan
Verified email at
Cited by
Cited by
Improved optimal and approximate power graph compression for clearer visualisation of dense graphs
T Dwyer, C Mears, K Morgan, T Niven, K Marriott, M Wallace
2014 IEEE Pacific Visualization Symposium, 105-112, 2014
Finding happiness: an analysis of the maximum happy vertices problem
R Lewis, D Thiruvady, K Morgan
Computers & Operations Research 103, 265-276, 2019
Certificates of factorisation for chromatic polynomials
K Morgan, G Farr
the electronic journal of combinatorics, R74-R74, 2009
Algebraic properties of chromatic roots
PJ Cameron, K Morgan
The Electronic Journal of Combinatorics, P1. 21-P1. 21, 2017
Algebraic aspects of the chromatic polynomial
KJA Morgan
Monash University, 2010
Certificates of factorisation for a class of triangle-free graphs
K Morgan, G Farr
the electronic journal of combinatorics, R75-R75, 2009
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems.
K Morgan, G Farr
J. Graph Algorithms Appl. 11 (1), 165-193, 2007
Large neighbourhood search based on mixed integer programming and ant colony optimisation for car sequencing
D Thiruvady, K Morgan, A Amir, AT Ernst
International Journal of Production Research 58 (9), 2696-2711, 2020
“Power to the People!”: Social Media Discourse on Regional Energy Issues in Australia
K Morgan, M Cheong, S Bedingfield
Australasian Journal of Information Systems 22, 2018
Pairs of chromatically equivalent graphs
K Morgan
Graphs and combinatorics 27 (4), 547-556, 2011
Algebraic properties of chromatic roots
PJ Cameron, K Morgan
arXiv preprint arXiv:1610.00424, 2016
Algebraic invariants arising from the chromatic polynomials of theta graphs
D Delbourgo, K Morgan
CMSA (Inc.) 59 (2), 293-310, 2014
Galois groups of chromatic polynomials
K Morgan
LMS Journal of Computation and Mathematics 15, 281-307, 2012
Non-bipartite chromatic factors
K Morgan, G Farr
Discrete Mathematics 312 (6), 1166-1170, 2012
Relational sensibilities and women's participation in computer science and information technology degrees: A cultural-historical approach
M Adams, K Morgan
Learning, Culture and Social Interaction, 100512, 2021
Certificates for properties of stability polynomials of graphs
R Mo, G Farr, K Morgan
The Electronic Journal of Combinatorics, P1. 66-P1. 66, 2014
Practical adaptive search trees with performance bounds
K Fray, K Morgan, A Wirth, J Zobel
Proceedings of the Australasian Computer Science Week Multiconference, 1-8, 2017
Chromatic factors
K Morgan, G Farr
Submitted, 2009
Further results on an abstract model for branching and its application to mixed integer programming
D Anderson, P Le Bodic, K Morgan
Mathematical Programming 190 (1), 811-841, 2021
Factorisation of greedoid polynomials of rooted digraphs
KS Yow, K Morgan, G Farr
Graphs and Combinatorics, 1-20, 2021
The system can't perform the operation now. Try again later.
Articles 1–20