Follow
Martin Tancer
Title
Cited by
Cited by
Year
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
1012010
Note: Combinatorial Alexander duality—a short and elementary proof
A Björner, M Tancer
Discrete & Computational Geometry 42, 586-593, 2009
672009
Injective colorings of planar graphs with few colors
B Lužar, R Škrekovski, M Tancer
Discrete Mathematics 309 (18), 5636-5649, 2009
592009
Intersection patterns of convex sets via simplicial complexes: a survey
M Tancer
Thirty essays on geometric graph theory, 521-540, 2013
492013
List-coloring squares of sparse subcubic graphs
Z Dvořák, R Škrekovski, M Tancer
SIAM Journal on Discrete Mathematics 22 (1), 139-159, 2008
402008
Recognition of collapsible complexes is NP-complete
M Tancer
Discrete & Computational Geometry 55, 21-38, 2016
382016
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
292018
Dimension gaps between representability and collapsibility
J Matoušek, M Tancer
Discrete & Computational Geometry 42 (4), 631, 2009
192009
Embeddability in R3 is NP-hard
A Mesmay, Y Rieck, E Sedgwick, M Tancer
Journal of the ACM (JACM) 67 (4), 1-29, 2020
172020
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
172017
Recognition of collapsible complexes is NP-complete
M Tancer
arXiv preprint arXiv:1211.6254, 2012
172012
d-collapsibility is NP-complete for d greater or equal to 4
M Tancer
arXiv preprint arXiv:0808.1991, 2008
17*2008
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
172008
A geometric proof of the colored Tverberg theorem
J Matoušek, M Tancer, U Wagner
Discrete & Computational Geometry 47, 245-265, 2012
142012
Backbone colorings and generalized Mycielski graphs
J Miškuf, R Škrekovski, M Tancer
SIAM Journal on Discrete Mathematics 23 (2), 1063-1070, 2009
142009
Hardness of almost embedding simplicial complexes in
A Skopenkov, M Tancer
Discrete & Computational Geometry 61, 452-463, 2019
132019
Untangling two systems of noncrossing curves
J Matoušek, E Sedgwick, M Tancer, U Wagner
Israel Journal of Mathematics 212, 37-79, 2016
132016
Backbone colorings of graphs with bounded degree
J Miškuf, R Škrekovski, M Tancer
Discrete Applied Mathematics 158 (5), 534-542, 2010
132010
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
112019
The unbearable hardness of unknotting
A de Mesmay, Y Rieck, E Sedgwick, M Tancer
Advances in Mathematics 381, 107648, 2021
102021
The system can't perform the operation now. Try again later.
Articles 1–20