Christian Schulz

research

∙ 05/11/2022

Local Motif Clustering via (Hyper)Graph Partitioning

A widely-used operation on graphs is local clustering, i.e., extracting ...

Adil Chhabra, et al. ∙

research

∙ 05/05/2022

Fractal dimensions of k-automatic sets

This paper seeks to build on the extensive connections that have arisen ...

Alexi Block Gorman, et al. ∙

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

Marcelo Fonseca Faraj, et al. ∙

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

Steve Ahlswede, et al. ∙

research

∙ 10/22/2021

A strong version of Cobham's theorem

Let k,ℓ≥ 2 be two multiplicatively independent integers. Cobham's famous...

Philipp Hieronymi, et al. ∙

research

∙ 07/06/2021

An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures

Processing massive application graphs on distributed memory systems requ...

Maria Predari, et al. ∙

research

∙ 06/16/2021

High-Quality Hypergraph Partitioning

This paper considers the balanced hypergraph partitioning problem, which...

Sebastian Schlag, et al. ∙

research

∙ 05/05/2021

Deep Multilevel Graph Partitioning

Partitioning a graph into blocks of "roughly equal" weight while cutting...

Lars Gottesbüren, et al. ∙

research

∙ 04/27/2021

Fully-dynamic Weighted Matching Approximation in Practice

Finding large or heavy matchings in graphs is a ubiquitous combinatorial...

Eugenio Angriman, et al. ∙

research

∙ 02/22/2021

Recent Advances in Fully Dynamic Graph Algorithms

In recent years, significant advances have been made in the design and a...

Kathrin Hanauer, et al. ∙

research

∙ 02/18/2021

Buffered Streaming Graph Partitioning

Partitioning graphs into blocks of roughly equal size is a widely used t...

Marcelo Fonseca Faraj, et al. ∙

research

∙ 02/16/2021

Decidability for Sturmian words

We show that the first-order theory of Sturmian words over Presburger ar...

Philipp Hieronymi, et al. ∙

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

Reed Oei, et al. ∙

research

∙ 01/13/2021

Practical Fully Dynamic Minimum Cut Algorithms

We present a practically efficient algorithm for maintaining a global mi...

Monika Henzinger, et al. ∙

research

∙ 12/23/2020

Recent Advances in Practical Data Reduction

Over the last two decades, significant advances have been made in the de...

Faisal Abu-Khzam, et al. ∙

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

Sherif Sakr, et al. ∙

research

∙ 08/25/2020

Faster Reachability in Static Graphs

One of the most fundamental problems in computer science is the reachabi...

Kathrin Hanauer, et al. ∙

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

Alexander Gellner, et al. ∙

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

Sascha Hunold, et al. ∙

research

∙ 04/24/2020

Faster Parallel Multiterminal Cuts

We give an improved branch-and-bound solver for the multiterminal cut pr...

Monika Henzinger, et al. ∙

research

∙ 04/23/2020

Engineering Data Reduction for Nested Dissection

Many applications rely on time-intensive matrix operations, such as fact...

Wolfgang Ost, et al. ∙

research

∙ 04/20/2020

Dynamic Matching Algorithms in Practice

In recent years, significant advances have been made in the design and a...

Monika Henzinger, et al. ∙

research

∙ 03/02/2020

Recent Advances in Scalable Network Generation

Random graph models are frequently used as a controllable and versatile ...

Manuel Penschuck, et al. ∙

research

∙ 02/17/2020

Finding All Global Minimum Cuts In Practice

We present a practically efficient algorithm that finds all global minim...

Monika Henzinger, et al. ∙

research

∙ 02/06/2020

Multilevel Acyclic Hypergraph Partitioning

A directed acyclic hypergraph is a generalized concept of a directed acy...

Merten Popp, et al. ∙

research

∙ 02/03/2020

Faster Fully Dynamic Transitive Closure in Practice

The fully dynamic transitive closure problem asks to maintain reachabili...

