Bernd Gärtner

PROFILE

Homepage
No homepage is listed.
ORCID
No ORCID is listed.
Affiliations
No affiliations are listed.
Aliases
No aliases are listed.
Publication record
122 papers · 3,179 citations · H-index 28

PAPERS

Realizability in Matoušek Unique Sink Orientations: Characterization and Complexity Gap
20250 citationsauthor #1
Computing Enclosing Depth
20240 citationsauthor #1
Optimizing Symbol Visibility through Displacement
20231 citationsauthor #1
A Note on the Faces of the Dual Koch Arrangement
20230 citationsauthor #1
Majority rule cellular automata
20215 citationsauthor #1
A Characterization of the Realizable Matoušek Unique Sink Orientations
20213 citationsauthor #2
A Subexponential Algorithm for ARRIVAL
202111 citationsauthor #1
Threshold Behavior of Democratic Opinion Dynamics
20200 citationsauthor #1
A New Combinatorial Property of Geometric Unique Sink Orientations
20205 citationsauthor #2
Threshold Behavior of Democratic Opinion Dynamics
202018 citationsauthor #1
Phase Transition in Democratic Opinion Dynamics
20192 citationsauthor #1
Feasibility Theory Reconciles and Informs Alternative Approaches to Neuromuscular Control
201831 citationsauthor #3
ARRIVAL: Next Stop in CLS
201821 citationsauthor #1
The Crossing Tverberg Theorem
20186 citationsauthor #2
49 LINEAR PROGRAMMING
20170 citationsauthor #2
Pseudo Unique Sink Orientations
20175 citationsauthor #2
Color War: Cellular Automata with Majority-Rule
201730 citationsauthor #1
Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada
20170 citationsauthor #20
(Biased) Majority Rule Cellular Automata
201710 citationsauthor #1
Majority Model on Random Regular Graphs
201761 citationsauthor #1
50 LINEAR PROGRAMMING
20160 citationsauthor #2
Screening Rules for Convex Problems
20160 citationsauthor #3
Learning Sparse Additive Models with Interactions in High Dimensions
201615 citationsauthor #3
Learning Sparse Additive Models with Interactions in High Dimensions: Proceedings of the 19th International Conference on Artificial Intelligence and Statistics
20161 citationsauthor #4
The Niceness of Unique Sink Orientations
20163 citationsauthor #1
The Complexity of Recognizing Unique Sink Orientations
201515 citationsauthor #1
Random Sampling with Removal
20150 citationsauthor #1
Screening Rules for Convex Problems
201526 citationsauthor #3
Combinatorial redundancy detection
201415 citationsauthor #2
Efficient edge-skeleton computation for polytopes defined by oracles
201410 citationsauthor #3
On Two Continuum Armed Bandit Problems in High Dimensions
20145 citationsauthor #3
Efficient Sampling for Learning Sparse Additive Models in High Dimensions
201411 citationsauthor #2
Sampling with Removal in LP-type Problems
20145 citationsauthor #1
Advances in Neural Information Processing Systems (NIPS)
2014316 citationsauthor #2
CGL Computational Geometric Learning Random Pursuit in Hilbert Space STREP
20130 citationsauthor #2
Stochastic continuum armed bandit problem of few linear parameters in high dimensions
20130 citationsauthor #3
CGL Computational Geometric Learning Efficient edge skeleton computation for polytopes defined by oracles STREP
20130 citationsauthor #3
CGL Computational Geometric Learning Matrix-valued Iterative Random Projections STREP
20131 citationsauthor #3
Large Shadows from Sparse Inequalities
20133 citationsauthor #1
Continuum Armed Bandit Problem of Few Variables in High Dimensions
201314 citationsauthor #2
Duality and Cone Programming
20120 citationsauthor #1
Introduction: MaxCut Via Semidefinite Programming
20120 citationsauthor #1
Variable metric random pursuit
201215 citationsauthor #3
plain bearing arrangement
20120 citationsauthor #1
Rounding Via Miniatures
20120 citationsauthor #1
Comparison of Worst-case Polytopes for the Simplex Method -- Klee-Minty Cubes Are Also Goldfarb Cubes
20120 citationsauthor #1
Approximately Solving Semidefinite Programs
20120 citationsauthor #1
Shannon Capacity and Lovász Theta
20120 citationsauthor #1
An Interior-Point Algorithm for Semidefinite Programming
20122 citationsauthor #1
Colorings with Low Discrepancy
20120 citationsauthor #1
Lower Bounds for the Goemans–Williamson MaxCut Algorithm
20120 citationsauthor #1
Maximizing a Quadratic Form on a Graph
20120 citationsauthor #1
Coloring 3-Chromatic Graphs
20120 citationsauthor #1
Constraint Satisfaction Problems, and Relaxing Them Semidefinitely
20120 citationsauthor #1
Optimization of Convex Functions with Random Pursuit
201157 citationsauthor #3
A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem
20115 citationsauthor #1
Optimal lower bounds for projective list update algorithms
20107 citationsauthor #2
Counting unique-sink orientations
201012 citationsauthor #2
Randomized Simplex Algorithms
20100 citationsauthor #1
Coresets for polytope distance
200972 citationsauthor #1
Clarkson's Algorithm for Violator Spaces
200919 citationsauthor #2
A Combinatorial Algorithm to Compute Regularization Paths
20097 citationsauthor #1
An Exponential Lower Bound on the Complexity of Regularization Paths
200938 citationsauthor #1
The Domination Heuristic for LP-type Problems
20093 citationsauthor #2
Pivoting in Linear Complementarity: Two Polynomial-Time Cases
200819 citationsauthor #3
Ranking Unit Squares with Few Visibilities
20080 citationsauthor #1
Two New Bounds for the Random-Edge Simplex-Algorithm
20073 citationsauthor #1
Integer Programming and LP Relaxation
200710 citationsauthor #2
The Simplex Method
20070 citationsauthor #2
Theory of Linear Programming: First Steps
20070 citationsauthor #2
Software and Further Reading
20070 citationsauthor #2
Not Only the Simplex Method
20071 citationsauthor #2
Duality of Linear Programming
20073 citationsauthor #2
What Is It, and What For?
20071 citationsauthor #2
Understanding and using linear programming
2007436 citationsauthor #1
A decade of CGAL
20072 citationsauthor #1
Smallest Enclosing Ball for a Point Set with Strictly Convex Level Sets
20076 citationsauthor #2
Understanding and Using Linear Programming (Universitext)
200662 citationsauthor #2
Linear programming and unique sink orientations
200639 citationsauthor #1
Computing incidences of stable manifolds of the o w complex
20060 citationsauthor #1
Violator spaces: Structure and algorithms
200647 citationsauthor #1
Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems
200535 citationsauthor #1
Grid Orientations, (d,d + 2)-Polytopes, and Arrangements of Pseudolines
20058 citationsauthor #2
Unique Sink Orientations of Grids
200543 citationsauthor #1
One line and n points
200328 citationsauthor #1
Fast Smallest-Enclosing-Ball Computation in High Dimensions
2003138 citationsauthor #2
The smallest enclosing ball of balls: combinatorial structure and algorithms
2003110 citationsauthor #2
The Random‐Facet simplex algorithm on combinatorial cubes
200252 citationsauthor #1
A new lower bound for the list update problem in the partial cost model
200115 citationsauthor #2
Explicit and Implicit Enforcing - Randomized Optimization
200112 citationsauthor #1
A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization
200148 citationsauthor #1
Enumerating Triangulation Paths
200116 citationsauthor #2
CGAL Reference and User Manuals
20010 citationsauthor #8
One line and <italic>ε</italic>
20014 citationsauthor #1
Computing the width of a point set in 3-space
20018 citationsauthor #1
Optimal Projective Algorithms for the List Update Problem
200010 citationsauthor #2
Computing Largest Common Point Sets under Approximate Congruence
200045 citationsauthor #3
ECG IST-2000-26473 Effective Computational Geometry for Curves and Surfaces ECG Technical Report No . : ECG-TR-301211-01 Prototype implementation of approximate minimum enclosing ellipsoids
20000 citationsauthor #2
An efficient, exact, and generic quadratic programming solver for geometric optimization
200062 citationsauthor #1
On a simple sampling lemma
20003 citationsauthor #1

TIMELINE

1991 1 citations

1992 103 citations

1994 101 citations

1995 417 citations

1996 64 citations

1997 62 citations

1998 33 citations

1999 231 citations

2000 140 citations

2001 103 citations

2002 52 citations

2003 276 citations

2005 86 citations

2006 148 citations

2007 462 citations

2008 19 citations

2009 139 citations

2010 19 citations

2011 62 citations

2012 17 citations

2013 18 citations

2014 362 citations

2015 41 citations

2016 19 citations

2017 106 citations

2018 58 citations

2019 2 citations

2020 23 citations

2021 19 citations

2023 1 citations

2024 0 citations

2025 0 citations

Unknown 2 citations

Bernd Gärtner

PROFILE

PAPERS

TIMELINE

COAUTHOR MAP

CONCEPT FOOTPRINT