# Home

## Contact

Address: Department of Computer Science,

Durham University, Upper Mountjoy, Durham, DH1 3LE, UK

Office: MCS2010

Email: [email protected]

#### Biography

- (2014-2018) MEng Degree in Discrete Mathematics at the University of Warwick.
- (2018-2022) PhD at Durham University under the supervision of Barnaby Martin and Daniel Paulusma

#### Research

My research interests lie mainly in graph theory and algorithms.

#### Publications

J**ournal Publications**

W. Kern, B. Martin, D. Paulusma, S. Smith and E.J. van Leeuwen, Disjoint paths and connected subgraphs for H-free graphs, to appear in *Theoretical Computer Science* doi.

B. Martin, D. Paulusma and S. Smith, Hard problems that quickly become very easy, *Information Processing Letters* **174** (2022) doi.

**Conference Papers**

C. Brause, P.A. Golovach, B. Martin, D. Paulusma and S. Smith, Partitioning H-free graphs of bounded diameter, *Proceedings of the 32nd International Symposium on Algorithms and Computation* (ISAAC 2021), Fukuoka, Japan, December 6-8, 2021, Leibniz International Proceedings in Informatics, to appear.

B. Larose, P. Markovic, B. Martin, D. Paulusma, S. Smith, and S. Zivny, QCSP on Reflexive Tournaments, Proceedings of the 29th Annual European Symposium on Algorithms (ESA 2021), Lisbon, Portugal, September 6-8, 2021, Leibniz International Proceedings in Informatics, to appear.

W. Kern, B. Martin, D. Paulusma, S. Smith and E.J. van Leeuwen, Disjoint paths and connected subgraphs for H-free graphs, Proceedings of the 32nd International Workshop on Combinatorial Algorithms (IWOCA 2021), Ottawa, Canada, July 5-8, 2021, Lecture Notes in Computer Science 12757, 414-427, IWOCA 2021.

J. Bok, N. Jedlickova, B. Martin, D. Paulusma and S. Smith, Injective colouring for H-free graphs, Proceedings of the 16th International Computer Science Symposium in Russia (CSR 2021), Sochi, Russia, June 28-July 2, 2021, Sochi, Russia, Lecture Notes in Computer Science 12730, 18-30 , CSR 2021.

C. Brause, P.A. Golovach, B. Martin, D. Paulusma and S. Smith, Acyclic, Star, and Injective Colouring: Bounding the Diameter, Proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2021), Warsaw, Poland, June 23-25, 2021, Lecture Notes in Computer Science, to appear.

B. Martin, D. Paulusma and S. Smith, Colouring Graphs of Bounded Diameter in the Absence of Small Cycles., Proceedings of the 12th International Conference on Algorithms and Complexity (CIAC 2021), Larnaca, Cyprus, May 10-12, 2021, Lecture Notes in Computer Science 12701, 367-380

J. Bok, N. Jedlickova, B. Martin, D. Paulusma and S. Smith, Acyclic, star and injective colouring: A complexity picture for H-free graphs, *Proceedings of the 28th Annual European Symposium on Algorithms* (ESA 2020), Pisa, Italy, September 7-9, 2020, Leibniz International Proceedings in Informatics 173, 22:1-22:22

B. Martin, D. Paulusma and S. Smith, Colouring H-free Graphs of Bounded Diameter, *Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)*, Aachen, Germany, August 26-30, 2019, Leibniz International Proceedings in Informatics 138, 14:1-14:14.

**Submitted Journal Papers**

J. Bok, N. Jedlickova, B. Martin, P. Ochem, D. Paulusma and S. Smith, Acyclic, star and injective colouring: a complexity picture for H-free graphs.

C. Brause, P.A. Golovach, B. Martin, P. Ochem, D. Paulusma and S. Smith, Acyclic, star and injective colouring: bounding the diameter

B. Martin, D. Paulusma and S. Smith, Colouring graphs of bounded diameter in the absence of small cycles.

C. Brause, P.A. Golovach, B. Martin, D. Paulusma and S. Smith, Partitioning H-free graphs of bounded diameter.

B. Larose, P. Markovic, B. Martin, D. Paulusma, S. Smith, and S. Zivny, QCSP on reflexive tournaments.

**Other Manuscripts**

G. Berthe, B. Martin, D. Paulusma and S. Smith, The complexity of L (p, q)-Edge-Labelling

#### Teaching

Since 2018/2019, I have been a demonstrator together with Chris Lindop and Giacomo Paesani for the module Mathematics for Computer Science.

All materials are on Duo.