Tanja Hartmann

18 papers A 2B 5Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
2016 — ch.
Clustering Evolving Networks.
Algorithm Engineering
Tanja Hartmann, Andrea Kappes, Dorothea Wagner
2015 A conf
Efficient Algorithms for a Robust Modularity-Driven Clustering of Attributed Graphs.
SDM
Patricia Iglesias Sánchez, Emmanuel Müller, Uwe Leo Korn, Klemens Böhm, Andrea Kappes, Tanja Hartmann, Dorothea Wagner
2015 J jnl
Regular Augmentation of Planar Graphs.
Algorithmica
Tanja Hartmann, Jonathan Rollin, Ignaz Rutter
2014 — —
Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering.
Tanja Hartmann
2014 J jnl
Clustering Evolving Networks.
CoRR
Tanja Hartmann, Andrea Kappes, Dorothea Wagner
2014 A conf
Simultaneous Embeddability of Two Partitions.
GD
Jan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg
2014 J jnl
Simultaneous Embeddability of Two Partitions.
CoRR
Jan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg
2013 J jnl
Dynamic Gomory-Hu Tree Construction - fast and simple.
CoRR
Tanja Hartmann, Dorothea Wagner
2013 J jnl
Hierarchies of Predominantly Connected Communities
CoRR
Michael Hamann, Tanja Hartmann, Dorothea Wagner
2013 B conf
Hierarchies of Predominantly Connected Communities.
WADS
Michael Hamann, Tanja Hartmann, Dorothea Wagner
2013 J jnl
Identifikation von Clustern in Graphen.
Inform. Spektrum
Robert Görke, Tanja Hartmann, Andrea Kappes, Dorothea Wagner
2012 — conf
Complete hierarchical cut-clustering: A case study on expansion and modularity.
Graph Partitioning and Graph Clustering
Michael Hamann, Tanja Hartmann, Dorothea Wagner
2012 J jnl
Cubic Augmentation of Planar Graphs
CoRR
Tanja Hartmann, Jonathan Rollin, Ignaz Rutter
2012 B conf
Cubic Augmentation of Planar Graphs.
ISAAC
Tanja Hartmann, Jonathan Rollin, Ignaz Rutter
2012 J jnl
Dynamic Graph Clustering Using Minimum-Cut Trees.
J. Graph Algorithms Appl.
Robert Görke, Tanja Hartmann, Dorothea Wagner
2012 B conf
Fast and Simple Fully-Dynamic Cut Tree Construction.
ISAAC
Tanja Hartmann, Dorothea Wagner
2011 B conf
Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees.
WADS
Christof Doll, Tanja Hartmann, Dorothea Wagner
2009 B conf
Dynamic Graph Clustering Using Minimum-Cut Trees.
WADS
Robert Görke, Tanja Hartmann, Dorothea Wagner