
Recent Advances in Fully Dynamic Graph Algorithms
In recent years, significant advances have been made in the design and a...
read it

Buffered Streaming Graph Partitioning
Partitioning graphs into blocks of roughly equal size is a widely used t...
read it

Decidability for Sturmian words
We show that the firstorder theory of Sturmian words over Presburger ar...
read it

Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi Automata
Pecan is an automated theorem prover for reasoning about properties of S...
read it

Practical Fully Dynamic Minimum Cut Algorithms
We present a practically efficient algorithm for maintaining a global mi...
read it

Recent Advances in Practical Data Reduction
Over the last two decades, significant advances have been made in the de...
read it

The Future is Big Graphs! A Community View on Graph Processing Systems
Graphs are by nature unifying abstractions that can leverage interconnec...
read it

Faster Reachability in Static Graphs
One of the most fundamental problems in computer science is the reachabi...
read it

Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations
Given a vertexweighted graph, the maximum weight independent set proble...
read it

Efficient ProcesstoNode Mapping Algorithms for Stencil Computations
Good processtocomputenode mappings can be decisive for well performin...
read it

Faster Parallel Multiterminal Cuts
We give an improved branchandbound solver for the multiterminal cut pr...
read it

Engineering Data Reduction for Nested Dissection
Many applications rely on timeintensive matrix operations, such as fact...
read it

Dynamic Matching Algorithms in Practice
In recent years, significant advances have been made in the design and a...
read it

Recent Advances in Scalable Network Generation
Random graph models are frequently used as a controllable and versatile ...
read it

Finding All Global Minimum Cuts In Practice
We present a practically efficient algorithm that finds all global minim...
read it

Multilevel Acyclic Hypergraph Partitioning
A directed acyclic hypergraph is a generalized concept of a directed acy...
read it

Faster Fully Dynamic Transitive Closure in Practice
The fully dynamic transitive closure problem asks to maintain reachabili...
read it

LoadBalanced Bottleneck Objectives in Process Mapping
We propose a new problem formulation for graph partitioning that is tail...
read it

HighQuality Hierarchical Process Mapping
Partitioning graphs into blocks of roughly equal size such that few edge...
read it

Scalable Graph Algorithms
Processing large complex networks recently attracted considerable intere...
read it

WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track
We present the winning solver of the PACE 2019 Implementation Challenge,...
read it

SharedMemory BranchandReduce for Multiterminal Cuts
We introduce the fastest known exact algorithm for the multiterminal cut...
read it

Engineering Kernelization for Maximum Cut
Kernelization is a general theoretical framework for preprocessing insta...
read it

Finding Optimal Longest Paths by Dynamic Programming in Parallel
We propose an exact algorithm for solving the longest simple path proble...
read it

Fully Dynamic SingleSource Reachability in Practice: An Experimental Study
Given a directed graph and a source vertex, the fully dynamic singlesou...
read it

Exactly Solving the Maximum Weight Independent Set Problem on Large RealWorld Graphs
One powerful technique to solve NPhard optimization problems in practic...
read it

Reproducible data citations for computational research
The general purpose of a scientific publication is the exchange and spre...
read it

Scalable Edge Partitioning
Edgecentric distributed computations have appeared as a recent techniqu...
read it

Faster Support Vector Machines
The time complexity of support vector machines (SVMs) prohibits training...
read it

Sharedmemory Exact Minimum Cuts
The minimum cut problem for an undirected edgeweighted graph asks us to...
read it

A networkbased citation indicator of scientific performance
Scientists are embedded in social and information networks that influenc...
read it

ILPbased Local Search for Graph Partitioning
Computing highquality graph partitions is a challenging problem with nu...
read it

Memetic Graph Clustering
It is common knowledge that there is no single best strategy for graph c...
read it

Communicationfree Massively Distributed Graph Generation
Analyzing massive complex networks yields promising insights about our e...
read it

Evolutionary Acyclic Graph Partitioning
Directed graphs are widely used to model data flow and execution depende...
read it

Graph Partitioning with Acyclicity Constraints
Graphs are widely used to model execution dependencies in applications. ...
read it

Distributed Evolutionary kway Node Separators
Computing high quality node separators in large graphs is necessary for ...
read it

Finding NearOptimal Independent Sets at Scale
The independent set problem is NPhard and particularly difficult to sol...
read it

Incorporating Road Networks into Territory Design
Given a set of basic areas, the territory design problem asks to create ...
read it

Graph Partitioning for Independent Sets
Computing maximum independent sets in graphs is an important problem in ...
read it

Proofs of two Theorems concerning Sparse Spacetime Constraints
In the SIGGRAPH 2014 paper [SvTSH14] an approach for animating deformabl...
read it

Parallel Graph Partitioning for Complex Networks
Processing large complex networks like social networks or web graphs has...
read it

Think Locally, Act Globally: Perfectly Balanced Graph Partitioning
We present a novel local improvement scheme for the perfectly balanced g...
read it

Distributed Evolutionary Graph Partitioning
We present a novel distributed evolutionary algorithm, KaFFPaE, to solve...
read it