Institut für Theoretische Informatik, Algorithmik
Suche
Institut für Theoretische Informatik, Algorithmik
Institut für Theoretische Informatik, Algorithmik
Institut für Theoretische Informatik, Algorithmik
Mitarbeiter
Ehemalige Mitarbeiter
Dr. Tanja Hartmann
Veröffentlichungen

Veröffentlichungen

Buchbeiträge

  1. Clustering Evolving Networks.
    In: Algorithm Engineering - Selected Results and Surveys, volume 9220 of Lecture Notes in Computer Science, pages 280–329. Springer, 2016.
    Joint work with Andrea Kappes and Dorothea Wagner.
    [ html ]

Artikel in Zeitschriften

  1. Regular Augmentation of Planar Graphs.
    Algorithmica, 73(2):306–370, 2015.
    Joint work with Jonathan Rollin and Ignaz Rutter.
    [ html ]
  2. Identifikation von Clustern in Graphen.
    Informatik Spektrum, 36(2):144–152, 2013.
    Joint work with Andrea Kappes and Dorothea Wagner.
    [ html | pdf ]
  3. Dynamic Graph Clustering Using Minimum-Cut Trees.
    Journal of Graph Algorithms and Applications, 16(2):411–446, 2012.
    Joint work with Robert Görke and Dorothea Wagner.
    [ html ]

Artikel in Tagungsbänden

  1. Efficient Algorithms for a Robust Modularity-Driven Clustering of Attributed Graphs.
    In: Proceedings of the 2015 SIAM International Conference on Data Mining, pages 100–108. SIAM, 2015.
    Joint work with Patricia Iglesias Sánchez, Emmanuel Müller, Uwe Leo Korn, Klemens Böhm, Andrea Kappes, and Dorothea Wagner.
    [ html ]
  2. Simultaneous Embeddability of Two Partitions.
    In: Proceedings of the 22nd International Symposium on Graph Drawing (GD'14), volume 8871 of Lecture Notes in Computer Science, pages 64–75. Springer, 2014.
    Full version available at http://arxiv.org/abs/1408.6019.
    Joint work with Jan Christoph Athenstädt and Martin Nöllenburg.
    [ html | pdf ]
  3. Complete Hierarchical Cut-Clustering: A Case Study on Expansion and Modularity.
    In: Graph Partitioning and Graph Clustering: Tenth DIMACS Implementation Challenge, volume 588 of DIMACS Book, pages 157–170. American Mathematical Society, 2013.
    Joint work with Michael Hamann and Dorothea Wagner.
    [ html ]
  4. Hierarchies of Predominantly Connected Communities.
    In: Algorithms and Data Structures, 13th International Symposium (WADS'13), volume 8037 of Lecture Notes in Computer Science, pages 365–377. Springer, 2013.
    Full version available at http://arxiv.org/abs/1305.0757.
    Joint work with Michael Hamann and Dorothea Wagner.
    [ html ]
  5. Cubic Augmentation of Planar Graphs.
    In: Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC'12), volume 7676 of Lecture Notes in Computer Science, pages 402–412. Springer, 2012.
    Full version available at http://arxiv.org/abs/1209.3865.
    Joint work with Jonathan Rollin and Ignaz Rutter.
    [ html ]
  6. Fast and Simple Fully-Dynamic Cut Tree Construction.
    In: Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC'12), volume 7676 of Lecture Notes in Computer Science, pages 95–104. Springer, 2012.
    Full version available at http://digbib.ubka.uni-karlsruhe.de/volltexte/1000030004.
    Joint work with Dorothea Wagner.
    [ html ]
  7. Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees.
    In: Algorithms and Data Structures, 12th International Symposium (WADS'11), volume 6844 of Lecture Notes in Computer Science, pages 338–349. Springer, 2011.
    Full version available at http://digbib.ubka.uni-karlsruhe.de/volltexte/1000022456.
    Joint work with Christof Doll and Dorothea Wagner.
    [ html ]
  8. Dynamic Graph Clustering Using Minimum-Cut Trees.
    In: Algorithms and Data Structures, 11th International Symposium (WADS'09), volume 5664 of Lecture Notes in Computer Science, pages 339–350. Springer, August 2009.
    Full version available at http://digbib.ubka.uni-karlsruhe.de/volltexte/1000011476.
    Joint work with Robert Görke and Dorothea Wagner.
    [ html | pdf ]

Dissertation

  1. Algorithms for Graph Connectivity and Cut Problems – Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering.
    PhD thesis, Fakultät für Informatik, Karlsruher Institut für Technologie (KIT), June 2014.
    [ html ]

Abschlussarbeiten

  1. Clustering Dynamic Graphs with Guaranteed Quality.
    Master's thesis, Fakultät für Informatik, Universität Karlsruhe (TH), October 2008.
    [ html | pdf ]
  2. Werbung zwischen Kunst und Manipulation – Denkanstöße zur persönlichen Auseinandersetzung mit dem polarisierenden Wesen der Werbung.
    Master's thesis, Department of Electronic Media, Hochschule der Medien (HDM), February 2002.
    [ html ]

Technische Berichte

  1. Simultaneous Embeddability of Two Partitions.
    Technical Report arXiv:1408.6019, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2014.
    Full version of conference paper at GD'14.
    Joint work with Jan Christoph Athenstädt and Martin Nöllenburg.
    [ html ]
  2. Clustering Evolving Networks.
    Technical Report arXiv:1401.3516, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2014.
    To appear in LNCS Volume on Algorithm Engineering, Lasse Kliemann and Peter Sanders (eds.).
    Joint work with Andrea Kappes and Dorothea Wagner.
    [ html ]
  3. Hierarchies of Predominantly Connected Communities.
    Technical Report arXiv:1305.0757, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2013.
    Full version of conference paper at WADS'13.
    Joint work with Michael Hamann and Dorothea Wagner.
    [ html ]
  4. Cubic augmentation of planar graphs.
    Technical Report arXiv:1209.3865, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2012.
    Full version of conference paper at ISAAC'12.
    Joint work with Jonathan Rollin and Ignaz Rutter.
    [ html ]
  5. Fast and Simple Fully-Dynamic Cut Tree Construction.
    Technical Report 2012-18, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2012.
    Full version of conference paper at ISAAC'12.
    Joint work with Dorothea Wagner.
    [ html ]
  6. Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees.
    Technical Report 2011-10, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2011.
    Full version of conference paper at WADS'11.
    Joint work with Christof Doll and Dorothea Wagner.
    [ html | pdf ]
  7. Dynamic Graph Clustering Using Minimum-Cut Trees.
    Technical Report 2011-12, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2011.
    Report to journal version in JGAA (2012).
    Joint work with Robert Görke and Dorothea Wagner.
    [ html | pdf ]
  8. Dynamic Graph Clustering Using Minimum-Cut Trees.
    Technical Report 2009-10, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2009.
    Full version of conference paper at WADS'09, reworked in journal version in JGAA (2012).
    Joint work with Robert Görke and Dorothea Wagner.
    [ html | pdf ]