Bernd Gärtner

	2011
53		Sebastian U. Stich, Christian L. Müller, Bernd Gärtner: Optimization of Convex Functions with Random Pursuit CoRR abs/1111.0194: (2011)
52		Bernd Gärtner, Markus Sprecher: A Polynomial-Time Algorithm for the Tridiagonal and Hessenberg P-Matrix Linear Complementarity Problem CoRR abs/1112.0217: (2011)
51		Yves Brise, Bernd Gärtner: Clarkson's algorithm for violator spaces. Comput. Geom. 44(2): 70-81 (2011)
	2010
50		Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel: Optimal Projective Algorithms for the List Update Problem CoRR abs/1002.2440: (2010)
49		Jan Foniok, Bernd Gärtner, Lorenz Klaus, Markus Sprecher: Counting Unique-Sink Orientations CoRR abs/1012.1573: (2010)
	2009
48		Taras Galkovsky, Bernd Gärtner, Bogdan Rublev: The Domination Heuristic for LP-type Problems. ALENEX 2009: 74-84
47		Yves Brise, Bernd Gärtner: Clarkson's Algorithm for Violator Spaces. CCCG 2009: 9-12
46		Bernd Gärtner, Martin Jaggi: Coresets for polytope distance. Symposium on Computational Geometry 2009: 33-42
45		Bernd Gärtner, Joachim Giesen, Martin Jaggi: An Exponential Lower Bound on the Complexity of Regularization Paths CoRR abs/0903.4817: (2009)
44		Bernd Gärtner, Joachim Giesen, Martin Jaggi, Torsten Welsch: A Combinatorial Algorithm to Compute Regularization Paths CoRR abs/0903.4856: (2009)
43		Yves Brise, Bernd Gärtner: Clarksons Algorithm for Violator Spaces CoRR abs/0906.4706: (2009)
42		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)
	2008
41		Bernd Gärtner, Walter D. Morris Jr., Leo Rüst: Unique Sink Orientations of Grids. Algorithmica 51(2): 200-235 (2008)
40		Bernd Gärtner: Ranking Unit Squares with Few Visibilities CoRR abs/0807.2178: (2008)
39		Bernd Gärtner, Jirka Matousek, Leo Rüst, Petr Skovron: Violator spaces: Structure and algorithms. Discrete Applied Mathematics 156(11): 2124-2141 (2008)
	2007
38		Bernd Gärtner, Remco C. Veltkamp: A decade of CGAL. Comput. Geom. 38(1-2): 1-3 (2007)
37		Bernd Gärtner, Volker Kaibel: Two New Bounds for the Random-Edge Simplex-Algorithm. SIAM J. Discrete Math. 21(1): 178-190 (2007)
	2006
36		Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron: Violator Spaces: Structure and Algorithms. ESA 2006: 387-398
35		Bernd Gärtner, Ingo Schurr: Linear programming and unique sink orientations. SODA 2006: 749-757
34		Bernd Gärtner, Jirka Matousek, Leo Rüst, Petr Skovron: Violator Spaces: Structure and Algorithms CoRR abs/cs/0606087: (2006)
	2005
33		Bernd Gärtner, Leo Rüst: Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems. FCT 2005: 209-220
32		Bernd Gärtner, Walter D. Morris, Leo Rüst: Unique Sink Orientations of Grids. IPCO 2005: 210-224
31		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)
	2004
30		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
29		Kaspar Fischer, Bernd Gärtner, Martin Kutz: Fast Smallest-Enclosing-Ball Computation in High Dimensions. ESA 2003: 630-641
28		Kaspar Fischer, Bernd Gärtner: The smallest enclosing ball of balls: combinatorial structure and algorithms. Symposium on Computational Geometry 2003: 292-301
	2002
27		Bernd Gärtner: The Random-Facet simplex algorithm on combinatorial cubes. Random Struct. Algorithms 20(3): 353-381 (2002)
	2001
26		Bernd Gärtner, Thomas Herrmann: Computing the width of a point set in 3-space. CCCG 2001: 101-103
25		Bernd Gärtner, Emo Welzl: Explicit and Implicit Enforcing - Randomized Optimization. Computational Discrete Mathematics 2001: 25-46
24		Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr: One line and n points. STOC 2001: 306-315
23		Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl: Enumerating triangulation paths. Comput. Geom. 20(1-2): 3-12 (2001)
22		Bernd Gärtner, Emo Welzl: A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization. Discrete & Computational Geometry 25(4): 569-590 (2001)
21		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)
	2000
