Aleksander B. G. Christiansen

Affiliations:
  • Technical University of Denmark, DTU Compute, Kongens Lyngby, Denmark


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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

2022
2023
2024
2025
0
1
2
3
4
5
6
7
8
3
1
2
1
4
2
2

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024
Local Density and its Distributed Approximation.
CoRR, 2024

Private graph colouring with limited defectiveness.
CoRR, 2024

Deterministic Dynamic Edge-Colouring.
CoRR, 2024

Augmenting Plane Straight-Line Graphs to Meet Parity Constraints.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Sparsity-Parameterised Dynamic Edge Colouring.
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Triangulations Admit Dominating Sets of Size 2<i>n</i>/7.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Adaptive Out-Orientations with Applications.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Triangulations Admit Dominating Sets of Size 2n/7.
CoRR, 2023

The Power of Multi-step Vizing Chains.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Improved Dynamic Colouring of Sparse Graphs.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Adaptive Out-Orientations with Applications.
CoRR, 2022

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

On Dynamic α + 1 Arboricity Decomposition and Out-Orientation.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Fully-Dynamic α + 2 Arboricity Decompositions and Implicit Colouring.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022


  Loading...