Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings. - Daniel Král; Riste Skrekovski; Martin Tancer (SIAM J. Discret. Math., 2006)

The Maximum Piercing Number for some Classes of Convex Sets with the (4, 3)-property. - Jan Kyncl; Martin Tancer (Electron. J. Comb., 2008)

Hardness of embedding simplicial complexes in Rd - Jirí Matousek 001; Martin Tancer; Uli Wagner 001 (CoRR, 2008)

List-Coloring Squares of Sparse Subcubic Graphs. - Zdenek Dvorák 001; Riste Skrekovski; Martin Tancer (SIAM J. Discret. Math., 2008)

Hardness of embedding simplicial complexes in Rd. - Jirí Matousek 001; Martin Tancer; Uli Wagner 001 (SODA, 2009)

Note: Combinatorial Alexander Duality - A Short and Elementary Proof. - Anders Björner; Martin Tancer (Discret. Comput. Geom., 2009)

Dimension Gaps between Representability and Collapsibility. - Jirí Matousek 001; Martin Tancer (Discret. Comput. Geom., 2009)

Injective colorings of planar graphs with few colors. - Borut Luzar; Riste Skrekovski; Martin Tancer (Discret. Math., 2009)

d-collapsibility is NP-complete for d>=4. - Martin Tancer (Electron. Notes Discret. Math., 2009)

Backbone Colorings and Generalized Mycielski Graphs. - Jozef Miskuf; Riste Skrekovski; Martin Tancer (SIAM J. Discret. Math., 2009)

d-collapsibility is NP-complete for d greater or equal to 4. - Martin Tancer (Chic. J. Theor. Comput. Sci., 2010)

Backbone colorings of graphs with bounded degree. - Jozef Miskuf; Riste Skrekovski; Martin Tancer (Discret. Appl. Math., 2010)

On the Complexity of Planar Covering of Small Graphs. - Ondrej Bílka; Jozef Jirásek 002; Pavel Klavík; Martin Tancer; Jan Volec (WG, 2011)

Strong d-collapsibility. - Martin Tancer (Contributions Discret. Math., 2011)

d-representability of simplicial complexes of fixed dimension. - Martin Tancer (J. Comput. Geom., 2011)

Good covers are algorithmically unrecognizable - Martin Tancer; Dmitry Tonkonog (CoRR, 2012)

A Geometric Proof of the Colored Tverberg Theorem. - Jirí Matousek 001; Martin Tancer; Uli Wagner 001 (Discret. Comput. Geom., 2012)

A Counterexample to Wegner's Conjecture on Good Covers. - Martin Tancer (Discret. Comput. Geom., 2012)

Untangling Two Systems of Noncrossing Curves. - Jirí Matousek 001; Eric Sedgwick; Martin Tancer; Uli Wagner 001 (GD, 2013)

Nerves of Good Covers Are Algorithmically Unrecognizable. - Martin Tancer; Dmitry Tonkonog (SIAM J. Comput., 2013)

Non-Embeddability of Geometric Lattices and Buildings. - Martin Tancer; Kathrin Vorwerk (Discret. Comput. Geom., 2014)

On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result. - Xavier Goaoc; Isaac Mabillard; Pavel Paták; Zuzana Patáková; Martin Tancer; Uli Wagner 001 (SoCG, 2015)

Bounding Helly Numbers via Betti Numbers. - Xavier Goaoc; Pavel Paták; Zuzana Patáková; Martin Tancer; Uli Wagner 001 (SoCG, 2015)

Simplifying Inclusion-Exclusion Formulas. - Xavier Goaoc; Jirí Matousek 001; Pavel Paták; Zuzana Safernová; Martin Tancer (Comb. Probab. Comput., 2015)

Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex. - Roman N. Karasev; Jan Kyncl; Pavel Paták; Zuzana Patáková; Martin Tancer (Discret. Comput. Geom., 2015)

Recognition of Collapsible Complexes is NP-Complete. - Martin Tancer (Discret. Comput. Geom., 2016)

Shortest Path Embeddings of Graphs on Surfaces. - Alfredo Hubard; Vojtech Kaluza; Arnaud de Mesmay; Martin Tancer (Discret. Comput. Geom., 2017)

A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. - Éric Colin de Verdière; Vojtech Kaluza; Pavel Paták; Zuzana Patáková; Martin Tancer (J. Graph Algorithms Appl., 2017)

Pach's Selection Theorem Does Not Admit a Topological Extension. - Imre Bárány; Roy Meshulam; Eran Nevo; Martin Tancer (Discret. Comput. Geom., 2018)

Embeddability in the 3-Sphere Is Decidable. - Jirí Matousek 001; Eric Sedgwick; Martin Tancer; Uli Wagner 001 (J. ACM, 2018)

The Unbearable Hardness of Unknotting. - Arnaud de Mesmay; Yo'av Rieck; Eric Sedgwick; Martin Tancer (SoCG, 2019)

Hardness of almost embedding simplicial complexes in Rd. - Arkadiy Skopenkov; Martin Tancer (Discret. Comput. Geom., 2019)

Shellability is NP-complete. - Xavier Goaoc; Pavel Paták; Zuzana Patáková; Martin Tancer; Uli Wagner 001 (J. ACM, 2019)

Embeddability in R3 is NP-hard. - Arnaud de Mesmay; Yo'av Rieck; Eric Sedgwick; Martin Tancer (J. ACM, 2020)

On the growth of the Möbius function of permutations. - Vít Jelínek; Ida Kantor; Jan Kyncl; Martin Tancer (J. Comb. Theory A, 2020)

Optimal Bounds for the Colorful Fractional Helly Theorem. - Denys Bulavka; Afshin Goodarzi; Martin Tancer (SoCG, 2021)

Shellings and Sheddings Induced by Collapses. - Thomas Magnard; Michael Skotnica; Martin Tancer (SIAM J. Discret. Math., 2021)

Barycentric Cuts Through a Convex Body. - Zuzana Patáková; Martin Tancer; Uli Wagner 001 (Discret. Comput. Geom., 2022)

Even Maps, the Colin de Verdière Number and Representations of Graphs. - Vojtech Kaluza; Martin Tancer (Comb., 2022)

Shellability Is Hard Even for Balls. - Pavel Paták; Martin Tancer (STOC, 2023)

Simpler algorithmically unrecognizable 4-manifolds. - Martin Tancer (CoRR, 2023)

NP-Hardness of Computing PL Geometric Category in Dimension 2. - Michael Skotnica; Martin Tancer (SIAM J. Discret. Math., 2023)

Weak Saturation of Multipartite Hypergraphs. - Denys Bulavka; Martin Tancer; Mykhaylo Tyomkyn (Comb., 2023)

Pach's Animal Problem Within the Bounding Box. - Martin Tancer (SoCG, 2024)

Parameterized Complexity of Untangling Knots. - Clément Legrand-Duchesne; Ashutosh Rai 001; Martin Tancer (SIAM J. Comput., 2024)

Embeddings of k-Complexes into 2k-Manifolds. - Pavel Paták; Martin Tancer (Discret. Comput. Geom., 2024)