Dr. Jonathan Spreer  
>> Homepage at the University of Queensland  
Address 
University of Queensland


Phone 
+61(0)7 / 3365 3116 

Room 
67.751 

CV  
since 2014  Postdoctoral Research Fellow funded by the AustraliaIndia Strategic Research Fund (AISRF), grant AISRF06660, at the School of Mathematics and Physics, University of Queensland.  
20122013  Postdoctoral Research Fellow at the School of Mathematics and Physics, University of Queensland.  
2011  Doctorate in natural sciences (Dr. rer. nat.) at the University of Stuttgart. Dissertation: Blowups, slicings and permutation groups in combinatorial topology [ bib  http ] (Doctoral advisor: Prof. W. Kühnel).  
20102011  Research assistant at DFGProject Ku 1203/53.  
20082011  Research assistant at the Institute of Geometry and Topology, University of Stuttgart.  
2008  Diploma in mathematics and computer science at the University of Stuttgart. Diploma thesis at the Institute of Geometry and Topology, University of Stuttgart: On the Topology of combinatorial 4manifolds, in particular the K3Surface [ bib ] (Supervisor: Prof. W. Kühnel).  
20072008  Student research assistant at DFGProject Ku 1203/52.  
2007  Maîtrise (french one year postgraduate diploma) in mathematics at the Université Pierre et Marie Curie in Paris.  
20062007  Studies of mathematics at the Université Pierre et Marie Curie.  
20032008  Studies of mathematics and computing science at the University of Stuttgart. Specialized in topology, algebra and combinatorial topology.  
Research areas  
 
Current research projects  
2015  2017  Benjamin A. Burton, Jonathan Spreer, Tractable topological computing: Escaping the hardness trap, Australian Research Council (ARC) Discovery Project 2015, DP150104108.  
Abstract: Computational topology is a young and energetic field that uses computers to solve complex geometric problems driven by pure mathematics, and with diverse applications in biology, signal processing and data mining. A major barrier is that many of these problems are thought to be fundamentally and intractably hard. This project will defy such barriers for typical realworld inputs by fusing geometric techniques with technologies from the field of parameterised complexity, creating powerful, practical solutions for these problems. It will shed muchneeded light on the vast and puzzling gap between theory and practice, and give researchers fast new software tools for largescale experimentation and cuttingedge computer proofs.  
 
2014  2016  Benjamin A. Burton, Basudeb Datta, Jonathan Spreer, Nitin Singh, Building triangulations for fast topological computing, DIICCSRTE, AustraliaIndia Strategic Research Fund (AISRF), Round 7, AISRF06660.  
Abstract: Computational topology is a young and fastgrowing area of ICT, with roots in geometry and applications in biology, physics, computer vision and cosmology, in which real computations are often prohibitively expensive. We will overcome this by building "tight triangulations", highly efficient forms of input with which we can solve substantial problems cheaply using new and innovative heuristics. Outcomes will include practical software, with significant benefits spanning both ICT and mathematics.  
 
