Tanja Hartmann

According to our database, Tanja Hartmann authored at least 14 papers between 2011 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2016

Clustering Evolving Networks.

Tanja Hartmann, Andrea Kappes, Dorothea Wagner

Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

2015

Regular Augmentation of Planar Graphs.

Tanja Hartmann, Jonathan Rollin, Ignaz Rutter

Algorithmica, 2015

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

Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, April 30, 2015

2014

Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering.

Tanja Hartmann

PhD thesis, 2014

Clustering Evolving Networks.

Tanja Hartmann, Andrea Kappes, Dorothea Wagner

CoRR, 2014

Simultaneous Embeddability of Two Partitions.

Jan Christoph Athenstädt, Tanja Hartmann, Martin Nöllenburg

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

2013

Identifikation von Clustern in Graphen.

Robert Görke, Tanja Hartmann, Andrea Kappes, Dorothea Wagner

Inform. Spektrum, 2013

Dynamic Gomory-Hu Tree Construction - fast and simple.

Tanja Hartmann, Dorothea Wagner

CoRR, 2013

Hierarchies of Predominantly Connected Communities.

Michael Hamann, Tanja Hartmann, Dorothea Wagner

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012

Dynamic Graph Clustering Using Minimum-Cut Trees.

Robert Görke, Tanja Hartmann, Dorothea Wagner

J. Graph Algorithms Appl., 2012

Fast and Simple Fully-Dynamic Cut Tree Construction.

Tanja Hartmann, Dorothea Wagner

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Cubic Augmentation of Planar Graphs.

Tanja Hartmann, Jonathan Rollin, Ignaz Rutter

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Complete hierarchical cut-clustering: A case study on expansion and modularity.

Michael Hamann, Tanja Hartmann, Dorothea Wagner

Proceedings of the Graph Partitioning and Graph Clustering, 2012

2011

Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees.

Christof Doll, Tanja Hartmann, Dorothea Wagner

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011