default search action
Lutz Oettershagen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Lutz Oettershagen, Honglian Wang, Aristides Gionis:
Finding Densest Subgraphs with Edge-Color Constraints. WWW 2024: 936-947 - [c12]Aristides Gionis, Lutz Oettershagen, Ilie Sarpe:
Mining Temporal Networks. WWW (Companion Volume) 2024: 1260-1263 - [i14]Lutz Oettershagen, Honglian Wang, Aristides Gionis:
Finding Densest Subgraphs with Edge-Color Constraints. CoRR abs/2402.09124 (2024) - [i13]Lutz Oettershagen, Athanasios L. Konstantinidis, Fariba Ranjbar, Giuseppe F. Italiano:
Consistent Strong Triadic Closure in Multilayer Networks. CoRR abs/2409.08405 (2024) - 2023
- [c11]Lutz Oettershagen, Nils M. Kriege, Petra Mutzel:
A Higher-Order Temporal H-Index for Evolving Networks. KDD 2023: 1770-1782 - [c10]Lutz Oettershagen, Nils M. Kriege, Claude Jordan, Petra Mutzel:
A Temporal Graphlet Kernel For Classifying Dissemination in Evolving Networks. SDM 2023: 19-27 - [c9]Lutz Oettershagen, Petra Mutzel:
An Index For Temporal Closeness Computation in Evolving Graphs. SDM 2023: 280-288 - [i12]Lutz Oettershagen, Nils M. Kriege, Petra Mutzel:
A Higher-Order Temporal H-Index for Evolving Networks. CoRR abs/2305.16001 (2023) - [i11]Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano:
Temporal Network Core Decomposition and Community Search. CoRR abs/2309.11843 (2023) - 2022
- [b1]Lutz Oettershagen:
Temporal Graph Algorithms. University of Bonn, Germany, 2022 - [j2]Lutz Oettershagen, Petra Mutzel:
Computing top-k temporal closeness in temporal networks. Knowl. Inf. Syst. 64(2): 507-535 (2022) - [c8]Lutz Oettershagen, Petra Mutzel:
TGLib: An Open-Source Library for Temporal Graph Analysis. ICDM (Workshops) 2022: 1240-1245 - [c7]Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano:
Inferring Tie Strength in Temporal Networks. ECML/PKDD (2) 2022: 69-85 - [c6]Lutz Oettershagen, Petra Mutzel, Nils M. Kriege:
Temporal Walk Centrality: Ranking Nodes in Evolving Networks. WWW 2022: 1640-1650 - [i10]Lutz Oettershagen, Petra Mutzel, Nils M. Kriege:
Temporal Walk Centrality: Ranking Nodes in Evolving Networks. CoRR abs/2202.03706 (2022) - [i9]Lutz Oettershagen, Athanasios L. Konstantinidis, Giuseppe F. Italiano:
Inferring Tie Strength in Temporal Networks. CoRR abs/2206.11705 (2022) - [i8]Lutz Oettershagen, Nils M. Kriege, Claude Jordan, Petra Mutzel:
A Temporal Graphlet Kernel for Classifying Dissemination in Evolving Networks. CoRR abs/2209.07332 (2022) - [i7]Lutz Oettershagen, Petra Mutzel:
TGLib: An Open-Source Library for Temporal Graph Analysis. CoRR abs/2209.12587 (2022) - 2021
- [i6]Lutz Oettershagen, Petra Mutzel:
An Index for Single Source All Destinations Distance Queries in Temporal Graphs. CoRR abs/2111.10095 (2021) - 2020
- [j1]Lutz Oettershagen, Nils M. Kriege, Christopher Morris, Petra Mutzel:
Classifying Dissemination Processes in Temporal Graphs. Big Data 8(5): 363-378 (2020) - [c5]Lutz Oettershagen, Petra Mutzel:
Efficient Top-k Temporal Closeness Calculation in Temporal Networks. ICDM 2020: 402-411 - [c4]Lutz Oettershagen, Nils M. Kriege, Christopher Morris, Petra Mutzel:
Temporal Graph Kernels for Classifying Dissemination Processes. SDM 2020: 496-504 - [i5]Anne Driemel, Petra Mutzel, Lutz Oettershagen:
Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs. CoRR abs/2009.06778 (2020)
2010 – 2019
- 2019
- [c3]Petra Mutzel, Lutz Oettershagen:
On the Enumeration of Bicriteria Temporal Paths. TAMC 2019: 518-535 - [i4]Lutz Oettershagen, Nils M. Kriege, Christopher Morris, Petra Mutzel:
Temporal Graph Kernels for Classifying Dissemination Processes. CoRR abs/1911.05496 (2019) - 2018
- [c2]Petra Mutzel, Lutz Oettershagen:
The Crossing Number of Semi-Pair-Shellable Drawings of Complete Graphs. CCCG 2018: 11-17 - [c1]Petra Mutzel, Lutz Oettershagen:
The Crossing Number of Seq-Shellable Drawings of Complete Graphs. IWOCA 2018: 273-284 - [i3]Petra Mutzel, Lutz Oettershagen:
The Crossing Number of Seq-Shellable Drawings of Complete Graphs. CoRR abs/1803.07515 (2018) - [i2]Petra Mutzel, Lutz Oettershagen:
The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete Graphs. CoRR abs/1805.06780 (2018) - [i1]Petra Mutzel, Lutz Oettershagen:
On the Enumeration of Bicriteria Temporal Paths. CoRR abs/1812.02507 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-14 23:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint