Bernd Gärtner

Cited by

	All	Since 2019
Citations	4061	1436
h-index	28	17
i10-index	58	27

280

140

210

19951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202411 13 11 23 16 28 51 52 65 98 95 87 121 121 107 144 138 134 188 189 201 213 250 199 230 257 240 226 264 219

Public access

View all

15 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Martin JaggiEPFLVerified email at epfl.ch
Sebastian Urban StichCISPA Helmholtz CenterVerified email at cispa.de
Ahad N. ZehmakanThe Australian National UniversityVerified email at anu.edu.au
Franz AurenhammerProfessor for Theoretical Computer Science, TU Graz, AustriaVerified email at igi.tugraz.at
Hemant TyagiResearcher, Inria Lille - Nord EuropeVerified email at inria.fr
Bernhard von StengelProfessor of Mathematics, London School of EconomicsVerified email at nash.lse.ac.uk
Christian L. MüllerHelmholtz Munich; Ludwig-Maximilians-Universität München; Flatiron Institute, New YorkVerified email at helmholtz-munich.de
Ioannis EmirisAthena Research Center; and National & Kapodistrian University of AthensVerified email at di.uoa.gr
Günter M. ZieglerProfessor of Mathematics, BerlinVerified email at math.fu-berlin.de
Manuel KohlerETH ZurichVerified email at bsse.ethz.ch
Jérôme DohrauETH ZurichVerified email at inf.ethz.ch
Jan FoniokGoogle SwitzerlandVerified email at google.com
Francisco Valero-CuevasProfessor, University of Southern CaliforniaVerified email at usc.edu
Brian CohnChief Scientist, KaspectVerified email at kaspect.com
Vissarion FisikopoulosDept Informatics & Telecoms, University of Athens, GreeceVerified email at di.uoa.gr
Martin HenkTU Berlin, Institut für MathematikVerified email at math.tu-berlin.de
jozsef solymosiUniversity of British ColumbiaVerified email at math.ubc.ca
Samarjit ChakrabortyKenan Professor of Computer Science, The University of North Carolina at Chapel HillVerified email at cs.unc.edu
Antonis ThomasPhD Student, ETH ZürichVerified email at inf.ethz.ch
Anastasios KyrillidisAssociate Professor, Computer Science Department, Ken Kennedy Institute Fellow, Rice UniversityVerified email at rice.edu

Bernd Gärtner

Professor of Computer Science, ETH Zurich

Verified email at inf.ethz.ch - Homepage

theoretical computer science combinatorial algorithms discrete optimization


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Understanding and using linear programming J Matoušek, B Gärtner Springer, 2007	828	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	490	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	239	2012
Fast smallest-enclosing-ball computation in high dimensions K Fischer, B Gärtner, M Kutz European Symposium on Algorithms, 630-641, 2003	181	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	126	1995
Coresets for polytope distance B Gärtner, M Jaggi Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009	89	2009
Randomized simplex algorithms on Klee-Minty cubes B Gartner, M Henk, GM Ziegler Combinatorica 18 (3), 349-372, 1998	84*	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	80	2000
Linear programming—randomization and abstract frameworks B Gärtner, E Welzl Annual Symposium on Theoretical Aspects of Computer Science, 667-687, 1996	73	1996
The Random‐Facet simplex algorithm on combinatorial cubes B Gärtner Random Structures & Algorithms 20 (3), 353-381, 2002	70	2002
Optimization of convex functions with random pursuit SU Stich, CL Muller, B Gartner SIAM Journal on Optimization 23 (2), 1284-1309, 2013	63	2013
A simple sampling lemma: Analysis and applications in geometric optimization B Gärtner, E Welzl Discrete & Computational Geometry 25, 569-590, 2001	58	2001
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
Majority model on random regular graphs B Gärtner, AN Zehmakan LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos …, 2018	55	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	53	2008
Exact arithmetic at low cost–a case study in linear programming B Gärtner Computational Geometry 13 (2), 121-139, 1999	47	1999
Vapnik-Chervonenkis dimension and (pseudo-) hyperplane arrangements B Gärtner, E Welzl Discrete & Computational Geometry 12, 399-432, 1994	44	1994
Linear programming and unique sink orientations B Gärtner, I Schurr Symposium on Discrete Algorithms: Proceedings of the seventeenth annual ACM …, 2006	43	2006

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors