Lutz Oettershagen

Orcid: 0000-0002-2526-8762

According to our database1, Lutz Oettershagen authored at least 19 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Finding Densest Subgraphs with Edge-Color Constraints.
CoRR, 2024

2023
Temporal Network Core Decomposition and Community Search.
CoRR, 2023

An Index For Temporal Closeness Computation in Evolving Graphs.
Proceedings of the 2023 SIAM International Conference on Data Mining, 2023

A Temporal Graphlet Kernel For Classifying Dissemination in Evolving Networks.
Proceedings of the 2023 SIAM International Conference on Data Mining, 2023

A Higher-Order Temporal H-Index for Evolving Networks.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

2022
Temporal Graph Algorithms.
PhD thesis, 2022

Computing top-k temporal closeness in temporal networks.
Knowl. Inf. Syst., 2022

Temporal Walk Centrality: Ranking Nodes in Evolving Networks.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Inferring Tie Strength in Temporal Networks.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2022

TGLib: An Open-Source Library for Temporal Graph Analysis.
Proceedings of the IEEE International Conference on Data Mining Workshops, 2022

2021
An Index for Single Source All Destinations Distance Queries in Temporal Graphs.
CoRR, 2021

2020
Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs.
CoRR, 2020

Classifying Dissemination Processes in Temporal Graphs.
Big Data, 2020

Temporal Graph Kernels for Classifying Dissemination Processes.
Proceedings of the 2020 SIAM International Conference on Data Mining, 2020

Efficient Top-k Temporal Closeness Calculation in Temporal Networks.
Proceedings of the 20th IEEE International Conference on Data Mining, 2020

2019
On the Enumeration of Bicriteria Temporal Paths.
Proceedings of the Theory and Applications of Models of Computation, 2019

2018
The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete Graphs.
CoRR, 2018

The Crossing Number of Seq-Shellable Drawings of Complete Graphs.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

The Crossing Number of Semi-Pair-Shellable Drawings of Complete Graphs.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018


  Loading...