PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Hartmann, Tanja"

Author of the publication

copydeleteadd this publication to your clipboard
Clustering Evolving Networks.

, , and . Algorithm Engineering, volume 9220 of Lecture Notes in Computer Science, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Silke Hartmann University of Stuttgart

Dr. Tanja Blascheck University of Stuttgart

Dr. Tanja Jovanovic University of Stuttgart

Tanja Soldo University of Stuttgart

Jan Hartmann University of Stuttgart

 

Other publications of authors with the same name

Complete hierarchical cut-clustering: A case study on expansion and modularity., , and . Graph Partitioning and Graph Clustering, volume 588 of Contemporary Mathematics, page 157-170. American Mathematical Society, (2012)Efficient Algorithms for a Robust Modularity-Driven Clustering of Attributed Graphs., , , , , , and . SDM, page 100-108. SIAM, (2015)Fast and Simple Fully-Dynamic Cut Tree Construction., and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 95-105. Springer, (2012)Clustering Evolving Networks., , and . CoRR, (2014)Dynamic Gomory-Hu Tree Construction - fast and simple., and . CoRR, (2013)Identifikation von Clustern in Graphen., , , and . Informatik Spektrum, 36 (2): 144-152 (2013)Simultaneous Embeddability of Two Partitions., , and . Graph Drawing, volume 8871 of Lecture Notes in Computer Science, page 64-75. Springer, (2014)Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees., , and . WADS, volume 6844 of Lecture Notes in Computer Science, page 338-349. Springer, (2011)Dynamic Graph Clustering Using Minimum-Cut Trees., , and . WADS, volume 5664 of Lecture Notes in Computer Science, page 339-350. Springer, (2009)Regular Augmentation of Planar Graphs., , and . Algorithmica, 73 (2): 306-370 (2015)