research
∙
02/01/2023
Improved Exact and Heuristic Algorithms for Maximum Weight Clique
We propose improved exact and heuristic algorithms for solving the maxim...
share
research
∙
01/13/2023
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters
Emerging reconfigurable datacenters allow to dynamically adjust the netw...
research
∙
01/17/2022
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies
Reconfigurable optical topologies promise to improve the performance in ...
research
∙
06/29/2021
Fully Dynamic Four-Vertex Subgraph Counting
This paper presents a comprehensive study of algorithms for maintaining ...
research
∙
02/22/2021
Recent Advances in Fully Dynamic Graph Algorithms
In recent years, significant advances have been made in the design and a...
research
∙
08/25/2020
Faster Reachability in Static Graphs
One of the most fundamental problems in computer science is the reachabi...
research
∙
02/03/2020
Faster Fully Dynamic Transitive Closure in Practice
The fully dynamic transitive closure problem asks to maintain reachabili...
research
∙
05/03/2019
