Introducing Regina, The 3-Manifold Topology Software. - Benjamin A. Burton (Exp. Math., 2004)

Secure Group Communication with Distributed Generation of Private Keys in Ad-hoc Networks. - Shrikant Sundaram; Peter Bertók; Benjamin A. Burton (SEC, 2005)

Enumeration of Non-Orientable 3-Manifolds Using Face-Pairing Graphs and Union-Find. - Benjamin A. Burton (Discret. Comput. Geom., 2007)

Observations from the 8-Tetrahedron Nonorientable Census. - Benjamin A. Burton (Exp. Math., 2007)

Informatics olympiads: challenges in programming and algorithm design. - Benjamin A. Burton (ACSC, 2008)

The complexity of the normal surface solution space. - Benjamin A. Burton (SCG, 2010)

Quadrilateral-Octagon Coordinates for Almost Normal Surfaces. - Benjamin A. Burton (Exp. Math., 2010)

Optimizing the double description method for normal surface enumeration. - Benjamin A. Burton (Math. Comput., 2010)

The pachner graph and the simplification of 3-sphere triangulations. - Benjamin A. Burton (SCG, 2011)

Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations. - Benjamin A. Burton (ISSAC, 2011)

Searching a Bitstream in Linear Time for the Longest Substring of Any Given Density. - Benjamin A. Burton (Algorithmica, 2011)

Simplification paths in the Pachner graphs of closed orientable 3-manifold triangulations - Benjamin A. Burton (CoRR, 2011)

Fundamental normal surfaces and the enumeration of Hilbert bases - Benjamin A. Burton (CoRR, 2011)

Maximal admissible faces and asymptotic bounds for the normal surface solution space. - Benjamin A. Burton (J. Comb. Theory A, 2011)

Complementary Vertices and Adjacency Testing in Polytopes. - Benjamin A. Burton (COCOON, 2012)

Computational topology with Regina: Algorithms, heuristics and implementations - Benjamin A. Burton (CoRR, 2012)

A fast branching algorithm for unknot recognition with experimental polynomial-time behaviour - Benjamin A. Burton; Melih Ozlen (CoRR, 2012)

Computing the Crosscap Number of a Knot Using Integer Programming and Normal Surfaces. - Benjamin A. Burton; Melih Ozlen (ACM Trans. Math. Softw., 2012)

Computational topology and normal surfaces: Theoretical and experimental complexity bounds. - Benjamin A. Burton; João Paixão; Jonathan Spreer (ALENEX, 2013)

Computing closed essential surfaces in knot complements. - Benjamin A. Burton; Alexander Coward; Stephan Tillmann (SoCG, 2013)

The complexity of detecting taut angle structures on triangulations. - Benjamin A. Burton; Jonathan Spreer (SODA, 2013)

A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology. - Benjamin A. Burton; Melih Ozlen (Algorithmica, 2013)

Optimising a nonlinear utility function in multi-objective integer programming. - Melih Ozlen; Meral Azizoglu; Benjamin A. Burton (J. Glob. Optim., 2013)

Locating Regions in a Sequence under Density Constraints. - Benjamin A. Burton; Mathias Hiron (SIAM J. Comput., 2013)

Enumerating fundamental normal surfaces: Algorithms, experiments and invariants. - Benjamin A. Burton (ALENEX, 2014)

Fixed Parameter Tractable Algorithms in Combinatorial Topology. - Benjamin A. Burton; William Pettersson (COCOON, 2014)

The cusped hyperbolic census is complete. - Benjamin A. Burton (CoRR, 2014)

On the Complexity of Immersed Normal Surfaces. - Benjamin A. Burton; Éric Colin de Verdière; Arnaud de Mesmay (CoRR, 2014)

Collection of abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto. - Jonathan Spreer; Uli Wagner 001; Benjamin A. Burton; Satoshi Murai; Eric Sedgwick; Henry Segerman (CoRR, 2014)

A New Approach to Crushing 3-Manifold Triangulations. - Benjamin A. Burton (Discret. Comput. Geom., 2014)

A Duplicate Pair in the SnapPea Census. - Benjamin A. Burton (Exp. Math., 2014)

Multi-Objective Integer Programming: An Improved Recursive Algorithm. - Melih Ozlen; Benjamin A. Burton; Cameron A. G. MacRae (J. Optim. Theory Appl., 2014)

Knot theory: Algorithms, complexity and computation (NII Shonan Meeting 2014-4). - Ryan Budney; Benjamin A. Burton; Kazuhiro Ichihara (NII Shonan Meet. Rep., 2014)

