An algorithmic walk from static to dynamic graph clustering [Elektronische Ressource] / von Robert Görke

An Algorithmic Walk from Static toDynamic Graph Clusteringzur Erlangung des akademischen Grades einesDoktors der Naturwissenschaftender Fakultat fur Informatikdes KITgenehmigteDissertationvonRobert Gorkeaus Ruit, Ost ldernTag der mundlichen Prufung: 11.02.2010 Erster Gutachter: Frau Prof. Dr. Dorothea WagnerZweiter Gutachter: Herr Prof. Dr. Michael KaufmannAcknowledgments\This thesis is the fruit of stumbling into, and then enjoying academia." The frighteningnumber of acknowledgments in PhD theses which commence with a statement similar to thismakes me feel an urge to not echo it. However, it clearly applies to me as well.My principal thanks go to my advisor Dorothea Wagner for accepting me into her fabulousteam. Shaped by her style of leadership, which is above all friendly, respectful and subtlyaustere, throughout my years as a member, this team never departed even a bit from being aproductive, fun and enjoyable working environment. At this point I must not forget to thankAlexander Wol , who, by advising my diploma thesis, introduced me to the world of science,became a friend and sponsored me into Dorothea Wagner’s team. Looking further back I alsothank Paul Bonnington and Cristian Calude of the University of Auckland in New Zealand,who revealed to me that theoretical computer science, discrete mathematics and graph theoryin particular are in fact fascinating, something that had largely eluded me prior to my timeabroad in Aotearoa.