| Publication | Date of Publication | Type |
|---|
The crossing Tverberg theorem
Discrete & Computational Geometry | 2024-10-25 | Paper |
| A Note on the Faces of the Dual Koch Arrangement | 2023-02-27 | Paper |
The crossing Tverberg theorem
(available as arXiv preprint) | 2022-07-18 | Paper |
Majority rule cellular automata
Theoretical Computer Science | 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
(available as arXiv preprint) | 2021-07-28 | Paper |
Random sampling with removal
Discrete & Computational Geometry | 2020-10-23 | Paper |
Threshold behavior of democratic opinion dynamics
Journal of Statistical Physics | 2020-04-07 | Paper |
Majority model on random regular graphs
(available as arXiv preprint) | 2020-02-12 | Paper |
Algorithms for learning sparse additive models with interactions in high dimensions
Information and Inference: A Journal of the IMA | 2019-11-07 | Paper |
The domination heuristic for LP-type problems
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
The Crossing Tverberg Theorem
(available as arXiv preprint) | 2018-12-12 | Paper |
Combinatorial redundancy detection
Annals of Operations Research | 2018-08-13 | Paper |
Sampling with removal in LP-type problems
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
The niceness of unique sink orientations
(available as arXiv preprint) | 2018-04-19 | Paper |
ARRIVAL: a zero-player graph game in \(\text{NP}\cap \text{coNP}\)
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
| Random sampling with removal | 2018-01-30 | Paper |
Linear programming — Randomization and abstract frameworks
STACS 96 | 2017-11-16 | Paper |
Coresets for polytope distance
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Combinatorial redundancy detection
(available as arXiv preprint) | 2017-10-10 | Paper |
An efficient, exact, and generic quadratic programming solver for geometric optimization
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
The smallest enclosing ball of balls: combinatorial structure and algorithms
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Random sampling in geometric optimization
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Pitfalls in computing with pseudorandom determinants
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Color War: Cellular Automata with Majority-Rule
Language and Automata Theory and Applications | 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
(available as arXiv preprint) | 2017-03-09 | Paper |
| The complexity of recognizing unique sink orientations | 2017-01-24 | Paper |
Exact primitives for smallest enclosing ellipses
Information Processing Letters | 2016-06-09 | Paper |
Variable metric random pursuit
Mathematical Programming. Series A. Series B | 2016-04-04 | Paper |
On two continuum armed bandit problems in high dimensions
Theory of Computing Systems | 2016-03-21 | Paper |
Efficient edge-skeleton computation for polytopes defined by oracles
Journal of Symbolic Computation | 2015-08-24 | Paper |
One line and \(n\) points
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Optimal lower bounds for projective list update algorithms
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Continuum armed bandit problem of few variables in high dimensions
Approximation and Online Algorithms | 2014-09-02 | Paper |
Counting unique-sink orientations
Discrete Applied Mathematics | 2014-02-07 | Paper |
Optimization of convex functions with random pursuit
SIAM Journal on Optimization | 2013-09-25 | Paper |
A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem
Operations Research Letters | 2013-03-05 | Paper |
| scientific article; zbMATH DE number 6112623 (Why is no real title available?) | 2012-12-04 | Paper |
| Approximation algorithms and semidefinite programming. | 2011-10-26 | Paper |
Clarkson's algorithm for violator spaces
Computational Geometry | 2011-01-31 | Paper |
Linear programming and unique sink orientations
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Algorithms - ESA 2003
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Pivoting in linear complementarity: Two polynomial-time cases
Discrete & Computational Geometry | 2009-07-24 | Paper |
Violator spaces: Structure and algorithms
Discrete Applied Mathematics | 2008-09-10 | Paper |
Unique sink orientations of grids
Algorithmica | 2008-07-01 | Paper |
Two New Bounds for the Random‐Edge Simplex‐Algorithm
SIAM Journal on Discrete Mathematics | 2008-03-28 | Paper |
Violator Spaces: Structure and Algorithms
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Unique Sink Orientations of Grids
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Understanding and using linear programming
Universitext | 2006-11-28 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Grid orientations, \((d,d+2)\)-polytopes, and arrangements of pseudolines
Discrete & Computational Geometry | 2005-11-10 | Paper |
THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
International Journal of Computational Geometry & Applications | 2004-11-01 | Paper |
One line and n points
Random Structures & Algorithms | 2004-02-03 | Paper |
| scientific article; zbMATH DE number 1775049 (Why is no real title available?) | 2002-08-04 | Paper |
The Random‐Facet simplex algorithm on combinatorial cubes
Random Structures & Algorithms | 2002-07-01 | Paper |
A simple sampling lemma: Analysis and applications in geometric optimization
Discrete & Computational Geometry | 2002-05-14 | Paper |
A new lower bound for the list update problem in the partial cost model
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1256684 (Why is no real title available?) | 2002-01-20 | Paper |
Enumerating triangulation paths
Computational Geometry | 2002-01-14 | Paper |
| scientific article; zbMATH DE number 1670833 (Why is no real title available?) | 2001-12-09 | Paper |
| scientific article; zbMATH DE number 1670646 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1301965 (Why is no real title available?) | 2001-08-29 | Paper |
| scientific article; zbMATH DE number 1497850 (Why is no real title available?) | 2001-03-05 | Paper |
| scientific article; zbMATH DE number 1419244 (Why is no real title available?) | 2000-05-11 | Paper |
Exact arithmetic at low cost. -- A case study in linear programming
Computational Geometry | 1999-11-23 | Paper |
Randomized simplex algorithms on Klee-Minty cubes
Combinatorica | 1999-10-31 | Paper |
| scientific article; zbMATH DE number 1303552 (Why is no real title available?) | 1999-08-16 | Paper |
A Subexponential Algorithm for Abstract Optimization Problems
SIAM Journal on Computing | 1996-04-11 | Paper |
Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
Discrete & Computational Geometry | 1994-12-01 | Paper |
