Understanding and using linear programming J Matoušek, B Gärtner Springer, 2007 | 740 | 2007 |
A novel type of skeleton for polygons O Aichholzer, F Aurenhammer, D Alberts, B Gärtner J. UCS The Journal of Universal Computer Science: Annual Print and CD-ROM …, 1996 | 481 | 1996 |
Fast and robust smallest enclosing balls B Gärtner European symposium on algorithms, 325-338, 1999 | 283 | 1999 |
Approximation algorithms and semidefinite programming B Gärtner, J Matousek Springer Science & Business Media, 2012 | 232 | 2012 |
Fast smallest-enclosing-ball computation in high dimensions K Fischer, B Gärtner, M Kutz European Symposium on Algorithms, 630-641, 2003 | 173 | 2003 |
The smallest enclosing ball of balls: combinatorial structure and algorithms K Fischer, B Gartner Proceedings of the nineteenth annual symposium on Computational geometry …, 2003 | 140 | 2003 |
A subexponential algorithm for abstract optimization problems B Gärtner SIAM Journal on Computing 24 (5), 1018-1035, 1995 | 124 | 1995 |
Coresets for polytope distance B Gärtner, M Jaggi Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009 | 86 | 2009 |
Randomized simplex algorithms on Klee-Minty cubes B Gartner, M Henk, GM Ziegler Combinatorica 18 (3), 349-372, 1998 | 83* | 1998 |
An efficient, exact, and generic quadratic programming solver for geometric optimization B Gärtner, S Schönherr Proceedings of the sixteenth annual symposium on Computational geometry, 110-118, 2000 | 77 | 2000 |
Linear programming—randomization and abstract frameworks B Gärtner, E Welzl Annual Symposium on Theoretical Aspects of Computer Science, 667-687, 1996 | 72 | 1996 |
The Random‐Facet simplex algorithm on combinatorial cubes B Gärtner Random Structures & Algorithms 20 (3), 353-381, 2002 | 68 | 2002 |
Optimization of convex functions with random pursuit SU Stich, CL Muller, B Gartner SIAM Journal on Optimization 23 (2), 1284-1309, 2013 | 61 | 2013 |
Understanding and using linear programming (universitext) J Matouek, B Gärtner Springer-Verlag, 2006 | 60 | 2006 |
Computing largest common point sets under approximate congruence C Ambühl, S Chakraborty, B Gärtner Algorithms-ESA 2000: 8th Annual European Symposium Saarbrücken, Germany …, 2000 | 58 | 2000 |
A simple sampling lemma: Analysis and applications in geometric optimization B Gärtner, E Welzl Discrete & Computational Geometry 25, 569-590, 2001 | 57 | 2001 |
Majority model on random regular graphs B Gärtner, AN Zehmakan LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos …, 2018 | 53 | 2018 |
Violator spaces: structure and algorithms B Gärtner, J Matoušek, L Rüst, P Škovroň Discrete Applied Mathematics 156 (11), 2124-2141, 2008 | 49 | 2008 |
Exact arithmetic at low cost–a case study in linear programming B Gärtner Computational Geometry 13 (2), 121-139, 1999 | 46 | 1999 |
Vapnik-Chervonenkis dimension and (pseudo-) hyperplane arrangements B Gärtner, E Welzl Discrete & Computational Geometry 12, 399-432, 1994 | 43 | 1994 |