| Publication | Date of Publication | Type |
|---|
| The crossing Tverberg theorem | 2024-10-25 | Paper |
| A Note on the Faces of the Dual Koch Arrangement | 2023-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088968 | 2022-07-18 | Paper |
| Majority rule cellular automata | 2021-10-06 | Paper |
| A Characterization of the Realizable Matou\v{s}ek Unique Sink Orientations | 2021-09-08 | Paper |
| ARRIVAL: Next Stop in CLS | 2021-07-28 | Paper |
| Random sampling with removal | 2020-10-23 | Paper |
| Threshold behavior of democratic opinion dynamics | 2020-04-07 | Paper |
| Majority model on random regular graphs | 2020-02-12 | Paper |
| Algorithms for learning sparse additive models with interactions in high dimensions* | 2019-11-07 | Paper |
| The Domination Heuristic for LP-type Problems | 2019-09-11 | Paper |
| The Crossing Tverberg Theorem | 2018-12-12 | Paper |
| Combinatorial redundancy detection | 2018-08-13 | Paper |
| Sampling with Removal in LP-type Problems | 2018-04-23 | Paper |
| The Niceness of Unique Sink Orientations | 2018-04-19 | Paper |
| ARRIVAL: A Zero-Player Graph Game in NP ∩ coNP | 2018-02-26 | Paper |
| Random Sampling with Removal. | 2018-01-30 | Paper |
| Linear programming — Randomization and abstract frameworks | 2017-11-16 | Paper |
| Coresets for polytope distance | 2017-10-20 | Paper |
| Combinatorial Redundancy Detection | 2017-10-10 | Paper |
| Random sampling in geometric optimization | 2017-09-29 | Paper |
| An efficient, exact, and generic quadratic programming solver for geometric optimization | 2017-09-29 | Paper |
| Pitfalls in computing with pseudorandom determinants | 2017-09-29 | Paper |
| The smallest enclosing ball of balls | 2017-09-29 | Paper |
| Color War: Cellular Automata with Majority-Rule | 2017-06-01 | Paper |
| Pseudo Unique Sink Orientations | 2017-04-27 | Paper |
| Sampling with removal in LP-type problems | 2017-03-30 | Paper |
| AN EXPONENTIAL LOWER BOUND ON THE COMPLEXITY OF REGULARIZATION PATHS | 2017-03-09 | Paper |
| The Complexity of Recognizing Unique Sink Orientations | 2017-01-24 | Paper |
| Exact primitives for smallest enclosing ellipses | 2016-06-09 | Paper |
| Variable metric random pursuit | 2016-04-04 | Paper |
| On two continuum armed bandit problems in high dimensions | 2016-03-21 | Paper |
| Efficient edge-skeleton computation for polytopes defined by oracles | 2015-08-24 | Paper |
| One line and ε | 2015-02-27 | Paper |
| Optimal lower bounds for projective list update algorithms | 2014-12-05 | Paper |
| Continuum Armed Bandit Problem of Few Variables in High Dimensions | 2014-09-02 | Paper |
| Counting unique-sink orientations | 2014-02-07 | Paper |
| Optimization of Convex Functions with Random Pursuit | 2013-09-25 | Paper |
| A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem | 2013-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3143860 | 2012-12-04 | Paper |
| Approximation Algorithms and Semidefinite Programming | 2011-10-26 | Paper |
| Clarkson's algorithm for violator spaces | 2011-01-31 | Paper |
| Linear programming and unique sink orientations | 2010-08-16 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Pivoting in linear complementarity: Two polynomial-time cases | 2009-07-24 | Paper |
| Violator spaces: Structure and algorithms | 2008-09-10 | Paper |
| Unique sink orientations of grids | 2008-07-01 | Paper |
| Two New Bounds for the Random‐Edge Simplex‐Algorithm | 2008-03-28 | Paper |
| Violator Spaces: Structure and Algorithms | 2008-03-11 | Paper |
| Unique Sink Orientations of Grids | 2007-08-30 | Paper |
| Understanding and using linear programming | 2006-11-28 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Grid orientations, \((d,d+2)\)-polytopes, and arrangements of pseudolines | 2005-11-10 | Paper |
| THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS | 2004-11-01 | Paper |
| One line and n points | 2004-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542175 | 2002-08-04 | Paper |
| The Random‐Facet simplex algorithm on combinatorial cubes | 2002-07-01 | Paper |
| A simple sampling lemma: Analysis and applications in geometric optimization | 2002-05-14 | Paper |
| A new lower bound for the list update problem in the partial cost model | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230371 | 2002-01-20 | Paper |
| Enumerating triangulation paths | 2002-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754153 | 2001-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753922 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247198 | 2001-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499280 | 2001-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942263 | 2000-05-11 | Paper |
| Exact arithmetic at low cost. -- A case study in linear programming | 1999-11-23 | Paper |
| Randomized simplex algorithms on Klee-Minty cubes | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250176 | 1999-08-16 | Paper |
| A Subexponential Algorithm for Abstract Optimization Problems | 1996-04-11 | Paper |
| Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements | 1994-12-01 | Paper |
