Christian Schulz
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Faster local motif clustering via maximum flows | 2025-01-06 | Paper |
| Decidability for Sturmian words Logical Methods in Computer Science | 2024-09-04 | Paper |
| Practical fully dynamic minimum cut algorithms | 2024-05-24 | Paper |
| Local motif clustering via (hyper)graph partitioning | 2024-05-24 | Paper |
| Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
| Buffered Streaming Graph Partitioning ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
| O’Reach: Even Faster Reachability in Large Graphs ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
| High-Quality Hypergraph Partitioning ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
| Decidability for Sturmian words | 2024-04-10 | Paper |
| A strong version of Cobham’s theorem Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| Deep multilevel graph partitioning | 2023-09-20 | Paper |
| O'Reach: Even Faster Reachability in Large Graphs | 2023-06-23 | Paper |
| ILP-Based Local Search for Graph Partitioning ACM Journal of Experimental Algorithmics | 2023-05-23 | Paper |
| Better Process Mapping and Sparse Quadratic Assignment ACM Journal of Experimental Algorithmics | 2023-05-23 | Paper |
| scientific article; zbMATH DE number 7651198 (Why is no real title available?) | 2023-02-07 | Paper |
| Faster fully dynamic transitive closure in practice | 2023-02-07 | Paper |
| High-quality hierarchical process mapping | 2023-02-07 | Paper |
| Undefinability of multiplication in Presburger arithmetic with sets of powers | 2022-09-23 | Paper |
| Faster support vector machines ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
| Fractal dimensions of $k$-automatic sets | 2022-05-05 | Paper |
| An MPI-based algorithm for mapping complex networks onto hierarchical architectures | 2022-03-31 | Paper |
| Multilevel Acyclic Hypergraph Partitioning 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
| Engineering Kernelization for Maximum Cut 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
| Shared-Memory Branch-and-Reduce for Multiterminal Cuts 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
| Engineering Data Reduction for Nested Dissection 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
| Fully Dynamic k-Center Clustering in Low Dimensional Metrics 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
| Fully Dynamic Single-Source Reachability in Practice: An Experimental Study 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
| Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
| scientific article; zbMATH DE number 7286677 (Why is no real title available?) | 2020-12-16 | Paper |
| Memetic graph clustering | 2020-12-16 | Paper |
| Faster Parallel Multiterminal Cuts | 2020-04-24 | Paper |
| Exactly solving the maximum weight independent set problem on large real-world graphs 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
| Faster Support Vector Machines 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
| Scalable edge partitioning 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
| \(k\)-way hypergraph partitioning via \(n\)-level recursive bisection 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| Distributed Evolutionary Graph Partitioning 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| (Semi-)External Algorithms for Graph Partitioning and Clustering 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| Practical minimum cut algorithms 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| Scalable kernelization for maximum independent sets 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| Finding near-optimal independent sets at scale 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
| Practical minimum cut algorithms ACM Journal of Experimental Algorithmics | 2019-03-27 | Paper |
| Adaptive large neighborhood search on the graphics processing unit European Journal of Operational Research | 2019-01-18 | Paper |
| Better process mapping and sparse quadratic assignment | 2018-08-13 | Paper |
| Graph partitioning with acyclicity constraints | 2018-08-13 | Paper |
| Finding near-optimal independent sets at scale Journal of Heuristics | 2017-09-08 | Paper |
| Tree-based coarsening and partitioning of complex networks ACM Journal of Experimental Algorithmics | 2017-06-16 | Paper |
| Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering Journal of Heuristics | 2017-04-28 | Paper |
| VieM v1.00 -- Vienna Mapping and Sparse Quadratic Assignment User Guide | 2017-03-16 | Paper |
| Existence of some signed magic arrays Discrete Mathematics | 2017-02-27 | Paper |
| Drawing large graphs by multilevel maxent-stress optimization Lecture Notes in Computer Science | 2017-02-10 | Paper |
| Advanced coarsening schemes for graph partitioning ACM Journal of Experimental Algorithmics | 2016-10-24 | Paper |
| Real-time nonlinear shape interpolation ACM Transactions on Graphics | 2016-04-11 | Paper |
| Scalable generation of scale-free graphs Information Processing Letters | 2016-04-06 | Paper |
| Recent Advances in Graph Partitioning | 2013-11-13 | Paper |
| High quality graph partitioning | 2013-06-25 | Paper |
| Engineering multilevel graph partitioning algorithms Algorithms – ESA 2011 | 2011-09-16 | Paper |
| Patch layout from feature graphs CAD. Computer-Aided Design | 2011-03-04 | Paper |
| Bézier clipping is quadratically convergent Computer Aided Geometric Design | 2011-02-15 | Paper |
| Computing intersections of planar spline curves using knot insertion Computer Aided Geometric Design | 2011-02-15 | Paper |
| scientific article; zbMATH DE number 1688602 (Why is no real title available?) | 2002-02-19 | Paper |
Research outcomes over time
This page was built for person: Christian Schulz
