research
∙
08/29/2023
Finding Optimal 2-Packing Sets on Arbitrary Graphs at Scale
A 2-packing set for an undirected graph G=(V,E) is a subset 𝒮⊂ V such th...
share
research
∙
02/14/2023
Arc-Flags Meet Trip-Based Public Transit Routing
We present Arc-Flag TB, a journey planning algorithm for public transit ...
research
∙
02/13/2023
FREIGHT: Fast Streaming Hypergraph Partitioning
Partitioning the vertices of a (hyper)graph into k roughly balanced bloc...
research
∙
02/01/2023
Improved Exact and Heuristic Algorithms for Maximum Weight Clique
We propose improved exact and heuristic algorithms for solving the maxim...
research
∙
01/17/2023
Engineering Fully Dynamic Δ-Orientation Algorithms
A (fully) dynamic graph algorithm is a data structure that supports edge...
research
∙
12/15/2022
Attention-based Multiple Instance Learning for Survival Prediction on Lung Cancer Tissue Microarrays
Attention-based multiple instance learning (AMIL) algorithms have proven...
research
∙
08/29/2022
Finding Near-Optimal Weight Independent Sets at Scale
Computing maximum weight independent sets in graphs is an important NP-h...
research
∙
08/29/2022
A Distributed Multilevel Memetic Algorithm for Signed Graph Clustering
In real-world applications, interactions between two entities can be usu...
research
∙
05/26/2022
More Recent Advances in (Hyper)Graph Partitioning
In recent years, significant advances have been made in the design and e...
research
∙
05/11/2022
Local Motif Clustering via (Hyper)Graph Partitioning
A widely-used operation on graphs is local clustering, i.e., extracting ...
research
∙
05/05/2022
Fractal dimensions of k-automatic sets
This paper seeks to build on the extensive connections that have arisen ...
research
∙
02/01/2022
Recursive Multi-Section on the Fly: Shared-Memory Streaming Algorithms for Hierarchical Graph Partitioning and Process Mapping
Partitioning a graph into balanced blocks such that few edges run betwee...
research
∙
01/19/2022
Weakly Supervised Semantic Segmentation of Remote Sensing Images for Tree Species Classification Based on Explanation Methods
The collection of a high number of pixel-based labeled training samples ...
research
∙
10/22/2021
A strong version of Cobham's theorem
Let k,ℓ≥ 2 be two multiplicatively independent integers. Cobham's famous...
research
∙
07/06/2021
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures
Processing massive application graphs on distributed memory systems requ...
research
∙
06/16/2021
High-Quality Hypergraph Partitioning
This paper considers the balanced hypergraph partitioning problem, which...
research
∙
05/05/2021
Deep Multilevel Graph Partitioning
Partitioning a graph into blocks of "roughly equal" weight while cutting...
research
∙
04/27/2021
Fully-dynamic Weighted Matching Approximation in Practice
Finding large or heavy matchings in graphs is a ubiquitous combinatorial...
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
∙
02/18/2021
Buffered Streaming Graph Partitioning
Partitioning graphs into blocks of roughly equal size is a widely used t...
research
∙
02/16/2021
Decidability for Sturmian words
We show that the first-order theory of Sturmian words over Presburger ar...
research
∙
02/02/2021
Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi Automata
Pecan is an automated theorem prover for reasoning about properties of S...
research
∙
01/13/2021
Practical Fully Dynamic Minimum Cut Algorithms
We present a practically efficient algorithm for maintaining a global mi...
research
∙
12/23/2020
Recent Advances in Practical Data Reduction
Over the last two decades, significant advances have been made in the de...
research
∙
12/11/2020
The Future is Big Graphs! A Community View on Graph Processing Systems
Graphs are by nature unifying abstractions that can leverage interconnec...
research
∙
08/25/2020
Faster Reachability in Static Graphs
One of the most fundamental problems in computer science is the reachabi...
research
∙
08/12/2020
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations
Given a vertex-weighted graph, the maximum weight independent set proble...
research
∙
05/19/2020
Efficient Process-to-Node Mapping Algorithms for Stencil Computations
Good process-to-compute-node mappings can be decisive for well performin...
research
∙
04/24/2020
Faster Parallel Multiterminal Cuts
We give an improved branch-and-bound solver for the multiterminal cut pr...
research
∙
04/23/2020
Engineering Data Reduction for Nested Dissection
Many applications rely on time-intensive matrix operations, such as fact...
research
∙
04/20/2020
Dynamic Matching Algorithms in Practice
In recent years, significant advances have been made in the design and a...
research
∙
03/02/2020
Recent Advances in Scalable Network Generation
Random graph models are frequently used as a controllable and versatile ...
research
∙
02/17/2020
Finding All Global Minimum Cuts In Practice
We present a practically efficient algorithm that finds all global minim...
research
∙
02/06/2020
Multilevel Acyclic Hypergraph Partitioning
A directed acyclic hypergraph is a generalized concept of a directed acy...
research
∙
02/03/2020
Faster Fully Dynamic Transitive Closure in Practice
The fully dynamic transitive closure problem asks to maintain reachabili...
research
∙
01/27/2020
Load-Balanced Bottleneck Objectives in Process Mapping
We propose a new problem formulation for graph partitioning that is tail...
research
∙
01/20/2020
High-Quality Hierarchical Process Mapping
Partitioning graphs into blocks of roughly equal size such that few edge...
research
∙
11/30/2019
Scalable Graph Algorithms
Processing large complex networks recently attracted considerable intere...
research
∙
08/19/2019
WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track
We present the winning solver of the PACE 2019 Implementation Challenge,...
research
∙
08/12/2019
Shared-Memory Branch-and-Reduce for Multiterminal Cuts
We introduce the fastest known exact algorithm for the multiterminal cut...
research
∙
05/26/2019
Engineering Kernelization for Maximum Cut
Kernelization is a general theoretical framework for preprocessing insta...
research
∙
05/08/2019
Finding Optimal Longest Paths by Dynamic Programming in Parallel
We propose an exact algorithm for solving the longest simple path proble...
research
∙
05/03/2019
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study
Given a directed graph and a source vertex, the fully dynamic single-sou...
research
∙
10/25/2018
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs
One powerful technique to solve NP-hard optimization problems in practic...
research
∙
08/22/2018
Reproducible data citations for computational research
The general purpose of a scientific publication is the exchange and spre...
research
∙
08/20/2018
Scalable Edge Partitioning
Edge-centric distributed computations have appeared as a recent techniqu...
research
∙
08/20/2018
Faster Support Vector Machines
The time complexity of support vector machines (SVMs) prohibits training...
research
∙
08/16/2018
Shared-memory Exact Minimum Cuts
The minimum cut problem for an undirected edge-weighted graph asks us to...
research
∙
07/12/2018
A network-based citation indicator of scientific performance
Scientists are embedded in social and information networks that influenc...
research
∙
02/20/2018
