Bernd Gärtner

107 papers A* 12A 8B 4C 1Journal 66Unranked 15

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