Kerri Morgan

Orcid: 0000-0002-7263-8340

According to our database1, Kerri Morgan authored at least 34 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Instance space analysis for the car sequencing problem.
Ann. Oper. Res., October, 2024

Graph polynomials: some questions on the edge.
CoRR, 2024

2023
Shaping a Tool for Developing Computing Students' Professional Identity - Industry Perspectives.
Proceedings of the 45th IEEE/ACM International Conference on Software Engineering: Software Engineering Education and Training, 2023

2022
Structural-functional connectivity bandwidth of the human brain.
NeuroImage, 2022

Finding Maximum Cliques in Large Networks.
CoRR, 2022

On the fifth chromatic coefficient.
Australas. J Comb., 2022

2021
Further results on an abstract model for branching and its application to mixed integer programming.
Math. Program., 2021

Factorisation of Greedoid Polynomials of Rooted Digraphs.
Graphs Comb., 2021

Supernodes.
CoRR, 2021

The maximum happy induced subgraph problem: Bounds and algorithms.
Comput. Oper. Res., 2021

Supernodes: a generalization of the rich-club.
J. Complex Networks, 2021

Allocating Students to Industry Placements Using Integer Programming and Ant Colony Optimisation.
Algorithms, 2021

2020
Large neighbourhood search based on mixed integer programming and ant colony optimisation for car sequencing.
Int. J. Prod. Res., 2020

Observement as Universal Measurement.
CoRR, 2020

A survey of repositories in graph theory.
CoRR, 2020

Tackling the maximum happy vertices problem in large networks.
4OR, 2020

2019
Short certificates for chromatic equivalence.
J. Graph Algorithms Appl., 2019

An algorithm which outputs a graph with a specified chromatic factor.
Discret. Appl. Math., 2019

Comparative Theory for Graph Polynomials (Dagstuhl Seminar 19401).
Dagstuhl Reports, 2019

Finding happiness: An analysis of the maximum happy vertices problem.
Comput. Oper. Res., 2019

2018
Tutte Invariants for Alternating Dimaps.
CoRR, 2018

"Power to the People!": Social Media Discourse on Regional Energy Issues in Australia.
Australas. J. Inf. Syst., 2018

2017
An infinite family of 2-connected graphs that have reliability factorisations.
Discret. Appl. Math., 2017

Algebraic Properties of Chromatic Roots.
Electron. J. Comb., 2017

Practical adaptive search trees with performance bounds.
Proceedings of the Australasian Computer Science Week Multiconference, 2017

2014
Certificates for Properties of Stability Polynomials of Graphs.
Electron. J. Comb., 2014

Algebraic invariants arising from the chromatic polynomials of theta graphs.
Australas. J Comb., 2014

Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs.
Proceedings of the IEEE Pacific Visualization Symposium, 2014

2012
Galois groups of chromatic polynomials.
LMS J. Comput. Math., 2012

Non-bipartite chromatic factors.
Discret. Math., 2012

2011
Pairs of Chromatically Equivalent Graphs.
Graphs Comb., 2011

2009
Certificates of Factorisation for a Class of Triangle-Free Graphs.
Electron. J. Comb., 2009

Certificates of Factorisation for Chromatic Polynomials.
Electron. J. Comb., 2009

2007
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems.
J. Graph Algorithms Appl., 2007


  Loading...