20		Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl: Enumerating Triangulation Paths. CCCG 2000
19		Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner: Computing Largest Common Point Sets under Approximate Congruence. ESA 2000: 52-63
18		Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel: Optimal Projective Algorithms for the List Update Problem. ICALP 2000: 305-316
17		Bernd Gärtner, Sven Schönherr: An efficient, exact, and generic quadratic programming solver for geometric optimization. Symposium on Computational Geometry 2000: 110-118
16		Bernd Gärtner: Pitfalls in computing with pseudorandom determinants. Symposium on Computational Geometry 2000: 148-155
15		Bernd Gärtner, Emo Welzl: Random sampling in geometric optimization: new insights and applications. Symposium on Computational Geometry 2000: 91-99
14		Bernd Gärtner, Emo Welzl: On a simple sampling lemma. Electr. Notes Theor. Comput. Sci. 31: 160-169 (2000)
	1999
13		Bernd Gärtner: Fast and Robust Smallest Enclosing Balls. ESA 1999: 325-338
12		Bernd Gärtner: Exact arithmetic at low cost - A case study in linear programming. Comput. Geom. 13(2): 121-139 (1999)
	1998
11		Bernd Gärtner: Combinatorial Linear Programming: Geometry Can Help. RANDOM 1998: 82-96
10		Bernd Gärtner: Exact Arithmetic at Low Cost - A Case Study in Linear Programming. SODA 1998: 157-166
9		Bernd Gärtner, Martin Henk, Günter M. Ziegler: Randomized Simplex Algorithms on Klee-Minty Cubes. Combinatorica 18(3): 349-372 (1998)
8		Bernd Gärtner, Sven Schönherr: Exact Primitives for Smallest Enclosing Ellipses. Inf. Process. Lett. 68(1): 33-38 (1998)
	1997
7		Bernd Gärtner, Sven Schönherr: Exact Primitives for Smallest Enclosing Ellipses. Symposium on Computational Geometry 1997: 430-432
	1996
6		Bernd Gärtner, Emo Welzl: Linear Programming - Randomization and Abstract Frameworks. STACS 1996: 669-687
	1995
5		Oswin Aichholzer, Franz Aurenhammer, David Alberts, Bernd Gärtner: A Novel Type of Skeleton for Polygons. J. UCS 1(12): 752-761 (1995)
4		Bernd Gärtner: A Subexponential Algorithm for Abstract Optimization Problems. SIAM J. Comput. 24(5): 1018-1035 (1995)
	1994
3		Bernd Gärtner, Günter M. Ziegler: Randomized Simplex Algorithms on Klee-Mintny Cubes FOCS 1994: 502-510
2		Bernd Gärtner, Emo Welzl: Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements. Discrete & Computational Geometry 12: 399-432 (1994)
	1992
1		Bernd Gärtner: A Subexponential Algorithm for Abstract Optimization Problems FOCS 1992: 464-472

Coauthor Index

1	Oswin Aichholzer	[5]
2	David Alberts	[5]
3	Christoph Ambühl	[18] [19] [21] [50]
4	Franz Aurenhammer	[5]
5	Yves Brise	[43] [47] [51]
6	Samarjit Chakraborty	[19]
7	Adrian Dumitrescu	[20] [23]
8	Stefan Felsner	[31]
9	Kaspar Fischer	[28] [29] [30]
10	Jan Foniok	[42] [49]
11	Komei Fukuda	[42]
12	Taras Galkovsky	[48]
13	Joachim Giesen	[44] [45]
14	Martin Henk	[9]
15	Thomas Herrmann	[26]
16	Martin Jaggi	[44] [45] [46]
17	Volker Kaibel	[37]
18	Lorenz Klaus	[49]
19	Martin Kutz	[29]
20	Hans-Jakob Lüthi	[42]
21	Jirí Matousek	[36]
22	Jirka Matousek	[34] [39]
23	Walter D. Morris	[32]
24	Walter D. Morris Jr.	[41]
25	Christian L. Müller	[53]
26	Samuele Pedroni	[20] [23]
27	Bogdan Rublev	[48]
28	Leo Rüst	[32] [33] [34] [36] [39] [41]
29	Sven Schönherr	[7] [8] [17]
30	Ingo Schurr	[35]
31	Petr Skovron	[34] [36] [39]
32	József Solymosi	[24]
33	Markus Sprecher	[49] [52]
34	Bernhard von Stengel	[18] [21] [50]
35	Sebastian U. Stich	[53]
36	Falk Tschirschnitz	[24] [31]
37	Pavel Valtr	[24]
38	Remco C. Veltkamp	[38]
39	Torsten Welsch	[44]
40	Emo Welzl	[2] [6] [14] [15] [20] [22] [23] [24] [25]
41	Günter M. Ziegler	[3] [9]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page