I agree that this site is using cookies. You can find further informations here.
X
Tancer, Martin
131  results:
Search for persons X
?
1

Parameterized Complexity of Untangling Knots:

Legrand-Duchesne, Clément ; Rai, Ashutosh ; Tancer, Martin
SIAM Journal on Computing.  53 (2024)  2 - p. 431-479 , 2024
Link: https://doi.org/10.1137/..
 
?
2

Shellability Is Hard Even for Balls:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Paták, Pavel ; Tancer, Martin - p. 1271-1284 , 2023
Link: https://dl.acm.org/doi/1..
 
?
3

Embeddings of k-Complexes into 2k-Manifolds:

Paták, Pavel ; Tancer, Martin
Discrete & Computational Geometry.  71 (2023)  3 - p. 960-991 , 2023
Link: https://doi.org/10.1007/..
 
?
4

Weak Saturation of Multipartite Hypergraphs:

Bulavka, Denys ; Tancer, Martin ; Tyomkyn, Mykhaylo
Combinatorica.  43 (2023)  6 - p. 1081-1102 , 2023
Link: https://doi.org/10.1007/..
 
?
5

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

Skotnica, Michael ; Tancer, Martin
SIAM Journal on Discrete Mathematics.  37 (2023)  3 - p. 2016-2029 , 2023
Link: https://doi.org/10.1137/..
 
?
6

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

Kaluža, Vojtěch ; Tancer, Martin
Combinatorica.  42 (2022)  S2 - p. 1317-1345 , 2022
Link: https://doi.org/10.1007/..
 
?
7

Barycentric Cuts Through a Convex Body:

Patáková, Zuzana ; Tancer, Martin ; Wagner, Uli
Discrete & Computational Geometry.  68 (2022)  4 - p. 1133-1154 , 2022
Link: https://doi.org/10.1007/..
 
?
8

The unbearable hardness of unknotting:

de Mesmay, Arnaud ; Rieck, Yo'av ; Sedgwick, Eric.
Advances in Mathematics.  381 (2021)  - p. 107648 , 2021
Link: https://doi.org/10.1016/..
 
?
9

Shellings and Sheddings Induced by Collapses:

Magnard, Thomas ; Skotnica, Michael ; Tancer, Martin
SIAM Journal on Discrete Mathematics.  35 (2021)  3 - p. 1978-2002 , 2021
Link: https://doi.org/10.1137/..
 
?
10

Embeddability in R3 is NP-hard:

Mesmay, Arnaud de ; Rieck, Yo'av ; Sedgwick, Eric.
Journal of the ACM (JACM).  67 (2020)  4 - p. 1-29 , 2020
Link: https://dl.acm.org/doi/1..
 
?
11

Even maps, the colin de verdière number and representations..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,
Kaluža, Vojtěch ; Tancer, Martin - p. 2642-2657 , 2020
Link: https://dl.acm.org/doi/1..
 
?
12

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

Jelínek, Vít ; Kantor, Ida ; Kynčl, Jan.
Journal of Combinatorial Theory, Series A.  169 (2020)  - p. 105121 , 2020
Link: https://doi.org/10.1016/..
 
?
13

Embeddability in R3is NP-hard:

Mesmay, Arnaud de ; Rieck, Yo'av ; Sedgwick, Eric.
Journal of the ACM.  67 (2020)  4 - p. 1-29 , 2020
Link: https://doi.org/10.1145/..
 
?
14

Shellability is NP-complete:

Goaoc, Xavier ; Paták, Pavel ; Patáková, Zuzana..
Journal of the ACM.  66 (2019)  3 - p. 1-18 , 2019
Link: https://doi.org/10.1145/..
 
?
15

Shellability is NP-complete:

Goaoc, Xavier ; Paták, Pavel ; Patáková, Zuzana..
Journal of the ACM (JACM).  66 (2019)  3 - p. 1-18 , 2019
Link: https://dl.acm.org/doi/1..
 
1-15