| Hardness of embedding simplicial complexes in ℝd J Matoušek, M Tancer, U Wagner Journal of the European Mathematical Society 13 (2), 259-295, 2010 | 92 | 2010 |
| Note: Combinatorial Alexander duality—a short and elementary proof A Björner, M Tancer Discrete & Computational Geometry 42 (4), 586, 2009 | 53 | 2009 |
| Injective colorings of planar graphs with few colors B Lužar, R Škrekovski, M Tancer Discrete Mathematics 309 (18), 5636-5649, 2009 | 50 | 2009 |
| Recognition of collapsible complexes is NP-complete M Tancer Discrete & Computational Geometry 55 (1), 21-38, 2016 | 39* | 2016 |
| List-coloring squares of sparse subcubic graphs Z Dvořák, R Škrekovski, M Tancer SIAM Journal on Discrete Mathematics 22 (1), 139-159, 2008 | 36 | 2008 |
| Intersection patterns of convex sets via simplicial complexes: a survey M Tancer Thirty essays on geometric graph theory, 521-540, 2013 | 34 | 2013 |
| Embeddability in the 3-sphere is decidable J Matoušek, E Sedgwick, M Tancer, U Wagner Journal of the ACM (JACM) 65 (1), 1-49, 2018 | 25* | 2018 |
| The Maximum Piercing Number for some Classes of Convex Sets with the -property J Kynčl, M Tancer the electronic journal of combinatorics, R27-R27, 2008 | 16 | 2008 |
| Bounding Helly numbers via Betti numbers X Goaoc, P Paták, Z Patáková, M Tancer, U Wagner A journey through discrete mathematics, 407-447, 2017 | 15 | 2017 |
| d-collapsibility is NP-complete for d≥ 4 M Tancer Chicago Journal of Theoretical Computer Science, 2010 | 15 | 2010 |
| Dimension gaps between representability and collapsibility J Matoušek, M Tancer Discrete & Computational Geometry 42 (4), 631, 2009 | 15 | 2009 |
| Embeddability in ℝ3 is NP-hard A de Mesmay, Y Rieck, E Sedgwick, M Tancer Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 14* | 2018 |
| A geometric proof of the colored Tverberg theorem J Matoušek, M Tancer, U Wagner Discrete & Computational Geometry 47 (2), 245-265, 2012 | 13 | 2012 |
| Backbone colorings and generalized Mycielski graphs J Miškuf, R Škrekovski, M Tancer SIAM Journal on Discrete Mathematics 23 (2), 1063-1070, 2009 | 13 | 2009 |
| Untangling two systems of noncrossing curves J Matoušek, E Sedgwick, M Tancer, U Wagner Israel Journal of Mathematics 212 (1), 37-79, 2016 | 11 | 2016 |
| Backbone colorings of graphs with bounded degree J Miškuf, R Škrekovski, M Tancer Discrete Applied Mathematics 158 (5), 534-542, 2010 | 10 | 2010 |
| The unbearable hardness of unknotting A de Mesmay, Y Rieck, E Sedgwick, M Tancer Advances in Mathematics 381, 107648, 2021 | 9 | 2021 |
| Hardness of almost embedding simplicial complexes in A Skopenkov, M Tancer Discrete & Computational Geometry 61 (2), 452-463, 2019 | 9 | 2019 |
| Shellability is NP-complete X Goaoc, P Paták, Z Patáková, M Tancer, U Wagner Journal of the ACM (JACM) 66 (3), 1-18, 2019 | 8 | 2019 |
| On generalized Heawood inequalities for manifolds: a van Kampen–Flores-type nonembeddability result X Goaoc, I Mabillard, P Paták, Z Patáková, M Tancer, U Wagner Israel Journal of Mathematics 222 (2), 841-866, 2017 | 7 | 2017 |
