4 citations · 5 across the 3 of their papers we have counts for
5 papers
Simultaneous Embeddability of Two Partitions
Jan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg
We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each…
Clustering Evolving Networks
Tanja Hartmann, Andrea Kappes, Dorothea Wagner
Roughly speaking, clustering evolving networks aims at detecting structurally dense subgroups in networks that evolve over time. This implies that the subgroups we seek for also ev…
Dynamic Gomory-Hu Tree Construction -- fast and simple
Tanja Hartmann, Dorothea Wagner
A cut tree (or Gomory-Hu tree) of an undirected weighted graph G=(V,E) encodes a minimum s-t-cut for each vertex pair {s,t} \subseteq V and can be iteratively constructed by n-1 ma…
Hierarchies of Predominantly Connected Communities
Michael Hamann, Tanja Hartmann, Dorothea Wagner
We consider communities whose vertices are predominantly connected, i.e., the vertices in each community are stronger connected to other community members of the same community tha…
Cubic Augmentation of Planar Graphs
Tanja Hartmann, Jonathan Rollin, Ignaz Rutter
In this paper we study the problem of augmenting a planar graph such that it becomes 3-regular and remains planar. We show that it is NP-hard to decide whether such an augmentation…