Publications (25)
Kempe Equivalence of Colourings of Cubic Graphs
Carl Feghali, Matthew Johnson, Daniel Paulusma
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
Konrad K. Dabrowski, Francois Dross, Matthew Johnson +1
The Segmented iHMM: A Simple, Efficient Hierarchical Infinite HMM
Ardavan Saeedi, Matthew Hoffman, Matthew Johnson +1
Finding Shortest Paths between Graph Colourings
Matthew Johnson, Dieter Kratsch, Stefan Kratsch +2
Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali +2
Narrowing the Complexity Gap for Colouring ($C_s$,$P_t$)-Free Graphs
Shenwei Huang, Matthew Johnson, Daniël Paulusma
Efficient non-greedy optimization of decision trees
Mohammad Norouzi, Maxwell D. Collins, Matthew Johnson +2
Simple, Distributed, and Accelerated Probabilistic Programming
Dustin Tran, Matthew Hoffman, Dave Moore +5
On a conjecture of Mohar concerning Kempe equivalence of regular graphs
Marthe Bonamy, Nicolas Bousquet, Carl Feghali +1
The nonlinear dynamical stability of infrared modifications of gravity
Richard Brito, Alexandra Terrana, Matthew Johnson +1
Clique-Width for Graph Classes Closed under Complementation
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson +3
A Serial Multilevel Hypergraph Partitioning Algorithm
Foad Lotfifar, Matthew Johnson
Connected Vertex Cover for $(sP_1+P_5)$-Free Graphs
Matthew Johnson, Giacomo Paesani, Daniel Paulusma
A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs
Petr A. Golovach, Matthew Johnson, Daniël Paulusma +1
Independent Feedback Vertex Sets for Graphs of Bounded Diameter
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali +2
Enclosings of Decompositions of Complete Multigraphs in 2-Factorizations
Carl Feghali, Matthew Johnson
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
Konrad K. Dabrowski, Carl Feghali, Matthew Johnson +3
Hereditary Graph Classes: When the Complexities of Colouring and Clique Cover Coincide
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson +1
Finding a Small Number of Colourful Components
Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin +3
Capturing Structure Implicitly from Time-Series having Limited Data
Daniel Emaasit, Matthew Johnson
Tensor Modes in Bigravity: Primordial to Present
Matthew Johnson, Alexandra Terrana
Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity
Nina Chiarelli, Tatiana R. Hartinger, Matthew Johnson +2
A Reconfigurations Analogue of Brooks' Theorem and its Consequences
Carl Feghali, Matthew Johnson, Daniël Paulusma
Independent Feedback Vertex Set for $P_5$-free Graphs
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali +2
ErdÅs-Ko-Rado Theorems for a Family of Trees
Carl Feghali, Matthew Johnson, Daniel Thomas