Haris Aziz, Zixu He, Xinhang Lu, Kaiyang Zhou
AAMAS 2025 Spotlight
This paper addresses the division of homogeneous divisible goods among agents with non-linear valuations. We propose an algorithm that guarantees a
Katie Clinch, Serge Gaspers, Zixu He, Abdallah Saffidine, Tiankuang Zhang
WALCOM 2025 Spotlight
This paper presents piecewise analysis, a new general method that analyzes the running time of branching algorithms. We reanalyze two 17-year-old algorithms from Fomin et al. (2007) that solve 4-Coloring and #3-Coloring and we improve their running time from
Katie Clinch, Serge Gaspers, Zixu He, Simon Mackenzie, Tiankuang Zhang
Submitted to STACS 2025 Spotlight
In this paper, we present a novel algorithm for solving the Vertex Cover problem on subcubic graphs in
Zixu He, Sirin Botan, Jérôme Lang, Abdallah Saffidine, Florian Sikora, Silas Workman
Submitted to AAAI 2025
When designing a public transportation network in a country, one may want to minimise the sum of travel duration of all inhabitants. This corresponds to a purely utilitarian view and does not involve any fairness consideration, as the resulting network will typically benefit the capital city and/or large central cities while leaving some peripheral cities behind. On the other hand, a more egalitarian view will allow some people to travel between peripheral cities without having to go through a central city. We define a model, propose algorithms for computing solution networks, and report on experiments based on real data.