Benjamin A. Burton

91 papers A* 12A 4B 2C 1Misc 3Journal 64Unranked 5

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