Bernd Gärtner

According to our database, Bernd Gärtner authored at least 78 papers between 1994 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Computing Enclosing Depth.

Bernd Gärtner, Fatime Rasiti, Patrick Schnider

CoRR, 2024

2023

Optimizing Symbol Visibility through Displacement.

Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, Milos Stojakovic

CoRR, 2023

A Note on the Faces of the Dual Koch Arrangement.

Bernd Gärtner, Manuel Wettstein

CoRR, 2023

2021

Majority rule cellular automata.

Bernd Gärtner, Ahad N. Zehmakan

Theor. Comput. Sci., 2021

A Characterization of the Realizable Matoušek Unique Sink Orientations.

Simon Weber, Bernd Gärtner

CoRR, 2021

A Subexponential Algorithm for ARRIVAL.

Bernd Gärtner, Sebastian Haslebacher, Hung P. Hoang

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Random Sampling with Removal.

Kenneth L. Clarkson, Bernd Gärtner, Johannes Lengler, May Szedlák

Discret. Comput. Geom., 2020

A New Combinatorial Property of Geometric Unique Sink Orientations.

Yuan Gao, Bernd Gärtner, Jourdain B. Lamperski

CoRR, 2020

2019

Phase Transition in Democratic Opinion Dynamics.

Bernd Gärtner, Ahad N. Zehmakan

CoRR, 2019

The Crossing Tverberg Theorem.

Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Feasibility Theory Reconciles and Informs Alternative Approaches to Neuromuscular Control.

Brian A. Cohn, May Szedlák, Bernd Gärtner, Francisco J. Valero Cuevas

Frontiers Comput. Neurosci., 2018

Combinatorial redundancy detection.

Komei Fukuda, Bernd Gärtner, May Szedlák

Ann. Oper. Res., 2018

Majority Model on Random Regular Graphs.

Bernd Gärtner, Ahad N. Zehmakan

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

ARRIVAL: Next Stop in CLS.

Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, Veronika Slívová

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

(Biased) Majority Rule Cellular Automata.

Bernd Gärtner, Ahad N. Zehmakan

CoRR, 2017

Pseudo Unique Sink Orientations.

Vitor Bosshard, Bernd Gärtner

CoRR, 2017

Color War: Cellular Automata with Majority-Rule.

Bernd Gärtner, Ahad N. Zehmakan

Proceedings of the Language and Automata Theory and Applications, 2017

2016

On Two Continuum Armed Bandit Problems in High Dimensions.

Hemant Tyagi, Sebastian U. Stich, Bernd Gärtner

Theory Comput. Syst., 2016

Variable metric random pursuit.

Sebastian U. Stich, Christian L. Müller, Bernd Gärtner

Math. Program., 2016

Efficient edge-skeleton computation for polytopes defined by oracles.

Ioannis Z. Emiris, Vissarion Fisikopoulos, Bernd Gärtner

J. Symb. Comput., 2016

Algorithms for Learning Sparse Additive Models with Interactions in High Dimensions.

Hemant Tyagi, Anastasios Kyrillidis, Bernd Gärtner, Andreas Krause

CoRR, 2016

Screening Rules for Convex Problems.

Anant Raj, Jakob Olbrich, Bernd Gärtner, Bernhard Schölkopf, Martin Jaggi

CoRR, 2016

A zero-player graph game in NP $\cap$ coNP.

Jérôme Dohrau, Bernd Gärtner, Manuel Kohler, Jirí Matousek, Emo Welzl

CoRR, 2016

Random Sampling with Removal.

Bernd Gärtner, Johannes Lengler, May Szedlák

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

The Niceness of Unique Sink Orientations.

Bernd Gärtner, Antonis Thomas

Proceedings of the Approximation, 2016

Learning Sparse Additive Models with Interactions in High Dimensions.

Hemant Tyagi, Anastasios Kyrillidis, Bernd Gärtner, Andreas Krause

Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015

Sampling with removal in LP-type problems.

Bernd Gärtner

J. Comput. Geom., 2015

The Complexity of Recognizing Unique Sink Orientations.

Bernd Gärtner, Antonis Thomas

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014

Counting unique-sink orientations.

Jan Foniok, Bernd Gärtner, Lorenz Klaus, Markus Sprecher

Discret. Appl. Math., 2014

Efficient Sampling for Learning Sparse Additive Models in High Dimensions.

Hemant Tyagi, Bernd Gärtner, Andreas Krause

Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013

Optimal lower bounds for projective list update algorithms.

Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel

ACM Trans. Algorithms, 2013

Optimization of Convex Functions with Random Pursuit.

Sebastian U. Stich, Christian L. Müller, Bernd Gärtner

SIAM J. Optim., 2013

Stochastic continuum armed bandit problem of few linear parameters in high dimensions.

Hemant Tyagi, Sebastian U. Stich, Bernd Gärtner

CoRR, 2013

Large Shadows from Sparse Inequalities.

Bernd Gärtner, Christian Helbling, Yoshiki Ota, Takeru Takahashi

CoRR, 2013

Continuum Armed Bandit Problem of Few Variables in High Dimensions.

Hemant Tyagi, Bernd Gärtner

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

2012

A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem.

Bernd Gärtner, Markus Sprecher

