Bibliography |
Prev |
[Ago11] Ideal triangulations of pseudo-Anosov mapping tori. Topology and Geometry in Dimension Three. pp. 1–17. Amer. Math. Soc.. Providence, RI. 2011.
[Bud08] Embeddings of 3-manifolds in
S
4
from the point of view of the 11-tetrahedron census. Preprint. arXiv:0810.2346. October 2008.
[Bur03] Minimal triangulations and normal surfaces. PhD Thesis. University of Melbourne. May 2003. Available from the Regina website.
[Bur04] Face pairing graphs and 3-manifold enumeration. J. Knot Theory Ramifications. no. 8. pp. 1057–1101. 2004.
[Bur07a] Enumeration of non-orientable 3-manifolds using face-pairing graphs and union-find. Discrete Comput. Geom.. no. 3. pp. 527–571. 2007.
[Bur07b] Observations from the 8-tetrahedron nonorientable census. Experiment. Math.. no. 2. pp. 129–144. 2007.
[Bur07c] Structures of small closed non-orientable 3-manifold triangulations. J. Knot Theory Ramifications. no. 5. pp. 545–574. 2007.
[Bur08a] Building minimal triangulations of graph manifolds using saturated blocks. In preparation. 2008.
[Bur09a] Converting between quadrilateral and standard solution sets in normal surface theory. Algebr. Geom. Topol.. no. 4. pp. 2121–2174. 2009.
[Bur10a] Optimizing the double description method for normal surface enumeration. Math. Comp.. no. 269. pp. 453–484. 2010.
[Bur10b] Quadrilateral-octagon coordinates for almost normal surfaces. Experiment. Math.. no. 3. pp. 285–315. 2010.
[Bur11a] Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations. ISSAC 2011: Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation. pp. 59–66. ACM. 2011.
[Bur11b] The Pachner graph and the simplification of 3-sphere triangulations. SCG '11: Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry. pp. 153–162. ACM. 2011.
[Bur11c] Simplification paths in the Pachner graphs of closed orientable 3-manifold triangulations. Preprint. arXiv:1110.6080. October 2011.
[Bur13] Computational topology with Regina: Algorithms, heuristics and implementations. Geometry and Topology Down Under. pp. 195–224. Amer. Math. Soc.. Providence, RI. 2013.
[Bur14a] Enumerating fundamental normal surfaces: Algorithms, experiments and invariants. ALENEX 2014: Proceedings of the Meeting on Algorithm Engineering & Experiments. pp. 112–124. SIAM. 2014.
[Bur14b] A new approach to crushing 3-manifold triangulations. Discrete Comput. Geom.. no. 1. pp. 116–139. 2014.
[Bur18] The HOMFLY-PT polynomial is fixed-parameter tractable. 34th International Symposium on Computational Geometry (SoCG 2018). pp. 18:1–18:14. Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik. Dagstuhl, Germany. 2018.
[Bur20] The next 350 million knots. 36th International Symposium on Computational Geometry (SoCG 2020). pp. 25:1–25:17. Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik. Dagstuhl, Germany. 2020.
[BCT13] Computing closed essential surfaces in knot complements. SCG '13: Proceedings of the 29th Annual Symposium on Computational Geometry. pp. 405–414. ACM. 2013.
[BMS15] Algorithms and complexity for Turaev-Viro invariants. ICALP 2015: Automata, Languages, and Programming: 42nd International Colloquium. pp. 281–293. Springer. 2015.
[BO12] A fast branching algorithm for unknot recognition with experimental polynomial-time behaviour. Preprint. arXiv:1211.1079. November 2012.
[BO13] A tree traversal algorithm for decision problems in knot theory and 3-manifold topology. Algorithmica. no. 4. pp. 772–801. 2013.
[BRT12] The Weber-Seifert dodecahedral space is non-Haken. Trans. Amer. Math. Soc.. 2. pp. 911–932. 2012.
[FG11] From angled triangulations to hyperbolic structures. Interactions Between Hyperbolic Geometry, Quantum Topology and Number Theory. pp. 159–182. Amer. Math. Soc.. Providence, RI. 2011.
[GAP02] GAP — Groups, Algorithms and Programming. Version 4.3. 2002. Available from http://www.gap-system.org/.
[Har20] Determining hyperbolicity of compact orientable 3-manifolds with torus boundary. J. Comput. Geom.. no. 1. pp. 125–136. 2020.
[HLP99] The computational complexity of knot and link problems. J. Assoc. Comput. Mach.. no. 2. pp. 185–211. 1999.
[HRST11] Veering triangulations admit strict angle structures. Geom. Topol.. no. 4. pp. 2073–2089. 2011.
[HW94] Symmetries, isometries and length spectra of closed hyperbolic three-manifolds. Experiment. Math.. no. 4. pp. 261–274. 1994.
[JO84] An algorithm to decide if a 3-manifold is a Haken manifold. Topology. no. 2. pp. 195–209. 1984.
[KR05] Ideal triangulations of 3-manifolds II; Taut and angle structures. Algebr. Geom. Topol.. pp. 1505–1533. 2005.
[KK80] Algebraic classification of linking pairings on 3-manifolds. Math. Ann.. no. 1. pp. 29–42. 1980.
[Mat98] Tables of 3-manifolds up to complexity 6. Max-Planck-Institut für Mathematik Preprint Series. 1998. Available from http://www.mpim-bonn.mpg.de/html/preprints/preprints.html.
[Riv94] Euclidean structures on simplicial surfaces and hyperbolic volume. Ann. of Math. (2). no. 3. pp. 553–580. 1994.
[Rub95] An algorithm to recognize the 3-sphere. Proceedings of the International Congress of Mathematicians (Zürich, 1994). pp. 601–611. Birkhäuser. Basel. 1995.
[Rub97] Polyhedral minimal surfaces, Heegaard splittings and decision problems for 3-dimensional manifolds. Geometric Topology (Athens, GA, 1993). pp. 1–20. Amer. Math. Soc.. Providence, RI. 1997.
[Tho94] Thin position and the recognition problem for S3. Math. Res. Lett.. no. 5. pp. 613–630. 1994.
Prev | Contents | |
Index | Up |