default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKerri Morgan
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Yuan Sun
, Samuel Esler, Dhananjay R. Thiruvady, Andreas T. Ernst, Xiaodong Li, Kerri Morgan:
Instance space analysis for the car sequencing problem. Ann. Oper. Res. 341(1): 41-69 (2024)- [i10]Graham Farr, Kerri Morgan:
Graph polynomials: some questions on the edge. CoRR abs/2406.15746 (2024) - 2023
- [c3]Laura Tubino, Kerri Morgan, Guy Wood-Bradley, Andrew Cain:
Shaping a Tool for Developing Computing Students' Professional Identity - Industry Perspectives. SEET@ICSE 2023: 302-307 - 2022
- [j23]Daniel Delbourgo, Kerri Morgan:
On the fifth chromatic coefficient. Australas. J Comb. 84: 56-85 (2022) - [j22]Nicholas Parsons, Julien Ugon, Kerri Morgan, Sergiy Shelyag, Alex Hocking, Su Yuan Chan, Govinda R. Poudel, Juan Dominguez Duque, Karen Caeyenberghs:
Structural-functional connectivity bandwidth of the human brain. NeuroImage 263: 119659 (2022) - [i9]Su Yuan Chan, Kerri Morgan, Julien Ugon:
Finding Maximum Cliques in Large Networks. CoRR abs/2207.13010 (2022) - 2021
- [j21]Dhananjay R. Thiruvady, Kerri Morgan, Susan E. Bedingfield, Asef Nazari:
Allocating Students to Industry Placements Using Integer Programming and Ant Colony Optimisation. Algorithms 14(8): 219 (2021) - [j20]Su Yuan Chan, Kerri Morgan, Nicholas Parsons, Julien Ugon:
Supernodes: a generalization of the rich-club. J. Complex Networks 10(1) (2021) - [j19]Rhyd Lewis, Dhananjay R. Thiruvady, Kerri Morgan:
The maximum happy induced subgraph problem: Bounds and algorithms. Comput. Oper. Res. 126: 105114 (2021) - [j18]Kai Siong Yow, Kerri Morgan, Graham Farr:
Factorisation of Greedoid Polynomials of Rooted Digraphs. Graphs Comb. 37(6): 2245-2264 (2021) - [j17]Daniel Anderson, Pierre Le Bodic, Kerri Morgan:
Further results on an abstract model for branching and its application to mixed integer programming. Math. Program. 190(1): 811-841 (2021) - [i8]Su Yuan Chan, Kerri Morgan, Nick Parsons, Julien Ugon:
Supernodes. CoRR abs/2108.10458 (2021) - 2020
- [j16]Dhananjay R. Thiruvady, Rhyd Lewis, Kerri Morgan:
Tackling the maximum happy vertices problem in large networks. 4OR 18(4): 507-527 (2020) - [j15]Dhananjay R. Thiruvady, Kerri Morgan, Amiza Amir, Andreas T. Ernst:
Large neighbourhood search based on mixed integer programming and ant colony optimisation for car sequencing. Int. J. Prod. Res. 58(9): 2696-2711 (2020) - [i7]Srinibas Swain, C. Paul Bonnington, Graham Farr, Kerri Morgan:
A survey of repositories in graph theory. CoRR abs/2006.12741 (2020) - [i6]Yuan Sun, Samuel Esler, Dhananjay R. Thiruvady, Andreas T. Ernst, Xiaodong Li, Kerri Morgan:
Instance Space Analysis for the Car Sequencing Problem. CoRR abs/2012.10053 (2020) - [i5]David G. Green, Kerri Morgan, Marc Cheong:
Observement as Universal Measurement. CoRR abs/2012.12095 (2020)
2010 – 2019
- 2019
- [j14]Rhyd Lewis, Dhananjay R. Thiruvady, Kerri Morgan:
Finding happiness: An analysis of the maximum happy vertices problem. Comput. Oper. Res. 103: 265-276 (2019) - [j13]Daniel Delbourgo, Kerri Morgan:
An algorithm which outputs a graph with a specified chromatic factor. Discret. Appl. Math. 257: 128-150 (2019) - [j12]Zoë Bukovac, Graham Farr, Kerri Morgan:
Short certificates for chromatic equivalence. J. Graph Algorithms Appl. 23(2): 227-269 (2019) - [i4]Joanna A. Ellis-Monaghan, Andrew J. Goodall, Iain Moffatt, Kerri Morgan:
Comparative Theory for Graph Polynomials (Dagstuhl Seminar 19401). Dagstuhl Reports 9(9): 135-155 (2019) - 2018
- [j11]Kerri Morgan, Marc Cheong, Susan E. Bedingfield:
"Power to the People!": Social Media Discourse on Regional Energy Issues in Australia. Australas. J. Inf. Syst. 22 (2018) - [i3]Kai Siong Yow, Graham Farr, Kerri Morgan:
Tutte Invariants for Alternating Dimaps. CoRR abs/1803.05539 (2018) - [i2]Kai Siong Yow, Kerri Morgan, Graham Farr:
Factorisation of Greedoid Polynomials of Rooted Digraphs. CoRR abs/1809.02924 (2018) - 2017
- [j10]Peter J. Cameron, Kerri Morgan:
Algebraic Properties of Chromatic Roots. Electron. J. Comb. 24(1): 1 (2017) - [j9]Kerri Morgan, Rui Chen:
An infinite family of 2-connected graphs that have reliability factorisations. Discret. Appl. Math. 218: 123-127 (2017) - [c2]Kevin Fray, Kerri Morgan, Anthony Wirth, Justin Zobel:
Practical adaptive search trees with performance bounds. ACSW 2017: 23:1-23:8 - 2014
- [j8]Daniel Delbourgo, Kerri Morgan:
Algebraic invariants arising from the chromatic polynomials of theta graphs. Australas. J Comb. 59: 293-310 (2014) - [j7]Ranjie Mo, Graham Farr, Kerri Morgan:
Certificates for Properties of Stability Polynomials of Graphs. Electron. J. Comb. 21(1): 1 (2014) - [c1]Tim Dwyer, Christopher Mears, Kerri Morgan, Todd Niven, Kim Marriott, Mark Wallace:
Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs. PacificVis 2014: 105-112 - 2013
- [i1]Tim Dwyer, Christopher Mears, Kerri Morgan, Todd Niven, Kim Marriott, Mark Wallace:
Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs. CoRR abs/1311.6996 (2013) - 2012
- [j6]Kerri Morgan, Graham Farr:
Non-bipartite chromatic factors. Discret. Math. 312(6): 1166-1170 (2012) - [j5]Kerri Morgan:
Galois groups of chromatic polynomials. LMS J. Comput. Math. 15: 281-307 (2012) - 2011
- [j4]Kerri Morgan:
Pairs of Chromatically Equivalent Graphs. Graphs Comb. 27(4): 547-556 (2011)
2000 – 2009
- 2009
- [j3]Kerri Morgan, Graham Farr:
Certificates of Factorisation for Chromatic Polynomials. Electron. J. Comb. 16(1) (2009) - [j2]Kerri Morgan, Graham Farr:
Certificates of Factorisation for a Class of Triangle-Free Graphs. Electron. J. Comb. 16(1) (2009) - 2007
- [j1]Kerri Morgan, Graham Farr:
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems. J. Graph Algorithms Appl. 11(1): 165-193 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
