Skip to menu Skip to content Skip to footer

2013

Journal Article

Optimising a nonlinear utility function in multi-objective integer programming

Ozlen, Melih, Azizoglu, Meral and Burton, Benjamin A. (2013). Optimising a nonlinear utility function in multi-objective integer programming. Journal of Global Optimization, 56 (1), 93-102. doi: 10.1007/s10898-012-9921-4

Optimising a nonlinear utility function in multi-objective integer programming

2013

Journal Article

Locating regions in a sequence under density constraints

Burton, Benjamin A. and Hiron, Mathias (2013). Locating regions in a sequence under density constraints. SIAM Journal on Computing, 42 (3), 1201-1215. doi: 10.1137/110830605

Locating regions in a sequence under density constraints

2012

Journal Article

Computing the crosscap number of a knot using integer programming and normal surfaces

Burton, Benjamin A. and Ozlen, Melih (2012). Computing the crosscap number of a knot using integer programming and normal surfaces. ACM Transactions On Mathematical Software, 39 (1) 4, 4.1-4.18. doi: 10.1145/2382585.2382589

Computing the crosscap number of a knot using integer programming and normal surfaces

2012

Journal Article

Triangulating a Cappell-Shaneson knot complement

Budney, Ryan, Burton, Benjamin A. and Hillman, Jonathan (2012). Triangulating a Cappell-Shaneson knot complement. Mathematical Research Letters, 19 (5), 1117-1126. doi: 10.4310/MRL.2012.v19.n5.a12

Triangulating a Cappell-Shaneson knot complement

2012

Journal Article

Pachner moves, generic complexity, and randomising 3-manifold triangulations

Burton, Benjamin A. (2012). Pachner moves, generic complexity, and randomising 3-manifold triangulations. Oberwolfach Reports, 9 (2), 1412-1414. doi: 10.4171/OWR/2012/24

Pachner moves, generic complexity, and randomising 3-manifold triangulations

2011

Journal Article

Searching a bitstream in linear time for the longest substring of any given density

Burton, Benjamin A. (2011). Searching a bitstream in linear time for the longest substring of any given density. Algorithmica, 61 (3), 555-579. doi: 10.1007/s00453-010-9424-y

Searching a bitstream in linear time for the longest substring of any given density

2011

Journal Article

Maximal admissible faces and asymptotic bounds for the normal surface solution space

Burton, Benjamin A. (2011). Maximal admissible faces and asymptotic bounds for the normal surface solution space. Journal of Combinatorial Theory: Series A, 118 (4), 1410-1435. doi: 10.1016/j.jcta.2010.12.011

Maximal admissible faces and asymptotic bounds for the normal surface solution space

2010

Journal Article

Quadrilateral-octagon coordinates for almost normal surfaces

Burton, Benjamin A. (2010). Quadrilateral-octagon coordinates for almost normal surfaces. Experimental Mathematics, 19 (3), 285-315. doi: 10.1080/10586458.2010.10390625

Quadrilateral-octagon coordinates for almost normal surfaces

2010

Journal Article

Get involved! The IOI workshop 2010, its goals and results

Pohl, Wolfgang, Burton, Benjamin A., Dagienė, Valentina, Fakcharoenphol, Jittat, Forišek, Michal, Hiron, Mathias, Opmanis, Mārtiņš, Skūpas, Bronius and van der Vegt, Willem (2010). Get involved! The IOI workshop 2010, its goals and results. Olympiads in Informatics, 4, 158-169.

Get involved! The IOI workshop 2010, its goals and results

2010

Journal Article

Optimizing the double description method for normal surface enumeration

Burton, Benjamin A. (2010). Optimizing the double description method for normal surface enumeration. Mathematics of Computation, 79 (269), 453-484. doi: 10.1090/S0025-5718-09-02282-0

Optimizing the double description method for normal surface enumeration

2009

Journal Article

Converting between quadrilateral and standard solution sets in normal surface theory

Burton, Benjamin A. (2009). Converting between quadrilateral and standard solution sets in normal surface theory. Algebraic and Geometric Topology, 9 (4), 2121-2174. doi: 10.2140/agt.2009.9.2121

Converting between quadrilateral and standard solution sets in normal surface theory

2008

Journal Article

Breaking the routine: Events to complement informatics olympiad training

Burton, Benjamin A. (2008). Breaking the routine: Events to complement informatics olympiad training. Olympiads in Informatics, 2, 5-15.

Breaking the routine: Events to complement informatics olympiad training

2008

Journal Article

Creating informatics olympiad tasks: Exploring the black art

Burton, Benjamin A. and Hiron, Mathias (2008). Creating informatics olympiad tasks: Exploring the black art. Olympiads in Informatics, 2, 16-36.

Creating informatics olympiad tasks: Exploring the black art

2007

Journal Article

Enumeration of non-orientable 3-manifolds using face-pairing graphs and union-find

Burton, Benjamin A. (2007). Enumeration of non-orientable 3-manifolds using face-pairing graphs and union-find. Discrete and Computational Geometry, 38 (3), 527-571. doi: 10.1007/s00454-007-1307-x

Enumeration of non-orientable 3-manifolds using face-pairing graphs and union-find

2007

Journal Article

Informatics olympiads: Approaching mathematics through code

Burton, Benjamin A. (2007). Informatics olympiads: Approaching mathematics through code. Mathematics Competitions, 20 (2), 29-51.

Informatics olympiads: Approaching mathematics through code

2007

Journal Article

Structures of small closed non-orientable 3-manifold triangulations

Burton, Benjamin A. (2007). Structures of small closed non-orientable 3-manifold triangulations. Journal of Knot Theory and Its Ramifications, 16 (5), 545-574. doi: 10.1142/S0218216507005439

Structures of small closed non-orientable 3-manifold triangulations

2007

Journal Article

Observations from the 8-tetrahedron nonorientable census

Burton, Benjamin A. (2007). Observations from the 8-tetrahedron nonorientable census. Experimental Mathematics, 16 (2), 129-144. doi: 10.1080/10586458.2007.10128994

Observations from the 8-tetrahedron nonorientable census

2004

Journal Article

Efficient enumeration of 3-manifold triangulations

Burton, Benjamin A. (2004). Efficient enumeration of 3-manifold triangulations. The Australian Mathematical Society Gazette, 31 (2), 111-117.

Efficient enumeration of 3-manifold triangulations

2004

Journal Article

Face pairing graphs and 3-manifold enumeration

Burton, Benjamin A. (2004). Face pairing graphs and 3-manifold enumeration. Journal of Knot Theory and Its Ramifications (JKTR), 13 (8), 1057-1101. doi: 10.1142/S0218216504003627

Face pairing graphs and 3-manifold enumeration

2004

Journal Article

Introducing Regina, the 3-manifold topology software

Burton, Benjamin A. (2004). Introducing Regina, the 3-manifold topology software. Experimental Mathematics, 13 (3), 267-272.

Introducing Regina, the 3-manifold topology software