The Crossing Number of Semi-Pair-Shellable Drawings of Complete Graphs. - Petra Mutzel; Lutz Oettershagen (CCCG, 2018)

The Crossing Number of Seq-Shellable Drawings of Complete Graphs. - Petra Mutzel; Lutz Oettershagen (IWOCA, 2018)

The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete Graphs. - Petra Mutzel; Lutz Oettershagen (CoRR, 2018)

On the Enumeration of Bicriteria Temporal Paths. - Petra Mutzel; Lutz Oettershagen (TAMC, 2019)

Efficient Top-k Temporal Closeness Calculation in Temporal Networks. - Lutz Oettershagen; Petra Mutzel (ICDM, 2020)

Temporal Graph Kernels for Classifying Dissemination Processes. - Lutz Oettershagen; Nils M. Kriege; Christopher Morris 001; Petra Mutzel (SDM, 2020)

Classifying Dissemination Processes in Temporal Graphs. - Lutz Oettershagen; Nils M. Kriege; Christopher Morris 001; Petra Mutzel (Big Data, 2020)

Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs. - Anne Driemel; Petra Mutzel; Lutz Oettershagen (CoRR, 2020)

An Index for Single Source All Destinations Distance Queries in Temporal Graphs. - Lutz Oettershagen; Petra Mutzel (CoRR, 2021)

TGLib: An Open-Source Library for Temporal Graph Analysis. - Lutz Oettershagen; Petra Mutzel (ICDM (Workshops), 2022)

Temporal Walk Centrality: Ranking Nodes in Evolving Networks. - Lutz Oettershagen; Petra Mutzel; Nils M. Kriege (WWW, 2022)

Computing top-k temporal closeness in temporal networks. - Lutz Oettershagen; Petra Mutzel (Knowl. Inf. Syst., 2022)

Temporal Graph Algorithms. - Lutz Oettershagen (2022)

A Higher-Order Temporal H-Index for Evolving Networks. - Lutz Oettershagen; Nils M. Kriege; Petra Mutzel (KDD, 2023)

A Temporal Graphlet Kernel For Classifying Dissemination in Evolving Networks. - Lutz Oettershagen; Nils M. Kriege; Claude Jordan; Petra Mutzel (SDM, 2023)

An Index For Temporal Closeness Computation in Evolving Graphs. - Lutz Oettershagen; Petra Mutzel (SDM, 2023)

Temporal Network Core Decomposition and Community Search. - Lutz Oettershagen; Athanasios L. Konstantinidis; Giuseppe F. Italiano (CoRR, 2023)

Mining Temporal Networks. - Aristides Gionis; Lutz Oettershagen; Ilie Sarpe (WWW (Companion Volume), 2024)

Finding Densest Subgraphs with Edge-Color Constraints. - Lutz Oettershagen; Honglian Wang; Aristides Gionis (WWW, 2024)

Consistent Strong Triadic Closure in Multilayer Networks. - Lutz Oettershagen; Athanasios L. Konstantinidis; Fariba Ranjbar; Giuseppe F. Italiano (CoRR, 2024)

An Edge-Based Decomposition Framework for Temporal Networks. - Lutz Oettershagen; Athanasios L. Konstantinidis; Giuseppe F. Italiano (WSDM, 2025)

Inferring tie strength in temporal networks. - Lutz Oettershagen; Athanasios L. Konstantinidis; Giuseppe F. Italiano (Data Min. Knowl. Discov., 2025)