default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernd Gärtner
Person information
- affiliation: ETH Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j32]Radoslav Fulek
, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner:
The Crossing Tverberg Theorem. Discret. Comput. Geom. 72(2): 831-848 (2024)- [c40]Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, Milos Stojakovic:
Optimizing Symbol Visibility Through Displacement. SWAT 2024: 24:1-24:16 - [i32]Bernd Gärtner, Fatime Rasiti, Patrick Schnider:
Computing Enclosing Depth. CoRR abs/2402.12371 (2024) - 2023
- [i31]Bernd Gärtner, Manuel Wettstein:
A Note on the Faces of the Dual Koch Arrangement. CoRR abs/2302.14125 (2023) - [i30]Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, Milos Stojakovic:
Optimizing Symbol Visibility through Displacement. CoRR abs/2310.01147 (2023) - 2021
- [j31]Bernd Gärtner, Ahad N. Zehmakan:
Majority rule cellular automata. Theor. Comput. Sci. 889: 41-59 (2021) - [c39]Bernd Gärtner, Sebastian Haslebacher, Hung P. Hoang:
A Subexponential Algorithm for ARRIVAL. ICALP 2021: 69:1-69:14 - [i29]Bernd Gärtner, Sebastian Haslebacher, Hung P. Hoang:
A Subexponential Algorithm for ARRIVAL. CoRR abs/2102.06427 (2021) - [i28]Simon Weber, Bernd Gärtner:
A Characterization of the Realizable Matoušek Unique Sink Orientations. CoRR abs/2109.03666 (2021) - 2020
- [j30]Kenneth L. Clarkson, Bernd Gärtner, Johannes Lengler, May Szedlák:
Random Sampling with Removal. Discret. Comput. Geom. 64(3): 700-733 (2020) - [i27]Yuan Gao, Bernd Gärtner, Jourdain B. Lamperski:
A New Combinatorial Property of Geometric Unique Sink Orientations. CoRR abs/2008.08992 (2020)
2010 – 2019
- 2019
- [c38]Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner:
The Crossing Tverberg Theorem. SoCG 2019: 38:1-38:13 - [i26]Bernd Gärtner, Ahad N. Zehmakan:
Phase Transition in Democratic Opinion Dynamics. CoRR abs/1904.13309 (2019) - 2018
- [j29]Komei Fukuda, Bernd Gärtner, May Szedlák:
Combinatorial redundancy detection. Ann. Oper. Res. 265(1): 47-65 (2018) - [j28]Brian A. Cohn, May Szedlák, Bernd Gärtner, Francisco J. Valero Cuevas:
Feasibility Theory Reconciles and Informs Alternative Approaches to Neuromuscular Control. Frontiers Comput. Neurosci. 12: 62 (2018) - [c37]Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, Veronika Slívová:
ARRIVAL: Next Stop in CLS. ICALP 2018: 60:1-60:13 - [c36]Bernd Gärtner, Ahad N. Zehmakan:
Majority Model on Random Regular Graphs. LATIN 2018: 572-583 - [i25]Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, Veronika Slívová:
ARRIVAL: Next Stop in CLS. CoRR abs/1802.07702 (2018) - [i24]Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner:
The Crossing Tverberg Theorem. CoRR abs/1812.04911 (2018) - 2017
- [c35]Bernd Gärtner, Ahad N. Zehmakan:
Color War: Cellular Automata with Majority-Rule. LATA 2017: 393-404 - [i23]Vitor Bosshard, Bernd Gärtner:
Pseudo Unique Sink Orientations. CoRR abs/1704.08481 (2017) - [i22]Bernd Gärtner, Ahad N. Zehmakan:
Majority Model on Random Regular Graphs. CoRR abs/1711.07423 (2017) - [i21]Bernd Gärtner, Ahad N. Zehmakan:
(Biased) Majority Rule Cellular Automata. CoRR abs/1711.10920 (2017) - 2016
- [j27]Ioannis Z. Emiris, Vissarion Fisikopoulos, Bernd Gärtner:
Efficient edge-skeleton computation for polytopes defined by oracles. J. Symb. Comput. 73: 139-152 (2016) - [j26]Sebastian U. Stich, Christian L. Müller, Bernd Gärtner:
Variable metric random pursuit. Math. Program. 156(1-2): 549-579 (2016) - [j25]Hemant Tyagi, Sebastian U. Stich, Bernd Gärtner:
On Two Continuum Armed Bandit Problems in High Dimensions. Theory Comput. Syst. 58(1): 191-222 (2016) - [c34]Hemant Tyagi, Anastasios Kyrillidis, Bernd Gärtner, Andreas Krause:
Learning Sparse Additive Models with Interactions in High Dimensions. AISTATS 2016: 111-120 - [c33]Bernd Gärtner, Antonis Thomas:
The Niceness of Unique Sink Orientations. APPROX-RANDOM 2016: 30:1-30:14 - [c32]Bernd Gärtner, Johannes Lengler, May Szedlák:
Random Sampling with Removal. SoCG 2016: 40:1-40:16 - [i20]Hemant Tyagi, Anastasios Kyrillidis, Bernd Gärtner, Andreas Krause:
Learning Sparse Additive Models with Interactions in High Dimensions. CoRR abs/1604.05307 (2016) - [i19]Hemant Tyagi, Anastasios Kyrillidis, Bernd Gärtner, Andreas Krause:
Algorithms for Learning Sparse Additive Models with Interactions in High Dimensions. CoRR abs/1605.00609 (2016) - [i18]Jérôme Dohrau, Bernd Gärtner, Manuel Kohler, Jirí Matousek, Emo Welzl:
A zero-player graph game in NP $\cap$ coNP. CoRR abs/1605.03546 (2016) - [i17]Bernd Gärtner, Antonis Thomas:
The Niceness of Unique Sink Orientations. CoRR abs/1606.07709 (2016) - [i16]Anant Raj, Jakob Olbrich, Bernd Gärtner, Bernhard Schölkopf, Martin Jaggi:
Screening Rules for Convex Problems. CoRR abs/1609.07478 (2016) - 2015
- [j24]Bernd Gärtner:
Sampling with removal in LP-type problems. J. Comput. Geom. 6(2): 93-112 (2015) - [c31]Komei Fukuda, Bernd Gärtner, May Szedlák:
Combinatorial Redundancy Detection. SoCG 2015: 315-328 - [c30]Bernd Gärtner, Antonis Thomas:
The Complexity of Recognizing Unique Sink Orientations. STACS 2015: 341-353 - [i15]Bernd Gärtner, Johannes Lengler, May Szedlák:
Random Sampling with Removal. CoRR abs/1512.04226 (2015) - 2014
- [j23]Jan Foniok, Bernd Gärtner, Lorenz Klaus, Markus Sprecher:
Counting unique-sink orientations. Discret. Appl. Math. 163: 155-164 (2014) - [c29]Bernd Gärtner:
Sampling with Removal in LP-type Problems. SoCG 2014: 511 - [c28]Hemant Tyagi, Bernd Gärtner, Andreas Krause:
Efficient Sampling for Learning Sparse Additive Models in High Dimensions. NIPS 2014: 514-522 - [i14]Komei Fukuda, Bernd Gärtner, May Szedlák:
Combinatorial Redundancy Detection. CoRR abs/1412.1241 (2014) - [i13]Ioannis Z. Emiris, Vissarion Fisikopoulos, Bernd Gärtner:
Efficient edge-skeleton computation for polytopes defined by oracles. CoRR abs/1412.3987 (2014) - 2013
- [j22]Sebastian U. Stich, Christian L. Müller, Bernd Gärtner:
Optimization of Convex Functions with Random Pursuit. SIAM J. Optim. 23(2): 1284-1309 (2013) - [j21]Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel:
Optimal lower bounds for projective list update algorithms. ACM Trans. Algorithms 9(4): 31:1-31:18 (2013) - [c27]Hemant Tyagi, Bernd Gärtner:
Continuum Armed Bandit Problem of Few Variables in High Dimensions. WAOA 2013: 108-119 - [i12]Hemant Tyagi, Bernd Gärtner:
Continuum armed bandit problem of few variables in high dimensions. CoRR abs/1304.5793 (2013) - [i11]Bernd Gärtner, Christian Helbling, Yoshiki Ota, Takeru Takahashi:
Large Shadows from Sparse Inequalities. CoRR abs/1308.2495 (2013) - [i10]Hemant Tyagi, Sebastian U. Stich, Bernd Gärtner:
Stochastic continuum armed bandit problem of few linear parameters in high dimensions. CoRR abs/1312.0232 (2013) - 2012
- [j20]Bernd Gärtner, Martin Jaggi, Clément Maria:
An Exponential Lower Bound on the Complexity of Regularization Paths. J. Comput. Geom. 3(1): 168-195 (2012) - [j19]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
- [j18]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)
2000 – 2009
- 2009
- [j17]Jan Foniok, Komei Fukuda, Bernd Gärtner, Hans-Jakob Lüthi:
Pivoting in Linear Complementarity: Two Polynomial-Time Cases. Discret. Comput. Geom. 42(2): 187-205 (2009) - [c26]Taras Galkovsky, Bernd Gärtner, Bogdan Rublev:
The Domination Heuristic for LP-type Problems. ALENEX 2009: 74-84 - [c25]Yves Brise, Bernd Gärtner:
Clarkson's Algorithm for Violator Spaces. CCCG 2009: 9-12 - [c24]Bernd Gärtner, Martin Jaggi:
Coresets for polytope distance. SCG 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]Yves Brise, Bernd Gärtner:
Clarksons Algorithm for Violator Spaces. CoRR abs/0906.4706 (2009) - 2008
- [j16]Bernd Gärtner, Walter D. Morris Jr., Leo Rüst:
Unique Sink Orientations of Grids. Algorithmica 51(2): 200-235 (2008) - [j15]Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron:
Violator spaces: Structure and algorithms. Discret. Appl. Math. 156(11): 2124-2141 (2008) - [i2]Bernd Gärtner:
Ranking Unit Squares with Few Visibilities. CoRR abs/0807.2178 (2008) - 2007
- [b1]Bernd Gärtner, Jirí Matousek:
Understanding and using linear programming. Universitext, Springer 2007, ISBN 978-3-540-30697-9, pp. I-VIII, 1-222 - [j14]Bernd Gärtner, Remco C. Veltkamp:
A decade of CGAL. Comput. Geom. 38(1-2): 1-3 (2007) - [j13]Bernd Gärtner, Volker Kaibel:
Two New Bounds for the Random-Edge Simplex-Algorithm. SIAM J. Discret. Math. 21(1): 178-190 (2007) - 2006
- [c23]Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron:
Violator Spaces: Structure and Algorithms. ESA 2006: 387-398 - [c22]Bernd Gärtner, Ingo Schurr:
Linear programming and unique sink orientations. SODA 2006: 749-757 - [i1]Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron:
Violator Spaces: Structure and Algorithms. CoRR abs/cs/0606087 (2006) - 2005
- [j12]Stefan Felsner, Bernd Gärtner, Falk Tschirschnitz:
Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines. Discret. Comput. Geom. 34(3): 411-437 (2005) - [c21]Bernd Gärtner, Leo Rüst:
Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems. FCT 2005: 209-220 - [c20]Bernd Gärtner, Walter D. Morris Jr., Leo Rüst:
Unique Sink Orientations of Grids. IPCO 2005: 210-224 - 2004
- [j11]Kaspar Fischer, Bernd Gärtner:
The smallest enclosing ball of balls: combinatorial structure and algorithms. Int. J. Comput. Geom. Appl. 14(4-5): 341-378 (2004) - 2003
- [c19]Kaspar Fischer, Bernd Gärtner:
The smallest enclosing ball of balls: combinatorial structure and algorithms. SCG 2003: 292-301 - [c18]Kaspar Fischer, Bernd Gärtner, Martin Kutz:
Fast Smallest-Enclosing-Ball Computation in High Dimensions. ESA 2003: 630-641 - 2002
- [j10]Bernd Gärtner:
The Random-Facet simplex algorithm on combinatorial cubes. Random Struct. Algorithms 20(3): 353-381 (2002) - 2001
- [j9]Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl:
Enumerating triangulation paths. Comput. Geom. 20(1-2): 3-12 (2001) - [j8]Bernd Gärtner, Emo Welzl:
A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization. Discret. Comput. Geom. 25(4): 569-590 (2001) - [j7]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) - [c17]Bernd Gärtner, Emo Welzl:
Explicit and Implicit Enforcing - Randomized Optimization. Computational Discrete Mathematics 2001: 25-46 - [c16]Bernd Gärtner, Thomas Herrmann:
Computing the width of a point set in 3-space. CCCG 2001: 101-103 - [c15]Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr:
One line and n points. STOC 2001: 306-315 - 2000
- [c14]Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl:
Enumerating Triangulation Paths. CCCG 2000 - [c13]Bernd Gärtner, Emo Welzl:
Random sampling in geometric optimization: new insights and applications. SCG 2000: 91-99 - [c12]Bernd Gärtner, Sven Schönherr:
An efficient, exact, and generic quadratic programming solver for geometric optimization. SCG 2000: 110-118 - [c11]Bernd Gärtner:
Pitfalls in computing with pseudorandom determinants. SCG 2000: 148-155 - [c10]Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner:
Computing Largest Common Point Sets under Approximate Congruence. ESA 2000: 52-63 - [c9]Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel:
Optimal Projective Algorithms for the List Update Problem. ICALP 2000: 305-316 - [c8]Bernd Gärtner, Emo Welzl:
On a simple sampling lemma. CATS 2000: 160-169
1990 – 1999
- 1999
- [j6]Bernd Gärtner:
Exact arithmetic at low cost - A case study in linear programming. Comput. Geom. 13(2): 121-139 (1999) - [c7]Bernd Gärtner:
Fast and Robust Smallest Enclosing Balls. ESA 1999: 325-338 - 1998
- [j5]Bernd Gärtner, Martin Henk, Günter M. Ziegler:
Randomized Simplex Algorithms on Klee-Minty Cubes. Comb. 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]Bernd Gärtner:
Combinatorial Linear Programming: Geometry Can Help. RANDOM 1998: 82-96 - [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. SCG 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. Univers. Comput. Sci. 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. Discret. Comput. Geom. 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]Bernd Gärtner:
A Subexponential Algorithm for Abstract Optimization Problems. FOCS 1992: 464-472
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
