Search results for "Bernd Gärtner"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Bernd Gärtner, Markus Sprecher	A Polynomial-Time Algorithm for the Tridiagonal and Hessenberg P-Matrix Linear Complementarity Problem	CoRR	2011	DBLP BibTeX RDF
1	Sebastian U. Stich, Christian L. Müller, Bernd Gärtner	Optimization of Convex Functions with Random Pursuit	CoRR	2011	DBLP BibTeX RDF
1	Yves Brise, Bernd Gärtner	Clarkson's algorithm for violator spaces.	Comput. Geom.	2011	DBLP DOI BibTeX RDF
1	Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel	Optimal Projective Algorithms for the List Update Problem	CoRR	2010	DBLP BibTeX RDF
1	Jan Foniok, Bernd Gärtner, Lorenz Klaus, Markus Sprecher	Counting Unique-Sink Orientations	CoRR	2010	DBLP BibTeX RDF
1	Jan Foniok, Komei Fukuda, Bernd Gärtner, Hans-Jakob Lüthi	Pivoting in Linear Complementarity: Two Polynomial-Time Cases.	Discrete & Computational Geometry	2009	DBLP DOI BibTeX RDF	Linear complementarity, Pivoting algorithm, P-matrix, K-matrix, Unique-sink orientation, Computational complexity
1	Yves Brise, Bernd Gärtner	Clarksons Algorithm for Violator Spaces	CoRR	2009	DBLP BibTeX RDF
1	Bernd Gärtner, Joachim Giesen, Martin Jaggi	An Exponential Lower Bound on the Complexity of Regularization Paths	CoRR	2009	DBLP BibTeX RDF
1	Bernd Gärtner, Joachim Giesen, Martin Jaggi, Torsten Welsch	A Combinatorial Algorithm to Compute Regularization Paths	CoRR	2009	DBLP BibTeX RDF
1	Taras Galkovsky, Bernd Gärtner, Bogdan Rublev	The Domination Heuristic for LP-type Problems.	ALENEX	2009	DBLP BibTeX RDF
1	Bernd Gärtner, Martin Jaggi	Coresets for polytope distance.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	polytope distance, support vector machines, approximation algorithms, kernel methods, sparsity, geometric optimization, coresets
1	Yves Brise, Bernd Gärtner	Clarkson's Algorithm for Violator Spaces.	CCCG	2009	DBLP BibTeX RDF
1	Bernd Gärtner, Walter D. Morris Jr., Leo Rüst	Unique Sink Orientations of Grids.	Algorithmica	2008	DBLP DOI BibTeX RDF	Unique sink orientation, Generalized linear complementarity problem, Sink finding algorithm, Holt Klee condition, Linear programming
1	Bernd Gärtner	Ranking Unit Squares with Few Visibilities	CoRR	2008	DBLP BibTeX RDF
1	Bernd Gärtner, Jirka Matousek, Leo Rüst, Petr Skovron	Violator spaces: Structure and algorithms.	Discrete Applied Mathematics	2008	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Volker Kaibel	Two New Bounds for the Random-Edge Simplex-Algorithm.	SIAM J. Discrete Math.	2007	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Remco C. Veltkamp	A decade of CGAL.	Comput. Geom.	2007	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Jirka Matousek, Leo Rüst, Petr Skovron	Violator Spaces: Structure and Algorithms	CoRR	2006	DBLP BibTeX RDF
1	Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron	Violator Spaces: Structure and Algorithms.	ESA	2006	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Ingo Schurr	Linear programming and unique sink orientations.	SODA	2006	DBLP DOI BibTeX RDF
1	Stefan Felsner, Bernd Gärtner, Falk Tschirschnitz	Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines.	Discrete & Computational Geometry	2005	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Leo Rüst	Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems.	FCT	2005	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Walter D. Morris, Leo Rüst	Unique Sink Orientations of Grids.	IPCO	2005	DBLP DOI BibTeX RDF
1	Kaspar Fischer, Bernd Gärtner	The smallest enclosing ball of balls: combinatorial structure and algorithms.	Int. J. Comput. Geometry Appl.	2004	DBLP DOI BibTeX RDF
1	Kaspar Fischer, Bernd Gärtner, Martin Kutz	Fast Smallest-Enclosing-Ball Computation in High Dimensions.	ESA	2003	DBLP DOI BibTeX RDF
1	Kaspar Fischer, Bernd Gärtner	The smallest enclosing ball of balls: combinatorial structure and algorithms.	Symposium on Computational Geometry	2003	DBLP DOI BibTeX RDF	distance to convex hull, minimal covering ball, minimum volume sphere, unique sink orientation
1	Bernd Gärtner	The Random-Facet simplex algorithm on combinatorial cubes.	Random Struct. Algorithms	2002	DBLP DOI BibTeX RDF
1	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.	2001	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Emo Welzl	A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization.	Discrete & Computational Geometry	2001	DBLP DOI BibTeX RDF
1	Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl	Enumerating triangulation paths.	Comput. Geom.	2001	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Thomas Herrmann	Computing the width of a point set in 3-space.	CCCG	2001	DBLP BibTeX RDF
1	Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr	One line and n points.	STOC	2001	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Emo Welzl	Explicit and Implicit Enforcing - Randomized Optimization.	Computational Discrete Mathematics	2001	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Emo Welzl	On a simple sampling lemma.	Electr. Notes Theor. Comput. Sci.	2000	DBLP DOI BibTeX RDF
1	Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner	Computing Largest Common Point Sets under Approximate Congruence.	ESA	2000	DBLP DOI BibTeX RDF
1	Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel	Optimal Projective Algorithms for the List Update Problem.	ICALP	2000	DBLP DOI BibTeX RDF
1	Bernd Gärtner	Pitfalls in computing with pseudorandom determinants.	Symposium on Computational Geometry	2000	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Sven Schönherr	An efficient, exact, and generic quadratic programming solver for geometric optimization.	Symposium on Computational Geometry	2000	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Emo Welzl	Random sampling in geometric optimization: new insights and applications.	Symposium on Computational Geometry	2000	DBLP DOI BibTeX RDF
1	Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl	Enumerating Triangulation Paths.	CCCG	2000	DBLP BibTeX RDF
1	Bernd Gärtner	Exact arithmetic at low cost - A case study in linear programming.	Comput. Geom.	1999	DBLP DOI BibTeX RDF
1	Bernd Gärtner	Fast and Robust Smallest Enclosing Balls.	ESA	1999	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Sven Schönherr	Exact Primitives for Smallest Enclosing Ellipses.	Inf. Process. Lett.	1998	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Martin Henk, Günter M. Ziegler	Randomized Simplex Algorithms on Klee-Minty Cubes.	Combinatorica	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 90C05, 52B12, 68Q25
1	Bernd Gärtner	Exact Arithmetic at Low Cost - A Case Study in Linear Programming.	SODA	1998	DBLP DOI BibTeX RDF
1	Bernd Gärtner	Combinatorial Linear Programming: Geometry Can Help.	RANDOM	1998	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Sven Schönherr	Exact Primitives for Smallest Enclosing Ellipses.	Symposium on Computational Geometry	1997	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Emo Welzl	Linear Programming - Randomization and Abstract Frameworks.	STACS	1996	DBLP DOI BibTeX RDF
1	Oswin Aichholzer, Franz Aurenhammer, David Alberts, Bernd Gärtner	A Novel Type of Skeleton for Polygons.	J. UCS	1995	DBLP BibTeX RDF
1	Bernd Gärtner	A Subexponential Algorithm for Abstract Optimization Problems.	SIAM J. Comput.	1995	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Emo Welzl	Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements.	Discrete & Computational Geometry	1994	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Günter M. Ziegler	Randomized Simplex Algorithms on Klee-Mintny Cubes	FOCS	1994	DBLP DOI BibTeX RDF	quadratic worst-case behavior, randomized simplex algorithms, Klee-Minty cubes, quadratic lower bounds, quadratic upper bounds, complexity, linear programs, combinatorial models
1	Bernd Gärtner	A Subexponential Algorithm for Abstract Optimization Problems	FOCS	1992	DBLP DOI BibTeX RDF	smallest ball, subexponential algorithm, abstract optimization problems, oracle calls, subexponential bound, randomized algorithm, polyhedra, minimum distance

Publications of "Bernd Gärtner" ( http://dblp.L3S.de/Authors/Bernd_Gärtner )