Christian Schulz

is this you? claim profile

∙ 0 followers
KIT ∙ University of Heidelberg ∙ ETH Zurich ∙ Universität Wien

Research and Teaching Staff at University of Vienna

Recent Advances in Fully Dynamic Graph Algorithms

In recent years, significant advances have been made in the design and a...
02/22/2021 ∙ by Kathrin Hanauer, et al. ∙ 0 ∙ share

read it
Buffered Streaming Graph Partitioning

Partitioning graphs into blocks of roughly equal size is a widely used t...
02/18/2021 ∙ by Marcelo Fonseca Faraj, et al. ∙ 0 ∙ share

read it
Decidability for Sturmian words

We show that the first-order theory of Sturmian words over Presburger ar...
02/16/2021 ∙ by Philipp Hieronymi, et al. ∙ 0 ∙ share

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...
02/02/2021 ∙ by Reed Oei, et al. ∙ 0 ∙ share

read it
Practical Fully Dynamic Minimum Cut Algorithms

We present a practically efficient algorithm for maintaining a global mi...
01/13/2021 ∙ by Monika Henzinger, et al. ∙ 0 ∙ share

read it
Recent Advances in Practical Data Reduction

Over the last two decades, significant advances have been made in the de...
12/23/2020 ∙ by Faisal Abu-Khzam, et al. ∙ 0 ∙ share

read it
The Future is Big Graphs! A Community View on Graph Processing Systems

Graphs are by nature unifying abstractions that can leverage interconnec...
12/11/2020 ∙ by Sherif Sakr, et al. ∙ 0 ∙ share

read it
Faster Reachability in Static Graphs

One of the most fundamental problems in computer science is the reachabi...
08/25/2020 ∙ by Kathrin Hanauer, et al. ∙ 0 ∙ share

read it
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations

Given a vertex-weighted graph, the maximum weight independent set proble...
08/12/2020 ∙ by Alexander Gellner, et al. ∙ 14 ∙ share

read it
Efficient Process-to-Node Mapping Algorithms for Stencil Computations

Good process-to-compute-node mappings can be decisive for well performin...
05/19/2020 ∙ by Sascha Hunold, et al. ∙ 0 ∙ share

read it
Faster Parallel Multiterminal Cuts

We give an improved branch-and-bound solver for the multiterminal cut pr...
04/24/2020 ∙ by Monika Henzinger, et al. ∙ 0 ∙ share

read it
Engineering Data Reduction for Nested Dissection

Many applications rely on time-intensive matrix operations, such as fact...
04/23/2020 ∙ by Wolfgang Ost, et al. ∙ 0 ∙ share

read it
Dynamic Matching Algorithms in Practice

In recent years, significant advances have been made in the design and a...
04/20/2020 ∙ by Monika Henzinger, et al. ∙ 0 ∙ share

read it
Recent Advances in Scalable Network Generation

Random graph models are frequently used as a controllable and versatile ...
03/02/2020 ∙ by Manuel Penschuck, et al. ∙ 0 ∙ share

read it
Finding All Global Minimum Cuts In Practice

We present a practically efficient algorithm that finds all global minim...
02/17/2020 ∙ by Monika Henzinger, et al. ∙ 0 ∙ share

read it
Multilevel Acyclic Hypergraph Partitioning

A directed acyclic hypergraph is a generalized concept of a directed acy...
02/06/2020 ∙ by Merten Popp, et al. ∙ 14 ∙ share

read it
Faster Fully Dynamic Transitive Closure in Practice

The fully dynamic transitive closure problem asks to maintain reachabili...
02/03/2020 ∙ by Kathrin Hanauer, et al. ∙ 0 ∙ share

read it
Load-Balanced Bottleneck Objectives in Process Mapping

We propose a new problem formulation for graph partitioning that is tail...
01/27/2020 ∙ by Johannes Langguth, et al. ∙ 0 ∙ share

read it
High-Quality Hierarchical Process Mapping

Partitioning graphs into blocks of roughly equal size such that few edge...
01/20/2020 ∙ by Marcelo Fonseca Faraj, et al. ∙ 0 ∙ share

read it
Scalable Graph Algorithms

Processing large complex networks recently attracted considerable intere...
11/30/2019 ∙ by Christian Schulz, et al. ∙ 0 ∙ share

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,...
08/19/2019 ∙ by Demian Hespe, et al. ∙ 0 ∙ share

read it
Shared-Memory Branch-and-Reduce for Multiterminal Cuts

We introduce the fastest known exact algorithm for the multiterminal cut...
08/12/2019 ∙ by Monika Henzinger, et al. ∙ 0 ∙ share

