Martin Tancer

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 39

Top Topics

Top Venues

Discret. Comput. Geom.

Publications

Martin Tancer
Pach's Animal Problem Within the Bounding Box. SoCG (2024)
Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer
Parameterized Complexity of Untangling Knots. SIAM J. Comput. 53 (2) (2024)
Pavel Paták, Martin Tancer
Embeddings of k-Complexes into 2k-Manifolds. Discret. Comput. Geom. 71 (3) (2024)
Pavel Paták, Martin Tancer
Shellability Is Hard Even for Balls. STOC (2023)
Martin Tancer
Simpler algorithmically unrecognizable 4-manifolds. CoRR (2023)
Denys Bulavka, Martin Tancer, Mykhaylo Tyomkyn
Weak Saturation of Multipartite Hypergraphs. Comb. 43 (6) (2023)
Michael Skotnica, Martin Tancer
NP-Hardness of Computing PL Geometric Category in Dimension 2. SIAM J. Discret. Math. 37 (3) (2023)
Pavel Paták, Martin Tancer
Shellability is hard even for balls. CoRR (2022)
Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer
Parameterized Complexity of Untangling Knots. ICALP (2022)
Vojtech Kaluza, Martin Tancer
Even Maps, the Colin de Verdière Number and Representations of Graphs. Comb. 42 (Supplement 2) (2022)
Michael Skotnica, Martin Tancer
NP-hardness of computing PL geometric category in dimension 2. CoRR (2022)
Zuzana Patáková, Martin Tancer, Uli Wagner
Barycentric Cuts Through a Convex Body. Discret. Comput. Geom. 68 (4) (2022)
Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer
Parameterized complexity of untangling knots. CoRR (2021)
Thomas Magnard, Michael Skotnica, Martin Tancer
Shellings and Sheddings Induced by Collapses. SIAM J. Discret. Math. 35 (3) (2021)
Denys Bulavka, Afshin Goodarzi, Martin Tancer
Optimal Bounds for the Colorful Fractional Helly Theorem. SoCG (2021)
Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer
is NP-hard. J. ACM 67 (4) (2020)
Vojtech Kaluza, Martin Tancer
Even maps, the Colin de Verdière number and representations of graphs. SODA (2020)
Vít Jelínek, Ida Kantor, Jan Kyncl, Martin Tancer
On the growth of the Möbius function of permutations. J. Comb. Theory, Ser. A 169 (2020)
Zuzana Patáková, Martin Tancer, Uli Wagner
Barycentric Cuts Through a Convex Body. SoCG (2020)
Zuzana Patáková, Martin Tancer, Uli Wagner
Barycentric cuts through a convex body. CoRR (2020)
Vojtech Kaluza, Martin Tancer
Even maps, the Colin de~Verdière number and representations of graphs. CoRR (2019)
Arkadiy Skopenkov, Martin Tancer
. Discret. Comput. Geom. 61 (2) (2019)
Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer
The Unbearable Hardness of Unknotting. SoCG (2019)
Pavel Paták, Martin Tancer
Embeddings of k-complexes into 2k-manifolds. CoRR (2019)
Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner
Shellability is NP-complete. J. ACM 66 (3) (2019)
Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer
is NP-hard. SODA (2018)
Imre Bárány, Roy Meshulam, Eran Nevo, Martin Tancer
Pach's Selection Theorem Does Not Admit a Topological Extension. Discret. Comput. Geom. 60 (2) (2018)
Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
Embeddability in the 3-Sphere Is Decidable. J. ACM 65 (1) (2018)
Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner
Shellability is NP-Complete. SoCG (2018)
Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner
Shellability is NP-complete. CoRR (2017)
Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer
is NP-hard. CoRR (2017)
Éric Colin de Verdière, Vojtech Kaluza, Pavel Paták, Zuzana Patáková, Martin Tancer
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. J. Graph Algorithms Appl. 21 (5) (2017)
Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer
Shortest Path Embeddings of Graphs on Surfaces. Discret. Comput. Geom. 58 (4) (2017)
Arkadiy Skopenkov, Martin Tancer
. CoRR (2017)
Martin Tancer
Recognition of Collapsible Complexes is NP-Complete. Discret. Comput. Geom. 55 (1) (2016)
Éric Colin de Verdière, Vojtech Kaluza, Pavel Paták, Zuzana Patáková, Martin Tancer
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. CoRR (2016)
Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer
Shortest Path Embeddings of Graphs on Surfaces. SoCG (2016)
Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer
Shortest path embeddings of graphs on surfaces. CoRR (2016)
Éric Colin de Verdière, Vojtech Kaluza, Pavel Paták, Zuzana Patáková, Martin Tancer
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. Graph Drawing (2016)
Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner
Bounding Helly Numbers via Betti Numbers. SoCG (2015)
Roman N. Karasev, Jan Kyncl, Pavel Paták, Zuzana Patáková, Martin Tancer
Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex. Discret. Comput. Geom. 54 (3) (2015)
Xavier Goaoc, Jirí Matousek, Pavel Paták, Zuzana Safernová, Martin Tancer
Simplifying Inclusion-Exclusion Formulas. Comb. Probab. Comput. 24 (2) (2015)
Xavier Goaoc, Isaac Mabillard, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner
On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result. SoCG (2015)
Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
Embeddability in the 3-sphere is decidable. CoRR (2014)
Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
Embeddability in the 3-sphere is decidable. SoCG (2014)
Martin Tancer, Kathrin Vorwerk
Non-Embeddability of Geometric Lattices and Buildings. Discret. Comput. Geom. 51 (4) (2014)
Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner
Untangling Two Systems of Noncrossing Curves. Graph Drawing (2013)
Martin Tancer, Dmitry Tonkonog
Nerves of Good Covers Are Algorithmically Unrecognizable. SIAM J. Comput. 42 (4) (2013)
Xavier Goaoc, Pavel Paták, Zuzana Safernová, Martin Tancer, Uli Wagner
Bounding Helly numbers via Betti numbers. CoRR (2013)
Martin Tancer, Dmitry Tonkonog
Good covers are algorithmically unrecognizable CoRR (2012)
Martin Tancer
Recognition of collapsible complexes is NP-complete CoRR (2012)
Martin Tancer
A Counterexample to Wegner's Conjecture on Good Covers. Discret. Comput. Geom. 47 (2) (2012)
Jirí Matousek, Martin Tancer, Uli Wagner
A Geometric Proof of the Colored Tverberg Theorem. Discret. Comput. Geom. 47 (2) (2012)
Martin Tancer
Strong d-collapsibility. Contributions Discret. Math. 6 (2) (2011)
Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec
On the Complexity of Planar Covering of Small Graphs. WG (2011)
Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec
On the Complexity of Planar Covering of Small Graphs CoRR (2011)
Martin Tancer
d-representability of simplicial complexes of fixed dimension. J. Comput. Geom. 2 (1) (2011)
Martin Tancer
d-collapsibility is NP-complete for d greater or equal to 4. Chic. J. Theor. Comput. Sci. 2010 (2010)
Jozef Miskuf, Riste Skrekovski, Martin Tancer
Backbone colorings of graphs with bounded degree. Discret. Appl. Math. 158 (5) (2010)
Anders Björner, Martin Tancer
Note: Combinatorial Alexander Duality - A Short and Elementary Proof. Discret. Comput. Geom. 42 (4) (2009)
Martin Tancer
d-collapsibility is NP-complete for d>=4. Electron. Notes Discret. Math. 34 (2009)
Jirí Matousek, Martin Tancer
Dimension Gaps between Representability and Collapsibility. Discret. Comput. Geom. 42 (4) (2009)
Jozef Miskuf, Riste Skrekovski, Martin Tancer
Backbone Colorings and Generalized Mycielski Graphs. SIAM J. Discret. Math. 23 (2) (2009)
Jirí Matousek, Martin Tancer, Uli Wagner
. SODA (2009)
Borut Luzar, Riste Skrekovski, Martin Tancer
Injective colorings of planar graphs with few colors. Discret. Math. 309 (18) (2009)
Jirí Matousek, Martin Tancer, Uli Wagner
CoRR (2008)
Zdenek Dvorák, Riste Skrekovski, Martin Tancer
List-Coloring Squares of Sparse Subcubic Graphs. SIAM J. Discret. Math. 22 (1) (2008)
Jan Kyncl, Martin Tancer
The Maximum Piercing Number for some Classes of Convex Sets with the (4, 3)-property. Electron. J. Comb. 15 (1) (2008)
Daniel Král, Riste Skrekovski, Martin Tancer
Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings. SIAM J. Discret. Math. 20 (2) (2006)