William Pettersson

Orcid: 0000-0003-0040-2088

According to our database1, William Pettersson authored at least 24 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation.
Algorithmica, October, 2024

New Algorithms for Hierarchical Optimization in Kidney Exchange Programs.
Oper. Res., 2024

Reachability in temporal graphs under perturbation.
CoRR, 2024

2023
Cops and Robbers on Multi-Layer Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2022
kep_solver: A Python package for kidney exchange programme exploration.
J. Open Source Softw., December, 2022

Bounds on the Twin-Width of Product Graphs.
CoRR, 2022

Improved instance generation for kidney exchange programmes.
Comput. Oper. Res., 2022

2021
Improved inference for areal unit count data using graph-based optimisation.
Stat. Comput., 2021

Data and optimisation requirements for Kidney Exchange Programs.
Health Informatics J., 2021

Modelling and optimisation in European Kidney Exchange Programmes.
Eur. J. Oper. Res., 2021

Tangled Paths: A Random Graph Model from Mallows Permutations.
CoRR, 2021

Improving solution times for stable matching problems through preprocessing.
Comput. Oper. Res., 2021

The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
Multiobjective Integer Programming: Synergistic Parallel Approaches.
INFORMS J. Comput., 2020

Directed branch-width: A directed analogue of tree-width.
CoRR, 2020

Compensation Scheme With Shapley Value For Multi-Country Kidney Exchange Programmes.
Proceedings of the 34th International ECMS Conference on Modelling and Simulation, 2020

2019
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex.
SIAM J. Discret. Math., 2019

Mathematical models for stable matching problems with ties and incomplete lists.
Eur. J. Oper. Res., 2019

Multi-Objective Mixed Integer Programming: An Objective Space Algorithm.
CoRR, 2019

Understanding the Empirical Hardness of Random Optimisation Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2019

2017
A parallel approach to bi-objective integer programming.
CoRR, 2017

2015
Bipartite 2-Factorizations of Complete Multipartite Graphs.
J. Graph Theory, 2015

An Edge-Based Framework for Enumerating 3-Manifold Triangulations.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Fixed Parameter Tractable Algorithms in Combinatorial Topology.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014


  Loading...