Benjamin A. Burton

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 33

Top Topics

Parameterized Complexity

Integer Programming

Bounded Treewidth

Top Venues

Discret. Comput. Geom.

Publications

Benjamin A. Burton, Finn Thompson
Effective Computation of the Heegaard Genus of 3-Manifolds. SoCG (2024)
Jack Brand, Benjamin A. Burton, Zsuzsanna Dancso, Alexander He, Adele Jackson, Joan Licata
Arc Diagrams on 3-Manifold Spines. Discret. Comput. Geom. 71 (4) (2024)
Benjamin A. Burton, Alexander He
Finding Large Counterexamples by Selectively Exploring the Pachner Graph. SoCG (2023)
Benjamin A. Burton, Alexander He
Finding large counterexamples by selectively exploring the Pachner graph. CoRR (2023)
Benjamin A. Burton, Basudeb Datta, Jonathan Spreer
Flip Graphs of Stacked and Flag Triangulations of the 2-Sphere. Electron. J. Comb. 29 (2) (2022)
Ryan Budney, Benjamin A. Burton
from the Point of View of the 11-Tetrahedron Census. Exp. Math. 31 (3) (2022)
Benjamin A. Burton, Alexander He
On the hardness of finding normal surfaces. J. Appl. Comput. Topol. 5 (4) (2021)
Benjamin A. Burton
The Next 350 Million Knots. SoCG (2020)
Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev
Knot Diagrams of Treewidth Two. WG (2020)
Benjamin A. Burton, Alexander He
Connecting 3-manifold triangulations with monotonic sequences of bistellar flips. CoRR (2020)
Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev
Knot Diagrams of Treewidth Two. CoRR (2019)
Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. SIAM J. Discret. Math. 33 (4) (2019)
Benjamin A. Burton, Alexander He
On the hardness of finding normal surfaces. CoRR (2019)
Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson
The parameterized complexity of finding a 2-sphere in a simplicial complex. CoRR (2018)
Benjamin A. Burton
The HOMFLY-PT Polynomial is Fixed-Parameter Tractable. SoCG (2018)
Benjamin A. Burton, Basudeb Datta, Nitin Singh, Jonathan Spreer
A Construction Principle for Tight and Minimal Triangulations of Manifolds. Exp. Math. 27 (1) (2018)
Benjamin A. Burton, Clément Maria, Jonathan Spreer
Algorithms and complexity for Turaev-Viro invariants. J. Appl. Comput. Topol. 2 (1-2) (2018)
Benjamin A. Burton, Erin W. Chambers, Marc J. van Kreveld, Wouter Meulemans, Tim Ophelders, Bettina Speckmann
Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary. ESA (2017)
Benjamin A. Burton, Maarten Löffler, Carola Wenk, Erin Wolf Chambers
Applications of Topology to the Analysis of 1-Dimensional Objects (Dagstuhl Seminar 17072). Dagstuhl Reports 7 (2) (2017)
Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner
Finding Non-orientable Surfaces in 3-Manifolds. Discret. Comput. Geom. 58 (4) (2017)
Serdar Boztas, Benjamin A. Burton
Randomness testing and comparison of classical and quantum bit generators. ISCC (2017)
Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. STACS (2017)
Benjamin A. Burton, Rodney G. Downey
Courcelle's theorem for triangulations. J. Comb. Theory, Ser. A 146 (2017)
Benjamin A. Burton
The HOMFLY-PT polynomial is fixed-parameter tractable. CoRR (2017)
Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner
Finding non-orientable surfaces in 3-manifolds. CoRR (2016)
Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner
Finding Non-Orientable Surfaces in 3-Manifolds. SoCG (2016)
Bhaskar Bagchi, Basudeb Datta, Benjamin A. Burton, Nitin Singh, Jonathan Spreer
Efficient Algorithms to Decide Tightness. SoCG (2016)
Benjamin A. Burton, Thomas Lewiner, João Paixão, Jonathan Spreer
Parameterized Complexity of Discrete Morse Theory. ACM Trans. Math. Softw. 42 (1) (2016)
Benjamin A. Burton, Murray Elder, Arkadius G. Kalka, Stephan Tillmann
2-manifold recognition is in logspace. J. Comput. Geom. 7 (1) (2016)
Benjamin A. Burton, Basudeb Datta, Nitin Singh, Jonathan Spreer
Separation index of graphs and stacked 2-spheres. J. Comb. Theory, Ser. A 136 (2015)
Benjamin A. Burton, Clément Maria, Jonathan Spreer
Algorithms and complexity for Turaev-Viro invariants. CoRR (2015)
Benjamin A. Burton, William Pettersson
An Edge-Based Framework for Enumerating 3-Manifold Triangulations. SoCG (2015)
Benjamin A. Burton, Clément Maria, Jonathan Spreer
Algorithms and Complexity for Turaev-Viro Invariants. ICALP (1) (2015)
Benjamin A. Burton, William Pettersson
Fixed parameter tractable algorithms in combinatorial topology. CoRR (2014)
Benjamin A. Burton, Murray Elder, Arkadius G. Kalka, Stephan Tillmann
2-manifold recognition is in logspace. CoRR (2014)
Benjamin A. Burton, William Pettersson
Fixed Parameter Tractable Algorithms in Combinatorial Topology. COCOON (2014)
Benjamin A. Burton, Éric Colin de Verdière, Arnaud de Mesmay
On the Complexity of Immersed Normal Surfaces. CoRR (2014)
Benjamin A. Burton
Enumerating fundamental normal surfaces: Algorithms, experiments and invariants. ALENEX (2014)
Melih Ozlen, Benjamin A. Burton, Cameron A. G. MacRae
Multi-Objective Integer Programming: An Improved Recursive Algorithm. J. Optim. Theory Appl. 160 (2) (2014)
Benjamin A. Burton
The cusped hyperbolic census is complete. CoRR (2014)
Jonathan Spreer, Uli Wagner, Benjamin A. Burton, Satoshi Murai, Eric Sedgwick, Henry Segerman
Collection of abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto. CoRR (2014)
Bhaskar Bagchi, Benjamin A. Burton, Basudeb Datta, Nitin Singh, Jonathan Spreer
Efficient algorithms to decide tightness. CoRR (2014)
Benjamin A. Burton
A New Approach to Crushing 3-Manifold Triangulations. Discret. Comput. Geom. 52 (1) (2014)
Benjamin A. Burton, Rodney G. Downey
Courcelle's theorem for triangulations. CoRR (2014)
Benjamin A. Burton
A Duplicate Pair in the SnapPea Census. Exp. Math. 23 (2) (2014)
Benjamin A. Burton, Jonathan Spreer
The complexity of detecting taut angle structures on triangulations. SODA (2013)
Melih Ozlen, Meral Azizoglu, Benjamin A. Burton
Optimising a nonlinear utility function in multi-objective integer programming. J. Glob. Optim. 56 (1) (2013)
Benjamin A. Burton, Melih Ozlen
A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology. Algorithmica 65 (4) (2013)
Benjamin A. Burton, João Paixão, Jonathan Spreer
Computational topology and normal surfaces: Theoretical and experimental complexity bounds. ALENEX (2013)
Benjamin A. Burton
A new approach to crushing 3-manifold triangulations. SoCG (2013)
Benjamin A. Burton, Thomas Lewiner, João Paixão, Jonathan Spreer
Parameterized complexity of discrete morse theory. SoCG (2013)
Benjamin A. Burton, Thomas Lewiner, João Paixão, Jonathan Spreer
Parameterized Complexity of Discrete Morse Theory CoRR (2013)
Benjamin A. Burton, Mathias Hiron
Locating Regions in a Sequence under Density Constraints. SIAM J. Comput. 42 (3) (2013)
Benjamin A. Burton, Alexander Coward, Stephan Tillmann
Computing closed essential surfaces in knot complements. SoCG (2013)
Benjamin A. Burton, Alexander Coward, Stephan Tillmann
Computing closed essential surfaces in knot complements CoRR (2012)
Benjamin A. Burton, Melih Ozlen
Computing the Crosscap Number of a Knot Using Integer Programming and Normal Surfaces. ACM Trans. Math. Softw. 39 (1) (2012)
Benjamin A. Burton
Computational topology with Regina: Algorithms, heuristics and implementations CoRR (2012)
Benjamin A. Burton
Complementary vertices and adjacency testing in polytopes CoRR (2012)
Benjamin A. Burton
A new approach to crushing 3-manifold triangulations CoRR (2012)
Benjamin A. Burton, João Paixão, Jonathan Spreer
Computational topology and normal surfaces: Theoretical and experimental complexity bounds CoRR (2012)
Benjamin A. Burton
Complementary Vertices and Adjacency Testing in Polytopes. COCOON (2012)
Benjamin A. Burton, Jonathan Spreer
The complexity of detecting taut angle structures on triangulations CoRR (2012)
Benjamin A. Burton, Melih Ozlen
A fast branching algorithm for unknot recognition with experimental polynomial-time behaviour CoRR (2012)
Benjamin A. Burton, Melih Ozlen
Computing the crosscap number of a knot using integer programming and normal surfaces CoRR (2011)
Benjamin A. Burton
Fundamental normal surfaces and the enumeration of Hilbert bases CoRR (2011)
Benjamin A. Burton
Searching a Bitstream in Linear Time for the Longest Substring of Any Given Density. Algorithmica 61 (3) (2011)
Benjamin A. Burton, Melih Ozlen
A tree traversal algorithm for decision problems in knot theory and 3-manifold topology. SCG (2011)
Benjamin A. Burton
Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations CoRR (2011)
Benjamin A. Burton
The pachner graph and the simplification of 3-sphere triangulations. SCG (2011)
Benjamin A. Burton
Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations. ISSAC (2011)
Benjamin A. Burton
Maximal admissible faces and asymptotic bounds for the normal surface solution space. J. Comb. Theory, Ser. A 118 (4) (2011)
Benjamin A. Burton
Simplification paths in the Pachner graphs of closed orientable 3-manifold triangulations CoRR (2011)
Benjamin A. Burton, Mathias Hiron
Locating regions in a sequence under density constraints CoRR (2011)
Benjamin A. Burton, Melih Ozlen
A tree traversal algorithm for decision problems in knot theory and 3-manifold topology CoRR (2010)
Benjamin A. Burton
Quadrilateral-Octagon Coordinates for Almost Normal Surfaces. Exp. Math. 19 (3) (2010)
Benjamin A. Burton
Optimizing the double description method for normal surface enumeration. Math. Comput. 79 (269) (2010)
Benjamin A. Burton
The Pachner graph and the simplification of 3-sphere triangulations CoRR (2010)
Benjamin A. Burton
The complexity of the normal surface solution space. SCG (2010)
Benjamin A. Burton
Searching a bitstream in linear time for the longest substring of any given density CoRR (2009)
Benjamin A. Burton
Informatics olympiads: challenges in programming and algorithm design. ACSC (2008)
Benjamin A. Burton
Optimizing the double description method for normal surface enumeration. CoRR (2008)
Benjamin A. Burton
Observations from the 8-Tetrahedron Nonorientable Census. Exp. Math. 16 (2) (2007)
Benjamin A. Burton
Enumeration of Non-Orientable 3-Manifolds Using Face-Pairing Graphs and Union-Find. Discret. Comput. Geom. 38 (3) (2007)
Benjamin A. Burton
Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find. CoRR (2006)
Benjamin A. Burton
Introducing Regina, The 3-Manifold Topology Software. Exp. Math. 13 (3) (2004)