| Hardness of embedding simplicial complexes in ℝd J Matoušek, M Tancer, U Wagner Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009 | 118 | 2009 |
| Note: Combinatorial Alexander duality—a short and elementary proof A Björner, M Tancer Discrete & Computational Geometry 42 (4), 586-593, 2009 | 84 | 2009 |
| Injective colorings of planar graphs with few colors B Lužar, R Škrekovski, M Tancer Discrete Mathematics 309 (18), 5636-5649, 2009 | 74 | 2009 |
| Intersection patterns of convex sets via simplicial complexes: a survey M Tancer Thirty essays on geometric graph theory, 521-540, 2012 | 67 | 2012 |
| Recognition of collapsible complexes is NP-complete M Tancer Discrete & Computational Geometry 55 (1), 21-38, 2016 | 52 | 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 | 49 | 2008 |
| 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 | 31 | 2018 |
| The unbearable hardness of unknotting A de Mesmay, Y Rieck, E Sedgwick, M Tancer Advances in Mathematics 381, 107648, 2021 | 26 | 2021 |
| 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 | 26 | 2019 |
| Bounding Helly numbers via Betti numbers X Goaoc, P Paták, Z Patáková, M Tancer, U Wagner A Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek, 407-447, 2017 | 26 | 2017 |
| d-collapsibility is NP-complete for d⩾ 4 M Tancer Electronic Notes in Discrete Mathematics 34, 53-57, 2009 | 23 | 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 | 22 | 2018 |
| Dimension gaps between representability and collapsibility J Matoušek, M Tancer Discrete & Computational Geometry 42 (4), 631-639, 2009 | 21 | 2009 |
| 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 | 19 | 2008 |
| Hardness of almost embedding simplicial complexes in A Skopenkov, M Tancer Discrete & Computational Geometry 61 (2), 452-463, 2019 | 18 | 2019 |
| Untangling two systems of noncrossing curves J Matoušek, E Sedgwick, M Tancer, U Wagner Israel Journal of Mathematics 212 (1), 37-79, 2016 | 18 | 2016 |
| Embeddings of -complexes into -manifolds P Paták, M Tancer arXiv preprint arXiv:1904.02404, 2019 | 17* | 2019 |
| Recognition of collapsible complexes is NP-complete M Tancer arXiv preprint arXiv:1211.6254, 2012 | 17 | 2012 |
| Backbone colorings and generalized Mycielski graphs J Miškuf, R Škrekovski, M Tancer SIAM Journal on Discrete Mathematics 23 (2), 1063-1070, 2009 | 17 | 2009 |
| Backbone colorings of graphs with bounded degree J Miškuf, R Škrekovski, M Tancer Discrete Applied Mathematics 158 (5), 534-542, 2010 | 16 | 2010 |
