Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas M. Tillmann
Person information
- affiliation: Technische Universität Braunschweig, Braunschweig, Germany
- affiliation (former): RWTH Aachen University, Visual Computing Institute, Germany
- affiliation (former): TU Darmstadt, Research Group Optimization, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j13]Felix J. L. Willamowski
, Andreas M. Tillmann:
Minimizing Airplane Boarding Time. Transp. Sci. 56(5): 1196-1218 (2022)- [j12]Tianyi Liu, Andreas M. Tillmann, Yang Yang, Yonina C. Eldar, Marius Pesavento:
Extended Successive Convex Approximation for Phase Retrieval With Dictionary Learning. IEEE Trans. Signal Process. 70: 6300-6315 (2022) - 2021
- [j11]Andreas M. Tillmann, Leif Kobbelt:
Structured discrete shape approximation: Theoretical complexity and practical algorithm. Comput. Geom. 99: 101795 (2021) - [c4]Tianyi Liu, Andreas M. Tillmann, Yang Yang, Yonina C. Eldar, Marius Pesavento:
A Parallel Algorithm for Phase Retrieval with Dictionary Learning. ICASSP 2021: 5619-5623 - [i10]Andreas M. Tillmann, Daniel Bienstock, Andrea Lodi, Alexandra Schwartz:
Cardinality Minimization, Constraints, and Regularization: A Survey. CoRR abs/2106.09606 (2021) - 2020
- [j10]Jan-Hendrik Lange, Marc E. Pfetsch, Bianca M. Seib, Andreas M. Tillmann:
Sparse recovery with integrality constraints. Discret. Appl. Math. 283: 346-366 (2020) - [j9]Christian Puchert, Andreas M. Tillmann:
Exact Separation of Forbidden-Set Cuts Associated With Redundant Parity Checks of Binary Linear Codes. IEEE Commun. Lett. 24(10): 2096-2099 (2020) - [i9]Christian Puchert, Andreas M. Tillmann:
Exact separation of forbidden-set cuts associated with redundant parity checks of binary linear codes. CoRR abs/2004.03387 (2020)
2010 – 2019
- 2019
- [j8]Andreas M. Tillmann:
Computing the spark: mixed-integer programming for the (vector) matroid girth problem. Comput. Optim. Appl. 74(2): 387-441 (2019) - [i8]Andreas M. Tillmann, Leif Kobbelt:
Structured Discrete Shape Approximation: Theoretical Complexity and Practical Algorithm. CoRR abs/1909.09217 (2019) - 2018
- [j7]Christoph Brauer, Dirk A. Lorenz, Andreas M. Tillmann:
A primal-dual homotopy algorithm for \(\ell _{1}\) -minimization with \(\ell _{\infty }\) -constraints. Comput. Optim. Appl. 70(2): 443-478 (2018) - [c3]Tobias Fischer, Ganapati Hegde, Frederic Matter, Marius Pesavento, Marc E. Pfetsch, Andreas M. Tillmann:
Joint Antenna Selection and Phase-only Beamforming using Mixed-Integer Nonlinear Programming. WSA 2018: 1-7 - [i7]Tobias Fischer, Ganapati Hegde, Frederic Matter, Marius Pesavento, Marc E. Pfetsch, Andreas M. Tillmann:
Joint Antenna Selection and Phase-Only Beamforming Using Mixed-Integer Nonlinear Programming. CoRR abs/1802.07990 (2018) - 2016
- [j6]Andreas M. Tillmann, Yonina C. Eldar, Julien Mairal:
DOLPHIn - Dictionary Learning for Phase Retrieval. IEEE Trans. Signal Process. 64(24): 6485-6500 (2016) - [c2]Andreas M. Tillmann, Yonina C. Eldar, Julien Mairal:
Dictionary learning from phaseless measurements. ICASSP 2016: 4702-4706 - [i6]Andreas M. Tillmann, Yonina C. Eldar, Julien Mairal:
DOLPHIn - Dictionary Learning for Phase Retrieval. CoRR abs/1602.02263 (2016) - [i5]Jan-Hendrik Lange, Marc E. Pfetsch, Bianca M. Seib, Andreas M. Tillmann:
Sparse Recovery With Integrality Constraints. CoRR abs/1608.08678 (2016) - [i4]Christoph Brauer, Dirk A. Lorenz, Andreas M. Tillmann:
A Primal-Dual Homotopy Algorithm for ℓ1-Minimization with ℓ∞-Constraints. CoRR abs/1610.10022 (2016) - 2015
- [j5]Andreas M. Tillmann:
On the Computational Intractability of Exact and Approximate Dictionary Learning. IEEE Signal Process. Lett. 22(1): 45-49 (2015) - [j4]Dirk A. Lorenz, Marc E. Pfetsch, Andreas M. Tillmann:
Solving Basis Pursuit: Heuristic Optimality Check and Solver Comparison. ACM Trans. Math. Softw. 41(2): 8:1-8:29 (2015) - 2014
- [j3]Dirk A. Lorenz, Marc E. Pfetsch, Andreas M. Tillmann:
An infeasible-point subgradient method using adaptive approximate projections. Comput. Optim. Appl. 57(2): 271-306 (2014) - [j2]Andreas M. Tillmann, Marc E. Pfetsch:
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing. IEEE Trans. Inf. Theory 60(2): 1248-1259 (2014) - [c1]Andreas M. Tillmann, Rémi Gribonval, Marc E. Pfetsch:
Projection onto the cosparse set is NP-hard. ICASSP 2014: 7148-7152 - [i3]Andreas M. Tillmann:
On the Computational Intractability of Exact and Approximate Dictionary Learning. CoRR abs/1405.6664 (2014) - 2013
- [i2]Andreas M. Tillmann, Rémi Gribonval, Marc E. Pfetsch:
Projection Onto The k-Cosparse Set is NP-Hard. CoRR abs/1303.5305 (2013) - 2012
- [j1]Stephan Wenger, Marco Ament, Stefan Guthe, Dirk A. Lorenz, Andreas M. Tillmann, Daniel Weiskopf, Marcus A. Magnor:
Visualization of Astronomical Nebulae via Distributed Multi-GPU Compressed Sensing Tomography. IEEE Trans. Vis. Comput. Graph. 18(12): 2188-2197 (2012) - [i1]Andreas M. Tillmann, Marc E. Pfetsch:
The Computational Complexity of RIP, NSP, and Related Concepts in Compressed Sensing. CoRR abs/1205.2081 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-11-13 23:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
