BENJAMIN MERLIN BUMPUS

I do research at the nexus of mathematics and computer science in the Formal Analysis, Theory and Algorithms group under the supervision of Kitty Meeks . I study graph decompositions and graph connectivity in the context of parameterized algorithms. I am particularly interested in building a theory of decompositions for more general classes of objects than just finite simple graphs. My research involves a blend of graph theory and category theory.

Non-technical research summary: I am interested in finding ways of "splitting up" (decomposing) large objects into small parts in an algorithmically useful way. The idea is that, given some hard computational problem, we solve the problem on the parts and then deduce an answer on the whole.

​

I am finishing my PhD in 2021 and I am looking for Postdoctoral opportunities across Europe in the following areas:

-- graph theory (including digraphs, temporal graphs and infinite graphs)

-- parameterized complexity

-- graph decompositions

-- graph containment relations

-- graph homomorphisms


​

​

​

List of keywords: tree-width, branch-width, rank-width, clique-width, modular decompositions (directed variants of all of these as well), graph minors, graph immersions, vertex minors.

PUBBLICATIONS AND PRE-PRINTS

​

• Edge exploration of temporal graphs. [Bumpus, Meeks] (submitted) We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast with the static case, it is NP-hard to determine whether a given temporal graph is temporally Eulerian even if strong restrictions are placed on the structure of the underlying graph and each edge is active at only three times. However, we do obtain an FPT-algorithm with respect to a new parameter called interval-membership-width which restricts the times assigned to different edges; we believe that this parameter will be of independent interest for other temporal graph problems. Our techniques also allow us to resolve two open question of Akrida, Mertzios and Spirakis [CIAC 2019] concerning a related problem of exploring temporal stars.

• Spined categories: generalizing tree-width beyond graphs. [Bumpus, Kocsis] Here we develop a general theory of categories that admit a functorial invariant called the triangulation functor which generalizes the tree-width of graphs. Our triangulation functor provides a uniform construction for various tree-width-like invariants including hypergraph tree-width, and the tree-width of the modular quotient in the category of modular partition functions.

• Directed branch-width: A directed analogue of tree-width [Bumpus, Meeks, Pettersson] (submitted) We introduce a new digraph width measure called directed branch-width. To do this, we generalize a characterization of graph classes of bounded tree-width in terms of their line graphs to digraphs. We show that problems such as directed Hamilton path and Max-Cut (which are hard when parameterized by other known directed width measures) are in FPT when parameterized by directed branch-width. More generally, we obtain an algorithmic meta-theorem for the model-checking problem for a restricted variant of MSO2-logic on classes of bounded directed branch-width.

​

Past Research Experience: During my undergraduate degree at the University of Stirling, I undertook multiple posts as a research intern. These projects all had industrial and policy applications within the field of mathematical modeling for biology using techniques from evolutionary computing and metaheuristics under the supervision of: Anthony O'Hare, Jessica Enright and Adam Kleczkowski.

TALKS

2021

• Dagstuhl Seminar on 'Temporal Graphs: Structure, Algorithms, Applications' (invited, upcoming 25. – 30. April)

• IBS Discrete Mathematics Group (DIMAG), Daejeon, South Korea: Virtual Discrete Math Colloquium (invited, upcoming)

• British Colloquium on Theoretical Computer Science (link to schedule here) 2021

• University of Birmingham: Study group in Graph Theory, Topology and Algorithms (invited)

• TU Berlin: Logic and Semantics Research Group (invited)

• Karlsruhe IT: discrete math seminar (invited)

2020

• Karlsruhe IT: discrete math seminar (invited)

2019

• British Colloquium on Theoretical Computer Science & AlgoUK

• Scottish Combinatorics Meeting

• Postgraduate Combinatorial Conference

• British Combinatorial Conference

​

2018

• Postgraduate Combinatorics Conference

• AlgoUK

• British Combinatorics Conference

• Oxford one day meeting in Combinatorics

• Scottish Combinatorics Meeting

• British Combinatorial Colloquium

CONFERENCES THAT I ORGANIZED

​

2020

• I am the founder and lead organizer of the e-PCC. This is an online seminar series for PhD students across Europe in discrete mathematics and/or theoretical computer science. Sign up for the mailing list here. For any questions, email me or contact one of the other organizers: Michael McKay and Jake Horsfield.

• I am the lead organizer of PCC2020: the Postgraduate Combinatorics Conference. Unfortunately this is postponed due to COVID19

​

2016

• Stirling Graph Theory Spring School. Invited speakers: Jessica Enright, Kitty Meeks, John Faben.

​

SUMMER SCHOOLS AND READING GROUPS

Organised

• Course Coordinator for the Programming Workshop for Scientists in Africa 2017-2019

• Stirling Graph Theory Spring School. Invited speakers: Jessica Enright, Kitty Meeks, John Faben.

​

Attended

• An Excursion into Model Theory and its Applications

• Recent Advances in Parameterized Complexity

​

Reading Groups

• (Parameterized) Algorithms and Discrete Mathematics reading group within the Formal Analysis, Theory and Algorithms group in Glasgow

• Undergraduate Reading group: "Totally QE'D" together with Pernille Rytterhuus and Zoltan A. Kocsis

AWARDS

• 3.5 years EPSRC Doctoral Research Scholarship, University of Glasgow (value: £ 111,000)
  

• Best in Europe (i.e. top 4% worldwide) in the MCM mathematical modelling competition

• Prize for An outstanding Performance in the Final Year of a Mathematics Degree

PWSAFRICA

I was part of organizing and tutoring team of Programming Workshop for Scientists in Africa.  The team memebers I worked with are: Sofiat Olaosebikan (the project founder) Tom Wallis, Fionnuala Johnson, Fatma Elsafoury, Ifeoma Okoh, Paul John and Alexandrina Pancheva.

• In 2019 I was the course coordinator for our course in Kigali, Rwanda. I developed the curriculum for the two-week long Python programming workshop. The workshop was delivered in a “Project-Based Learning” style inspired by textbooks such as Lovász’s “Combinatorial Problems and Exercises”. The workshop was a huge success with students who had never programmed before being able to understand and write a small language interpreter within only two weeks. (The credit should go to the students, though!). You can find the course materials HERE.

• In 2018 we went to Ibadan, Nigeria. If you are interested in reading more about this experience, then you should read the article I wrote for the March 2019 edition of the London Mathematical Society Newsletter!

TUTOR FOR PROJECT GRASP

Project Grasp is an initiative targeting students from local Glasgow high schools, organised at the University of Glasgow by Adam Kurkiewicz, Jordan Baillie and Samko Gurský in partnership with Skyscanner.

UNIVERSITY OF GLASGOW

Supervision:

• Rory Barnett. Undergraduate Dissertation on "Finding k-blocks in practice". A k-block describes a highly connected vertex-set in a graph. Rory implemented an algorithm described in a paper by Carmesin, Diestel, Hamman and Hudtermark which finds all k-blocks in a graph (either for all k or for fixed k).

​

Tutor:

• ALGORITHMS & DATA STRUCTURES 2

• ALGORITHMS AND DATA STRUCTURES (Masters level)

EDUCATION