Christian Elbracht

According to our database, Christian Elbracht authored at least 9 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Ubiquity of locally finite graphs with extensive tree-decompositions.

Nathan J. Bowler, Christian Elbracht, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen

Comb. Theory, 2024

2023

Ubiquity of graphs with nowhere-linear end structure.

Nathan J. Bowler, Christian Elbracht, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen

J. Graph Theory, July, 2023

Clustering with Tangles: Algorithmic Framework and Theoretical Guarantees.

Solveig Klepper, Christian Elbracht, Diego Fioravanti, Jakob Kneip, Luca Rendsburg, Maximilian Teegen, Ulrike von Luxburg

J. Mach. Learn. Res., 2023

2022

Topological ubiquity of trees.

Nathan J. Bowler, Christian Elbracht, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen

J. Comb. Theory B, 2022

2021

Trees of tangles in abstract separation systems.

Christian Elbracht, Jakob Kneip, Maximilian Teegen

J. Comb. Theory A, 2021

A canonical tree-of-tangles theorem for structurally submodular separation systems.

Christian Elbracht, Jakob Kneip

Comb. Theory, 2021

2020

Edge-connectivity and tree-structure in finite and infinite graphs.

Christian Elbracht, Jan Kurkofka, Maximilian Teegen

CoRR, 2020

Tangles: From Weak to Strong Clustering.

Christian Elbracht, Diego Fioravanti, Solveig Klepper, Jakob Kneip, Luca Rendsburg, Maximilian Teegen, Ulrike von Luxburg

CoRR, 2020

A Note on Generic Tangle Algorithms.

Christian Elbracht, Jakob Kneip, Maximilian Teegen

CoRR, 2020