Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees. - Christof Doll; Tanja Hartmann; Dorothea Wagner (WADS, 2011)

Complete hierarchical cut-clustering: A case study on expansion and modularity. - Michael Hamann; Tanja Hartmann; Dorothea Wagner (Graph Partitioning and Graph Clustering, 2012)

Cubic Augmentation of Planar Graphs. - Tanja Hartmann; Jonathan Rollin; Ignaz Rutter (ISAAC, 2012)

Fast and Simple Fully-Dynamic Cut Tree Construction. - Tanja Hartmann; Dorothea Wagner (ISAAC, 2012)

Dynamic Graph Clustering Using Minimum-Cut Trees. - Robert Görke; Tanja Hartmann; Dorothea Wagner (J. Graph Algorithms Appl., 2012)

Hierarchies of Predominantly Connected Communities. - Michael Hamann; Tanja Hartmann; Dorothea Wagner (WADS, 2013)

Dynamic Gomory-Hu Tree Construction - fast and simple. - Tanja Hartmann; Dorothea Wagner (CoRR, 2013)

Identifikation von Clustern in Graphen. - Robert Görke; Tanja Hartmann; Andrea Kappes; Dorothea Wagner (Inform. Spektrum, 2013)

Simultaneous Embeddability of Two Partitions. - Jan Christoph Athenstädt; Tanja Hartmann; Martin Nöllenburg (GD, 2014)

Clustering Evolving Networks. - Tanja Hartmann; Andrea Kappes; Dorothea Wagner (CoRR, 2014)

Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering. - Tanja Hartmann (2014)

Efficient Algorithms for a Robust Modularity-Driven Clustering of Attributed Graphs. - Patricia Iglesias Sánchez; Emmanuel Müller; Uwe Leo Korn; Klemens Böhm; Andrea Kappes; Tanja Hartmann; Dorothea Wagner (SDM, 2015)

Regular Augmentation of Planar Graphs. - Tanja Hartmann; Jonathan Rollin; Ignaz Rutter (Algorithmica, 2015)

Clustering Evolving Networks. - Tanja Hartmann; Andrea Kappes; Dorothea Wagner (Algorithm Engineering, 2016)