William Pettersson

Publications

Particulars Status
J. Enright, K. Meeks, W. Pettersson, J. Sylvester Cops and Robbers on Multi-Layer Graphs; Graph-Theoretic Concepts in Computer Science 2023; doi: 10.1007/978-3-031-43380-1_23 Published (Preprint)
W. Pettersson, J. Sylvester Bounds on the Twin-Width of Product Graphs; Discrete Mathematics & Theoretical Computer Science 2023; doi: 10.46298/dmtcs.10091 Published (Preprint)
M. Delorme, S. García, J. Gondzio, J. Kalcsics, D. Manlove, W. Pettersson Enhanced mathematical models for hierarchical optimisation in kidney exchange programmes; Operations Research 2023; doi: 10.1287/opre.2022.2374 Published
W. Pettersson kep_solver: A Python package for kidney exchange programme exploration; The Journal of Open Source Software 2022; doi: 10.21105/joss.04881 Published
M. Delorme, S. García, J. Gondzio, J. Kalcsics, D. Manlove, W. Pettersson, J. Trimble Improved instance generation for kidney exchange programmes; Computers & Operations Research 2022; doi: 10.1016/j.cor.2022.105707 Published (Preprint)
J. Enright, D. Lee, K. Meeks, W. Pettersson, J. Sylvester The complexity of finding optimal subgraphs to represent spatial correlation; 15th Annual International Conference on Combinatorial Optimization and Applications 2021; doi: 10.1007/978-3-030-92681-6_13 Published (Preprint)
J. Enright, K. Meeks, W. Pettersson, J. Sylvester Tangled Paths: A Random Graph Model from Mallows Permutations 2021 Submitted
D. Lee, K. Meeks, W. Pettersson Improved inference for areal unit count data using graph-based optimisation; Statistics and Computing 2021; doi: 10.1007/s11222-021-10025-7 Published
B. Smeulders et al. Data and optimization requirements for Kidney Exchange Programs 2021; doi: 10.1177/14604582211009918 Published
B. M. Bumpus, K. Meeks, W. Pettersson Directed branch-width: A directed analogue of tree-width 2020 Submitted
M. Delorme, S. García, J. Gondzio, J. Kalcsics, D. Manlove, W. Pettersson Stability in the the Hospital/Residents problem with Couples and Ties: Mathematical models and computational studies; Omega 2020; doi: 10.1016/j.omega.2020.102386 Published (Preprint)
W. Pettersson, M. Delorme, S. García, J. Gondzio, J. Kalcsics, D. Manlove Improving solution times for stable matching problems through preprocessing; Computers & Operations Research 2020; doi: 10.1016/j.cor.2020.105128 Published
P. Biró, M. Gyetvai, X. Klimentova, J. Pedroso, W. Pettersson Compensation scheme with Shapley value for multi-country kidney exchange; 34th ECMS International Conference on Modelling and Simulation 2020; doi: 10.7148/2020-0129 Published
B. Burton, S. Cabello, S. Kratsch, W. Pettersson The Parameterised Complexity of Finding a 2-Sphere in a Simplicial Complex; SIAM Journal on Discrete Mathematics 2019; doi: 10.1137/18M1168704 Published (Preprint)
P. Biró et al. Modelling and Optimisation in European Kidney Exchange Programmes; European Journal of Operational Research 2019; doi: 10.1016/j.ejor.2019.09.006 Published
C. McCreesh, W. Pettersson, P. Prosser Understanding the empirical hardness of random optimisation problems; 25th International Conference on Principles and Practice of Constraint Programming (CP) 2019; doi: 10.1007/978-3-030-30048-7_20 Published
W. Pettersson, M. Ozlen Multi-Objective Mixed Integer Programming: An Objective Space Algorithm; 14th International Workshop on Global Optimization 2019; doi: 10.1063/1.5090006 Published
M. Delorme, S. García, J. Gondzio, J. Kalcsics, D. Manlove, W. Pettersson 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
W. Pettersson, M. Ozlen Multi-objective integer programming: Synergistic parallel approaches; INFORMS Journal on Computing 2019; doi: 10.1287/ijoc.2018.0875 Published (Preprint)
W. Pettersson, M. Ozlen 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
B. Burton, S. Cabello, S. Kratsch, W. Pettersson The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex; 34th International Symposium on Theoretical Aspects of Computer Science (STACS) 2017; doi: 10.4230/LIPIcs.STACS.2017.18 Published
B. Burton, W. Pettersson An edge-based framework for enumerating 3-manifold triangulations; 31st International Symposium on Computational Geometry (SoCG) 2015; doi: 10.4230/LIPIcs.SOCG.2015.270 Published
D. Bryant, D. Horsley, W. Pettersson Cycle decompositions V: Complete graphs into cycles of arbitrary lengths; Proceedings of the London Mathematical Society 2014; doi: 10.1112/plms/pdt051 Published (Preprint)
D. Bryant, P. Danziger, W. Pettersson Bipartite 2-factorisations of complete multipartite graphs; Journal of Graph Theory 2015; doi: 10.1002/jgt.21806 Published (Preprint)
B. Burton, W. Pettersson Fixed parameter tractable algorithms in combinatorial topology; International Computing and Combinatorics Conference 2014; doi: 10.1007/978-3-319-08783-2_26 Published (Preprint)
W. Pettersson Computational Graph Theory; PhD Thesis 2014 Accepted