Peter Gritzmann

Efficient subspace approximation algorithms

Sparse Subspace Clustering: Algorithm, Theory, and Applications

Robust Recovery of Subspace Structures by Low-Rank Representation

The First Optimized Railway Timetable in Practice

Optimizing urban rail timetable under time-dependent demand and oversaturated conditions

Train scheduling for minimizing passenger waiting time with time-dependent demand and skip-stop patterns: Nonlinear integer programming models with linear constraints

Personnel scheduling: A literature review

Automation of the CHARMM General Force Field (CGenFF) I: Bond Perception and Atom Typing

Joint client scheduling and resource allocation under channel uncertainty in federated learning

Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions

Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse Regression-Based Approaches

Largest j-simplices in d-cubes: Some relatives of the hadamard maximum determinant problem

Edge Artificial Intelligence for 6G: Vision, Enabling Technologies, and Applications

Lectures on 0/1-Polytopes

Algebraic Methods for Computing Smallest Enclosing and Circumscribing Cylinders of Simplices

Counterexamples in Chemical Ring Perception

A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing

Solving problems of discrete tomography

Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

Mathematics – Key Technology for the Future

A geometric analysis of subspace clustering with outliers

Smallest singular value of random matrices and geometry of random polytopes

Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spaces

Inner and outerj-radii of convex bodies in finite-dimensional normed spaces

Deciding uniqueness in norm maximization

Largestj-simplices inn-polytopes

Isoradial Bodies

Computational complexity of norm-maximization

Deterministic and randomized polynomial‐time approximation of radii

On the computational complexity of determining polyatomic structures by X-rays

Minimum Cycle Bases for Network Graphs

On the complexity of some basic problems in computational convexity: I. Containment problems