| Slim graph: practical lossy graph compression for approximate graph processing, storage, and analytics M Besta, S Weber, L Gianinazzi, R Gerstenberger, A Ivanov, Y Oltchik, ... Proceedings of the International Conference for High Performance Computing …, 2019 | 32 | 2019 |
| Training Fully Connected Neural Networks is -Complete D Bertschinger, C Hertrich, P Jungeblut, T Miltzow, S Weber Advances in Neural Information Processing Systems 36, 2024 | 26 | 2024 |
| Topological Art in Simple Galleries D Bertschinger, N El Maalouly, T Miltzow, P Schnider, S Weber Symposium on Simplicity in Algorithms (SOSA), 87-116, 2022 | 8 | 2022 |
| On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem M Borzechowski, S Weber arXiv preprint arXiv:2302.14585, 2023 | 2 | 2023 |
| An FPT Algorithm for Splitting a Necklace Among Two Thieves M Borzechowski, P Schnider, S Weber arXiv preprint arXiv:2306.14508, 2023 | 1 | 2023 |
| A Universal Construction for Unique Sink Orientations M Borzechowski, J Doolittle, S Weber arXiv preprint arXiv:2211.06072, 2022 | 1 | 2022 |
| A Characterization of the Realizable Matoušek Unique Sink Orientations S Weber, B Gärtner arXiv preprint arXiv:2109.03666, 2021 | 1 | 2021 |
| Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents M Borzechowski, J Fearnley, S Gordon, R Savani, P Schnider, S Weber arXiv preprint arXiv:2402.07683, 2024 | | 2024 |
| Recognition of Unit Segment and Polyline Graphs is -Complete M Hoffmann, T Miltzow, S Weber, L Wulf arXiv preprint arXiv:2401.02172, 2024 | | 2024 |
| On Phases of Unique Sink Orientations M Borzechowski, S Weber arXiv preprint arXiv:2310.00064, 2023 | | 2023 |
| The Complexity of Recognizing Geometric Hypergraphs D Bertschinger, N El Maalouly, L Kleist, T Miltzow, S Weber International Symposium on Graph Drawing and Network Visualization, 163-179, 2023 | | 2023 |
| Realizability Makes A Difference: A Complexity Gap For Sink-Finding in USOs S Weber, J Widmer Algorithms and Data Structures Symposium, 704-718, 2023 | | 2023 |
| A Topological Version of Schaefer's Dichotomy Theorem P Schnider, S Weber arXiv preprint arXiv:2307.03446, 2023 | | 2023 |
| On Connectivity in Random Graph Models with Limited Dependencies J Lengler, A Martinsson, K Petrova, P Schnider, R Steiner, S Weber, ... arXiv preprint arXiv:2305.02974, 2023 | | 2023 |
| On the Complexity of Recognizing Nerves of Convex Sets P Schnider, S Weber arXiv preprint arXiv:2302.13276, 2023 | | 2023 |
| Reducing Nearest Neighbor Training Sets Optimally and Exactly J Rohrer, S Weber arXiv preprint arXiv:2302.02132, 2023 | | 2023 |
Tillmann MiltzowUtrecht UniversityVerified email at uu.nl
