Books

B. Gärtner, J. Matoušek, Approximation Algorithms and Semidefinite Programming, Springer Verlag (2012).

Journals (with refereeing)

H. Gebauer, Disproof of the Neighborhood Conjecture with Implications to SAT, Combinatorica(2012), to appear.

H. Gebauer, On the Clique-Game, Eur. J. Comb. 33(1), (2012), 8-19.

J. Giesen, M. Jaggi, S. Laue, Approximating Parameterized Convex Optimization Problems, ACM Transactions on Algorithms (2012), to appear.

Jiří Matoušek, Martin Tancer, and Uli Wagner, A geometric proof of the colored Tverberg theorem, Discrete and Computational Geometry (2012), to appear.

A. Razen, E. Welzl, On the Number of Crossing-Free Partitions, Computational Geometry - Theory and Applications (2012), to appear.

Conference Proceedings (with selection process)

A. Bärtschi and S. Suri, Conflict-free Chromatic Art Gallery Coverage, Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS) (2012), to appear.

Martin Čadek, Marek Krčál, Jiří Matoušek, Francis Sergeraert, Lukáš Vokřínek, and Uli Wagner, Computing all maps into a sphere Proc. 23nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2012), 1-10.

J. Giesen, M. Jaggi, S. Laue, Regularization Paths with Guarantees for Convex Semidefinite Optimization, Proceedings of 15th International Conference on Artificial Intelligence and Statistics (AISTATS) (2012), to appear.

Other (including submitted work)

K. Buchin, J. Matoušek, R. Moser, D. Pálvölgyi, Vectors in a Box (2011), submitted.

B. Bukh, G. Nivasch, Upper Bounds for Centerlines (2012), submitted.

P. Cheilaris, S. Smorodinsky and M. Sulovský, The potential to improve the choice: list conflict-free coloring for geometric hypergraphs (2011), submitted.

J. Foniok, B. Gärtner, L. Klaus, M. Sprecher, Counting Unique-Sink Orientations (2011), submitted.

B. Gärtner, M. Jaggi, C. Maria, An Exponential Lower Bound on the Complexity of Regularization Paths (2011), submitted.

B. Gärtner, C. Müller and S. Stich, Optimization of Convex Functions with Random Pursuit (2011), submitted.

B. Gärtner, M. Sprecher, A Polynomial-Time Algorithm for the Tridiagonal and Hessenberg P-Matrix Linear Complementarity Problem (2011), submitted.

Y.-L. Hwong, V. Kusters, T. Willemse, Analysing the control software of the compact muon solenoid experiment at the large hadron collider (2011), submitted.

R. Moser, D. Scheder, A Full Derandomization of Schöning's Algorithm (2011), submitted.

H. Nakayamka, S. Moriyama, K. Fukuda, Realizations of oriented matroids by polynomial optimization (2011), submitted.

H. Nakayamka, S. Moriyama, K. Fukuda, Three characteristic rank-4 oriented matroids (2011), submitted.

M. Sharir, A. Sheffer, E. Welzl, Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique (2011), submitted.

U. Wagner, Minors, Embeddability, and Extremal Problems for Hypergraphs (2011), submitted.