Oper. Res. Lett., 2012

An Exponential Lower Bound on the Complexity of Regularization Paths.

Bernd Gärtner, Martin Jaggi, Clément Maria

J. Comput. Geom., 2012

2011

Clarkson's algorithm for violator spaces.

Yves Brise, Bernd Gärtner

Comput. Geom., 2011

2009

Pivoting in Linear Complementarity: Two Polynomial-Time Cases.

Jan Foniok, Komei Fukuda, Bernd Gärtner, Hans-Jakob Lüthi

Discret. Comput. Geom., 2009

Clarksons Algorithm for Violator Spaces

Yves Brise, Bernd Gärtner

CoRR, 2009

A Combinatorial Algorithm to Compute Regularization Paths

Bernd Gärtner, Joachim Giesen, Martin Jaggi, Torsten Welsch

CoRR, 2009

An Exponential Lower Bound on the Complexity of Regularization Paths

Bernd Gärtner, Joachim Giesen, Martin Jaggi

CoRR, 2009

Coresets for polytope distance.

Bernd Gärtner, Martin Jaggi

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

The Domination Heuristic for LP-type Problems.

Taras Galkovsky, Bernd Gärtner, Bogdan Rublev

Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008

Violator spaces: Structure and algorithms.

Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron

Discret. Appl. Math., 2008

Ranking Unit Squares with Few Visibilities

Bernd Gärtner

CoRR, 2008

Unique Sink Orientations of Grids.

Bernd Gärtner, Walter D. Morris Jr., Leo Rüst

Algorithmica, 2008

2007

Two New Bounds for the Random-Edge Simplex-Algorithm.

Bernd Gärtner, Volker Kaibel

SIAM J. Discret. Math., 2007

A decade of CGAL.

Bernd Gärtner, Remco C. Veltkamp

Comput. Geom., 2007

Understanding and using linear programming.

Bernd Gärtner, Jirí Matousek

Universitext, Springer, ISBN: 978-3-540-30697-9, 2007

2006

Linear programming and unique sink orientations.

Bernd Gärtner, Ingo Schurr

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines.

Stefan Felsner, Bernd Gärtner, Falk Tschirschnitz

Discret. Comput. Geom., 2005

Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems.

Bernd Gärtner, Leo Rüst

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

The smallest enclosing ball of balls: combinatorial structure and algorithms.

Kaspar Fischer, Bernd Gärtner

Int. J. Comput. Geom. Appl., 2004

2003

Fast Smallest-Enclosing-Ball Computation in High Dimensions.

Kaspar Fischer, Bernd Gärtner, Martin Kutz

Proceedings of the Algorithms, 2003

2002

The Random-Facet simplex algorithm on combinatorial cubes.

Bernd Gärtner

Random Struct. Algorithms, 2002

2001

A new lower bound for the list update problem in the partial cost model.

Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel

Theor. Comput. Sci., 2001

A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization.

Bernd Gärtner, Emo Welzl

Discret. Comput. Geom., 2001

Enumerating triangulation paths.

Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl

Comput. Geom., 2001

One line and n points.

Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Computing the width of a point set in 3-space.

Bernd Gärtner, Thomas Herrmann

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

Explicit and Implicit Enforcing - Randomized Optimization.

Bernd Gärtner, Emo Welzl

Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001

2000

On a simple sampling lemma.

Bernd Gärtner, Emo Welzl

Proceedings of the Computing: the Australasian Theory Symposium, 2000

Optimal Projective Algorithms for the List Update Problem.

Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Computing Largest Common Point Sets under Approximate Congruence.

Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner

Proceedings of the Algorithms, 2000

Random sampling in geometric optimization: new insights and applications.

Bernd Gärtner, Emo Welzl

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

An efficient, exact, and generic quadratic programming solver for geometric optimization.

Bernd Gärtner, Sven Schönherr

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

Pitfalls in computing with pseudorandom determinants.

Bernd Gärtner

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999

Exact arithmetic at low cost - A case study in linear programming.

Bernd Gärtner

Comput. Geom., 1999

Fast and Robust Smallest Enclosing Balls.

Bernd Gärtner

Proceedings of the Algorithms, 1999

1998

Exact Primitives for Smallest Enclosing Ellipses.

Bernd Gärtner, Sven Schönherr

Inf. Process. Lett., 1998

Randomized Simplex Algorithms on Klee-Minty Cubes.

Bernd Gärtner, Martin Henk, Günter M. Ziegler

Comb., 1998

Combinatorial Linear Programming: Geometry Can Help.

Bernd Gärtner

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

1996

Linear Programming - Randomization and Abstract Frameworks.

Bernd Gärtner, Emo Welzl

Proceedings of the STACS 96, 1996

1995

A Subexponential Algorithm for Abstract Optimization Problems.

Bernd Gärtner

SIAM J. Comput., 1995

A Novel Type of Skeleton for Polygons.

Oswin Aichholzer, Franz Aurenhammer, David Alberts, Bernd Gärtner

J. Univers. Comput. Sci., 1995

1994

Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements.

Bernd Gärtner, Emo Welzl

Discret. Comput. Geom., 1994

Randomized Simplex Algorithms on Klee-Mintny Cubes

Bernd Gärtner, Günter M. Ziegler

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994