An Edge-Based Framework for Enumerating 3-Manifold Triangulations. - Benjamin A. Burton; William Pettersson (SoCG, 2015)

Separation index of graphs and stacked 2-spheres. - Benjamin A. Burton; Basudeb Datta; Nitin Singh; Jonathan Spreer (J. Comb. Theory A, 2015)

Efficient Algorithms to Decide Tightness. - Bhaskar Bagchi; Basudeb Datta; Benjamin A. Burton; Nitin Singh; Jonathan Spreer (SoCG, 2016)

2-manifold recognition is in logspace. - Benjamin A. Burton; Murray Elder; Arkadius G. Kalka; Stephan Tillmann (J. Comput. Geom., 2016)

Parameterized Complexity of Discrete Morse Theory. - Benjamin A. Burton; Thomas Lewiner; João Paixão; Jonathan Spreer (ACM Trans. Math. Softw., 2016)

Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary. - Benjamin A. Burton; Erin W. Chambers; Marc J. van Kreveld; Wouter Meulemans; Tim Ophelders; Bettina Speckmann (ESA, 2017)

Randomness testing and comparison of classical and quantum bit generators. - Serdar Boztas; Benjamin A. Burton (ISCC, 2017)

Applications of Topology to the Analysis of 1-Dimensional Objects (Dagstuhl Seminar 17072). - Benjamin A. Burton; Maarten Löffler; Carola Wenk; Erin Wolf Chambers (Dagstuhl Reports, 2017)

Finding Non-orientable Surfaces in 3-Manifolds. - Benjamin A. Burton; Arnaud de Mesmay; Uli Wagner 001 (Discret. Comput. Geom., 2017)

Courcelle's theorem for triangulations. - Benjamin A. Burton; Rodney G. Downey (J. Comb. Theory A, 2017)

The HOMFLY-PT Polynomial is Fixed-Parameter Tractable. - Benjamin A. Burton (SoCG, 2018)

A Construction Principle for Tight and Minimal Triangulations of Manifolds. - Benjamin A. Burton; Basudeb Datta; Nitin Singh; Jonathan Spreer (Exp. Math., 2018)

Algorithms and complexity for Turaev-Viro invariants. - Benjamin A. Burton; Clément Maria; Jonathan Spreer (J. Appl. Comput. Topol., 2018)

The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. - Benjamin A. Burton; Sergio Cabello; Stefan Kratsch; William Pettersson (SIAM J. Discret. Math., 2019)

The Next 350 Million Knots. - Benjamin A. Burton (SoCG, 2020)

Knot Diagrams of Treewidth Two. - Hans L. Bodlaender; Benjamin A. Burton; Fedor V. Fomin; Alexander Grigoriev (WG, 2020)

Connecting 3-manifold triangulations with monotonic sequences of bistellar flips. - Benjamin A. Burton; Alexander He 001 (CoRR, 2020)

On the hardness of finding normal surfaces. - Benjamin A. Burton; Alexander He 001 (J. Appl. Comput. Topol., 2021)

Flip Graphs of Stacked and Flag Triangulations of the 2-Sphere. - Benjamin A. Burton; Basudeb Datta; Jonathan Spreer (Electron. J. Comb., 2022)

Embeddings of 3-Manifolds in S4 from the Point of View of the 11-Tetrahedron Census. - Ryan Budney; Benjamin A. Burton (Exp. Math., 2022)

Finding Large Counterexamples by Selectively Exploring the Pachner Graph. - Benjamin A. Burton; Alexander He 001 (SoCG, 2023)

Effective Computation of the Heegaard Genus of 3-Manifolds. - Benjamin A. Burton; Finn Thompson (SoCG, 2024)

Arc Diagrams on 3-Manifold Spines. - Jack Brand; Benjamin A. Burton; Zsuzsanna Dancso; Alexander He 001; Adele Jackson; Joan Licata (Discret. Comput. Geom., 2024)

Hard Diagrams of the Unknot. - Benjamin A. Burton; Hsien-Chih Chang; Maarten Löffler; Clément Maria; Arnaud de Mesmay; Saul Schleimer; Eric Sedgwick; Jonathan Spreer (Exp. Math., 2024)

Small Triangulations of 4-Manifolds and the 4-Manifold Census. - Rhuaidi Antonio Burke; Benjamin A. Burton; Jonathan Spreer (SoCG, 2025)

raburke/Dim4Census. - Rhuaidi Antonio Burke; Benjamin A. Burton; Jonathan Spreer (DROPS Artifacts, 2025)

Computing closed essential surfaces in 3-manifolds. - Benjamin A. Burton; Stephan Tillmann (J. Appl. Comput. Topol., 2025)