Aleksander B. G. Christiansen

According to our database, Aleksander B. G. Christiansen authored at least 15 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2026

Private Graph Colouring with Limited Defectiveness.

Aleksander B. G. Christiansen, Eva Rotenberg, Teresa Anna Steiner, Juliette Vlieghe

Proceedings of the SOFSEM 2026: Theory and Practice of Computer Science, 2026

Deterministic Dynamic Edge Colouring.

Aleksander B. G. Christiansen

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Local Density and Its Distributed Approximation.

Aleksander Bjørn Grodt Christiansen, Ivor van der Hoog, Eva Rotenberg

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity.

Tijn de Vos, Aleksander B. G. Christiansen

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Augmenting Plane Straight-Line Graphs to Meet Parity Constraints.

Aleksander Bjørn Grodt Christiansen, Linda Kleist, Irene Parada, Eva Rotenberg

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Sparsity-Parameterised Dynamic Edge Colouring.

Aleksander B. G. Christiansen, Eva Rotenberg, Juliette Vlieghe

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Triangulations Admit Dominating Sets of Size 2<i>n</i>/7.

Aleksander B. G. Christiansen, Eva Rotenberg, Daniel Rutschmann

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Adaptive Out-Orientations with Applications.

Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Triangulations Admit Dominating Sets of Size 2n/7.

Aleksander B. G. Christiansen, Eva Rotenberg, Daniel Rutschmann

CoRR, 2023

The Power of Multi-step Vizing Chains.

Aleksander Bjørn Grodt Christiansen

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Improved Dynamic Colouring of Sparse Graphs.

Aleksander Bjørn Grodt Christiansen, Krzysztof Nowicki, Eva Rotenberg

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

Adaptive Out-Orientations with Applications.

Aleksander B. G. Christiansen, Jacob Holm, Ivor van der Hoog, Eva Rotenberg, Chris Schwiegelshohn

CoRR, 2022

Fully-dynamic α+2 Arboricity Decomposition and Implicit Colouring.

Aleksander B. G. Christiansen, Eva Rotenberg

CoRR, 2022

On Dynamic α + 1 Arboricity Decomposition and Out-Orientation.

Aleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg, Carsten Thomassen

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Fully-Dynamic α + 2 Arboricity Decompositions and Implicit Colouring.

Aleksander B. G. Christiansen, Eva Rotenberg

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022