| Publication | Date of Publication | Type |
|---|
The crossing Tverberg theorem
Discrete \& Computational Geometry | 2024-10-25 | Paper |
scientific article; zbMATH DE number 7760191 (Why is no real title available?)
| 2023-11-02 | Paper |
Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).
| 2023-11-02 | Paper |
Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes
Israel Journal of Mathematics | 2023-10-12 | Paper |
Exposé Bourbaki 1187 : High-Dimensional Expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and others)
Astérisque | 2023-08-04 | Paper |
Connectivity of triangulation flip graphs in the plane
Discrete \& Computational Geometry | 2022-12-08 | Paper |
Barycentric cuts through a convex body
Discrete \& Computational Geometry | 2022-12-08 | Paper |
The crossing Tverberg theorem
| 2022-07-18 | Paper |
Eliminating higher-multiplicity intersections. III. Codimension 2
Israel Journal of Mathematics | 2022-04-25 | Paper |
Eliminating higher-multiplicity intersections. III: Codimension 2
Russian Mathematical Surveys | 2021-03-11 | Paper |
Embeddability of Simplicial Complexes is Undecidable
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
scientific article; zbMATH DE number 7236450 (Why is no real title available?)
| 2020-08-18 | Paper |
Shellability is NP-complete
| 2020-08-18 | Paper |
Connectivity of Triangulation Flip Graphs in the Plane
| 2020-03-30 | Paper |
Shellability is NP-complete
Journal of the ACM | 2020-02-11 | Paper |
On the treewidth of triangulated 3-manifolds
| 2020-01-13 | Paper |
Computing simplicial representatives of homotopy group elements
Journal of Applied and Computational Topology | 2019-09-11 | Paper |
A proof of the orbit conjecture for flipping edge-labelled triangulations
Discrete \& Computational Geometry | 2019-05-21 | Paper |
Computing all maps into a sphere
| 2019-05-10 | Paper |
scientific article; zbMATH DE number 7051255 (Why is no real title available?)
| 2019-05-06 | Paper |
The Crossing Tverberg Theorem
| 2018-12-12 | Paper |
On expansion and topological overlap
Geometriae Dedicata | 2018-08-23 | Paper |
A proof of the orbit conjecture for flipping edge-labelled triangulations
| 2018-08-13 | Paper |
Embeddability in the 3-sphere is decidable
Journal of the ACM | 2018-08-02 | Paper |
Eliminating Tverberg points. I. An analogue of the Whitney trick
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Embeddability in the 3-sphere is decidable
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Computing simplicial representatives of homotopy group elements
| 2018-03-15 | Paper |
Bounding Helly numbers via Betti numbers
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
On expansion and topological overlap
| 2018-01-30 | Paper |
Eliminating higher-multiplicity intersections. II. The deleted product criterion in the \(r\)-metastable range
| 2018-01-30 | Paper |
Finding non-orientable surfaces in 3-manifolds
| 2018-01-30 | Paper |
Finding non-orientable surfaces in 3-manifolds
Discrete \& Computational Geometry | 2018-01-11 | Paper |
On generalized Heawood inequalities for manifolds: a van Kampen-Flores-type nonembeddability result
Israel Journal of Mathematics | 2017-12-22 | Paper |
On generalized Heawood inequalities for manifolds: a van Kampen-Flores-type nonembeddability result
| 2017-10-10 | Paper |
Bounding Helly numbers via Betti numbers
| 2017-10-10 | Paper |
Shape dimension and intrinsic metric from samples of manifolds with high co-dimension (extended abstract)
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
New constructions of weak epsilon-nets
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Origin-embracing distributions or a continuous analogue of the upper bound theorem
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
On eigenvalues of random complexes
Israel Journal of Mathematics | 2017-01-11 | Paper |
Untangling two systems of noncrossing curves
Israel Journal of Mathematics | 2016-07-22 | Paper |
Mathematics at IST Austria
Internationale Mathematische Nachrichten | 2016-05-25 | Paper |
On topological minors in random simplicial complexes
Proceedings of the American Mathematical Society | 2016-03-03 | Paper |
Eliminating Higher-Multiplicity Intersections, I. A Whitney Trick for Tverberg-Type Problems
| 2015-08-10 | Paper |
Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension
SIAM Journal on Computing | 2015-02-09 | Paper |
Online conflict-free coloring for intervals
| 2014-10-13 | Paper |
On Gromov's method of selecting heavily covered points
Discrete \& Computational Geometry | 2014-09-19 | Paper |
Computing all maps into a sphere
Journal of the ACM | 2014-09-12 | Paper |
Extending continuous maps, polynomiality and undecidability
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
On Laplacians of random complexes
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Collection of abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto
| 2014-06-02 | Paper |
Extendability of continuous maps is undecidable
Discrete \& Computational Geometry | 2014-03-25 | Paper |
Minors in random and expanding hypergraphs
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Untangling two systems of noncrossing curves
Lecture Notes in Computer Science | 2013-12-20 | Paper |
Minors, embeddability, and extremal problems for hypergraphs
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
Absolute approximation of Tukey depth: theory and experiments
Computational Geometry | 2013-03-12 | Paper |
A geometric proof of the colored Tverberg theorem
Discrete \& Computational Geometry | 2012-03-01 | Paper |
Hardness of embedding simplicial complexes in \(\mathbb R^d\)
Journal of the European Mathematical Society (JEMS) | 2011-01-28 | Paper |
On the embeddability of skeleta of spheres
Israel Journal of Mathematics | 2010-01-26 | Paper |
Transforming spanning trees: A lower bound
Computational Geometry | 2009-06-30 | Paper |
\(k\)-sets and \(k\)-facets
| 2008-07-21 | Paper |
On Center Regions and Balls Containing Many Points
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Online Conflict‐Free Coloring for Intervals
SIAM Journal on Computing | 2007-10-22 | Paper |
On six problems posed by Jarik Nešetřil
| 2007-03-05 | Paper |
\(k\)-sets in four dimensions
Discrete \& Computational Geometry | 2006-03-21 | Paper |
The clique problem in intersection graphs of ellipses and triangles
Theory of Computing Systems | 2005-06-14 | Paper |
scientific article; zbMATH DE number 2145237 (Why is no real title available?)
| 2005-03-14 | Paper |
Shape dimension and intrinsic metric from samples of manifolds
Discrete \& Computational Geometry | 2005-02-11 | Paper |
New constructions of weak \(\varepsilon\)-nets
Discrete \& Computational Geometry | 2005-02-11 | Paper |
scientific article; zbMATH DE number 2079388 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 1979524 (Why is no real title available?)
| 2003-09-14 | Paper |
A continuous analogue of the upper bound theorem
Discrete \& Computational Geometry | 2003-07-22 | Paper |
On the number of corner cuts
Advances in Applied Mathematics | 2003-03-26 | Paper |
Eight-Partitioning Points in 3D, and Efficiently Too
| N/A | Paper |
