|
PhD Theses |
 |
Marc Benkert, 2007
Construction and Analysis of Geometric Networks
|
|
|
|
Marco Gaertler, 2007
Algorithmic Aspects of Clustering - Theory, Experimental Evaluation, and Applications in Network Analysis and Visualization
|
|
|
|
Thomas Schank, 2007
Algorithmic Aspects of Triangle-Based Network Analysis
|
|
|
|
Thomas Willhalm, 2005
Engineering Shortest Paths and Layout Algorithms for Large Graphs
|
|
|
|
Frank Schulz, 2005
Timetable Information and Shortest Paths
|
|
|
|
Sabine Cornelsen, 2003
Drawing Families of Cuts in a Graph
|
|
|
|
Annegret Liebers, 2000
Analyzing Train Time Table Graphs
|
|
|
|
Dagmar Handke, 1999
Graphs with Distance Guarantees
|
|
|
|
Ulrik Brandes, 1999
Layout of Graph Visualizations
|
|
|
| |
|
Master's Theses |
|
Florian Hübner, 2008
The Dynamic Graph Clustering Problem - ILP-Based Approaches Balancing Optimality and the Mental Map
|
|
|
|
Dieter Glaser, 2008
Zeitexpandiertes Graphenclustern - Modellierung und Experimente
|
|
|
|
Dennis Schieferdecker, 2008
Systematic Combination of Speed-Up Techniques for exact Shortest-Path Queries
|
|
|
|
Lin Huang, 2007
A Node's Perspective of Changing Properties in Dynamic Networks
|
|
|
|
Ignaz Rutter, 2007
Schnelle Berechnung von großen Matchings
|
|
|
|
Sebastian Knopp, 2006
Efficient Computation of Many-to-Many Shortest Paths
|
|
|
|
Reinhard Bauer, 2006
Dynamic Speed-Up Techniques for Dijkstra's Algorithm
|
|
|
|
Kirill Müller, 2006
Design and Implementation of an Effcient Hierarchical Speed-up Technique for Computation of Exact Shortest Paths in Graphs
|
|
|
|
Daniel Delling, 2006
Analyse und Evaluierung von Vergleichsmaßen für Graphclusterungen
|
|
|
|
Bastian Katz, 2006
Richtungsbasierte Lokalisierung von Sensornetzwerken
|
|
|
|
Markus Maier, 2005
Disjunkte kürzeste Wege in drahtlosen Sensornetzen
|
|
|
|
Martin Nöllenburg, 2005
Automated Drawing of Metro Maps
|
|
|
|
Robert Görke, 2004
Ein Schneller Konstruktionsalgorithmus für eine Quickest-Path-Map bezüglich der City-Metrik
|
|
|
|
Christoph Gulden, 2004
Algorithmic analysis of large networks by computing structural indices
|
|
|
|
Michael Baur, 2003
Kantenkreuzungen in Kreislayouts
|
|
|
|
Steffen Mecke, 2003
Standortplanung von Bahnhöfen
|
|
|
|
Silke Wagner, 2003
Optimierung des Demographic Clustering Algorithmus
|
|
|
|
Martin Holzer, 2003
Hierarchical Speed-up Techniques for Shortest-Path Algorithms
|
|
|
|
Boris Alexander Köpf, 2002
Fixed Parameter Algorithms on Planar Graphs
|
|
|
|
Burkhard Möller, 2002
Zentralitäten in Graphen
|
|
|
|
Marco Gaertler, 2002
Clustering with Spectral Methods
|
|
|
|
Martin Oberhofer, 2002
Konstruktion 3-dimensionaler, konvexer Polytope
|
|
|
|
Christian Fieß, 2001
Algorithmen zur Visualisierung von Schnitten in Graphen
|
|
|
|
Thomas Schank, Zulassungsarbeit 2001
Algorithmen zur Visualisierung planarer, partitionierter Graphen (ps)
|
|
|
|
Frank Müller, 2000
Visualisierung von Status in Sozialen Netzwerken
|
|
|
|
Frank Schulz, 2000
Efficient Algorithms for a Timetable Information System (ps)
|
|
|
|
Vanessa Kääb, 1999
Dualität von Suchstrategien auf planaren Graphen
|
|
|
|
Thomas Willhalm, 1998
Using Discrete Mathematics to Reconstruct the Topology of a CAD-Datamodel
|
|
|
|
Annegret Liebers, 1996
Methods for Planarizing Graphs
|
|
|
| |
|
Student Research Projects |
|
Christian Schulz, 2008
Design and experimental evaluation of a local graph clustering algorithm
|
|
|
|
Thomas Pajor, 2008
Goal Directed Speed-Up Techniques for Shortest-Path Queries in Timetable Networks
|
|
|
|
Abian Blome, 2007
Emprirical Analysis of k-Betweenness
|
|
|
|
Tanja Hartmann, 2007
Approximative Matchings in Cross-Match-Tests
|
|
|
|
Steffen Lang, 2007
Protein domain decomposition using spectral graph partitioning
|
|
|
|
Myriam Freidinger, 2007
Minimale Schnitte und Schnittbäume
|
|
|
|
Lin Huang, 2007
Survey on Generators for Internet Topologies at the AS Level
|
|
|
|
Jochen Speck, 2006
Clustern mit beschränkter Clustergröße
|
|
|
|
Tirdad Rahmani, 2006
Experimentelle Analyse von Freiheitsgraden im Planar-Separator-Theorem
|
|
|
|
Tobias Matzner, 2005
Min-Wise Independent Permutaion Families
|
|
|
|
Kirill Müller, 2005
Berechnung kürzester Pfade unter Beachtung von Abbiegeverboten
|
|
|
|
Marcus Krug, 2005
Ein multidimensionaler Vergleich zwischen spektralen und kräftebasierten Layouts
|
|
|
|
Moritz Minzlaff, 2005
Beschriften gewichteter Punkte mit verschiebbaren Labeln
|
|
|
|
Sebastian Knopp, 2005
Schnelle Berechnung von kürzesten Wegen in Graphen unter Benutzung höherdimensionaler Layouts
|
|
|
|
Florian Widmann, 2005
Manhattan-Netzwerke und Stufenpolygone
|
|
|
|
Birk Schütz, 2005
Partition-Based Speed-Up of Dijkstra s Algorithm
|
|
|
|
Daniel Delling, 2004
Experimentelle Untersuchung von Clusterungsgeneratoren mittels Qualitätsindizes
|
|
|
