Follow
Bernd Gärtner
Bernd Gärtner
Professor of Computer Science, ETH Zurich
Verified email at inf.ethz.ch - Homepage
Title
Cited by
Cited by
Year
Understanding and using linear programming
J Matoušek, B Gärtner
Springer, 2007
7212007
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
4781996
Fast and robust smallest enclosing balls
B Gärtner
European symposium on algorithms, 325-338, 1999
2801999
Approximation algorithms and semidefinite programming
B Gärtner, J Matousek
Springer Science & Business Media, 2012
2302012
Fast smallest-enclosing-ball computation in high dimensions
K Fischer, B Gärtner, M Kutz
European Symposium on Algorithms, 630-641, 2003
1722003
The smallest enclosing ball of balls: combinatorial structure and algorithms
K Fischer, B Gartner
Proceedings of the nineteenth annual symposium on Computational geometry …, 2003
1372003
A subexponential algorithm for abstract optimization problems
B Gärtner
SIAM Journal on Computing 24 (5), 1018-1035, 1995
1231995
Coresets for polytope distance
B Gärtner, M Jaggi
Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009
852009
Randomized simplex algorithms on Klee-Minty cubes
B Gartner, M Henk, GM Ziegler
Combinatorica 18 (3), 349-372, 1998
82*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
762000
Linear programming—randomization and abstract frameworks
B Gärtner, E Welzl
Annual Symposium on Theoretical Aspects of Computer Science, 667-687, 1996
721996
The Random‐Facet simplex algorithm on combinatorial cubes
B Gärtner
Random Structures & Algorithms 20 (3), 353-381, 2002
682002
Optimization of convex functions with random pursuit
SU Stich, CL Muller, B Gartner
SIAM Journal on Optimization 23 (2), 1284-1309, 2013
602013
Understanding and using linear programming (universitext)
J Matouek, B Gärtner
Springer-Verlag, 2006
582006
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
582000
A simple sampling lemma: Analysis and applications in geometric optimization
B Gärtner, E Welzl
Discrete & Computational Geometry 25, 569-590, 2001
572001
Majority model on random regular graphs
B Gärtner, AN Zehmakan
LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos …, 2018
492018
Violator spaces: structure and algorithms
B Gärtner, J Matoušek, L Rüst, P Škovroň
Discrete Applied Mathematics 156 (11), 2124-2141, 2008
482008
Exact arithmetic at low cost–a case study in linear programming
B Gärtner
Computational Geometry 13 (2), 121-139, 1999
451999
Linear programming and unique sink orientations
B Gärtner, I Schurr
Symposium on Discrete Algorithms: Proceedings of the seventeenth annual ACM …, 2006
422006
The system can't perform the operation now. Try again later.
Articles 1–20