Room:	2.078b
E-Mail:	lutz.oettershagencs.uni-bonn.de

I'm researching problems on temporal graphs. Such a graph changes its structure over time. Amongst other things, I'm interested in path problems, classification, and network analysis.

• Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs
  Lutz Oettershagen, Anne Driemel, Petra Mutzel, 2021
  arXiv:2009.06778

• Efficient Top-k Temporal Closeness Calculation in Temporal Networks
  Lutz Oettershagen, Petra Mutzel
  IEEE International Conference on Data Mining (ICDM), 2020

• Temporal Graph Kernels for Classifying Dissemination Processes
  Lutz Oettershagen, Nils Kriege, Christopher Morris, Petra Mutzel
  SIAM International Conference on Data Mining (SDM), 2020
  arXiv:1911.05496

• On the Enumeration of Bicriteria Temporal Paths
  Petra Mutzel, Lutz Oettershagen
  Theory and Applications of Models of Computation (TAMC), 2019
  arXiv:1812.02507

• The Crossing Number of Semi-Pair-Seq-Shellable Drawings of Complete Graphs
  Petra Mutzel, Lutz Oettershagen
  Canadian Conference on Computational Geometry (CCCG), 2018
  arXiv:1805.06780

• The Crossing Number of Seq-Shellable Drawings of Complete Graphs
  Petra Mutzel, Lutz Oettershagen
  International Workshop on Combinatorial Algorithms (IWOCA), 2018
  arXiv:1803.07515

• Computing Top-k Temporal Closeness in Temporal Networks
  Lutz Oettershagen, Petra Mutzel.
  Knowledge and Information Systems, Springer, 2022

• Classifying Dissemination Processes in Temporal Graphs
  Lutz Oettershagen, Nils Kriege, Christopher Morris, Petra Mutzel
  Big Data, Mary Ann Liebert, 2020

• Wintersemester 2021/22
  • Algorithms for Data Analysis

• Sommersemester 2021
  • Graphenalgorithmen

• Wintersemester 2020/21
  • Advanced Algorithms

• Sommersemester 2020
  • Lab Computational Analytics - Algorithms for learning on temporal graphs

• Wintersemester 2019/20
  • Algorithmen und Berechnungskomplexität I

• Sommersemester 2019 (TU Dortmund)
  • Softwaretechnik (Übung)
  • Proseminar Graphalgorithmen

• Wintersemester 2018/2019 (TU Dortmund)
  • Einführung in die Programmierung (Übung)

• Sommersemester 2018 (TU Dortmund)
  • Grundbegriffe der Theoretischen Informatik (Übung)
  • Seminar Algorithm Engineering

• Wintersemester 2017/2018 (TU Dortmund)
  • Einführung in die Programmierung (Praktikum)

• Sommersemester 2017 (TU Dortmund)
  • Effiziente Algorithmen (Übung)

• Vergleich von Zentralitätsmaßen auf statischen Graphen zur Identifikation von Superspreadern, BA, Carlos Rossmaier, 2022 (laufend)

• BOBA* für Meeresdaten, BA, Tim Schätz, 2022 (laufend)

• Klassifikation temporaler Graphen mit Graphkernen, BA, Claude Jordan, 2021

• Maximal-flow graph kernel, BA, Vladimir Miletić, 2021

• Similarity Measures for Temporal Graphs based on the k-dimensional Weisfeiler-Leman Refinement, MA, Nicholas Schwab, 2021

• Entwicklung und Evaluation von Syntheseansätzen fürTemporale Graphen mit Generative Adversarial Networks, BA, Michael Marx, 2021

• Synthese Realistischer Temporaler Graphen, BA, Matthias D. Neidhardt, 2021

• Bestimmung der Separationen in Zeichnungen vollständiger Graphen, BA, Minh Bang Vu, 2019 (TU Dortmund)

• Routenplanung für zwei Fahrzeuge in Graphen mit zeitexklusiver Kantennutzung, BA, Mustafa Yalcir, 2019 (TU Dortmund)