Scientific work  
In press  
[1]  Benjamin A. Burton and Basudeb Datta and Nitin Singh and Jonathan Spreer. Separation index of graphs and stacked 2spheres, 2014. 11 pages. To appear in Journal of Combinatorial Theory, Series A. [ bib  http ]  
[2]  Benjamin A. Burton and Clément Maria and Jonathan Spreer. Algorithms and complexity for TuraevViro invariants , 2015. 17 pages, 5 figures. To appear in ICALP 2015: 42nd International Colloquium on Automata, Languages and Programming. [ bib  http ]  
[3]  Benjamin A. Burton and Jonathan Spreer. Combinatorial Seifert fibred spaces with transitive cyclic automorphism group. 26 pages, 10 figures. To appear in Israel Journal of Mathematics. [ bib  http ]  
[4a]  Benjamin A. Burton, Thomas Lewiner, João Paixão and Jonathan Spreer. Parameterized complexity of discrete Morse theory. To appear in ACM Transaction on Mathematical Software (TOMS). [ bib  http ]  
[5]  Biplab Basak and Jonathan Spreer. Simple crystallizations of 4manifolds. 22 pages, 7 figures. To appear in Advances in Geometry. [ bib  http ]  
2014  
[6]  Jonathan Spreer. Combinatorial 3manifolds with transitive cyclic automorphism group. Discrete and Computational Geometry, 51(2):394426, 2014. [ bib  doi:10.1007/s0045401395607 ]  
2013  
[4b]  Benjamin A. Burton, Thomas Lewiner, João Paixão and Jonathan Spreer. Parameterized complexity of discrete Morse theory. Proceedings of the TwentyNinth Annual Symposium on Computational Geometry (SoCG), pg. 127136, 2013. [ bib  http ]  
[7]  Benjamin A. Burton, João Paixão and Jonathan Spreer. Computational topology and normal surfaces: Theoretical and experimental complexity bounds. Proceedings of the Meeting on Algorithm Engineering and Experiments, pg. 7887, 2013. [ bib  http ]  
[8]  Benjamin A. Burton and Jonathan Spreer. The complexity of detecting taut angle structures on triangulations. Proceedings of the TwentyFourth Annual ACMSIAM Symposium on Discrete Algorithms, pg. 168183, 2013. [ bib  http ]  
[9]  Benjamin A. Burton and Jonathan Spreer. Computationally proving triangulated 4manifolds to be diffeomorphic. 29th ACM Symposium on Computational Geometry, Young Researchers Forum, Collections of abstracts, 2013, pages 1516. [ bib  http ]  
2012  
[10]  Jonathan Spreer. Partitioning the triangles of the cross polytope into surfaces. Beitr. Algebra Geom. / Contributions to Algebra and Geometry, 53(2):473486, 2012. [ bib  doi:10.1007/s1336601100831 ]  
2011  
[11]  Felix Effenberger and Jonathan Spreer. Simplicial blowups and discrete normal surfaces in the GAP package simpcomp. ACM Communications in Computer Algebra, 45(3):173  176, 2011. [ bib ]  
[12]  Jonathan Spreer. Normal surfaces as combinatorial slicings. Discrete Math., 311(14):12951309, 2011. [ bib  doi:10.1016/j.disc.2011.03.013 ]  
[13]  Jonathan Spreer and Wolfgang Kühnel. Combinatorial properties of the K3 surface: Simplicial blowups and slicings. Exp. Math., 20(2):201216, 2011. [ bib  http ]  
2010  
[14]  Felix Effenberger and Jonathan Spreer. simpcomp  a GAP toolbox for simplicial complexes. ACM Communications in Computer Algebra, 44(4):186  189, 2010. [ bib ]  
Preprints  
[1]  Bhaskar Bagchi and Benjamin A. Burton and Basudeb Datta and Nitin Singh and Jonathan Spreer. Efficient algorithms to decide tightness, 2014. 18 pages, 3 figures, arXiv:1412.1547 [math.GT]. [ bib  http ]  
[15]  Bhaskar Bagchi and Basudeb Datta and Jonathan Spreer. Tight triangulations of closed 3manifolds, 2014. 19 pages, 1 figure, arXiv:1412.0412 [math.GT]. [ bib  http ]  
[17]  William Jaco and Jesse Johnson and Jonathan Spreer and Stephan Tillmann. Bounds for the genus of a normal surface, 2014. 38 pages, 25 figures, arXiv:1411.6413 [math.GT]. [ bib  http ]  
[18]  Jonathan Spreer. Necessary conditions for the tightness of odddimensional combinatorial manifolds, 2014. 18 pages, 1 figure, arXiv:1405.5962 [math.CO]. [ bib  http ]  
Mathematical software  
[19]  Felix Effenberger and Jonathan Spreer. simpcomp  A GAP package, Version 2.0.0, 20092013. [ bib  http ]  
Editorship  
[20]  Jonathan Spreer, Uli Wagner (Organisers), 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. 4 x 6 page extended abstracts. The workshop was held as part of CGWeek 2014 at Kyoto University. June 10th, 2014 [ bib  http ]  
Theses  
[21]  Jonathan Spreer. Blowups, slicings and permutation groups in combinatorial topology. Logos Verlag Berlin, 2011. Dissertation. [ bib  http ]  
[22]  Jonathan Spreer. Über die Topologie von kombinatorischen 4Mannigfaltigkeiten, insbesondere der K3Fläche, 2008. Diplomarbeit. [ bib ]  
Software  
simpcomp  A GAP toolbox for simplicial complexes  simpcomp homepage. Joint project with Felix Effenberger. "Best Software Presentation Award" by the Fachgruppe Computeralgebra at the ISSAC 2010 in Munich. 

Teaching  
Semester 1, 2015:  MATH2301: Linear and Abstract Algebra and Number Theory  
Semester 2, 2014:  Reading course in Complexity Theory  
Semester 1, 2014:  MATH3302: Coding and Cryptography  
Semester 1, 2013:  MATH3302: Coding and Cryptography  
Winter 2009/2010:  Mathematics for Computer Scientists and Software Engineers I (Prof. Dr. Wolfgang Rump)  
Summer 2009:  Mathematics for Computer Scientists and Software Engineers II (Prof. Dr. Eberhard Teufel)  
Winter 2008/2009:  Mathematics for Computer Scientists and Software Engineers I (Prof. Dr. Eberhard Teufel)  
Office hours  
Thursday, 11.00 am  12.00 pm  
Links  
