- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i10 |      | Hemant Tyagi, Bernd Gärtner: Continuum armed bandit problem of few variables in high dimensions. CoRR abs/1304.5793 (2013) |
| 2012 | ||
| j21 | | Bernd Gärtner, Martin Jaggi, Clément Maria: An Exponential Lower Bound on the Complexity of Regularization Paths. JoCG 3(1): 168-195 (2012) |
| j20 | | Bernd Gärtner, Markus Sprecher: A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem. Oper. Res. Lett. 40(6): 484-486 (2012) |
| 2011 | ||
| j19 | | Yves Brise, Bernd Gärtner: Clarkson's algorithm for violator spaces. Comput. Geom. 44(2): 70-81 (2011) |
| i9 | | Sebastian U. Stich, Christian L. Müller, Bernd Gärtner: Optimization of Convex Functions with Random Pursuit. CoRR abs/1111.0194 (2011) |
| i8 | | Bernd Gärtner, Markus Sprecher: A Polynomial-Time Algorithm for the Tridiagonal and Hessenberg P-Matrix Linear Complementarity Problem. CoRR abs/1112.0217 (2011) |
| 2010 | ||
| i7 | | Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel: Optimal Projective Algorithms for the List Update Problem. CoRR abs/1002.2440 (2010) |
| i6 | | Jan Foniok, Bernd Gärtner, Lorenz Klaus, Markus Sprecher: Counting Unique-Sink Orientations. CoRR abs/1012.1573 (2010) |
| 2009 | ||
| j18 | | Jan Foniok, Komei Fukuda, Bernd Gärtner, Hans-Jakob Lüthi: Pivoting in Linear Complementarity: Two Polynomial-Time Cases. Discrete & Computational Geometry 42(2): 187-205 (2009) |
| c25 | | Taras Galkovsky, Bernd Gärtner, Bogdan Rublev: The Domination Heuristic for LP-type Problems. ALENEX 2009: 74-84 |
| c24 | | |
| c23 | | Bernd Gärtner, Martin Jaggi: Coresets for polytope distance. Symposium on Computational Geometry 2009: 33-42 |
| i5 | | Bernd Gärtner, Joachim Giesen, Martin Jaggi: An Exponential Lower Bound on the Complexity of Regularization Paths. CoRR abs/0903.4817 (2009) |
| i4 | | Bernd Gärtner, Joachim Giesen, Martin Jaggi, Torsten Welsch: A Combinatorial Algorithm to Compute Regularization Paths. CoRR abs/0903.4856 (2009) |
| i3 | | |
| 2008 | ||
| j17 | | Bernd Gärtner, Walter D. Morris Jr., Leo Rüst: Unique Sink Orientations of Grids. Algorithmica 51(2): 200-235 (2008) |
| j16 | | Bernd Gärtner, Jirka Matousek, Leo Rüst, Petr Skovron: Violator spaces: Structure and algorithms. Discrete Applied Mathematics 156(11): 2124-2141 (2008) |
| i2 | | |
| 2007 | ||
| j15 | | |
| j14 | | Bernd Gärtner, Volker Kaibel: Two New Bounds for the Random-Edge Simplex-Algorithm. SIAM J. Discrete Math. 21(1): 178-190 (2007) |
| 2006 | ||
| c22 | | Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron: Violator Spaces: Structure and Algorithms. ESA 2006: 387-398 |
| c21 | | |
| i1 | | Bernd Gärtner, Jirka Matousek, Leo Rüst, Petr Skovron: Violator Spaces: Structure and Algorithms. CoRR abs/cs/0606087 (2006) |
| 2005 | ||
| j13 | | Stefan Felsner, Bernd Gärtner, Falk Tschirschnitz: Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines. Discrete & Computational Geometry 34(3): 411-437 (2005) |
| c20 | | |
| c19 | | |
| 2004 | ||
| j12 | | Kaspar Fischer, Bernd Gärtner: The smallest enclosing ball of balls: combinatorial structure and algorithms. Int. J. Comput. Geometry Appl. 14(4-5): 341-378 (2004) |
| 2003 | ||
| c18 | | Kaspar Fischer, Bernd Gärtner: The smallest enclosing ball of balls: combinatorial structure and algorithms. Symposium on Computational Geometry 2003: 292-301 |
| c17 | | Kaspar Fischer, Bernd Gärtner, Martin Kutz: Fast Smallest-Enclosing-Ball Computation in High Dimensions. ESA 2003: 630-641 |
| 2002 | ||
| j11 | | Bernd Gärtner: The Random-Facet simplex algorithm on combinatorial cubes. Random Struct. Algorithms 20(3): 353-381 (2002) |
| 2001 | ||
| j10 | | Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl: Enumerating triangulation paths. Comput. Geom. 20(1-2): 3-12 (2001) |
| j9 | | Bernd Gärtner, Emo Welzl: A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization. Discrete & Computational Geometry 25(4): 569-590 (2001) |
| j8 | | Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel: A new lower bound for the list update problem in the partial cost model. Theor. Comput. Sci. 268(1): 3-16 (2001) |
| c16 | | Bernd Gärtner, Emo Welzl: Explicit and Implicit Enforcing - Randomized Optimization. Computational Discrete Mathematics 2001: 25-46 |
| c15 | | |
| c14 | | Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr: One line and n points. STOC 2001: 306-315 |
| 2000 | ||
| j7 | | Bernd Gärtner, Emo Welzl: On a simple sampling lemma. Electr. Notes Theor. Comput. Sci. 31: 160-169 (2000) |
| c13 | | Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl: Enumerating Triangulation Paths. CCCG 2000 |
| c12 | | Bernd Gärtner, Emo Welzl: Random sampling in geometric optimization: new insights and applications. Symposium on Computational Geometry 2000: 91-99 |
| c11 | | Bernd Gärtner, Sven Schönherr: An efficient, exact, and generic quadratic programming solver for geometric optimization. Symposium on Computational Geometry 2000: 110-118 |
| c10 | | Bernd Gärtner: Pitfalls in computing with pseudorandom determinants. Symposium on Computational Geometry 2000: 148-155 |
| c9 | | Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner: Computing Largest Common Point Sets under Approximate Congruence. ESA 2000: 52-63 |
| c8 | | Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel: Optimal Projective Algorithms for the List Update Problem. ICALP 2000: 305-316 |
| 1999 | ||
| j6 | | Bernd Gärtner: Exact arithmetic at low cost - A case study in linear programming. Comput. Geom. 13(2): 121-139 (1999) |
| c7 | | |
| 1998 | ||
| j5 | | Bernd Gärtner, Martin Henk, Günter M. Ziegler: Randomized Simplex Algorithms on Klee-Minty Cubes. Combinatorica 18(3): 349-372 (1998) |
| j4 | | Bernd Gärtner, Sven Schönherr: Exact Primitives for Smallest Enclosing Ellipses. Inf. Process. Lett. 68(1): 33-38 (1998) |
| c6 | | |
| c5 | | Bernd Gärtner: Exact Arithmetic at Low Cost - A Case Study in Linear Programming. SODA 1998: 157-166 |
| 1997 | ||
| c4 | | Bernd Gärtner, Sven Schönherr: Exact Primitives for Smallest Enclosing Ellipses. Symposium on Computational Geometry 1997: 430-432 |
| 1996 | ||
| c3 | | Bernd Gärtner, Emo Welzl: Linear Programming - Randomization and Abstract Frameworks. STACS 1996: 669-687 |
| 1995 | ||
| j3 | | Oswin Aichholzer, Franz Aurenhammer, David Alberts, Bernd Gärtner: A Novel Type of Skeleton for Polygons. J. UCS 1(12): 752-761 (1995) |
| j2 | | Bernd Gärtner: A Subexponential Algorithm for Abstract Optimization Problems. SIAM J. Comput. 24(5): 1018-1035 (1995) |
| 1994 | ||
| j1 | | Bernd Gärtner, Emo Welzl: Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements. Discrete & Computational Geometry 12: 399-432 (1994) |
| c2 | | Bernd Gärtner, Günter M. Ziegler: Randomized Simplex Algorithms on Klee-Mintny Cubes. FOCS 1994: 502-510 |
| 1992 | ||
| c1 | | |
Colors in the list of coauthors
Last update Fri May 24 04:40:03 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page