7 citations · 7 across the 1 of their papers we have counts for
6 papers
As Time Goes By: Reflections on Treewidth for Temporal Graphs
Till Fluschnik, Hendrik Molter, Rolf Niedermeier +2
Treewidth is arguably the most important structural graph parameter leading to algorithmically beneficial graph decompositions. Triggered by a strongly growing interest in temporal…
Multistage Graph Problems on a Global Budget
Klaus Heeger, Anne-Sophie Himmel, Frank Kammer +3
Time-evolving or temporal graphs gain more and more popularity when studying the behavior of complex networks. In this context, the multistage view on computational problems is amo…
Persistent Graphs and Cyclic Polytope Triangulations
Vincent Froese, Malte Renken
We prove a bijection between the triangulations of the 3-dimensional cyclic polytope C(n+2, 3) and persistent graphs with n vertices. We show that under this bijection the Stasheff…
Enumerating Isolated Cliques in Temporal Networks
Hendrik Molter, Rolf Niedermeier, Malte Renken
Isolation is a concept from the world of clique enumeration that is mostly used to model communities that do not have much contact to the outside world. Herein, a clique is conside…
Advancing Through Terrains
Vincent Froese, Malte Renken
We study terrain visibility graphs, a well-known graph class closely related to polygon visibility graphs in computational geometry, for which a precise graph-theoretical character…
Comparing Temporal Graphs Using Dynamic Time Warping
Vincent Froese, Brijnesh Jain, Rolf Niedermeier +1
Within many real-world networks the links between pairs of nodes change over time. Thus, there has been a recent boom in studying temporal graphs. Recognizing patterns in temporal…