The Computational Complexity of RIP, NSP, and Related Concepts in Compressed Sensing - Andreas M. Tillmann; Marc E. Pfetsch (CoRR, 2012)

Visualization of Astronomical Nebulae via Distributed Multi-GPU Compressed Sensing Tomography. - Stephan Wenger; Marco Ament; Stefan Guthe; Dirk A. Lorenz; Andreas M. Tillmann; Daniel Weiskopf; Marcus A. Magnor (IEEE Trans. Vis. Comput. Graph., 2012)

Projection Onto The k-Cosparse Set is NP-Hard - Andreas M. Tillmann; Rémi Gribonval; Marc E. Pfetsch (CoRR, 2013)

Projection onto the cosparse set is NP-hard. - Andreas M. Tillmann; Rémi Gribonval; Marc E. Pfetsch (ICASSP, 2014)

An infeasible-point subgradient method using adaptive approximate projections. - Dirk A. Lorenz; Marc E. Pfetsch; Andreas M. Tillmann (Comput. Optim. Appl., 2014)

The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing. - Andreas M. Tillmann; Marc E. Pfetsch (IEEE Trans. Inf. Theory, 2014)

On the Computational Intractability of Exact and Approximate Dictionary Learning. - Andreas M. Tillmann (IEEE Signal Process. Lett., 2015)

Solving Basis Pursuit: Heuristic Optimality Check and Solver Comparison. - Dirk A. Lorenz; Marc E. Pfetsch; Andreas M. Tillmann (ACM Trans. Math. Softw., 2015)

Dictionary learning from phaseless measurements. - Andreas M. Tillmann; Yonina C. Eldar; Julien Mairal (ICASSP, 2016)

A Primal-Dual Homotopy Algorithm for ℓ1-Minimization with ℓ∞-Constraints. - Christoph Brauer; Dirk A. Lorenz; Andreas M. Tillmann (CoRR, 2016)

DOLPHIn - Dictionary Learning for Phase Retrieval. - Andreas M. Tillmann; Yonina C. Eldar; Julien Mairal (IEEE Trans. Signal Process., 2016)

Joint Antenna Selection and Phase-only Beamforming using Mixed-Integer Nonlinear Programming. - Tobias Fischer 002; Ganapati Hegde; Frederic Matter; Marius Pesavento; Marc E. Pfetsch; Andreas M. Tillmann (WSA, 2018)

A primal-dual homotopy algorithm for ( ell _{1} ) -minimization with ( ell _{ infty } ) -constraints. - Christoph Brauer; Dirk A. Lorenz; Andreas M. Tillmann (Comput. Optim. Appl., 2018)

Computing the spark: mixed-integer programming for the (vector) matroid girth problem. - Andreas M. Tillmann (Comput. Optim. Appl., 2019)

Sparse recovery with integrality constraints. - Jan-Hendrik Lange; Marc E. Pfetsch; Bianca M. Seib; Andreas M. Tillmann (Discret. Appl. Math., 2020)

Exact Separation of Forbidden-Set Cuts Associated With Redundant Parity Checks of Binary Linear Codes. - Christian Puchert; Andreas M. Tillmann (IEEE Commun. Lett., 2020)

A Parallel Algorithm for Phase Retrieval with Dictionary Learning. - Tianyi Liu; Andreas M. Tillmann; Yang Yang 033; Yonina C. Eldar; Marius Pesavento (ICASSP, 2021)

Structured discrete shape approximation: Theoretical complexity and practical algorithm. - Andreas M. Tillmann; Leif Kobbelt (Comput. Geom., 2021)

Vehicle Routing with Heterogeneous Time Windows. - Petra Mutzel; Tim Niemann; Lukas Schürmann; Sebastian Stiller; Andreas M. Tillmann (OR, 2022)

Minimizing Airplane Boarding Time. - Felix J. L. Willamowski; Andreas M. Tillmann (Transp. Sci., 2022)

Extended Successive Convex Approximation for Phase Retrieval With Dictionary Learning. - Tianyi Liu; Andreas M. Tillmann; Yang Yang 033; Yonina C. Eldar; Marius Pesavento (IEEE Trans. Signal Process., 2022)

Delay-resistant robust vehicle routing with heterogeneous time windows. - Lukas Metz; Petra Mutzel; Tim Niemann; Lukas Schürmann; Sebastian Stiller; Andreas M. Tillmann (Comput. Oper. Res., 2024)

Cardinality Minimization, Constraints, and Regularization: A Survey. - Andreas M. Tillmann; Daniel Bienstock; Andrea Lodi 001; Alexandra Schwartz (SIAM Rev., 2024)