research
∙
09/26/2022
TGLib: An Open-Source Library for Temporal Graph Analysis
We initiate an open-source library for the efficient analysis of tempora...
share
research
∙
09/12/2022
A Temporal Graphlet Kernel for Classifying Dissemination in Evolving Networks
We introduce the temporal graphlet kernel for classifying dissemination ...
research
∙
06/28/2022
Strengthened Partial-Ordering Based ILP Models for the Vertex Coloring Problem
The vertex coloring problem asks for the minimum number of colors that c...
research
∙
03/14/2022
Minimum-Error Triangulations for Sea Surface Reconstruction
We apply state-of-the-art computational geometry methods to the problem ...
research
∙
02/08/2022
Temporal Walk Centrality: Ranking Nodes in Evolving Networks
We propose the Temporal Walk Centrality, which quantifies the importance...
research
∙
11/19/2021
An Index for Single Source All Destinations Distance Queries in Temporal Graphs
A typical task in temporal graphs analysis is answering single-source-al...
research
∙
09/14/2020
Spatio-Temporal Top-k Similarity Search for Trajectories in Graphs
We study the problem of finding the k most similar trajectories to a giv...
research
∙
07/16/2020
TUDataset: A collection of benchmark datasets for learning with graphs
Recently, there has been an increasing interest in (supervised) learning...
research
∙
04/25/2019
Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs
Quantum annealing is getting increasing attention in combinatorial optim...
research
∙
04/02/2019
Towards a practical k-dimensional Weisfeiler-Leman algorithm
The k-dimensional Weisfeiler-Leman algorithm is a well-known heuristic f...
research
∙
03/14/2019
Maximum Cut Parameterized by Crossing Number
Given an edge-weighted graph G on n nodes, the NP-hard Max-Cut problem a...
research
∙
12/06/2018
On the Enumeration of Bicriteria Temporal Paths
We discuss the complexity of path enumeration in weighted temporal graph...
research
∙
11/29/2018
Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs
We propose two fixed-parameter tractable algorithms for the weighted Max...
research
∙
06/27/2018
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...
research
∙
06/18/2018
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width
We consider the coordinate assignment phase of the well known Sugiyama f...
research
∙
05/28/2018
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
Schietgat, Ramon and Bruynooghe proposed a polynomial-time algorithm for...
research
∙
05/16/2018
The Crossing Number of Semi-Pair-Shellable Drawings of Complete Graphs
The Harary-Hill Conjecture states that for n≥ 3 every drawing of K_n has...
research
∙
05/16/2018
The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete Graphs
The Harary-Hill Conjecture states that for n≥ 3 every drawing of K_n has...
research
∙
05/02/2018
Largest Weight Common Subtree Embeddings with Distance Penalties
The largest common embeddable subtree problem asks for the largest possi...
research
∙
03/29/2018
A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
We propose a fixed-parameter tractable algorithm for the Max-Cut problem...
research
∙
03/20/2018
The Crossing Number of Seq-Shellable Drawings of Complete Graphs
The Harary-Hill conjecture states that for every n>0 the complete graph ...
research
∙
02/16/2018
Recognizing Cuneiform Signs Using Graph Based Methods
The cuneiform script constitutes one of the earliest systems of writing ...
research
∙
08/09/2017
On Maximum Common Subgraph Problems in Series-Parallel Graphs
The complexity of the maximum common connected subgraph problem in parti...
research
∙
06/30/2017
New Integer Linear Programming Models for the Vertex Coloring Problem
The vertex coloring problem asks for the minimum number of colors that c...
research
∙
03/07/2017
Global Weisfeiler-Lehman Graph Kernels
Most state-of-the-art graph kernels only take local graph properties int...
research
∙
03/02/2017
A Unifying View of Explicit and Implicit Feature Maps for Structured Data: Systematic Studies of Graph Kernels
Non-linear kernel methods can be approximated by fast linear ones using ...
research
∙
10/01/2016
Faster Kernels for Graphs with Continuous Attributes via Hashing
While state-of-the-art kernels for graphs with discrete labels scale wel...
research
∙
09/28/2016
StruClus: Structural Clustering of Large-Scale Graph Databases
We present a structural clustering algorithm for large-scale datasets of...
research
∙
06/27/2012