Normal subgroups of infinite symmetric groups, with an application to stratified set theory. - Nathan J. Bowler; Thomas Forster (J. Symb. Log., 2009)

Coproducts of Monads on Set. - Jirí Adámek; Stefan Milius; Nathan J. Bowler; Paul Blain Levy (LICS, 2012)

Exploring the Boundaries of Monad Tensorability on Set. - Nathan J. Bowler; Sergey Goncharov 001; Paul Blain Levy; Lutz Schröder (Log. Methods Comput. Sci., 2013)

Model theoretic connected components of finitely generated nilpotent groups. - Nathan J. Bowler; Cong Chen; Jakub Gismatullin (J. Symb. Log., 2013)

Matroids with an infinite circuit-cocircuit intersection. - Nathan J. Bowler; Johannes Carmesin (J. Comb. Theory B, 2014)

The Axiom Scheme of Acyclic Comprehension. - Zuhair Al-Johar; M. Randall Holmes; Nathan J. Bowler (Notre Dame J. Formal Log., 2014)

Matroid intersection, base packing and base covering for infinite matroids. - Nathan J. Bowler; Johannes Carmesin (Comb., 2015)

Edge-disjoint double rays in infinite graphs: A Halin type result. - Nathan J. Bowler; Johannes Carmesin; Julian Pott (J. Comb. Theory B, 2015)

Rudimentary Recursion, Gentle Functions and Provident Sets. - A. R. D. Mathias; Nathan J. Bowler (Notre Dame J. Formal Log., 2015)

A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs. - Nathan J. Bowler; Joshua Erde; Florian Lehner; Martin Merker; Max Pitz; Konstantinos S. Stavropoulos (Discret. Appl. Math., 2017)

Infinite Graphic Matroids. - Nathan J. Bowler; Johannes Carmesin; Robin Christian (Comb., 2018)

Reconstruction of infinite matroids from their 3-connected minors. - Nathan J. Bowler; Johannes Carmesin; Luke Postle (Eur. J. Comb., 2018)

Initial Algebras and Final Coalgebras Consisting of Nondeterministic Finite Trace Strategies. - Nathan J. Bowler; Paul Blain Levy; Gordon D. Plotkin (MFPS, 2018)

An excluded minors method for infinite matroids. - Nathan J. Bowler; Johannes Carmesin (J. Comb. Theory B, 2018)

Non-reconstructible locally finite graphs. - Nathan J. Bowler; Joshua Erde; Peter Heinig; Florian Lehner; Max Pitz (J. Comb. Theory B, 2018)

The Colouring Number of Infinite Graphs. - Nathan J. Bowler; Johannes Carmesin; Péter Komjáth; Christian Reiher (Comb., 2019)

Peripheral circuits in infinite binary matroids. - Nathan J. Bowler; Robin Christian; R. Bruce Richter (J. Comb. Theory B, 2019)

The Almost Intersection Property for Pairs of Matroids on Common Groundset. - Nathan J. Bowler; Johannes Carmesin; Jerzy Wojciechowski; Shadisadat Ghaderi (Electron. J. Comb., 2020)

Describing quasi-graphic matroids. - Nathan J. Bowler; Daryl Funk; Daniel C. Slilaty (Eur. J. Comb., 2020)

Investigating posets via their maximal chains. - Seyed Hadi Afzali Borujeni; Nathan J. Bowler (Order, 2020)

Separations of Sets. - Nathan J. Bowler; Jakob Kneip (Order, 2020)

On the intersection conjecture for infinite trees of matroids. - Nathan J. Bowler; Johannes Carmesin (J. Comb. Theory B, 2021)

Bounding the Cop Number of a Graph by Its Genus. - Nathan J. Bowler; Joshua Erde; Florian Lehner; Max Pitz (SIAM J. Discret. Math., 2021)

Topological ubiquity of trees. - Nathan J. Bowler; Christian Elbracht; Joshua Erde; J. Pascal Gollin; Karl Heuer; Max Pitz; Maximilian Teegen (J. Comb. Theory B, 2022)

Decomposition of (infinite) digraphs along directed 1-separations. - Nathan J. Bowler; Florian Gut; Meike Hatzel; Ken-ichi Kawarabayashi; Irene Muzi; Florian Reich (CoRR, 2023)

Maker-Breaker Games on and. - Nathan J. Bowler; Florian Gut; Attila Joó; Max Pitz (J. Symb. Log., 2023)

Ubiquity of graphs with nowhere-linear end structure. - Nathan J. Bowler; Christian Elbracht; Joshua Erde; J. Pascal Gollin; Karl Heuer; Max Pitz; Maximilian Teegen (J. Graph Theory, 2023)

The Rational Number Game. - Nathan J. Bowler; Florian Gut (Electron. J. Comb., 2024)

Ubiquity of locally finite graphs with extensive tree-decompositions. - Nathan J. Bowler; Christian Elbracht; Joshua Erde; J. Pascal Gollin; Karl Heuer; Max Pitz; Maximilian Teegen (Comb. Theory, 2024)

Corrigendum to "Describing quasi-graphic matroids" [European J. Combin. 85 (2020) 103062]. - Nathan J. Bowler; Daryl Funk; Daniel C. Slilaty (Eur. J. Comb., 2024)

Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture. - Nathan J. Bowler; Yared Nigussie (J. Comb. Theory B, 2024)

A Note on Uncountably Chromatic Graphs. - Nathan J. Bowler; Max Pitz (Electron. J. Comb., 2025)

Probabilistic Strategies: Definability and the Tensor Completeness Problem. - Nathan J. Bowler; Sergey Goncharov 001; Paul Blain Levy (CoRR, 2025)