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...
share
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
∙
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
