Publications (69)
Fine-Grained Analysis of Team Collaborative Dialogue
Ian Perera, Matthew Johnson, Carson Wilber
Natural language analysis of human collaborative chat dialogues is an understudied domain with many unique challenges: a large number of dialogue act labels, underspecified and dyn…
Finding Shortest Paths between Graph Colourings
Matthew Johnson, Dieter Kratsch, Stefan Kratsch +2
The -colouring reconfiguration problem asks whether, for a given graph , two proper -colourings and of , and a positive integer , there exists a sequenc…
Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali +2
We continue research into a well-studied family of problems that ask whether the vertices of a graph can be partitioned into sets and~, where is an independent set and $…
VolTeMorph: Realtime, Controllable and Generalisable Animation of Volumetric Representations
Stephan J. Garbin, Marek Kowalski, Virginia Estellers +5
The recent increase in popularity of volumetric representations for scene reconstruction and novel view synthesis has put renewed focus on animating volumetric content at high visu…
Computing Weighted Subset Transversals in -Free Graphs
Nick Brettell, Matthew Johnson, Daniel Paulusma
For the Odd Cycle Transversal problem, the task is to find a small set of vertices in a graph that intersects every cycle of odd length. The Subset Odd Cycle Transversal proble…
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani +2
Let , and , respectively, denote the size of a minimum vertex cover, minimum feedback vertex set and minimum odd cycle transversal in a graph . One can a…