Martin Tancer

Discret. Comput. Geom., April, 2024

2023

Weak Saturation of Multipartite Hypergraphs.

[BibT_eX]

[DOI]

Denys Bulavka

Mykhaylo Tyomkyn

Comb., December, 2023

NP-Hardness of Computing PL Geometric Category in Dimension 2.

[BibT_eX]

[DOI]

Michael Skotnica

SIAM J. Discret. Math., September, 2023

Simpler algorithmically unrecognizable 4-manifolds.

[BibT_eX]

[DOI]

CoRR, 2023

Shellability Is Hard Even for Balls.

[BibT_eX]

[DOI]

Pavel Paták

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

Even Maps, the Colin de Verdière Number and Representations of Graphs.

[BibT_eX]

[DOI]

Vojtech Kaluza

Comb., December, 2022

Barycentric Cuts Through a Convex Body.

[BibT_eX]

[DOI]

Zuzana Patáková

Discret. Comput. Geom., 2022

Parameterized Complexity of Untangling Knots.

[BibT_eX]

[DOI]

Clément Legrand-Duchesne

Ashutosh Rai

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Shellings and Sheddings Induced by Collapses.

[BibT_eX]

[DOI]

Thomas Magnard

Michael Skotnica

SIAM J. Discret. Math., 2021

Optimal Bounds for the Colorful Fractional Helly Theorem.

[BibT_eX]

[DOI]

Denys Bulavka

Afshin Goodarzi

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

On the growth of the Möbius function of permutations.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2020

Embeddability in R3 is NP-hard.

[BibT_eX]

[DOI]

J. ACM, 2020

2019

Shellability is NP-complete.

[BibT_eX]

[DOI]

J. ACM, 2019

Hardness of almost embedding simplicial complexes in Rd.

[BibT_eX]

[DOI]

Arkadiy Skopenkov

Discret. Comput. Geom., 2019

The Unbearable Hardness of Unknotting.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Embeddability in the 3-Sphere Is Decidable.

[BibT_eX]

[DOI]

J. ACM, 2018

Pach's Selection Theorem Does Not Admit a Topological Extension.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2018

2017

A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane.

[BibT_eX]

[DOI]

Éric Colin de Verdière

J. Graph Algorithms Appl., 2017

Shortest Path Embeddings of Graphs on Surfaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

2016

Recognition of Collapsible Complexes is NP-Complete.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2016

2015

Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Simplifying Inclusion-Exclusion Formulas.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 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

Non-Embeddability of Geometric Lattices and Buildings.

[BibT_eX]

[DOI]

Kathrin Vorwerk

Discret. Comput. Geom., 2014

2013

Nerves of Good Covers Are Algorithmically Unrecognizable.

[BibT_eX]

[DOI]

Dmitry Tonkonog

SIAM J. Comput., 2013

Untangling Two Systems of Noncrossing Curves.

[BibT_eX]

[DOI]

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

2012

A Counterexample to Wegner's Conjecture on Good Covers.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

A Geometric Proof of the Colored Tverberg Theorem.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

Good covers are algorithmically unrecognizable

[BibT_eX]

[DOI]

Dmitry Tonkonog

CoRR, 2012

2011

d-representability of simplicial complexes of fixed dimension.

[BibT_eX]

[DOI]

J. Comput. Geom., 2011

Strong d-collapsibility.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2011

On the Complexity of Planar Covering of Small Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

2010

Backbone colorings of graphs with bounded degree.

[BibT_eX]

[DOI]

Jozef Miskuf

Discret. Appl. Math., 2010

d-collapsibility is NP-complete for d greater or equal to 4.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2010

2009

Backbone Colorings and Generalized Mycielski Graphs.

[BibT_eX]

[DOI]

Jozef Miskuf

SIAM J. Discret. Math., 2009

d-collapsibility is NP-complete for d>=4.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Injective colorings of planar graphs with few colors.

[BibT_eX]

[DOI]

Borut Luzar

Discret. Math., 2009

Dimension Gaps between Representability and Collapsibility.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Note: Combinatorial Alexander Duality - A Short and Elementary Proof.

[BibT_eX]

[DOI]

Anders Björner

Discret. 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

List-Coloring Squares of Sparse Subcubic Graphs.

[BibT_eX]

[DOI]

Zdenek Dvorák

SIAM J. Discret. Math., 2008

Hardness of embedding simplicial complexes in Rd

[BibT_eX]

[DOI]

CoRR, 2008

The Maximum Piercing Number for some Classes of Convex Sets with the (4, 3)-property.

[BibT_eX]

[DOI]

Jan Kyncl

Electron. J. Comb., 2008

2006

Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings.

[BibT_eX]

[DOI]

Daniel Král