引用次数
引用: 3,951
H-指数: 28
I10-指数 : 57
出版物: 153
The domination heuristic for LP-type problems
Bernd Gärtner , Taras Galkovskyi , Bogdan Rublev
algorithm engineering and experimentation 74 -84
1
2009
CGAL Reference and User Manuals
Monique Teillaud , Iddo Hanniel , Remco Veltkamp , Matthias Bäsken
CGAL Consortium
2001
Linear programming and unique sink orientations
Ingo Schurr , Bernd Gärtner
symposium on discrete algorithms 749 -757
30
2006
Optimal lower bounds for projective list update algorithms
Bernhard von Stengel , Christoph Ambühl , Bernd Gärtner
ACM Transactions on Algorithms 9 ( 4) 31
6
2013
Efficient Sampling for Learning Sparse Additive Models in High Dimensions
Hemant Tyagi , Bernd Gärtner , Andreas Krause
neural information processing systems 27 514 -522
10
2014
The Complexity of Recognizing Unique Sink Orientations
Antonis Thomas , Bernd Gärtner
symposium on theoretical aspects of computer science 341 -353
8
2015
Understanding and Using Linear Programming (Universitext)
Jirí Matouek , Bernd Gärtner
Springer-Verlag New York, Inc.
23
2006
Unique Sink Orientations of Grids
Bernd Gärtner , Walter D Morris , Leo Rüst
CTIT technical reports series 472
1
2005
Learning Sparse Additive Models with Interactions in High Dimensions
Hemant Tyagi , Bernd Gärtner , Andreas Krause , Anastasios Kyrillidis
international conference on artificial intelligence and statistics 111 -120
3
2016
Algorithms for Learning Sparse Additive Models with Interactions in High Dimensions
Hemant Tyagi , Anastasios Kyrillidis , Bernd Gärtner , Andreas Krause
Information and Inference: A Journal of the IMA 7 ( 2) 183 -249
5
2018
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Kaspar Fischer , Bernd Gärtner , Martin Kutz
european symposium on algorithms 630 -641
164
2003
Fast and Robust Smallest Enclosing Balls
Bernd Gärtner
european symposium on algorithms 325 -338
151
1999
Unique Sink Orientations of Grids
Bernd Gärtner , Walter D. Jr. Morris , Leo Rüst
Algorithmica 51 ( 2) 200 -235
32
2008
Feasibility Theory Reconciles and Informs Alternative Approaches to Neuromuscular Control.
Brian A. Cohn , May Szedlák , Bernd Gärtner , Francisco J. Valero-Cuevas
Frontiers in Computational Neuroscience 12 62
12
2018
Efficient edge-skeleton computation for polytopes defined by oracles
Ioannis Z. Emiris , Vissarion Fisikopoulos , Bernd Gärtner
Journal of Symbolic Computation 73 139 -152
4
2016
On a Simple Sampling Lemma
Bernd Gärtner , Emo Welzl
Electronic Notes in Theoretical Computer Science 31 160 -169
3
2000
A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem
Bernd Gärtner , Markus Sprecher
Operations Research Letters 40 ( 6) 484 -486
3
2012
Color War: Cellular Automata with Majority-Rule
Bernd Gärtner , Ahad N. Zehmakan
Language and Automata Theory and Applications 393 -404
19
2017
The random facet simplex algorithm on combinatorial cubes
Bernd Gärtner
Random Structures and Algorithms 20 ( 3) 353 -381
66
2002
One line and n points
Bernd Gärtner , Falk Tschirschnitz , Emo Welzl , József Solymosi
Random Structures and Algorithms 23 ( 4) 453 -471
12
2003
Martin Jaggi Sebastian Urban Stich Ahad N. Zehmakan Franz Aurenhammer Hemant Tyagi Christian L. Müller Bernhard von Stengel Ioannis Emiris Günter M. Ziegler Manuel Kohler Jérôme Dohrau Jan Foniok Vissarion Fisikopoulos jozsef solymosi Francisco Valero-Cuevas Brian Cohn Martin Henk Samarjit Chakraborty Antonis Thomas Anastasios Kyrillidis