1 citations · 1 across the 4 of their papers we have counts for
5 papers
Refuting the Direct Sum Conjecture for Total Functions in Deterministic Communication Complexity
Simon Mackenzie, Abdallah Saffidine
In communication complexity the input of a function is distributed between two players Alice and Bob. If Alice knows only and Bob only ,…
Fair Railway Network Design
Zixu He, Sirin Botan, Jérôme Lang +3
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 a…
Constructions, bounds, and algorithms for peaceable queens
Katie Clinch, Matthew Drescher, Tony Huynh +1
The peaceable queens problem asks to determine the maximum number such that there is a placement of white queens and black queens on an chessboard…
Generalizing Roberts' characterization of unit interval graphs
Virginia Ardévol Martínez, Romeo Rizzi, Abdallah Saffidine +2
For any natural number , a graph is a (disjoint) -interval graph if it is the intersection graph of (disjoint) -intervals, the union of (disjoint) intervals on the…
A Piecewise Approach for the Analysis of Exact Algorithms
Katie Clinch, Serge Gaspers, Zixu He +2
To analyze the worst-case running time of branching algorithms, the majority of work in exponential time algorithms focuses on designing complicated branching rules over developing…