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
Projekte
Abgeschlossene Projekte
Clusterung statischer und zeitbehafteter Graphen
Arbeiten zum zweiten Förderabschnitt

Arbeiten zum zweiten Förderabschnitt

Publikationen (Publications)

Artikel in Zeitschriften (Journal Articles)

  1. Determining and interpreting correlations in lipidomic networks found in glioblastoma cells.
    BMC Systems Biology, 4(126), September 2010.
    Robert Görke, Anke Meyer-Bäse, Dorothea Wagner, Huan He, Mark R. Emmett and Charles A. Conrad.
    [ url ]
  2. Computational Aspects of Lucidity-Driven Graph Clustering.
    Journal of Graph Algorithms and Applications, 14(2):165-197, January 2010.
    Robert Görke, Marco Gaertler, Florian Hübner and Dorothea Wagner.
    [ url ]
  3. Engineering planar separator algorithms.
    ACM Journal of Experimental Algorithmics, 14(1):1-31, December 2009.
    Martin Holzer, Frank Schulz, Dorothea Wagner, Grigorios Prasinos and Christos Zaroliagis.
    [ url ]

Artikel in Tagungsbänden (Conference Articles)

  1. Modularity-Driven Clustering of Dynamic Graphs.
    In: Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10), volume 6049 of Lecture Notes in Computer Science, pages 436-448. Springer, May 2010.
    Robert Görke, Pascal Maillard, Christian Staudt and Dorothea Wagner
    [ url | pdf ]
  2. Computational techniques to the topology and dynamics of lipidomic networks found in glioblastoma cells.
    In: Proceedings of SPIE 7704: Evolutionary and Bio-Inspired Computation: Theory and Applications IV (2010), volume 7704. SPIE–The International Society for Optical Engineering, April 2010.
    Anke Meyer-Bäse, Robert Görke, Huan He, Mark R. Emmett, Alan G. Marshall and Charles A. Conrad
    [ url ]
  3. Dynamic Graph Clustering Using Minimum-Cut Trees.
    In: Algorithms and Data Structures, 11th International Workshop (WADS'09), volume 5664 of Lecture Notes in Computer Science, pages 339-350. Springer, August 2009.
    Robert Görke, Tanja Hartmann and Dorothea Wagner
    [ url | pdf ]
  4. ORCA Reduction and ContrAction Graph Clustering.
    In: Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM'09), volume 5564 of Lecture Notes in Computer Science, pages 152-165. Springer, June 2009.
    Robert Görke, Daniel Delling, Christian Schulz, and Dorothea Wagner.
    [ pdf ]

Technische Berichte (Technical Reports)

  1. Dynamic Graph Clustering Using Minimum-Cut Trees.
    Technical report, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2011.
    Karlsruhe Reports in Informatics 2011-12.
    Robert Görke, Tanja Hartmann and Dorothea Wagner.
    [ html | pdf ]
  2. Dynamic Graph Clustering Combining Modularity and Smoothness.
    Technical report, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2011.
    Karlsruhe Reports in Informatics 2011-11 (and invitational submision to a Special Issue of the ACM Journal on Experimental Algorithmics).
    Robert Görke, Pascal Maillard, Andrea Schumm, Christian Staudt, and Dorothea Wagner.
    [ html | pdf ]
  3. Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees.
    Technical report, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2011.
    Karlsruhe Reports in Informatics 2011-10.
    Christof Doll, Tanja Hartmann and Dorothea Wagner.
    [ html | pdf ]
  4. Modularity-Driven Clustering of Dynamic Graphs.
    Technical report, ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT), 2010.
    Informatik, Uni Karlsruhe, TR 2010-5.
    Robert Görke, Pascal Maillard, Christian Staudt, and Dorothea Wagner.
    [ html | pdf ]
  5. Dynamic Graph Clustering Using Minimum-Cut Trees.
    Technical report, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2009.
    Informatik, Uni Karlsruhe, TR 2009-10.
    Robert Görke, Tanja Hartmann and Dorothea Wagner.
    [ html | pdf ]
  6. A Generator for Dynamic Clustered Random Graphs.
    Technical report, ITI Wagner, Faculty of Informatics, Universität Karlsruhe (TH), 2009.
    Informatik, Uni Karlsruhe, TR 2009-7.
    Robert Görke, Christian Staudt.
    [ html | pdf ]

Noch nicht publizierte Ergebnisse (Unpublished Results)

In Überarbeitung (Under Revision)

  1. Dynamic Graph Clustering Using Minimum-Cut Trees.
    Robert Görke, Tanja Hartmann and Dorothea Wagner
    erscheint im Journal of Graph Algorithms and Applications (JGAA)
  2. Dynamic Graph Clustering Combining Modularity and Smoothness.
    Robert Görke, Pascal Maillard, Andrea Schumm, Christian Staudt and Dorothea Wagner
    erscheint im Journal of Experimental Algorithmics (JEA)

Abschlussarbeiten im Rahmen des Projekts (Theses)

Dissertationen (Doctoral Theses)

  1. Robert Görke, February 2010.
    An Algorithmic Walk from Static to Dynamic Graph Clustering
    Department of Informatics, Karlsruhe Institute of Technology (KIT).
    [ url ]

Diplomarbeiten (Master's Theses)

  1. Selma Mukhtar, April 2009.
    Dynamische Clusteranalyse für DM-Verkaufsdaten
    Department of Informatics, Karlsruhe Institute of Technology (KIT).
    [ url ]

Studienarbeiten (Student Projects)

  1. Christof Doll Februar 2011.
    Hierarchical Cut Clustering in Dynamic Scenarios
    Department of Informatics, Karlsruhe Institute of Technology (KIT).
    [ url ]
  2. Oscar Fofie Lafou August 2010.
    Engineering von Modularity-basiertem Graphenclustern
    Department of Informatics, Karlsruhe Institute of Technology (KIT).
    [ url ]
  3. Christian Staudt Dezember 2009.
    Experimental Evaluation of Dynamic Graph Clustering Algorithms
    Department of Informatics, Karlsruhe Institute of Technology (KIT).
    [ url ]