3 papers
cs.DM2026
The Gallai Vertex Problem is -Complete
Amir Nikabadi, Eva Rotenberg, Lasse Wulf
When a graph admits a vertex that is contained in all its longest paths, we call a Gallai vertex. These are named after Gallai, who in 1966 asked the question if it is…
cs.DS2025
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…
cs.DS2025
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 inse…