Graham Farr

39 papers A 3Journal 35Unranked 1
YearRankTypeTitle / Venue / Authors
2024 A conf
Anytime Approximate Formal Feature Attribution.
SAT
Jinqiang Yu, Graham Farr, Alexey Ignatiev, Peter J. Stuckey
2024 J jnl
Dominic Welsh: his work and influence.
CoRR
Graham Farr, Dillon Mayhew, James G. Oxley
2024 J jnl
Graph polynomials: some questions on the edge.
CoRR
Graham Farr, Kerri Morgan
2024 J jnl
Thrackles, Superthrackles and the Hanani-Tutte Theorem.
J. Graph Algorithms Appl.
Hooman Reisi Dehkordi, Graham Farr
2023 J jnl
Anytime Approximate Formal Feature Attribution.
CoRR
Jinqiang Yu, Graham Farr, Alexey Ignatiev, Peter J. Stuckey
2021 J jnl
Factorisation of Greedoid Polynomials of Rooted Digraphs.
Graphs Comb.
Kai Siong Yow, Kerri Morgan, Graham Farr
2021 J jnl
Non-Separating Planar Graphs.
Electron. J. Comb.
Hooman Reisi Dehkordi, Graham Farr
2021 J jnl
On the Strong Hanani-Tutte Theorem.
Electron. J. Comb.
Hooman Reisi Dehkordi, Graham Farr
2020 J jnl
A survey of repositories in graph theory.
CoRR
Srinibas Swain, C. Paul Bonnington, Graham Farr, Kerri Morgan
2019 J jnl
Short certificates for chromatic equivalence.
J. Graph Algorithms Appl.
Zoë Bukovac, Graham Farr, Kerri Morgan
2019 J jnl
Using Go in teaching the theory of computation.
SIGACT News
Graham Farr
2018 J jnl
Factorisation of Greedoid Polynomials of Rooted Digraphs.
CoRR
Kai Siong Yow, Kerri Morgan, Graham Farr
2018 J jnl
The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar games.
Theor. Comput. Sci.
Graham Farr, Nhan Bao Ho
2018 J jnl
Tutte Invariants for Alternating Dimaps.
CoRR
Kai Siong Yow, Graham Farr, Kerri Morgan
2017 J jnl
Topological containment of the 5-clique minus an edge in 4-connected graphs.
CoRR
Rebecca Robinson, Graham Farr
2016 A conf
Computer History on the Move.
SIGCSE
Graham Farr, A. Barbara Ainsworth, Chris Avram, Judy Sheard
2015 J jnl
Cost-effectiveness of algorithms.
Discret. Math. Theor. Comput. Sci.
Graham Farr
2014 J jnl
Certificates for Properties of Stability Polynomials of Graphs.
Electron. J. Comb.
Ranjie Mo, Graham Farr, Kerri Morgan
2014 J jnl
Graphs with no 7-wheel subdivision.
Discret. Math.
Rebecca Robinson, Graham Farr
2013 J jnl
Graphs with no 7-wheel subdivision.
CoRR
Rebecca Robinson, Graham Farr
2013 J jnl
Search strategies for developing characterizations of graphs without small wheel subdivisions.
CoRR
Rebecca Robinson, Graham Farr
2012 J jnl
Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs.
Electron. J. Comb.
Keith Edwards, Graham Farr
2012 J jnl
Non-bipartite chromatic factors.
Discret. Math.
Kerri Morgan, Graham Farr
2009 J jnl
Certificates of Factorisation for Chromatic Polynomials.
Electron. J. Comb.
Kerri Morgan, Graham Farr
2009 J jnl
Certificates of Factorisation for a Class of Triangle-Free Graphs.
Electron. J. Comb.
Kerri Morgan, Graham Farr
2009 J jnl
Structure and Recognition of Graphs with No 6-wheel Subdivision.
Algorithmica
Rebecca Robinson, Graham Farr
2008 J jnl
On the number of Go positions on lattice graphs.
Inf. Process. Lett.
Graham Farr, Johannes Schmidt
2008 J jnl
Planarization and fragmentability of some classes of graphs.
Discret. Math.
Keith Edwards, Graham Farr
2007 J jnl
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems.
J. Graph Algorithms Appl.
Kerri Morgan, Graham Farr
2006 — conf
On pedagogically sound examples in public-key cryptography.
ACSC
Suan Khai Chong, Graham Farr, Laura Frost, Simon Hawley
2005 J jnl
On monochromatic component size for improper colourings.
Discret. Appl. Math.
Keith Edwards, Graham Farr
2004 J jnl
Some results on generalised Whitney functions.
Adv. Appl. Math.
Graham Farr
2003 J jnl
Skewness of Graphs with Small Cutsets.
Graphs Comb.
Graham Farr, Peter Eades
2001 A conf
An Algorithm for Finding Large Induced Planar Subgraphs.
GD
Keith Edwards, Graham Farr
2001 J jnl
Fragmentability of Graphs.
J. Comb. Theory B
Keith Edwards, Graham Farr
1994 J jnl
On Problems with Short Certificates.
Acta Informatica
Graham Farr
1988 J jnl
The complexity of multicolouring.
Discret. Math.
Graham Farr
1988 J jnl
The subgraph homeomorphism problem for small wheels.
Discret. Math.
Graham Farr
1985 J jnl
The Compexity of Counting Homeomorphs.
Theor. Comput. Sci.
Graham Farr, Colin McDiarmid