|
2019 Journal Article The parameterized complexity of finding a 2-sphere in a simplicial complexBurton, Benjamin, Cabello, Sergio, Kratsch, Stefan and Pettersson, William (2019). The parameterized complexity of finding a 2-sphere in a simplicial complex. SIAM Journal on Discrete Mathematics, 33 (4), 2092-2110. doi: 10.1137/18M1168704 |
|
2018 Journal Article Algorithms and complexity for Turaev–Viro invariantsBurton, Benjamin A., Maria, Clément and Spreer, Jonathan (2018). Algorithms and complexity for Turaev–Viro invariants. Journal of Applied and Computational Topology, 2 (1-2), 33-53. doi: 10.1007/s41468-018-0016-2 |
|
2018 Conference Publication The HOMFLY-PT polynomial is fixed-parameter tractableBurton, Benjamin A. (2018). The HOMFLY-PT polynomial is fixed-parameter tractable. 34th International Symposium on Computational Geometry, SoCG 2018, Budapest, Hungary, 11-14 June 2018. Wadern, Germany: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. doi: 10.4230/LIPIcs.SoCG.2018.18 |
|
2017 Conference Publication The parameterized complexity of finding a 2-sphere in a simplicial complexBurton, Benjamin, Cabello, Sergio, Kratsch, Stefan and Pettersson, William (2017). The parameterized complexity of finding a 2-sphere in a simplicial complex. 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, Hannover, Germany, 8 - 11 March 2017. Wadern, Germany: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH. doi: 10.4230/LIPIcs.STACS.2017.18 |
|
2017 Conference Publication Computing optimal homotopies over a spiked plane with polygonal boundaryBurton, Benjamin, Chambers, Erin, Van Kreveld, Marc, Meulemans, Wouter, Ophelders, Tim and Speckmann, Bettina (2017). Computing optimal homotopies over a spiked plane with polygonal boundary. 25th European Symposium on Algorithms, ESA 2017, Vienna, Austria, 4-6 September 2017. Wadern, Germany: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik GmbH. doi: 10.4230/LIPIcs.ESA.2017.23 |
|
2017 Conference Publication Randomness testing and comparison of classical and quantum bit generatorsBoztas, Serdar and Burton, Benjamin A. (2017). Randomness testing and comparison of classical and quantum bit generators. 2017 IEEE Symposium on Computers and Communications (ISCC), , Heraklion, Greece, 3-6 July 2017. Piscataway, NJ United States: Institute of Electrical and Electronics Engineers . doi: 10.1109/ISCC.2017.8024660 |
|
2017 Conference Publication Finding Non-orientable Surfaces in 3-ManifoldsBurton, Benjamin A., de Mesmay, Arnaud and Wagner, Uli (2017). Finding Non-orientable Surfaces in 3-Manifolds. 32nd Annual ACM International Symposium on Computational Geometry (SoCG), Boston Ma, Jun 14-17, 2016. New York, NY United States: Springer New York. doi: 10.1007/s00454-017-9900-0 |
|
2016 Journal Article Courcelle's theorem for triangulationsBurton, Benjamin A. and Downey, Rodney G. (2016). Courcelle's theorem for triangulations. Journal of Combinatorial Theory. Series A, 146, 264-294. doi: 10.1016/j.jcta.2016.10.001 |
|
2016 Journal Article A construction principle for tight and minimal triangulations of manifoldsBurton, Benjamin A., Datta, Basudeb, Singh, Nitin and Spreer, Jonathan (2016). A construction principle for tight and minimal triangulations of manifolds. Experimental Mathematics, 27 (1), 22-36. doi: 10.1080/10586458.2016.1212747 |
|
2016 Journal Article Combinatorial Seifert fibred spaces with transitive cyclic automorphism groupBurton, Benjamin and Spreer, Jonathan (2016). Combinatorial Seifert fibred spaces with transitive cyclic automorphism group. Israel Journal of Mathematics, 214 (2), 741-784. doi: 10.1007/s11856-016-1330-9 |
|
2016 Journal Article On the complexity of immersed normal surfacesBurton, Benjamin A., de Verdière, Éric Colin and de Mesmay, Arnaud (2016). On the complexity of immersed normal surfaces. Geometry and Topology, 20 (2), 1061-1083. doi: 10.2140/gt.2016.20.1061 |
|
2016 Journal Article Parameterized complexity of discrete Morse theoryBurton, Benjamin A., Lewiner, Thomas, Paixao, Joao and Spreer, Jonathan (2016). Parameterized complexity of discrete Morse theory. ACM Transactions On Mathematical Software, 42 (1) 2738034, 6:1-6:24. doi: 10.1145/2738034 |
|
2016 Conference Publication Finding non-orientable surfaces in 3-manifoldsBurton, Benjamin A., de Mesmay, Arnaud and Wagner, Uli (2016). Finding non-orientable surfaces in 3-manifolds. International Symposium on Computational Geometry, Boston, MA, United States, 14-17 June 2016. Wadern, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. doi: 10.4230/LIPIcs.SoCG.2016.24 |
|
2016 Journal Article 2-manifold recognition is in logspaceBurton, Benjamin A., Elder, Murray, Kalka, Arkadius and Tillmann, Stephan (2016). 2-manifold recognition is in logspace. Journal of Computational Geometry, 7 (1), 70-85. |
|
2016 Conference Publication Efficient algorithms to decide tightnessBagchi, Bhaskar, Datta, Basudeb, Burton, Benjamin A., Singh, Nitin and Spreer, Jonathan (2016). Efficient algorithms to decide tightness. International Symposium on Computational Geometry, Boston, MA, United States, 14-18 June 2016. Wadern, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. doi: 10.4230/LIPIcs.SoCG.2016.12 |
|
2015 Journal Article Separation index of graphs and stacked 2-spheresBurton, Benjamin, Datta, Basudeb, Singh, Nitin and Spreer, Jonathan (2015). Separation index of graphs and stacked 2-spheres. Journal of Combinatorial Theory. Series A, 136, 184-197. doi: 10.1016/j.jcta.2015.07.001 |
|
2015 Conference Publication Algorithms and complexity for Turaev-Viro invariantsBurton, Benjamin A., Maria, Clément and Spreer, Jonathan (2015). Algorithms and complexity for Turaev-Viro invariants. International Colloquium on Automata, Languages, and Programming, Kyoto, Japan, 6-10 June 2015. Heidelberg, Germany: Springer. doi: 10.1007/978-3-662-47672-7_23 |
|
2015 Conference Publication Tabulation of 3-manifolds of lengths up to 10Kawauchi, Akio, Tayama, Ikuo and Burton, Benjamin (2015). Tabulation of 3-manifolds of lengths up to 10. International Conference on Topology and Geometry 2013, joint with the Sixth Japan-Mexico Topology Symposium, Matsue, Japan, September 2-6, 2013. Amsterdam, Netherlands: Elsevier BV. doi: 10.1016/j.topol.2015.05.036 |
|
2015 Conference Publication An edge-based framework for enumerating 3-manifold triangulationsBurton, Benjamin A. and Pettersson, William (2015). An edge-based framework for enumerating 3-manifold triangulations. International Symposium on Computational Geometry, Eindhoven, Netherlands, 22-25 June 2015. Wadern, Germany: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. doi: 10.4230/LIPIcs.SOCG.2015.270 |
|
2014 Journal Article A new approach to crushing 3-manifold triangulationsBurton, Benjamin A. (2014). A new approach to crushing 3-manifold triangulations. Discrete and Computational Geometry, 52 (1), 116-139. doi: 10.1007/s00454-014-9572-y |
