moip_aira is an implementation of a parallel multi-objective integer programming algorithm that aims for perfect parallelisation. It has been improved through multiple research papers, and offers many different ways to improve running times through various tweaks and overhauls.
graphlib is a library of graph decomposition techniques that were used to find various decompositions and factorisations which were in turn used to solve the cycle decomposition problem for complete graphs.
rook_decomp is a small program that is currently trying to find a decomposition of the complete bipartite graph on 2n vertices into copies of the rook graph Kn.
My Github page lists many other projects that I have at some point worked on.
I am one of the developers of Regina, a suite of mathematical software for 3-manifold topologists. It focuses on the study of 3-manifold triangulations and normal surfaces. I also maintain the Gentoo packages for Regina. For official downloads for other distributions, see http://regina.sourceforge.net.
Gentoo packages for Regina are available in a layman overlay.
Once layman has been installed, you can install the overlay by running
# layman -a regina-gentoo.
You will then be able to install Regina with
# emerge regina. Note
that version 9999 of Regina in the overlay will always update to the latest GIT
revision, which may or may not work at any given time.
|The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex SIAM Journal on Discrete Mathematics 2019; doi: 10.1137/18M1168704||Published||arXiv|
|Modelling and Optimisation in European Kidney Exchange Programmes European Journal of Operational Research 2019; doi: 10.1016/j.ejor.2019.09.006||Published|
|Understanding the empirical hardness of random optimisation problems Lecture Notes in Computer Science 2019; doi: 10.1007/978-3-030-30047-7_20||Accepted|
|Multi-Objective Mixed Integer Programming: An Objective Space Algorithm AIP Conference Proceedings 2019; doi: 10.1063/1.5090006||Published||arXiv|
|Mathematical models for stable matching problems with ties and incomplete lists. European Journal of Operational Research 2019; doi: 10.1016/j.ejor.2019.03.017||Published||arXiv|
|Multi-objective integer programming: Synergistic parallel approaches. INFORMS Journal on Computing 2019; doi: 10.1287/ijoc.2018.0875||Published||arXiv|
|A parallel approach to bi-objective integer programming, Australian and New Zealand Industrial and Applied Mathematics Journal. 2017; doi: 10.21914/anziamj.v58i0.11724||Published||arXiv|
|The parameterized complexity of finding a 2-sphere in a simplicial complex, 34th International Symposium on Theoretical Aspects of Computer Science (STACS 2017) 2017; doi: 10.4230/LIPIcs.STACS.2017.18||Published||arXiv|
|An edge-based framework for enumerating 3-manifold triangulations, 31st International Symposium on Computational Geometry (SoCG 2015) 2015; doi: 10.4230/LIPIcs.SOCG.2015.270||Published||arXiv|
|Cycle decompositions V: Complete graph into cycles of arbitrary lengths, Proceedings of the London Mathematical Society 2014; doi: 10.1112/plms/pdt051||Published||arXiv|
|Bipartite 2-factorisations of complete multipartite graphs, Journal of Graph Theory vol. 78, issue 4. April 2015;, pp.287-294 doi: 10.1002/jgt.21806||Published|
|Fixed parameter tractable algorithms in combinatorial topology, Lecture Notes in Computer Science vol. 8591, 2014, pp.200-311. doi: 10.1007/978-3-319-08783-2_26||Published||arXiv|
|Computational Graph Theory, PhD Thesis Oct 17 2014||Accepted||Self hosted|