Dr Kerri Morgan

STAFF PROFILE

Position

Senior Lecturer, Computer Science

Faculty

Faculty of Sci Eng & Built Env

Department

School of Info Technology

Campus

Melbourne Burwood Campus

Contact

kerri.morgan@deakin.edu.au
+61 3 924 46427

Publications

Filter by

2022

Supernodes: a generalization of the rich-club

Su Chan, Kerri Morgan, Nicholas Parsons, Julien Ugon

(2022), Vol. 10, pp. 1-18, Journal of Complex Networks, Oxford, Eng., C1

journal article
2021

Assessing mathematics during COVID-19 times

Simon James, Kerri Morgan, Guillermo Pineda Villavicencio, Laura Tubino Larizbeascoa

(2021), pp. 425-442, COVID-19 and education: Learning and teaching in a pandemic-constrained environment, Santa Rosa, Calif., B1

book chapter

Further results on an abstract model for branching and its application to mixed integer programming

D Anderson, P Le Bodic, K Morgan

(2021), Vol. 190, pp. 811-841, Mathematical Programming, C1

journal article

The Maximum Happy Induced Subgraph Problem: Bounds and Algorithms

R Lewis, D Thiruvady, K Morgan

(2021), Vol. 126, pp. 1-15, Computers and Operations Research, Amsterdam, The Netherlands, C1

journal article

Relational sensibilities and women's participation in computer science and information technology degrees: A cultural-historical approach

M Adams, K Morgan

(2021), Vol. 28, pp. 1-12, Learning, Culture and Social Interaction, Amsterdam, The Netherlands, C1

journal article

Factorisation of Greedoid Polynomials of Rooted Digraphs

K Yow, K Morgan, G Farr

(2021), Vol. 37, pp. 2245-2264, Graphs and Combinatorics, C1

journal article

Allocating students to industry placements using integer programming and ant colony optimisation

Dhananjay Thiruvady, Kerri Morgan, Susan Bedingfield, Asef Nazari

(2021), Vol. 14, pp. 1-17, Algorithms, Basel, Switzerland, C1

journal article

Mathematics Yearbook 2021

Simon James, Kerri Morgan, Julien Ugon

(2021), Burwood, VIC, Australia, A7

edited book
2020

Tackling the maximum happy vertices problem in large networks

D Thiruvady, R Lewis, K Morgan

(2020), Vol. 18, pp. 507-527, 4OR, Berlin, Germany, C1

journal article
2019

Finding happiness: an analysis of the maximum happy vertices problem

R Lewis, D Thiruvady, K Morgan

(2019), Vol. 103, pp. 265-276, Computers and operations research, Amsterdam, The Netherlands, C1

journal article

An algorithm which outputs a graph with a specified chromatic factor

D Delbourgo, K Morgan

(2019), Vol. 257, pp. 128-150, Discrete applied mathematics, Amsterdam, The Netherlands, C1

journal article

Large neighbourhood search based on mixed integer programming and ant colony optimisation for car sequencing

D Thiruvady, K Morgan, A Amir, A Ernst

(2019), International journal of production research, Abingdon, Eng., C1

journal article

Short certificates for chromatic equivalence

Zoe Bukovac, Graham Farr, Kerri Morgan

(2019), Vol. 23, pp. 227-269, Journal of graph algorithms and applications, Providence, R.I., C1

journal article

Comparative Theory for Graph Polynomials

Joanna Ellis-Monaghan, Andrew Goodall, Iain Moffatt, Kerri Morgan

(2019), Vol. 9, pp. 135-155, Dagstuhl Reports, Dagstuhl, Germany, E1

conference
2018

"Power to the people!": Social media discourse on regional energy issues in Australia

K Morgan, M Cheong, S Bedingfield

(2018), Vol. 22, Australasian journal of information systems, Bruce, A.C.T., C1

journal article
2017

An infinite family of 2-connected graphs that have reliability factorisations

K Morgan, R Chen

(2017), Vol. 218, pp. 123-127, Discrete applied mathematics, Amsterdam, The Netherlands, C1-1

journal article

Algebraic properties of chromatic roots

P Cameron, K Morgan

(2017), Vol. 24, pp. 1-14, Electronic journal of combinatorics, [Atlanata, Ga.], C1-1

journal article

Practical adaptive search trees with performance bounds

K Morgan, K Fray, A Wirth, J Zobel

(2017), Vol. 23, pp. 1-8, ACSC 2017 : Proceedings of the Australasian Computer Science Week, Geelong, Victoria, E1-1

conference
2014

Algebraic invariants arising from the chromatic polynomials of theta graphs

D Delbourgo, K Morgan

(2014), Vol. 59, pp. 293-310, Australasian journal of combinatorics, St. Lucia, Qld., C1-1

journal article

Certificates for properties of stability polynomials of graphs

R Mo, G Farr, K Morgan

(2014), Vol. 21, pp. 1-25, Electronic journal of combinatorics, [Atlanata, Ga.], C1-1

journal article

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), pp. 105-112, PacificVic 2014 : Proceedings of the 2014 IEEE Pacific Visualization Symposium, Yokohama, Japan, E1-1

conference
2012

Galois groups of chromatic polynomials

K Morgan

(2012), Vol. 15, pp. 281-307, LMS journal of computation and mathematics, Cambridge, Eng., C1-1

journal article

Non-bipartite chromatic factors

K Morgan, G Farr

(2012), Vol. 312, pp. 1166-1170, Discrete mathematics, Amsterdam, The Netherlands, C1-1

journal article
2011

Pairs of chromatically equivalent graphs

K Morgan

(2011), Vol. 27, pp. 547-556, Graphs and combinatorics, Tokyo, Japan, C1-1

journal article
2009

Certificates of factorisation for a class of triangle-free graphs

K Morgan, G Farr

(2009), Vol. 16, pp. 1-14, Electronic Journal of Combinatorics, Atlanta, Ga., C1-1

journal article

Certificates of factorisation for chromatic polynomials

K Morgan, G Farr

(2009), Vol. 16, pp. 1-29, Electronic Journal of Combinatorics, Atlanta, Ga., C1-1

journal article
2007

Approximation algorithms for the maximum induced planar and outerplanar subgraph problems

K Morgan, G Farr

(2007), Vol. 11, pp. 165-193, Journal of Graph Algorithms and Applications, Providence, R.I., C1-1

journal article

Funded Projects at Deakin

No Funded Projects at Deakin found

Supervisions

No completed student supervisions to report