
SpatioTemporal Topk Similarity Search for Trajectories in Graphs
We study the problem of finding the k most similar trajectories to a giv...
read it

TUDataset: A collection of benchmark datasets for learning with graphs
Recently, there has been an increasing interest in (supervised) learning...
read it

Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs
Quantum annealing is getting increasing attention in combinatorial optim...
read it

Towards a practical kdimensional WeisfeilerLeman algorithm
The kdimensional WeisfeilerLeman algorithm is a wellknown heuristic f...
read it

Maximum Cut Parameterized by Crossing Number
Given an edgeweighted graph G on n nodes, the NPhard MaxCut problem a...
read it

On the Enumeration of Bicriteria Temporal Paths
We discuss the complexity of path enumeration in weighted temporal graph...
read it

FixedParameter Algorithms for the Weighted MaxCut Problem on Embedded 1Planar Graphs
We propose two fixedparameter tractable algorithms for the weighted Max...
read it

A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
The Steiner tree problem with revenues, budgets and hop constraints (STP...
read it

A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width
We consider the coordinate assignment phase of the well known Sugiyama f...
read it

A note on blockandbridge preserving maximum common subgraph algorithms for outerplanar graphs
Schietgat, Ramon and Bruynooghe proposed a polynomialtime algorithm for...
read it

The Crossing Number of SemiPairShellable Drawings of Complete Graphs
The HararyHill Conjecture states that for n≥ 3 every drawing of K_n has...
read it

The Crossing Number of SinglePairSeqShellable Drawings of Complete Graphs
The HararyHill Conjecture states that for n≥ 3 every drawing of K_n has...
read it

Largest Weight Common Subtree Embeddings with Distance Penalties
The largest common embeddable subtree problem asks for the largest possi...
read it

A FixedParameter Algorithm for the MaxCut Problem on Embedded 1Planar Graphs
We propose a fixedparameter tractable algorithm for the MaxCut problem...
read it

The Crossing Number of SeqShellable Drawings of Complete Graphs
The HararyHill conjecture states that for every n>0 the complete graph ...
read it

Recognizing Cuneiform Signs Using Graph Based Methods
The cuneiform script constitutes one of the earliest systems of writing ...
read it

On Maximum Common Subgraph Problems in SeriesParallel Graphs
The complexity of the maximum common connected subgraph problem in parti...
read it

New Integer Linear Programming Models for the Vertex Coloring Problem
The vertex coloring problem asks for the minimum number of colors that c...
read it

Global WeisfeilerLehman Graph Kernels
Most stateoftheart graph kernels only take local graph properties int...
read it

A Unifying View of Explicit and Implicit Feature Maps for Structured Data: Systematic Studies of Graph Kernels
Nonlinear kernel methods can be approximated by fast linear ones using ...
read it

Faster Kernels for Graphs with Continuous Attributes via Hashing
While stateoftheart kernels for graphs with discrete labels scale wel...
read it

StruClus: Structural Clustering of LargeScale Graph Databases
We present a structural clustering algorithm for largescale datasets of...
read it

Subgraph Matching Kernels for Attributed Graphs
We propose graph kernels based on subgraph matchings, i.e. structurepre...
read it
Petra Mutzel
is this you? claim profile