Last updated: 7 March 2016
| 2015 | ||
|---|---|---|
| The hardness of simplifying triangulations | ||
| ACCMCC: Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (Dec 2015) | Brisbane, Australia | |
| Knots, computers, and a tangled career | ||
| Australian Mathematical Sciences Student Conference (Dec 2015) | Hobart, Australia | |
| A theory for practical computational topology | ||
| Melbourne University (Nov 2015) | Melbourne, Australia | |
| Exploring parameterised complexity in computational topology | ||
| Indian Statistical Institute (Nov 2015) | Kolkata, India | |
| Exploring parameterised complexity in computational topology | ||
| Indian Institute of Science (Nov 2015) | Bangalore, India | |
| Knots, 3-manifolds and polyhedra | ||
| Universität Osnabrück (Oct 2015) | Osnabrück, Germany | |
| The computational hardness of normal surfaces | ||
| Annual Meeting of the Australian Mathematical Society (Sep 2015) | Melbourne, Australia | |
| How easy are problems in low-dimensional topology? | ||
| UQ Pure Mathematics Seminar (Sep 2015) | Brisbane, Australia | |
| How easy are problems in low-dimensional topology? | ||
| IST Austria (Jul 2015) | Vienna, Austria | |
| Practical parameterised complexity for knots and 3-manifolds | ||
| 4th Annual Minisymposium on Computational Topology (CG-Week, Jun 2015) | Eindhoven, Netherlands | |
| 2014 | ||
| Parameterised complexity in 3-manifold topology | ||
| Foundations of Computational Mathematics (Dec 2014) | Montevideo, Uruguay | |
| Courcelle’s theorem for triangulations | ||
| Australia-New Zealand Mathematics Convention (Dec 2014) | Melbourne, Australia | |
| There and back again | ||
| AustMS Early Career Workshop (Dec 2014) | Melbourne, Australia | |
| Exploring parameterised complexity in computational topology | ||
| Chennai Mathematical Institute (Nov 2014) | Chennai, India | |
| Untangling knots using combinatorial optimisation | ||
| Chennai Mathematical Institute (Nov 2014) | Chennai, India | |
| Knots, algorithms and linear programming: The quest to solve unknot recognition in polynomial time | ||
| Indian Institute of Science (Nov 2014) | Bangalore, India | |
| Courcelle’s theorem for triangulations | ||
| ICM 2014: International Congress of Mathematicians — Mathematical Aspects of Computer Science (Aug 2014) | Seoul, Korea | |
| Exact computation and the cusped hyperbolic census | ||
| ICM 2014: International Congress of Mathematicians — Topology (Aug 2014) | Seoul, Korea | |
| Recent developments in Regina: Exact computation with triangulated 3-manifolds | ||
| ICMS 2014: International Congress on Mathematical Software (Aug 2014) | Seoul, Korea | |
| Exact computation with hyperbolic 3-manifolds | ||
| TU Berlin (Jul 2014) | Berlin, Germany | |
| Exact computation with hyperbolic 3-manifolds | ||
| UQ Pure Mathematics Seminar (Jun 2014) | Brisbane, Australia | |
| Exact computation with hyperbolic 3-manifolds | ||
| Workshop on Geometric Structures with Symmetry and Periodicity (CG-Week, Jun 2014) | Kyoto, Japan | |
| Courcelle’s theorem for triangulations | ||
| Workshop on Triangulations in Geometry and Topology (CG-Week, Jun 2014) | Kyoto, Japan | |
| Regina: Software demonstration | ||
| NII Shonan Meeting: Knot Theory: Algorithms, Complexity and Computation (Apr 2014) | Tokyo, Japan | |
| Exploring parameterised complexity in computational topology | ||
| Computational & Algorithmic Topology, Sydney (Apr 2014) | Sydney, Australia | |
| Enumerating fundamental normal surfaces: Algorithms, experiments and invariants | ||
| ALENEX 2014: Meeting on Algorithm Engineering & Experiments (Jan 2014) | Portland, USA | |
| 2013 | ||
| Exploring parameterised complexity in computational topology | ||
| Journées de géométrie algorithmique (Dec 2013) | CIRM (Luminy), France | |
| Untangling knots using combinatorial optimisation | ||
| INRIA Sophia Antipolis - Méditerranée (Dec 2013) | Sophia Antipolis, France | |
| Untangling knots using combinatorial optimisation | ||
| École Normale Supérieure (Dec 2013) | Paris, France | |
| Exploring parameterised complexity in computational topology | ||
| Columbia University (Nov 2013) | New York, USA | |
| Computational surprises: mathematical programming and normal surface theory | ||
| Topology, Geometry and Group Theory, Informed by Experiment (Oct 2013) | Providence, USA | |
| Regina: Triangulations, normal surfaces and other goodies | ||
| Topology, Geometry and Group Theory, Informed by Experiment (Oct 2013) | Providence, USA | |
| Exploring parameterised complexity in computational topology | ||
| Oklahoma State University (Oct 2013) | Stillwater, USA | |
| How to crush a triangulation politely | ||
| UQ Pure Mathematics Seminar (Aug 2013) | Brisbane, Australia | |
| Knots, algorithms and linear programming: The quest to solve unknot recognition in polynomial time | ||
| TU Berlin (Jul 2013) | Berlin, Germany | |
| A new approach to crushing 3-manifold triangulations | ||
| SCG ’13: Annual Symposium on Computational Geometry (Jun 2013) | Rio de Janeiro, Brazil | |
| Computing closed essential surfaces in knot complements | ||
| SCG ’13: Annual Symposium on Computational Geometry (Jun 2013) | Rio de Janeiro, Brazil | |
| A metatheorem for triangulations | ||
| UQ Pure Mathematics Seminar (May 2013) | Brisbane, Australia | |
| Exploring parameterised complexity in computational topology | ||
| NII Shonan Meeting: Parameterized Complexity and the Understanding, Design and Analysis of Heuristics (May 2013) | Tokyo, Japan | |
| Untangling knots using combinatorial optimisation | ||
| UQ Statistics, Modelling and Operations Research Seminar (Apr 2013) | Brisbane, Australia | |
| Untangling knots using combinatorial optimisation | ||
| University of Sydney Geometry Seminar (Apr 2013) | Sydney, Australia | |
| Computing which knots are large | ||
| Nara Women’s University (Mar 2013) | Nara, Japan | |
| Why should unknot recognition and 3-sphere recognition be fast? | ||
| Chuo University (Mar 2013) | Tokyo, Japan | |
| Computational complexity, taut structures and unknot recognition | ||
| Nihon University (Mar 2013) | Tokyo, Japan | |
| Untangling knots using combinatorial optimisation | ||
| Tokyo Institute of Technology (Mar 2013) | Tokyo, Japan | |
| Knots, algorithms and linear programming: The quest to solve unknot recognition in polynomial time | ||
| University of Tokyo (Mar 2013) | Tokyo, Japan | |
| Enumeration and experimentation: Exploring the landscape of 3-manifold triangulations | ||
| Osaka City University (Mar 2013) | Osaka, Japan | |
| Computing which knots are large | ||
| Hiroshima University (Mar 2013) | Hiroshima, Japan | |
| The complexity of detecting taut angle structures on triangulations | ||
| SODA 2013: ACM-SIAM Symposium on Discrete Algorithms (Jan 2013) | New Orleans, USA | |
| 2012 | ||
| Computational complexity, triangulations, and taut structures | ||
| RMIT University (Oct 2012) | Melbourne, Australia | |
| Unknot recognition and the elusive polynomial-time algorithm | ||
| INRIA Sophia Antipolis - Méditerranée (Oct 2012) | Sophia Antipolis, France | |
| Complementary vertices and adjacency testing in polytopes | ||
| COCOON 2012: Annual International Computing and Combinatorics Conference (Aug 2012) | Sydney, Australia | |
| Using Regina to experiment and compute with 3-manifold triangulations and normal surfaces | ||
| GTS 2012: Minisymposium on Publicly Available Geometric/Topological Software (CG-Week, Jun 2012) | Chapel Hill, USA | |
| Regina in Regina: Adventures in computation with knots and 3-manifolds | ||
| Canadian Mathematical Society Summer Meeting (Jun 2012) | Regina, Canada | |
| Computational complexity, taut structures and triangulations | ||
| University of Sydney Algorithms Seminar (May 2012) | Sydney, Australia | |
| Unknot recognition and the elusive polynomial-time algorithm | ||
| University of New South Wales (May 2012) | Sydney, Australia | |
| Computational complexity, taut structures and triangulations | ||
| University of Adelaide Differential Geometry Seminar (May 2012) | Adelaide, Australia | |
| Unknot recognition and the elusive polynomial-time algorithm | ||
| University of Adelaide Colloquium (May 2012) | Adelaide, Australia | |
| Normal surface theory: Using the big machine | ||
| Technische Universität Darmstadt (May 2012) | Darmstadt, Germany | |
| Regina: Software demonstration | ||
| Oberwolfach Workshop: Triangulations (May 2012) | Oberwolfach, Germany | |
| Pachner moves, generic complexity, and randomising 3-manifold triangulations | ||
| Oberwolfach Workshop: Triangulations (May 2012) | Oberwolfach, Germany | |
| Exploring the landscape of 3-manifold triangulations | ||
| Università di Pisa (Apr 2012) | Pisa, Italy | |
| Linear and almost-linear algorithms for sequence analysis | ||
| RMIT University (Feb 2012) | Melbourne, Australia | |
| Knot invariants, normal surfaces and integer programming | ||
| Melbourne University (Feb 2012) | Melbourne, Australia | |
| Hyperplane arrangements and algorithmic complexity in low-dimensional topology | ||
| Workshop: Extended Root Systems and Fundamental Groups (Feb 2012) | Tokyo, Japan | |
| Knot invariants, normal surfaces and integer programming | ||
| Nihon University (Feb 2012) | Tokyo, Japan | |
| 2011 | ||
| Challenges of combinatorial enumeration in low-dimensional topology | ||
| ACCMCC: Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (Dec 2011) | Melbourne, Australia | |
| Generic and parameterised complexity of decision problems in low-dimensional topology | ||
| Parameterized Complexity: Not About Graphs (Aug 2011) | Darwin, Australia | |
| What is... or who is... Regina? | ||
| Geometry & Topology Down Under (Jul 2011) | Melbourne, Australia | |
| Unknot recognition, linear programming and the elusive polynomial time algorithm | ||
| École Normale Supérieure (Jun 2011) | Paris, France | |
| A tree traversal algorithm for decision problems in knot theory and 3-manifold topology | ||
| SCG ’11: Annual Symposium on Computational Geometry (Jun 2011) | Paris, France | |
| The Pachner graph and the simplification of 3-sphere triangulations | ||
| SCG ’11: Annual Symposium on Computational Geometry (Jun 2011) | Paris, France | |
| Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations | ||
| ISSAC ’11: International Symposium on Symbolic and Algebraic Computation (Jun 2011) | San Jose, USA | |
| Models of complexity, high-performance computing and computational topology | ||
| RMIT University (May 2011) | Melbourne, Australia | |
| Linear and almost-linear algorithms for sequence analysis | ||
| University of Queensland (Apr 2011) | Brisbane, Australia | |
| Unknot recognition, linear programming and the elusive polynomial time algorithm | ||
| RMIT University / Access Grid (Feb 2011) | Melbourne, Australia | |
| 2010 | ||
| Is simplifying triangulations as hard as it seems? | ||
| ACCMCC: Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (Dec 2010) | Canberra, Australia | |
| The Pachner graph and the simplification of 3-sphere triangulations | ||
| Melbourne University (Nov 2010) | Melbourne, Australia | |
| Linear programming, combinatorial geometry and the perfect sausage | ||
| RMIT University (Nov 2010) | Melbourne, Australia | |
| Is simplifying triangulations as hard as it seems? | ||
| AustMS Annual Meeting (Sep 2010) | Brisbane, Australia | |
| Encouraging algorithmic thinking without a computer | ||
| IOI Conference (Aug 2010) | Waterloo, Canada | |
| Polytopes, combinatorics and complexity in computational topology | ||
| Combinatorics and Mathematical Physics 2010 (Jul 2010) | Brisbane, Australia | |
| Computational topology in four dimensions | ||
| Workshop: Algorithms, Algebra and Analysis in Four Dimensions (Jul 2010) | Brisbane, Australia | |
| Computer session | ||
| Workshop: Algorithms, Algebra and Analysis in Four Dimensions (Jul 2010) | Brisbane, Australia | |
| Problem setting in mathematics and informatics: Weaving proof into programming | ||
| Congress of the World Federation of National Mathematics Competitions (Jul 2010) | Riga, Latvia | |
| Communication and cooperation: A report on the 2010 Informatics Olympiad workshop | ||
| Congress of the World Federation of National Mathematics Competitions (Jul 2010) | Riga, Lavtia | |
| The complexity of the normal surface solution space | ||
| SCG ’10: Annual Symposium on Computational Geometry (Jun 2010) | Snowbird, USA | |
| Linear programming, combinatorial geometry and the perfect sausage | ||
| University of Queensland (May 2010) | Brisbane, Australia | |
| Polytopes, combinatorics and complexity in computational topology | ||
| Oxford University (May 2010) | Oxford, UK | |
| Developing an international repository of problems | ||
| IOI Development Workshop (May 2010) | Dagstuhl, Germany | |
| Using a wiki for peer-to-peer teaching and learning | ||
| IOI Development Workshop (May 2010) | Dagstuhl, Germany | |
| Fast, faster, fastest: Algorithms in cryptography and bioinformatics | ||
| Group Theory International Webinar (Apr 2010) | ||
| A short history of 3-sphere recognition | ||
| University of Queensland (Mar 2010) | Brisbane, Australia | |
| The Weber-Seifert dodecahedral space: Answering a computational challenge | ||
| Mini-Workshop: Topology of the Space of Knots (Feb 2010) | Tokyo, Japan | |
| Normal surfaces: Taming the wild algorithms of topology | ||
| Nihon University (Feb 2010) | Tokyo, Japan | |
| 2009 | ||
| The feasibility of algorithms in 3-manifold topology | ||
| University of Melbourne (Dec 2009) | Melbourne, Australia | |
| Algorithms and computation in three-dimensional topology | ||
| Australian National University (Dec 2009) | Canberra, Australia | |
| The feasibility of algorithms in 3-manifold topology | ||
| University of Queensland (Dec 2009) | Brisbane, Australia | |
| Fast, faster, fastest: Algorithms in cryptography and bioinformatics | ||
| RMIT University (Nov 2009) | Melbourne, Australia | |
| The Weber-Seifert dodecahedral space: Theory, algorithms and computation in 3-manifold topology | ||
| University of Melbourne (Nov 2009) | Melbourne, Australia | |
| Fast, faster, fastest: Algorithms in cryptography and bioinformatics | ||
| University of Queensland (Oct 2009) | Brisbane, Australia | |
| An introduction to computational topology | ||
| University of Queensland (May 2009) | Brisbane, Australia | |
| 2008 | ||
| Problems in computational topology: Where pure mathematics meets computer science | ||
| PIMS Seminar (Nov 2008) | Victoria, Canada | |
| A guided tour through the census of minimal 3-manifold triangulations | ||
| University of Victoria (Nov 2008) | Victoria, Canada | |
| Creating informatics olympiad tasks: Exploring the black art | ||
| IOI Conference (Aug 2008) | Cairo, Egypt | |
| Breaking the routine: Events to complement informatics olympiad training | ||
| IOI Conference (Aug 2008) | Cairo, Egypt | |
| Enhancing security through SELinux | ||
| RMIT University (May 2008) | Melbourne, Australia | |
| Informatics olympiads: Challenges in programming and algorithm design | ||
| ACSC 2008: Australasian Computer Science Conference (Jan 2008) | Wollongong, Australia | |
| 2006 | ||
| Informatics olympiads: Mathematics through code | ||
| Congress of the World Federation of National Mathematics Competitions (Jul 2006) | Cambridge, UK | |
| 2005 | ||
| Minimal triangulations of non-orientable 3-manifolds | ||
| Nara Women’s University (Dec 2005) | Nara, Japan | |
| Theorems, algorithms and brute force: Building a census of 3-manifolds | ||
| Workshop: Topology and Computers (Dec 2005) | Osaka, Japan | |
| Improved pass-systems | ||
| Biometrics Institute (Nov 2005) | Melbourne, Australia | |
| Secure group communication with distributed generation of private keys for ad-hoc networks | ||
| SEC 2005: IFIP Information Security Conference (Jun 2005) | Chiba, Japan | |
| 2004 | ||
| Normal surfaces, complexity and edge-weight space | ||
| Victorian Algebra Conference (Sep 2004) | Melbourne, Australia | |
| 2003 | ||
| Face pairing graphs in 3-manifold enumeration | ||
| AustMS Annual Meeting (Jul 2003) | Sydney, Australia | |