Benjamin A. Burton

Alexander He

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Embeddings of 3-Manifolds in <i>S</i><sup>4</sup> from the Point of View of the 11-Tetrahedron Census.

[BibT_eX]

[DOI]

Ryan Budney

Exp. Math., 2022

Flip Graphs of Stacked and Flag Triangulations of the 2-Sphere.

[BibT_eX]

[DOI]

Basudeb Datta

Electron. J. Comb., 2022

2021

On the hardness of finding normal surfaces.

[BibT_eX]

[DOI]

Alexander He

J. Appl. Comput. Topol., 2021

2020

Connecting 3-manifold triangulations with monotonic sequences of bistellar flips.

[BibT_eX]

[DOI]

Alexander He

CoRR, 2020

Knot Diagrams of Treewidth Two.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

The Next 350 Million Knots.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

2018

Algorithms and complexity for Turaev-Viro invariants.

[BibT_eX]

[DOI]

Clément Maria

J. Appl. Comput. Topol., 2018

A Construction Principle for Tight and Minimal Triangulations of Manifolds.

[BibT_eX]

[DOI]

Exp. Math., 2018

The HOMFLY-PT Polynomial is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Courcelle's theorem for triangulations.

[BibT_eX]

[DOI]

Rodney G. Downey

J. Comb. Theory, Ser. A, 2017

Finding Non-orientable Surfaces in 3-Manifolds.

[BibT_eX]

[DOI]

Arnaud de Mesmay

Uli Wagner

Discret. Comput. Geom., 2017

Applications of Topology to the Analysis of 1-Dimensional Objects (Dagstuhl Seminar 17072).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2017

Randomness testing and comparison of classical and quantum bit generators.

[BibT_eX]

[DOI]

Serdar Boztas

Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Parameterized Complexity of Discrete Morse Theory.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2016

2-manifold recognition is in logspace.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

Efficient Algorithms to Decide Tightness.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Separation index of graphs and stacked 2-spheres.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2015

An Edge-Based Framework for Enumerating 3-Manifold Triangulations.

[BibT_eX]

[DOI]

William Pettersson

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Knot theory: Algorithms, complexity and computation (NII Shonan Meeting 2014-4).

[BibT_eX]

[DOI]

Ryan Budney

Kazuhiro Ichihara

NII Shonan Meet. Rep., 2014

Multi-Objective Integer Programming: An Improved Recursive Algorithm.

[BibT_eX]

[DOI]

Cameron A. G. MacRae

J. Optim. Theory Appl., 2014

A Duplicate Pair in the SnapPea Census.

[BibT_eX]

[DOI]

Exp. Math., 2014

A New Approach to Crushing 3-Manifold Triangulations.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Collection of abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto.

[BibT_eX]

[DOI]

CoRR, 2014

On the Complexity of Immersed Normal Surfaces.

[BibT_eX]

[DOI]

Éric Colin de Verdière

Arnaud de Mesmay

CoRR, 2014

The cusped hyperbolic census is complete.

[BibT_eX]

[DOI]

CoRR, 2014

Fixed Parameter Tractable Algorithms in Combinatorial Topology.

[BibT_eX]

[DOI]

William Pettersson

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Enumerating fundamental normal surfaces: Algorithms, experiments and invariants.

[BibT_eX]

[DOI]

Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013

Locating Regions in a Sequence under Density Constraints.

[BibT_eX]

[DOI]

Mathias Hiron

SIAM J. Comput., 2013

Optimising a nonlinear utility function in multi-objective integer programming.

[BibT_eX]

[DOI]

Meral Azizoglu

J. Glob. Optim., 2013

A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology.

[BibT_eX]

[DOI]

Algorithmica, 2013

The complexity of detecting taut angle structures on triangulations.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Computing closed essential surfaces in knot complements.

[BibT_eX]

[DOI]

Alexander Coward

Stephan Tillmann

Proceedings of the Symposium on Computational Geometry 2013, 2013

Computational topology and normal surfaces: Theoretical and experimental complexity bounds.

[BibT_eX]

[DOI]

João Paixão

Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, 2013

2012

Computing the Crosscap Number of a Knot Using Integer Programming and Normal Surfaces.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2012

A fast branching algorithm for unknot recognition with experimental polynomial-time behaviour

[BibT_eX]

[DOI]

CoRR, 2012

Computational topology with Regina: Algorithms, heuristics and implementations

[BibT_eX]

[DOI]

CoRR, 2012

Complementary Vertices and Adjacency Testing in Polytopes.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

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

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2011

Fundamental normal surfaces and the enumeration of Hilbert bases

[BibT_eX]

[DOI]

CoRR, 2011

Simplification paths in the Pachner graphs of closed orientable 3-manifold triangulations

[BibT_eX]

[DOI]

CoRR, 2011

Searching a Bitstream in Linear Time for the Longest Substring of Any Given Density.

[BibT_eX]

[DOI]

Algorithmica, 2011

Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

The pachner graph and the simplification of 3-sphere triangulations.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

Optimizing the double description method for normal surface enumeration.

[BibT_eX]

[DOI]

Math. Comput., 2010

Quadrilateral-Octagon Coordinates for Almost Normal Surfaces.

[BibT_eX]

[DOI]

Exp. Math., 2010

The complexity of the normal surface solution space.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2008

Informatics olympiads: challenges in programming and algorithm design.

[BibT_eX]

[DOI]

Proceedings of the Computer Science 2008, 2008

2007

Observations from the 8-Tetrahedron Nonorientable Census.

[BibT_eX]

[DOI]

Exp. Math., 2007

Enumeration of Non-Orientable 3-Manifolds Using Face-Pairing Graphs and Union-Find.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

2004

Introducing Regina, The 3-Manifold Topology Software.

[BibT_eX]

[DOI]