The following pages link to Christian Schulz (Q269739):
Displaying 47 items.
- Scalable generation of scale-free graphs (Q269740) (← links)
- Existence of some signed magic arrays (Q512560) (← links)
- Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering (Q525113) (← links)
- Bézier clipping is quadratically convergent (Q625153) (← links)
- Computing intersections of planar spline curves using knot insertion (Q625188) (← links)
- Patch layout from feature graphs (Q628222) (← links)
- Adaptive large neighborhood search on the graphics processing unit (Q1711444) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- (Q2762576) (← links)
- Real-Time Nonlinear Shape Interpolation (Q2799495) (← links)
- Advanced Coarsening Schemes for Graph Partitioning (Q2828188) (← links)
- Drawing Large Graphs by Multilevel Maxent-Stress Optimization (Q2959740) (← links)
- Engineering Multilevel Graph Partitioning Algorithms (Q3092253) (← links)
- Better Process Mapping and Sparse Quadratic Assignment. (Q4580146) (← links)
- Graph Partitioning with Acyclicity Constraints (Q4580190) (← links)
- Practical Minimum Cut Algorithms (Q4629534) (← links)
- Faster Support Vector Machines (Q5102061) (← links)
- Memetic Graph Clustering (Q5140709) (← links)
- (Q5140710) (← links)
- Engineering Kernelization for Maximum Cut (Q5147491) (← links)
- Shared-Memory Branch-and-Reduce for Multiterminal Cuts (Q5147492) (← links)
- Fully Dynamic Single-Source Reachability in Practice: An Experimental Study (Q5147502) (← links)
- Multilevel Acyclic Hypergraph Partitioning (Q5147517) (← links)
- Engineering Data Reduction for Nested Dissection (Q5147532) (← links)
- Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations (Q5147534) (← links)
- Fully Dynamic <i>k</i>-Center Clustering in Low Dimensional Metrics (Q5147535) (← links)
- (Semi-)External Algorithms for Graph Partitioning and Clustering (Q5232520) (← links)
- <i>k</i>-way Hypergraph Partitioning via <i>n</i>-Level Recursive Bisection (Q5232546) (← links)
- Practical Minimum Cut Algorithms (Q5232722) (← links)
- Scalable Kernelization for Maximum Independent Sets (Q5232741) (← links)
- Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs (Q5232762) (← links)
- Faster Support Vector Machines (Q5232767) (← links)
- Scalable Edge Partitioning (Q5232768) (← links)
- Distributed Evolutionary Graph Partitioning (Q5233714) (← links)
- Tree-Based Coarsening and Partitioning of Complex Networks (Q5266614) (← links)
- (Q5298929) (← links)
- (Q5874530) (← links)
- Deep multilevel graph partitioning (Q6075939) (← links)
- (Q6124959) (← links)
- O'Reach: Even Faster Reachability in Large Graphs (Q6159900) (← links)
- High-quality hierarchical process mapping (Q6487599) (← links)
- Faster fully dynamic transitive closure in practice (Q6487607) (← links)
- Practical fully dynamic minimum cut algorithms (Q6543122) (← links)
- Local motif clustering via (hyper)graph partitioning (Q6543543) (← links)
- Decidability for Sturmian words (Q6597962) (← links)
- Faster local motif clustering via maximum flows (Q6656979) (← links)
- Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem (Q6758780) (← links)
