|
Featured 2013 Conference Publication The complexity of detecting taut angle structures on triangulationsBurton, Benjamin and Spreer, Jonathan (2013). The complexity of detecting taut angle structures on triangulations. 24th ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), New Orleans, United States, 6-9 January 2013. Philadelphia, United States: Society for Industrial and Applied Mathematics. doi: 10.1137/1.9781611973105.13 |
|
2023 Conference Publication Finding large counterexamples by selectively exploring the Pachner graphBurton, Benjamin A. and He, Alexander (2023). Finding large counterexamples by selectively exploring the Pachner graph. Symposium on Computational Geometry (SoCG), Dallas, TX, United States, 12-15 June 2023. Wadern, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. doi: 10.4230/LIPIcs.SoCG.2023.21 |
|
2020 Conference Publication The next 350 million knotsBurton, Benjamin A. (2020). The next 350 million knots. 36th International Symposium on Computational Geometry (SoCG 2020), Zürich, Switzerland, 23-26 June 2020. Wadern, Germany: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH. doi: 10.4230/LIPIcs.SoCG.2020.25 |
|
2020 Conference Publication Knot Diagrams of Treewidth TwoBodlaender, Hans L., Burton, Benjamin, Fomin, Fedor V. and Grigoriev, Alexander (2020). Knot Diagrams of Treewidth Two. 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2020), Online, 24–26 June 2020. Heidelberg, Germany: Springer. doi: 10.1007/978-3-030-60440-0_7 |
|
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 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 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 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 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 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 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 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 |
|
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 |
|
2014 Conference Publication Fixed parameter tractable algorithms in combinatorial topologyBurton, Benjamin A. and Pettersson, William (2014). Fixed parameter tractable algorithms in combinatorial topology. 20th International Computing and Combinatorics Conference, COCOON 2014, Atlanta, GA United States, 2 - 6 August 2014. Heidelberg, Germany: Springer. doi: 10.1007/978-3-319-08783-2_26 |
|
2014 Conference Publication Enumerating fundamental normal surfaces: algorithms, experiments and invariantsBurton, Benjamin A. (2014). Enumerating fundamental normal surfaces: algorithms, experiments and invariants. 16th Workshop on Algorithm Engineering and Experiments (ALENEX14), Portland, United States, 5 January 2014. Philadelphia, United States: Society for Industrial and Applied Mathematics (SIAM). doi: 10.1137/1.9781611973198.11 |
|
2014 Conference Publication Courcelle's theorem for triangulationsBurton, Benjamin A. (2014). Courcelle's theorem for triangulations. Workshop on Triangulations in Geometry and Topology. SoCG 2014: Computational Geometry Week 2014. The 30th Annual Symposium on Computational Geometry, Kyoto, Japan, 8-11 June, 2014. Ithaca, NY, USA: Cornell University Library. |
|
2013 Conference Publication A new approach to crushing 3-manifold triangulationsBurton, Benjamin A. (2013). A new approach to crushing 3-manifold triangulations. SoCG '13: Symposium on Computational Geometry 2013, Rio de Janeiro, Brazil, 17 - 20 June 2013. New York, NY United States: Association for Computing Machinery. doi: 10.1145/2493132.2462409 |
|
2013 Conference Publication A tree traversal algorithm for decision problems in knot theory and 3-manifold topologyBurton, Benjamin A. and Ozlen, Melih (2013). A tree traversal algorithm for decision problems in knot theory and 3-manifold topology. Secaucus, NJ, United States: Springer. doi: 10.1007/s00453-012-9645-3 |
|
2013 Conference Publication Computing closed essential surfaces in knot complementsBurton, Benjamin A., Coward, Alexander and Tillmann, Stephan (2013). Computing closed essential surfaces in knot complements. SoCG '13: Symposium on Computational Geometry 2013, Rio de Janeiro, Brazil, 17 - 20 June 2013. New York, NY United States: Association for Computing Machinery. doi: 10.1145/2493132.2462380 |