Kathrin Hanauer, et al. ∙

research

∙ 01/27/2020

Load-Balanced Bottleneck Objectives in Process Mapping

We propose a new problem formulation for graph partitioning that is tail...

Johannes Langguth, et al. ∙

research

∙ 01/20/2020

High-Quality Hierarchical Process Mapping

Partitioning graphs into blocks of roughly equal size such that few edge...

Marcelo Fonseca Faraj, et al. ∙

research

∙ 11/30/2019

Scalable Graph Algorithms

Processing large complex networks recently attracted considerable intere...

Christian Schulz, et al. ∙

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,...

Demian Hespe, et al. ∙

research

∙ 08/12/2019

Shared-Memory Branch-and-Reduce for Multiterminal Cuts

We introduce the fastest known exact algorithm for the multiterminal cut...

Monika Henzinger, et al. ∙

research

∙ 05/26/2019

Engineering Kernelization for Maximum Cut

Kernelization is a general theoretical framework for preprocessing insta...

Damir Ferizovic, et al. ∙

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

Kai Fieger, et al. ∙

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

Kathrin Hanauer, et al. ∙

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

Sebastian Lamm, et al. ∙

research

∙ 08/22/2018

Reproducible data citations for computational research

The general purpose of a scientific publication is the exchange and spre...

Christian Schulz, et al. ∙

research

∙ 08/20/2018

Scalable Edge Partitioning

Edge-centric distributed computations have appeared as a recent techniqu...

Sebastian Schlag, et al. ∙

research

∙ 08/20/2018

Faster Support Vector Machines

The time complexity of support vector machines (SVMs) prohibits training...

Sebastian Schlag, et al. ∙

research

∙ 08/16/2018

Shared-memory Exact Minimum Cuts

The minimum cut problem for an undirected edge-weighted graph asks us to...

Monika Henzinger, et al. ∙

research

∙ 07/12/2018

A network-based citation indicator of scientific performance

Scientists are embedded in social and information networks that influenc...

Christian Schulz, et al. ∙

research

∙ 02/20/2018

ILP-based Local Search for Graph Partitioning

Computing high-quality graph partitions is a challenging problem with nu...

Alexandra Henzinger, et al. ∙

research

∙ 02/20/2018

Memetic Graph Clustering

It is common knowledge that there is no single best strategy for graph c...

Sonja Biedermann, et al. ∙

research

∙ 10/20/2017

Communication-free Massively Distributed Graph Generation

Analyzing massive complex networks yields promising insights about our e...

Daniel Funke, et al. ∙

research

∙ 09/25/2017

Evolutionary Acyclic Graph Partitioning

Directed graphs are widely used to model data flow and execution depende...

Orlando Moreira, et al. ∙

research

∙ 04/03/2017

Graph Partitioning with Acyclicity Constraints

Graphs are widely used to model execution dependencies in applications. ...

Orlando Moreira, et al. ∙

research

∙ 02/06/2017

Distributed Evolutionary k-way Node Separators

Computing high quality node separators in large graphs is necessary for ...

Peter Sanders, et al. ∙

research

∙ 09/02/2015

Finding Near-Optimal Independent Sets at Scale

The independent set problem is NP-hard and particularly difficult to sol...

Sebastian Lamm, et al. ∙

research

∙ 04/29/2015

Incorporating Road Networks into Territory Design

Given a set of basic areas, the territory design problem asks to create ...

Nitin Ahuja, et al. ∙

research

∙ 02/05/2015

Graph Partitioning for Independent Sets

Computing maximum independent sets in graphs is an important problem in ...

Sebastian Lamm, et al. ∙

research

∙ 05/08/2014

Proofs of two Theorems concerning Sparse Spacetime Constraints

In the SIGGRAPH 2014 paper [SvTSH14] an approach for animating deformabl...

Christian Schulz, et al. ∙

Christian Schulz

Featured Co-authors