Jonathan Spreer

Orcid: 0000-0001-6865-9483

Affiliations:
  • University of Sydney, School of Mathematics and Statistics, Australia


According to our database1, Jonathan Spreer authored at least 34 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Hard Diagrams of the Unknot.
Exp. Math., July, 2024

Triangulations in Geometry and Topology (Dagstuhl Seminar 24072).
Dagstuhl Reports, 2024

2023
Sampling triangulations of manifolds using Monte Carlo methods.
CoRR, 2023

On the Width of Complicated JSJ Decompositions.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

A Uniform Sampling Procedure for Abstract Triangulations of Surfaces.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022
Determining the Trisection Genus of Orientable and Non-Orientable PL 4-Manifolds through Triangulations.
Exp. Math., 2022

Flip Graphs of Stacked and Flag Triangulations of the 2-Sphere.
Electron. J. Comb., 2022

2020
The EKR property for flag pure simplicial complexes without boundary.
J. Comb. Theory A, 2020

A Polynomial-Time Algorithm to Compute Turaev-Viro Invariants $\mathrm {TV}_{4, q}$ of 3-Manifolds with Bounded First Betti Number.
Found. Comput. Math., 2020

Average Betti Numbers of Induced Subcomplexes in Triangulations of Manifolds.
Electron. J. Comb., 2020

2019
On the treewidth of triangulated 3-manifolds.
J. Comput. Geom., 2019

Short proof of two cases of Chvátal's conjecture.
Discret. Math., 2019

Parametrized Complexity of Expansion Height.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

3-Manifold Triangulations with Small Treewidth.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Algorithms and complexity for Turaev-Viro invariants.
J. Appl. Comput. Topol., 2018

A Construction Principle for Tight and Minimal Triangulations of Manifolds.
Exp. Math., 2018

The Trisection Genus of Standard Simply Connected PL 4-Manifolds.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
A characterization of tightly triangulated 3-manifolds.
Eur. J. Comb., 2017

A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Parameterized Complexity of Discrete Morse Theory.
ACM Trans. Math. Softw., 2016

A necessary condition for the tightness of odd-dimensional combinatorial manifolds.
Eur. J. Comb., 2016

Tight triangulations of closed 3-manifolds.
Eur. J. Comb., 2016

Admissible Colourings of 3-Manifold Triangulations for Turaev-Viro Type Invariants.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Efficient Algorithms to Decide Tightness.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Separation index of graphs and stacked 2-spheres.
J. Comb. Theory A, 2015

Random collapsibility and 3-sphere recognition.
CoRR, 2015

2014
Combinatorial 3-Manifolds with Transitive Cyclic Symmetry.
Discret. Comput. Geom., 2014

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

2013
The complexity of detecting taut angle structures on triangulations.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Computational topology and normal surfaces: Theoretical and experimental complexity bounds.
Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, 2013

2011
Combinatorial Properties of the <i>K</i>3 Surface: Simplicial Blowups and Slicings.
Exp. Math., 2011

Normal surfaces as combinatorial slicings.
Discret. Math., 2011

Simplicial blowups and discrete normal surfaces in simpcomp.
ACM Commun. Comput. Algebra, 2011

2010
simpcomp: a GAP toolbox for simplicial complexes.
ACM Commun. Comput. Algebra, 2010


  Loading...