Christian Schulz

From MaRDI portal
Person:269739

Available identifiers

zbMath Open schulz.christianMaRDI QIDQ269739

List of research outcomes

PublicationDate of PublicationType
Buffered Streaming Graph Partitioning2024-04-14Paper
Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide2024-04-14Paper
O’Reach: Even Faster Reachability in Large Graphs2024-04-14Paper
High-Quality Hypergraph Partitioning2024-04-14Paper
https://portal.mardi4nfdi.de/entity/Q61249592024-04-10Paper
A strong version of Cobham’s theorem2023-12-08Paper
Deep multilevel graph partitioning2023-09-20Paper
O'Reach: Even Faster Reachability in Large Graphs2023-06-23Paper
ILP-Based Local Search for Graph Partitioning2023-05-23Paper
Better Process Mapping and Sparse Quadratic Assignment2023-05-23Paper
https://portal.mardi4nfdi.de/entity/Q58745302023-02-07Paper
Undefinability of multiplication in Presburger arithmetic with sets of powers2022-09-23Paper
Faster Support Vector Machines2022-09-06Paper
Fractal dimensions of $k$-automatic sets2022-05-05Paper
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures2022-03-31Paper
Engineering Kernelization for Maximum Cut2021-01-27Paper
Shared-Memory Branch-and-Reduce for Multiterminal Cuts2021-01-27Paper
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study2021-01-27Paper
Multilevel Acyclic Hypergraph Partitioning2021-01-27Paper
Engineering Data Reduction for Nested Dissection2021-01-27Paper
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations2021-01-27Paper
Fully Dynamic k-Center Clustering in Low Dimensional Metrics2021-01-27Paper
Memetic Graph Clustering2020-12-16Paper
https://portal.mardi4nfdi.de/entity/Q51407102020-12-16Paper
Faster Parallel Multiterminal Cuts2020-04-24Paper
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs2019-09-13Paper
Faster Support Vector Machines2019-09-13Paper
Scalable Edge Partitioning2019-09-13Paper
Finding near-optimal independent sets at scale2019-09-12Paper
(Semi-)External Algorithms for Graph Partitioning and Clustering2019-09-12Paper
k-way Hypergraph Partitioning via n-Level Recursive Bisection2019-09-12Paper
Practical Minimum Cut Algorithms2019-09-12Paper
Scalable Kernelization for Maximum Independent Sets2019-09-12Paper
Distributed Evolutionary Graph Partitioning2019-09-12Paper
Practical Minimum Cut Algorithms2019-03-27Paper
Adaptive large neighborhood search on the graphics processing unit2019-01-18Paper
Better Process Mapping and Sparse Quadratic Assignment.2018-08-13Paper
Graph Partitioning with Acyclicity Constraints2018-08-13Paper
Finding near-optimal independent sets at scale2017-09-08Paper
Tree-Based Coarsening and Partitioning of Complex Networks2017-06-16Paper
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering2017-04-28Paper
VieM v1.00 -- Vienna Mapping and Sparse Quadratic Assignment User Guide2017-03-16Paper
Existence of some signed magic arrays2017-02-27Paper
Drawing Large Graphs by Multilevel Maxent-Stress Optimization2017-02-10Paper
Advanced Coarsening Schemes for Graph Partitioning2016-10-24Paper
Real-Time Nonlinear Shape Interpolation2016-04-11Paper
Scalable generation of scale-free graphs2016-04-06Paper
Recent Advances in Graph Partitioning2013-11-13Paper
https://portal.mardi4nfdi.de/entity/Q52989292013-06-25Paper
Engineering Multilevel Graph Partitioning Algorithms2011-09-16Paper
Patch layout from feature graphs2011-03-04Paper
Bézier clipping is quadratically convergent2011-02-15Paper
Computing intersections of planar spline curves using knot insertion2011-02-15Paper
https://portal.mardi4nfdi.de/entity/Q27625762002-02-19Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Christian Schulz