72 citations · 119 across the 18 of their papers we have counts for
6 papers · 1 filter
Computing Enclosing Depth
Bernd Gärtner, Fatime Rasiti, Patrick Schnider
Enclosing depth is a recently introduced depth measure which gives a lower bound to many depth measures studied in the literature. So far, enclosing depth has only been studied fro…
Optimizing Symbol Visibility through Displacement
Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy +3
In information visualization, the position of symbols often encodes associated data values. When visualizing data elements with both a numerical and a categorical dimension, positi…
A Note on the Faces of the Dual Koch Arrangement
Bernd Gärtner, Manuel Wettstein
We analyze the faces of the dual Koch arrangement, which is the arrangement of lines obtained by projective duality from the Koch chain . In particular, we show that…
Random Sampling with Removal
Kenneth L. Clarkson, Bernd Gärtner, Johannes Lengler +1
We study randomized algorithms for constrained optimization, in abstract frameworks that include, in strictly increasing generality: convex programming; LP-type problems; violator…
Efficient edge-skeleton computation for polytopes defined by oracles
Ioannis Z. Emiris, Vissarion Fisikopoulos, Bernd Gärtner
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the inpu…
Combinatorial Redundancy Detection
Komei Fukuda, Bernd Gärtner, May Szedlák
The problem of detecting and removing redundant constraints is fundamental in optimization. We focus on the case of linear programs (LPs) in dictionary form, given by equality…