Bernd Gärtner

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 33

Top Venues

CoRR

SoCG

ICALP

APPROX-RANDOM

Publications

Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, Milos Stojakovic
Optimizing Symbol Visibility Through Displacement. SWAT (2024)
Bernd Gärtner, Fatime Rasiti, Patrick Schnider
Computing Enclosing Depth. CoRR (2024)
Bernd Gärtner, Manuel Wettstein
A Note on the Faces of the Dual Koch Arrangement. CoRR (2023)
Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, Milos Stojakovic
Optimizing Symbol Visibility through Displacement. CoRR (2023)
Bernd Gärtner, Sebastian Haslebacher, Hung P. Hoang
A Subexponential Algorithm for ARRIVAL. ICALP (2021)
Simon Weber, Bernd Gärtner
A Characterization of the Realizable Matoušek Unique Sink Orientations. CoRR (2021)
Bernd Gärtner, Sebastian Haslebacher, Hung P. Hoang
A Subexponential Algorithm for ARRIVAL. CoRR (2021)
Bernd Gärtner, Ahad N. Zehmakan
Majority rule cellular automata. Theor. Comput. Sci. 889 (2021)
Kenneth L. Clarkson, Bernd Gärtner, Johannes Lengler, May Szedlák
Random Sampling with Removal. Discret. Comput. Geom. 64 (3) (2020)
Yuan Gao, Bernd Gärtner, Jourdain B. Lamperski
A New Combinatorial Property of Geometric Unique Sink Orientations. CoRR (2020)
Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
The Crossing Tverberg Theorem. SoCG (2019)
Bernd Gärtner, Ahad N. Zehmakan
Phase Transition in Democratic Opinion Dynamics. CoRR (2019)
Komei Fukuda, Bernd Gärtner, May Szedlák
Combinatorial redundancy detection. Ann. Oper. Res. 265 (1) (2018)
Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner
The Crossing Tverberg Theorem. CoRR (2018)
Bernd Gärtner, Ahad N. Zehmakan
Majority Model on Random Regular Graphs. LATIN (2018)
Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, Veronika Slívová
ARRIVAL: Next Stop in CLS. ICALP (2018)
Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, Veronika Slívová
ARRIVAL: Next Stop in CLS. CoRR (2018)
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 (2018)
Bernd Gärtner, Ahad N. Zehmakan
Color War: Cellular Automata with Majority-Rule. LATA (2017)
Bernd Gärtner, Ahad N. Zehmakan
Majority Model on Random Regular Graphs. CoRR (2017)
Bernd Gärtner, Ahad N. Zehmakan
(Biased) Majority Rule Cellular Automata. CoRR (2017)
Vitor Bosshard, Bernd Gärtner
Pseudo Unique Sink Orientations. CoRR (2017)
Bernd Gärtner, Antonis Thomas
The Niceness of Unique Sink Orientations. APPROX-RANDOM (2016)
Hemant Tyagi, Anastasios Kyrillidis, Bernd Gärtner, Andreas Krause
Learning Sparse Additive Models with Interactions in High Dimensions. AISTATS (2016)
Bernd Gärtner, Antonis Thomas
The Niceness of Unique Sink Orientations. CoRR (2016)
Jérôme Dohrau, Bernd Gärtner, Manuel Kohler, Jirí Matousek, Emo Welzl
A zero-player graph game in NP $\cap$ coNP. CoRR (2016)
Hemant Tyagi, Sebastian U. Stich, Bernd Gärtner
On Two Continuum Armed Bandit Problems in High Dimensions. Theory Comput. Syst. 58 (1) (2016)
Sebastian U. Stich, Christian L. Müller, Bernd Gärtner
Variable metric random pursuit. Math. Program. 156 (1-2) (2016)
Anant Raj, Jakob Olbrich, Bernd Gärtner, Bernhard Schölkopf, Martin Jaggi
Screening Rules for Convex Problems. CoRR (2016)
Ioannis Z. Emiris, Vissarion Fisikopoulos, Bernd Gärtner
Efficient edge-skeleton computation for polytopes defined by oracles. J. Symb. Comput. 73 (2016)
Bernd Gärtner, Johannes Lengler, May Szedlák
Random Sampling with Removal. SoCG (2016)
Hemant Tyagi, Anastasios Kyrillidis, Bernd Gärtner, Andreas Krause
Algorithms for Learning Sparse Additive Models with Interactions in High Dimensions. CoRR (2016)
Hemant Tyagi, Anastasios Kyrillidis, Bernd Gärtner, Andreas Krause
Learning Sparse Additive Models with Interactions in High Dimensions. CoRR (2016)
Bernd Gärtner
Sampling with removal in LP-type problems. J. Comput. Geom. 6 (2) (2015)
Bernd Gärtner, Johannes Lengler, May Szedlák
Random Sampling with Removal. CoRR (2015)
Komei Fukuda, Bernd Gärtner, May Szedlák
Combinatorial Redundancy Detection. SoCG (2015)
Bernd Gärtner, Antonis Thomas
The Complexity of Recognizing Unique Sink Orientations. STACS (2015)
Hemant Tyagi, Bernd Gärtner, Andreas Krause
Efficient Sampling for Learning Sparse Additive Models in High Dimensions. NIPS (2014)
Komei Fukuda, Bernd Gärtner, May Szedlák
Combinatorial Redundancy Detection. CoRR (2014)
Jan Foniok, Bernd Gärtner, Lorenz Klaus, Markus Sprecher
Counting unique-sink orientations. Discret. Appl. Math. 163 (2014)
Bernd Gärtner
Sampling with Removal in LP-type Problems. SoCG (2014)
Ioannis Z. Emiris, Vissarion Fisikopoulos, Bernd Gärtner
Efficient edge-skeleton computation for polytopes defined by oracles. CoRR (2014)
Bernd Gärtner, Christian Helbling, Yoshiki Ota, Takeru Takahashi
Large Shadows from Sparse Inequalities. CoRR (2013)
Hemant Tyagi, Bernd Gärtner
Continuum Armed Bandit Problem of Few Variables in High Dimensions. WAOA (2013)
Sebastian U. Stich, Christian L. Müller, Bernd Gärtner
Optimization of Convex Functions with Random Pursuit. SIAM J. Optim. 23 (2) (2013)
Hemant Tyagi, Sebastian U. Stich, Bernd Gärtner
Stochastic continuum armed bandit problem of few linear parameters in high dimensions. CoRR (2013)
Hemant Tyagi, Bernd Gärtner
Continuum armed bandit problem of few variables in high dimensions CoRR (2013)
Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
Optimal lower bounds for projective list update algorithms. ACM Trans. Algorithms 9 (4) (2013)
Bernd Gärtner, Martin Jaggi, Clément Maria
An Exponential Lower Bound on the Complexity of Regularization Paths. J. Comput. Geom. 3 (1) (2012)
Bernd Gärtner, Markus Sprecher
A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem. Oper. Res. Lett. 40 (6) (2012)
Sebastian U. Stich, Christian L. Müller, Bernd Gärtner
Optimization of Convex Functions with Random Pursuit CoRR (2011)
Bernd Gärtner, Markus Sprecher
A Polynomial-Time Algorithm for the Tridiagonal and Hessenberg P-Matrix Linear Complementarity Problem CoRR (2011)
Yves Brise, Bernd Gärtner
Clarkson's algorithm for violator spaces. Comput. Geom. 44 (2) (2011)
Jan Foniok, Bernd Gärtner, Lorenz Klaus, Markus Sprecher
Counting Unique-Sink Orientations CoRR (2010)
Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
Optimal Projective Algorithms for the List Update Problem CoRR (2010)
Bernd Gärtner, Martin Jaggi
Coresets for polytope distance. SCG (2009)
Bernd Gärtner, Joachim Giesen, Martin Jaggi, Torsten Welsch
A Combinatorial Algorithm to Compute Regularization Paths CoRR (2009)
Taras Galkovsky, Bernd Gärtner, Bogdan Rublev
The Domination Heuristic for LP-type Problems. ALENEX (2009)
Jan Foniok, Komei Fukuda, Bernd Gärtner, Hans-Jakob Lüthi
Pivoting in Linear Complementarity: Two Polynomial-Time Cases. Discret. Comput. Geom. 42 (2) (2009)
Yves Brise, Bernd Gärtner
Clarksons Algorithm for Violator Spaces CoRR (2009)
Yves Brise, Bernd Gärtner
Clarkson's Algorithm for Violator Spaces. CCCG (2009)
Bernd Gärtner, Joachim Giesen, Martin Jaggi
An Exponential Lower Bound on the Complexity of Regularization Paths CoRR (2009)
Bernd Gärtner
Ranking Unit Squares with Few Visibilities CoRR (2008)
Bernd Gärtner, Walter D. Morris Jr., Leo Rüst
Unique Sink Orientations of Grids. Algorithmica 51 (2) (2008)
Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron
Violator spaces: Structure and algorithms. Discret. Appl. Math. 156 (11) (2008)
Bernd Gärtner, Volker Kaibel
Two New Bounds for the Random-Edge Simplex-Algorithm. SIAM J. Discret. Math. 21 (1) (2007)
Bernd Gärtner, Remco C. Veltkamp
A decade of CGAL. Comput. Geom. 38 (1-2) (2007)
Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron
Violator Spaces: Structure and Algorithms CoRR (2006)
Bernd Gärtner, Ingo Schurr
Linear programming and unique sink orientations. SODA (2006)
Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron
Violator Spaces: Structure and Algorithms. ESA (2006)
Bernd Gärtner, Leo Rüst
Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems. FCT (2005)
Stefan Felsner, Bernd Gärtner, Falk Tschirschnitz
Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines. Discret. Comput. Geom. 34 (3) (2005)
Bernd Gärtner, Walter D. Morris Jr., Leo Rüst
Unique Sink Orientations of Grids. IPCO (2005)
Kaspar Fischer, Bernd Gärtner
The smallest enclosing ball of balls: combinatorial structure and algorithms. Int. J. Comput. Geom. Appl. 14 (4-5) (2004)
Kaspar Fischer, Bernd Gärtner, Martin Kutz
Fast Smallest-Enclosing-Ball Computation in High Dimensions. ESA (2003)
Kaspar Fischer, Bernd Gärtner
The smallest enclosing ball of balls: combinatorial structure and algorithms. SCG (2003)
Bernd Gärtner
The Random-Facet simplex algorithm on combinatorial cubes. Random Struct. Algorithms 20 (3) (2002)
Bernd Gärtner, Thomas Herrmann
Computing the width of a point set in 3-space. CCCG (2001)
Bernd Gärtner, Emo Welzl
Explicit and Implicit Enforcing - Randomized Optimization. Computational Discrete Mathematics (2001)
Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl
Enumerating triangulation paths. Comput. Geom. 20 (1-2) (2001)
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) (2001)
Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr
One line and n points. STOC (2001)
Bernd Gärtner, Emo Welzl
A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization. Discret. Comput. Geom. 25 (4) (2001)
Bernd Gärtner, Sven Schönherr
An efficient, exact, and generic quadratic programming solver for geometric optimization. SCG (2000)
Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
Optimal Projective Algorithms for the List Update Problem. ICALP (2000)
Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner
Computing Largest Common Point Sets under Approximate Congruence. ESA (2000)
Bernd Gärtner, Emo Welzl
On a simple sampling lemma. Electron. Notes Theor. Comput. Sci. 31 (2000)
Bernd Gärtner
Pitfalls in computing with pseudorandom determinants. SCG (2000)
Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl
Enumerating Triangulation Paths. CCCG (2000)
Bernd Gärtner, Emo Welzl
Random sampling in geometric optimization: new insights and applications. SCG (2000)
Bernd Gärtner
Fast and Robust Smallest Enclosing Balls. ESA (1999)
Bernd Gärtner
Exact arithmetic at low cost - A case study in linear programming. Comput. Geom. 13 (2) (1999)
Bernd Gärtner, Martin Henk, Günter M. Ziegler
Randomized Simplex Algorithms on Klee-Minty Cubes. Comb. 18 (3) (1998)
Bernd Gärtner, Sven Schönherr
Exact Primitives for Smallest Enclosing Ellipses. Inf. Process. Lett. 68 (1) (1998)
Bernd Gärtner
Combinatorial Linear Programming: Geometry Can Help. RANDOM (1998)
Bernd Gärtner
Exact Arithmetic at Low Cost - A Case Study in Linear Programming. SODA (1998)
Bernd Gärtner, Sven Schönherr
Exact Primitives for Smallest Enclosing Ellipses. SCG (1997)
Bernd Gärtner, Emo Welzl
Linear Programming - Randomization and Abstract Frameworks. STACS (1996)
Bernd Gärtner
A Subexponential Algorithm for Abstract Optimization Problems. SIAM J. Comput. 24 (5) (1995)
Oswin Aichholzer, Franz Aurenhammer, David Alberts, Bernd Gärtner
A Novel Type of Skeleton for Polygons. J. Univers. Comput. Sci. 1 (12) (1995)

Bernd Gärtner.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Bernd Gärtner