1 citations · 1 across the 4 of their papers we have counts for
3 papers · 1 filter
Private graph colouring with limited defectiveness
Aleksander B. G. Christiansen, Eva Rotenberg, Teresa Anna Steiner +1
Differential privacy is the gold standard in the problem of privacy preserving data analysis, which is crucial in a wide range of disciplines. Vertex colouring is one of the most f…
Sparsity-Parameterised Dynamic Edge Colouring
Aleksander B. G. Christiansen, Eva Rotenberg, Juliette Vlieghe
We study the edge-colouring problem, and give efficient algorithms where the number of colours is parameterised by the graph's arboricity, . In a dynamic graph, subject to inser…
Fully-dynamic Arboricity Decomposition and Implicit Colouring
Aleksander B. G. Christiansen, Eva Rotenberg
In the implicit dynamic colouring problem, the task is to maintain a representation of a proper colouring as a dynamic graph is subject to insertions and deletions of edges, while…