Uli Wagner

Discret. Comput. Geom., 2022

Barycentric Cuts Through a Convex Body.

[BibT_eX]

[DOI]

Zuzana Patáková

Discret. Comput. Geom., 2022

2020

Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips).

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Embeddability of Simplicial Complexes is Undecidable.

[BibT_eX]

[DOI]

Marek Filakovský

Stephan Zhechev

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

On the treewidth of triangulated 3-manifolds.

[BibT_eX]

[DOI]

Kristóf Huszár

Jonathan Spreer

J. Comput. Geom., 2019

Shellability is NP-complete.

[BibT_eX]

[DOI]

J. ACM, 2019

A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.

[BibT_eX]

[DOI]

Anna Lubiw

Zuzana Masárová

Discret. Comput. Geom., 2019

2018

Computing simplicial representatives of homotopy group elements.

[BibT_eX]

[DOI]

J. Appl. Comput. Topol., 2018

Embeddability in the 3-Sphere Is Decidable.

[BibT_eX]

[DOI]

J. ACM, 2018

2017

Finding Non-orientable Surfaces in 3-Manifolds.

[BibT_eX]

[DOI]

Benjamin A. Burton

Arnaud de Mesmay

Discret. Comput. Geom., 2017

Computing simplicial representatives of homotopy group element.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range.

[BibT_eX]

[DOI]

Isaac Mabillard

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

On Expansion and Topological Overlap.

[BibT_eX]

[DOI]

Dominic Dotterrer

Tali Kaufman

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

Eliminating Higher-Multiplicity Intersections, I. A Whitney Trick for Tverberg-Type Problems.

[BibT_eX]

[DOI]

Isaac Mabillard

CoRR, 2015

Eliminating Higher-Multiplicity Intersections, III. Codimension 2.

[BibT_eX]

[DOI]

CoRR, 2015

Bounding Helly Numbers via Betti Numbers.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

Computing All Maps into a Sphere.

[BibT_eX]

[DOI]

J. ACM, 2014

On Gromov's Method of Selecting Heavily Covered Points.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Extendability of Continuous Maps Is Undecidable.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Collection of abstracts of the Workshop on Triangulations in Geometry and Topology at CG Week 2014 in Kyoto.

[BibT_eX]

[DOI]

CoRR, 2014

On Eigenvalues of Random Complexes.

[BibT_eX]

[DOI]

Anna Gundert

CoRR, 2014

On Topological Minors in Random Simplicial Complexes.

[BibT_eX]

[DOI]

Anna Gundert

CoRR, 2014

Eliminating Tverberg Points, I. An Analogue of the Whitney Trick.

[BibT_eX]

[DOI]

Isaac Mabillard

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Absolute approximation of Tukey depth: Theory and experiments.

[BibT_eX]

[DOI]

Dan Chen

Pat Morin

Comput. Geom., 2013

Extending continuous maps: polynomiality and undecidability.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Untangling Two Systems of Noncrossing Curves.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

A Geometric Proof of the Colored Tverberg Theorem.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

On laplacians of random complexes.

[BibT_eX]

[DOI]

Anna Gundert

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

2011

Minors in random and expanding hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

k-sets and continuous motion in R3.

[BibT_eX]

[DOI]

Marek Sulovský

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

Transforming spanning trees: A lower bound.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Hardness of embedding simplicial complexes in Rd.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Hardness of embedding simplicial complexes in Rd

[BibT_eX]

[DOI]

CoRR, 2008

On Center Regions and Balls Containing Many Points.

[BibT_eX]

[DOI]

Shakhar Smorodinsky

Marek Sulovský

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

Online Conflict-Free Coloring for Intervals.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

2006

k-Sets in Four Dimensions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2006

On a Geometric Generalization of the Upper Bound Theorem.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

The Clique Problem in Intersection Graphs of Ellipses and Triangles.

[BibT_eX]

[DOI]

Christoph Ambühl

Theory Comput. Syst., 2005

Online conflict-free coloring for intervals.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

New Constructions of Weak epsilon-Nets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2004

Shape Dimension and Intrinsic Metric from Samples of Manifolds.

[BibT_eX]

[DOI]

Joachim Giesen

Discret. Comput. Geom., 2004

2003

On the rectilinear crossing number of complete graphs.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Shape dimension and intrinsic metric from samples of manifolds with high co-dimension.

[BibT_eX]

[DOI]

Joachim Giesen

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002

On the number of corner cuts.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2002

On the Clique Problem in Intersection Graphs of Ellipses.

[BibT_eX]

[DOI]

Christoph Ambühl

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

A Continuous Analogue of the Upper Bound Theorem.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

2000

Origin-embracing distributions or a continuous analogue of the upper bound theorem.

[BibT_eX]

[DOI]