default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan Spreer
Person information
- affiliation: University of Sydney, School of Mathematics and Statistics, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Benjamin A. Burton
, Hsien-Chih Chang, Maarten Löffler, Clément Maria, Arnaud de Mesmay, Saul Schleimer, Eric Sedgwick, Jonathan Spreer:
Hard Diagrams of the Unknot. Exp. Math. 33(3): 482-500 (2024)- [i18]Maike Buchin, Jean Cardinal, Arnaud de Mesmay, Jonathan Spreer, Alex He:
Triangulations in Geometry and Topology (Dagstuhl Seminar 24072). Dagstuhl Reports 14(2): 120-163 (2024) - 2023
- [c13]Rajan Shankar, Jonathan Spreer:
A Uniform Sampling Procedure for Abstract Triangulations of Surfaces. ALENEX 2023: 15-26 - [c12]Kristóf Huszár, Jonathan Spreer:
On the Width of Complicated JSJ Decompositions. SoCG 2023: 42:1-42:18 - [i17]Kristóf Huszár, Jonathan Spreer:
On the width of complicated JSJ decompositions. CoRR abs/2303.06789 (2023) - [i16]Eduardo G. Altmann, Jonathan Spreer:
Sampling triangulations of manifolds using Monte Carlo methods. CoRR abs/2310.07372 (2023) - 2022
- [j19]Benjamin A. Burton, Basudeb Datta, Jonathan Spreer:
Flip Graphs of Stacked and Flag Triangulations of the 2-Sphere. Electron. J. Comb. 29(2) (2022) - [j18]Jonathan Spreer, Stephan Tillmann:
Determining the Trisection Genus of Orientable and Non-Orientable PL 4-Manifolds through Triangulations. Exp. Math. 31(3): 897-907 (2022) - [i15]Rajan Shankar, Jonathan Spreer:
A Uniform Sampling Procedure for Abstract Triangulations of Surfaces. CoRR abs/2211.07798 (2022) - 2020
- [j17]Giulia Codenotti, Jonathan Spreer, Francisco Santos:
Average Betti Numbers of Induced Subcomplexes in Triangulations of Manifolds. Electron. J. Comb. 27(3): 3 (2020) - [j16]Clément Maria, Jonathan Spreer:
A Polynomial-Time Algorithm to Compute Turaev-Viro Invariants $\mathrm {TV}_{4, q}$ of 3-Manifolds with Bounded First Betti Number. Found. Comput. Math. 20(5): 1013-1034 (2020) - [j15]Jorge Alberto Olarte, Francisco Santos, Jonathan Spreer, Christian Stump:
The EKR property for flag pure simplicial complexes without boundary. J. Comb. Theory A 172: 105205 (2020)
2010 – 2019
- 2019
- [j14]Jorge Alberto Olarte, Francisco Santos, Jonathan Spreer:
Short proof of two cases of Chvátal's conjecture. Discret. Math. 342(8): 2192-2194 (2019) - [j13]Kristóf Huszár, Jonathan Spreer, Uli Wagner:
On the treewidth of triangulated 3-manifolds. J. Comput. Geom. 10(2): 70-98 (2019) - [c11]Kristóf Huszár, Jonathan Spreer:
3-Manifold Triangulations with Small Treewidth. SoCG 2019: 44:1-44:20 - [c10]Ulrich Bauer, Abhishek Rathod, Jonathan Spreer:
Parametrized Complexity of Expansion Height. ESA 2019: 13:1-13:15 - [i14]Ulrich Bauer, Abhishek Rathod, Jonathan Spreer:
Parametrized Complexity of Expansion Height. CoRR abs/1910.09228 (2019) - 2018
- [j12]Benjamin A. Burton, Basudeb Datta, Nitin Singh, Jonathan Spreer:
A Construction Principle for Tight and Minimal Triangulations of Manifolds. Exp. Math. 27(1): 22-36 (2018) - [j11]Benjamin A. Burton, Clément Maria, Jonathan Spreer:
Algorithms and complexity for Turaev-Viro invariants. J. Appl. Comput. Topol. 2(1-2): 33-53 (2018) - [c9]Kristóf Huszár, Jonathan Spreer, Uli Wagner:
On the Treewidth of Triangulated 3-Manifolds. SoCG 2018: 46:1-46:15 - [c8]Jonathan Spreer, Stephan Tillmann:
The Trisection Genus of Standard Simply Connected PL 4-Manifolds. SoCG 2018: 71:1-71:13 - [i13]Kristóf Huszár, Jonathan Spreer:
3-Manifold triangulations with small treewidth. CoRR abs/1812.05528 (2018) - 2017
- [j10]Bhaskar Bagchi, Basudeb Datta, Jonathan Spreer:
A characterization of tightly triangulated 3-manifolds. Eur. J. Comb. 61: 133-137 (2017) - [c7]Clément Maria, Jonathan Spreer:
A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number. SODA 2017: 2721-2732 - [i12]Kristóf Huszár, Jonathan Spreer, Uli Wagner:
On the treewidth of triangulated 3-manifolds. CoRR abs/1712.00434 (2017) - 2016
- [j9]Jonathan Spreer:
A necessary condition for the tightness of odd-dimensional combinatorial manifolds. Eur. J. Comb. 51: 475-491 (2016) - [j8]Bhaskar Bagchi, Basudeb Datta, Jonathan Spreer:
Tight triangulations of closed 3-manifolds. Eur. J. Comb. 54: 103-120 (2016) - [j7]Benjamin A. Burton, Thomas Lewiner, João Paixão, Jonathan Spreer:
Parameterized Complexity of Discrete Morse Theory. ACM Trans. Math. Softw. 42(1): 6:1-6:24 (2016) - [c6]Bhaskar Bagchi, Basudeb Datta, Benjamin A. Burton, Nitin Singh, Jonathan Spreer:
Efficient Algorithms to Decide Tightness. SoCG 2016: 12:1-12:15 - [c5]Clément Maria, Jonathan Spreer:
Admissible Colourings of 3-Manifold Triangulations for Turaev-Viro Type Invariants. ESA 2016: 64:1-64:16 - [i11]Clément Maria, Jonathan Spreer:
A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number. CoRR abs/1607.02218 (2016) - 2015
- [j6]Benjamin A. Burton, Basudeb Datta, Nitin Singh, Jonathan Spreer:
Separation index of graphs and stacked 2-spheres. J. Comb. Theory A 136: 184-197 (2015) - [c4]Benjamin A. Burton, Clément Maria, Jonathan Spreer:
Algorithms and Complexity for Turaev-Viro Invariants. ICALP (1) 2015: 281-293 - [i10]Benjamin A. Burton, Clément Maria, Jonathan Spreer:
Algorithms and complexity for Turaev-Viro invariants. CoRR abs/1503.04099 (2015) - [i9]João Paixão, Jonathan Spreer:
Random collapsibility and 3-sphere recognition. CoRR abs/1509.07607 (2015) - [i8]Clément Maria, Jonathan Spreer:
Admissible colourings of 3-manifold triangulations for Turaev-Viro type invariants. CoRR abs/1512.04648 (2015) - 2014
- [j5]Jonathan Spreer:
Combinatorial 3-Manifolds with Transitive Cyclic Symmetry. Discret. Comput. Geom. 51(2): 394-426 (2014) - [i7]Jonathan Spreer, Uli Wagner, Benjamin A. Burton, Satoshi Murai, Eric Sedgwick, Henry Segerman:
Collection of abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto. CoRR abs/1406.0333 (2014) - [i6]Bhaskar Bagchi, Benjamin A. Burton, Basudeb Datta, Nitin Singh, Jonathan Spreer:
Efficient algorithms to decide tightness. CoRR abs/1412.1547 (2014) - 2013
- [c3]Benjamin A. Burton, João Paixão, Jonathan Spreer:
Computational topology and normal surfaces: Theoretical and experimental complexity bounds. ALENEX 2013: 78-87 - [c2]Benjamin A. Burton, Thomas Lewiner, João Paixão, Jonathan Spreer:
Parameterized complexity of discrete morse theory. SoCG 2013: 127-136 - [c1]Benjamin A. Burton, Jonathan Spreer:
The complexity of detecting taut angle structures on triangulations. SODA 2013: 168-183 - [i5]Benjamin A. Burton, Thomas Lewiner, João Paixão, Jonathan Spreer:
Parameterized Complexity of Discrete Morse Theory. CoRR abs/1303.7037 (2013) - 2012
- [i4]Benjamin A. Burton, Jonathan Spreer:
The complexity of detecting taut angle structures on triangulations. CoRR abs/1207.0904 (2012) - [i3]Benjamin A. Burton, João Paixão, Jonathan Spreer:
Computational topology and normal surfaces: Theoretical and experimental complexity bounds. CoRR abs/1211.3234 (2012) - 2011
- [j4]Felix Effenberger, Jonathan Spreer:
Simplicial blowups and discrete normal surfaces in simpcomp. ACM Commun. Comput. Algebra 45(3/4): 173-176 (2011) - [j3]Jonathan Spreer:
Normal surfaces as combinatorial slicings. Discret. Math. 311(14): 1295-1309 (2011) - [j2]Jonathan Spreer, Wolfgang Kühnel:
Combinatorial Properties of the K3 Surface: Simplicial Blowups and Slicings. Exp. Math. 20(2): 201-216 (2011) - [i2]Felix Effenberger, Jonathan Spreer:
Simplicial blowups and discrete normal surfaces in simpcomp. CoRR abs/1105.5298 (2011) - 2010
- [j1]Felix Effenberger, Jonathan Spreer:
simpcomp: a GAP toolbox for simplicial complexes. ACM Commun. Comput. Algebra 44(3/4): 186-189 (2010) - [i1]Felix Effenberger, Jonathan Spreer:
simpcomp -- A GAP toolbox for simplicial complexes. CoRR abs/1004.1367 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
