302 citations · 303 across the 3 of their papers we have counts for
11 papers · 1 filter
Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs
Lutz Oettershagen, Anne Driemel, Petra Mutzel
We study the problem of finding the most similar trajectories to a given query trajectory. Our work is inspired by the work of Grossi et al. [6] that considers trajectories as…
Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings
Christopher Morris, Gaurav Rattan, Petra Mutzel
Graph kernels based on the -dimensional Weisfeiler-Leman algorithm and corresponding neural architectures recently emerged as powerful tools for (supervised) learning with graph…
Maximum Cut Parameterized by Crossing Number
Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke +3
Given an edge-weighted graph on nodes, the NP-hard Max-Cut problem asks for a node bipartition such that the sum of edge weights joining the different partitions is maximiz…
Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs
Christine Dahn, Nils M. Kriege, Petra Mutzel +1
We propose two fixed-parameter tractable algorithms for the weighted Max-Cut problem on embedded 1-planar graphs parameterized by the crossing number of the given embedding. A…
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width
Michael Jünger, Petra Mutzel, Christiane Spisla
We consider the coordinate assignment phase of the well known Sugiyama framework for drawing directed graphs in a hierarchical style. The extensive literature in this area has give…
Largest Weight Common Subtree Embeddings with Distance Penalties
Andre Droschinsky, Nils M. Kriege, Petra Mutzel
The largest common embeddable subtree problem asks for the largest possible tree embeddable into two input trees and generalizes the classical maximum common subtree problem. Sever…