read it
Engineering Kernelization for Maximum Cut

Kernelization is a general theoretical framework for preprocessing insta...
05/26/2019 ∙ by Damir Ferizovic, et al. ∙ 0 ∙ share

read it
Finding Optimal Longest Paths by Dynamic Programming in Parallel

We propose an exact algorithm for solving the longest simple path proble...
05/08/2019 ∙ by Kai Fieger, et al. ∙ 0 ∙ share

read it
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study

Given a directed graph and a source vertex, the fully dynamic single-sou...
05/03/2019 ∙ by Kathrin Hanauer, et al. ∙ 0 ∙ share

read it
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs

One powerful technique to solve NP-hard optimization problems in practic...
10/25/2018 ∙ by Sebastian Lamm, et al. ∙ 0 ∙ share

read it
Reproducible data citations for computational research

The general purpose of a scientific publication is the exchange and spre...
08/22/2018 ∙ by Christian Schulz, et al. ∙ 0 ∙ share

read it
Scalable Edge Partitioning

Edge-centric distributed computations have appeared as a recent techniqu...
08/20/2018 ∙ by Sebastian Schlag, et al. ∙ 0 ∙ share

read it
Faster Support Vector Machines

The time complexity of support vector machines (SVMs) prohibits training...
08/20/2018 ∙ by Sebastian Schlag, et al. ∙ 4 ∙ share

read it
Shared-memory Exact Minimum Cuts

The minimum cut problem for an undirected edge-weighted graph asks us to...
08/16/2018 ∙ by Monika Henzinger, et al. ∙ 0 ∙ share

read it
A network-based citation indicator of scientific performance

Scientists are embedded in social and information networks that influenc...
07/12/2018 ∙ by Christian Schulz, et al. ∙ 0 ∙ share

read it
ILP-based Local Search for Graph Partitioning

Computing high-quality graph partitions is a challenging problem with nu...
02/20/2018 ∙ by Alexandra Henzinger, et al. ∙ 0 ∙ share

read it
Memetic Graph Clustering

It is common knowledge that there is no single best strategy for graph c...
02/20/2018 ∙ by Sonja Biedermann, et al. ∙ 0 ∙ share

read it
Communication-free Massively Distributed Graph Generation

Analyzing massive complex networks yields promising insights about our e...
10/20/2017 ∙ by Daniel Funke, et al. ∙ 0 ∙ share

read it
Evolutionary Acyclic Graph Partitioning

Directed graphs are widely used to model data flow and execution depende...
09/25/2017 ∙ by Orlando Moreira, et al. ∙ 0 ∙ share

read it
Graph Partitioning with Acyclicity Constraints

Graphs are widely used to model execution dependencies in applications. ...
04/03/2017 ∙ by Orlando Moreira, et al. ∙ 0 ∙ share

read it
Distributed Evolutionary k-way Node Separators

Computing high quality node separators in large graphs is necessary for ...
02/06/2017 ∙ by Peter Sanders, et al. ∙ 0 ∙ share

read it
Finding Near-Optimal Independent Sets at Scale

The independent set problem is NP-hard and particularly difficult to sol...
09/02/2015 ∙ by Sebastian Lamm, et al. ∙ 0 ∙ share

read it
Incorporating Road Networks into Territory Design

Given a set of basic areas, the territory design problem asks to create ...
04/29/2015 ∙ by Nitin Ahuja, et al. ∙ 0 ∙ share

read it
Graph Partitioning for Independent Sets

Computing maximum independent sets in graphs is an important problem in ...
02/05/2015 ∙ by Sebastian Lamm, et al. ∙ 0 ∙ share

read it
Proofs of two Theorems concerning Sparse Spacetime Constraints

In the SIGGRAPH 2014 paper [SvTSH14] an approach for animating deformabl...
05/08/2014 ∙ by Christian Schulz, et al. ∙ 0 ∙ share

read it
Parallel Graph Partitioning for Complex Networks

Processing large complex networks like social networks or web graphs has...
04/18/2014 ∙ by Henning Meyerhenke, et al. ∙ 0 ∙ share

read it
Think Locally, Act Globally: Perfectly Balanced Graph Partitioning

We present a novel local improvement scheme for the perfectly balanced g...
10/01/2012 ∙ by Peter Sanders, et al. ∙ 0 ∙ share

read it
Distributed Evolutionary Graph Partitioning

We present a novel distributed evolutionary algorithm, KaFFPaE, to solve...
10/03/2011 ∙ by Peter Sanders, et al. ∙ 0 ∙ share

read it

Christian Schulz

Featured Co-authors