×

Found 27 Documents (Results 1–27)

Adding one edge to planar graphs makes crossing number hard. (English) Zbl 1284.05070

Proceedings of the 26th annual symposium on computational geometry, SoCG 2010, Snowbird, UT, USA, June 13–16, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0016-2). 68-76 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Numerical methods for sparse recovery. (English) Zbl 1208.65089

Fornasier, Massimo (ed.), Theoretical foundations and numerical methods for sparse recovery. Papers based on the presentations of the summer school “Theoretical foundations and numerical methods for sparse recovery”, Vienna, Austria, August 31 – September 4, 2009. Berlin: Walter de Gruyter (ISBN 978-3-11-022614-0/hbk; 978-3-11-022615-7/ebook). Radon Series on Computational and Applied Mathematics 9, 93-200 (2010).
MSC:  65K10 90C25 52A41 49M30 49J27 49M27
PDFBibTeX XMLCite

Maximizing non-linear concave functions in fixed dimension. (English) Zbl 0917.52005

33rd annual symposium on Foundations of computer science (FOCS). Proceedings, Pittsburgh, PA, USA, October 24–27, 1992. Washington, DC: IEEE Computer Society Press, 676-685 (1992).
MSC:  52A20 68Q25 52A41
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software