default search action
Benjamin A. Burton
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j27]Jack Brand, Benjamin A. Burton
, Zsuzsanna Dancso
Arc Diagrams on 3-Manifold Spines. Discret. Comput. Geom. 71(4): 1190-1209 (2024) - [j26]Benjamin A. Burton
Hard Diagrams of the Unknot. Exp. Math. 33(3): 482-500 (2024) - [c26]Benjamin A. Burton, Finn Thompson:
Effective Computation of the Heegaard Genus of 3-Manifolds. SoCG 2024: 30:1-30:16 - 2023
- [c25]Benjamin A. Burton
Finding Large Counterexamples by Selectively Exploring the Pachner Graph. SoCG 2023: 21:1-21:16 - [i35]Benjamin A. Burton
Finding large counterexamples by selectively exploring the Pachner graph. CoRR abs/2303.06321 (2023) - 2022
- [j25]Benjamin A. Burton
Flip Graphs of Stacked and Flag Triangulations of the 2-Sphere. Electron. J. Comb. 29(2) (2022) - [j24]Ryan Budney, Benjamin A. Burton
Embeddings of 3-Manifolds in S4 from the Point of View of the 11-Tetrahedron Census. Exp. Math. 31(3): 988-1013 (2022) - 2021
- [j23]Benjamin A. Burton
On the hardness of finding normal surfaces. J. Appl. Comput. Topol. 5(4): 583-619 (2021) - 2020
- [c24]Benjamin A. Burton
The Next 350 Million Knots. SoCG 2020: 25:1-25:17 - [c23]Hans L. Bodlaender
Knot Diagrams of Treewidth Two. WG 2020: 80-91 - [i34]Benjamin A. Burton, Alexander He
Connecting 3-manifold triangulations with monotonic sequences of bistellar flips. CoRR abs/2012.02398 (2020)
2010 – 2019
- 2019
- [j22]Benjamin A. Burton
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. SIAM J. Discret. Math. 33(4): 2092-2110 (2019) - [i33]Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev:
Knot Diagrams of Treewidth Two. CoRR abs/1904.03117 (2019) - [i32]Benjamin A. Burton, Alexander He
On the hardness of finding normal surfaces. CoRR abs/1912.09051 (2019) - 2018
- [j21]Benjamin A. Burton
A Construction Principle for Tight and Minimal Triangulations of Manifolds. Exp. Math. 27(1): 22-36 (2018) - [j20]Benjamin A. Burton
Algorithms and complexity for Turaev-Viro invariants. J. Appl. Comput. Topol. 2(1-2): 33-53 (2018) - [c22]Benjamin A. Burton
The HOMFLY-PT Polynomial is Fixed-Parameter Tractable. SoCG 2018: 18:1-18:14 - [i31]Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson:
The parameterized complexity of finding a 2-sphere in a simplicial complex. CoRR abs/1802.07175 (2018) - 2017
- [j19]Benjamin A. Burton
Finding Non-orientable Surfaces in 3-Manifolds. Discret. Comput. Geom. 58(4): 871-888 (2017) - [j18]Benjamin A. Burton
Courcelle's theorem for triangulations. J. Comb. Theory A 146: 264-294 (2017) - [c21]Benjamin A. Burton
Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary. ESA 2017: 23:1-23:14 - [c20]Serdar Boztas
Randomness testing and comparison of classical and quantum bit generators. ISCC 2017: 1029-1032 - [c19]Benjamin A. Burton
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. STACS 2017: 18:1-18:14 - [i30]Benjamin A. Burton:
The HOMFLY-PT polynomial is fixed-parameter tractable. CoRR abs/1712.05776 (2017) - [i29]Benjamin A. Burton, Maarten Löffler, Carola Wenk
Applications of Topology to the Analysis of 1-Dimensional Objects (Dagstuhl Seminar 17072). Dagstuhl Reports 7(2): 64-88 (2017) - 2016
- [j17]Benjamin A. Burton
2-manifold recognition is in logspace. J. Comput. Geom. 7(1): 70-85 (2016) - [j16]Benjamin A. Burton
Parameterized Complexity of Discrete Morse Theory. ACM Trans. Math. Softw. 42(1): 6:1-6:24 (2016) - [c18]Bhaskar Bagchi, Basudeb Datta, Benjamin A. Burton
Efficient Algorithms to Decide Tightness. SoCG 2016: 12:1-12:15 - [c17]Benjamin A. Burton
Finding Non-Orientable Surfaces in 3-Manifolds. SoCG 2016: 24:1-24:15 - [i28]Benjamin A. Burton, Arnaud de Mesmay, Uli Wagner:
Finding non-orientable surfaces in 3-manifolds. CoRR abs/1602.07907 (2016) - 2015
- [j15]Benjamin A. Burton
Separation index of graphs and stacked 2-spheres. J. Comb. Theory A 136: 184-197 (2015) - [c16]Benjamin A. Burton
An Edge-Based Framework for Enumerating 3-Manifold Triangulations. SoCG 2015: 270-284 - [c15]Benjamin A. Burton
Algorithms and Complexity for Turaev-Viro Invariants. ICALP (1) 2015: 281-293 - [i27]Benjamin A. Burton, Clément Maria, Jonathan Spreer:
Algorithms and complexity for Turaev-Viro invariants. CoRR abs/1503.04099 (2015) - 2014
- [j14]Benjamin A. Burton
A New Approach to Crushing 3-Manifold Triangulations. Discret. Comput. Geom. 52(1): 116-139 (2014) - [j13]Benjamin A. Burton
A Duplicate Pair in the SnapPea Census. Exp. Math. 23(2): 170-173 (2014) - [j12]Melih Ozlen
Multi-Objective Integer Programming: An Improved Recursive Algorithm. J. Optim. Theory Appl. 160(2): 470-482 (2014) - [c14]Benjamin A. Burton
Enumerating fundamental normal surfaces: Algorithms, experiments and invariants. ALENEX 2014: 112-124 - [c13]Benjamin A. Burton
Fixed Parameter Tractable Algorithms in Combinatorial Topology. COCOON 2014: 300-311 - [i26]Benjamin A. Burton, William Pettersson:
Fixed parameter tractable algorithms in combinatorial topology. CoRR abs/1402.3876 (2014) - [i25]Benjamin A. Burton, Rodney G. Downey:
Courcelle's theorem for triangulations. CoRR abs/1403.2926 (2014) - [i24]Benjamin A. Burton:
The cusped hyperbolic census is complete. CoRR abs/1405.2695 (2014) - [i23]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 abs/1406.0333 (2014) - [i22]Benjamin A. Burton, Murray Elder, Arkadius G. Kalka, Stephan Tillmann:
2-manifold recognition is in logspace. CoRR abs/1412.1188 (2014) - [i21]Bhaskar Bagchi, Benjamin A. Burton, Basudeb Datta, Nitin Singh, Jonathan Spreer:
Efficient algorithms to decide tightness. CoRR abs/1412.1547 (2014) - [i20]Benjamin A. Burton, Éric Colin de Verdière, Arnaud de Mesmay:
On the Complexity of Immersed Normal Surfaces. CoRR abs/1412.4988 (2014) - [i19]Ryan Budney, Benjamin A. Burton, Kazuhiro Ichihara:
Knot theory: Algorithms, complexity and computation (NII Shonan Meeting 2014-4). NII Shonan Meet. Rep. 2014 (2014) - 2013
- [j11]Benjamin A. Burton
A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology. Algorithmica 65(4): 772-801 (2013) - [j10]Melih Ozlen
Optimising a nonlinear utility function in multi-objective integer programming. J. Glob. Optim. 56(1): 93-102 (2013) - [j9]Benjamin A. Burton
Locating Regions in a Sequence under Density Constraints. SIAM J. Comput. 42(3): 1201-1215 (2013) - [c12]Benjamin A. Burton
Computational topology and normal surfaces: Theoretical and experimental complexity bounds. ALENEX 2013: 78-87 - [c11]Benjamin A. Burton, Thomas Lewiner, João Paixão, Jonathan Spreer
Parameterized complexity of discrete morse theory. SoCG 2013: 127-136 - [c10]Benjamin A. Burton, Alexander Coward, Stephan Tillmann
Computing closed essential surfaces in knot complements. SoCG 2013: 405-414 - [c9]Benjamin A. Burton:
A new approach to crushing 3-manifold triangulations. SoCG 2013: 415-424 - [c8]Benjamin A. Burton, Jonathan Spreer
The complexity of detecting taut angle structures on triangulations. SODA 2013: 168-183 - [i18]Benjamin A. Burton, Thomas Lewiner, João Paixão, Jonathan Spreer:
Parameterized Complexity of Discrete Morse Theory. CoRR abs/1303.7037 (2013) - 2012
- [j8]Benjamin A. Burton
Computing the Crosscap Number of a Knot Using Integer Programming and Normal Surfaces. ACM Trans. Math. Softw. 39(1): 4:1-4:18 (2012) - [c7]Benjamin A. Burton
Complementary Vertices and Adjacency Testing in Polytopes. COCOON 2012: 507-518 - [i17]Benjamin A. Burton:
Complementary vertices and adjacency testing in polytopes. CoRR abs/1202.4045 (2012) - [i16]Benjamin A. Burton, Jonathan Spreer:
The complexity of detecting taut angle structures on triangulations. CoRR abs/1207.0904 (2012) - [i15]Benjamin A. Burton:
Computational topology with Regina: Algorithms, heuristics and implementations. CoRR abs/1208.2504 (2012) - [i14]Benjamin A. Burton, Melih Ozlen:
A fast branching algorithm for unknot recognition with experimental polynomial-time behaviour. CoRR abs/1211.1079 (2012) - [i13]Benjamin A. Burton, João Paixão, Jonathan Spreer:
Computational topology and normal surfaces: Theoretical and experimental complexity bounds. CoRR abs/1211.3234 (2012) - [i12]Benjamin A. Burton:
A new approach to crushing 3-manifold triangulations. CoRR abs/1212.1441 (2012) - [i11]Benjamin A. Burton, Alexander Coward, Stephan Tillmann:
Computing closed essential surfaces in knot complements. CoRR abs/1212.1531 (2012) - 2011
- [j7]Benjamin A. Burton
Searching a Bitstream in Linear Time for the Longest Substring of Any Given Density. Algorithmica 61(3): 555-579 (2011) - [j6]Benjamin A. Burton
Maximal admissible faces and asymptotic bounds for the normal surface solution space. J. Comb. Theory A 118(4): 1410-1435 (2011) - [c6]Benjamin A. Burton
A tree traversal algorithm for decision problems in knot theory and 3-manifold topology. SCG 2011: 145-152 - [c5]Benjamin A. Burton
The pachner graph and the simplification of 3-sphere triangulations. SCG 2011: 153-162 - [c4]Benjamin A. Burton
Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations. ISSAC 2011: 59-66 - [i10]Benjamin A. Burton:
Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations. CoRR abs/1101.3091 (2011) - [i9]Benjamin A. Burton, Mathias Hiron:
Locating regions in a sequence under density constraints. CoRR abs/1104.0919 (2011) - [i8]Benjamin A. Burton, Melih Ozlen:
Computing the crosscap number of a knot using integer programming and normal surfaces. CoRR abs/1107.2382 (2011) - [i7]Benjamin A. Burton:
Simplification paths in the Pachner graphs of closed orientable 3-manifold triangulations. CoRR abs/1110.6080 (2011) - [i6]Benjamin A. Burton:
Fundamental normal surfaces and the enumeration of Hilbert bases. CoRR abs/1111.7055 (2011) - 2010
- [j5]Benjamin A. Burton
Quadrilateral-Octagon Coordinates for Almost Normal Surfaces. Exp. Math. 19(3): 285-315 (2010) - [j4]Benjamin A. Burton
Optimizing the double description method for normal surface enumeration. Math. Comput. 79(269): 453-484 (2010) - [c3]Benjamin A. Burton
The complexity of the normal surface solution space. SCG 2010: 201-209 - [i5]Benjamin A. Burton, Melih Ozlen:
A tree traversal algorithm for decision problems in knot theory and 3-manifold topology. CoRR abs/1010.6200 (2010) - [i4]Benjamin A. Burton:
The Pachner graph and the simplification of 3-sphere triangulations. CoRR abs/1011.4169 (2010)
2000 – 2009
- 2009
- [i3]Benjamin A. Burton:
Searching a bitstream in linear time for the longest substring of any given density. CoRR abs/0910.3503 (2009) - 2008
- [c2]Benjamin A. Burton:
Informatics olympiads: challenges in programming and algorithm design. ACSC 2008: 9-13 - [i2]Benjamin A. Burton:
Optimizing the double description method for normal surface enumeration. CoRR abs/0808.4050 (2008) - 2007
- [j3]Benjamin A. Burton
Enumeration of Non-Orientable 3-Manifolds Using Face-Pairing Graphs and Union-Find. Discret. Comput. Geom. 38(3): 527-571 (2007) - [j2]Benjamin A. Burton:
Observations from the 8-Tetrahedron Nonorientable Census. Exp. Math. 16(2): 129-143 (2007) - 2006
- [i1]Benjamin A. Burton:
Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find. CoRR abs/math/0604584 (2006) - 2005
- [c1]Shrikant Sundaram, Peter Bertók, Benjamin A. Burton:
Secure Group Communication with Distributed Generation of Private Keys in Ad-hoc Networks. SEC 2005: 477-492 - 2004
- [j1]Benjamin A. Burton:
Introducing Regina, The 3-Manifold Topology Software. Exp. Math. 13(3): 267-272 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: