Martin Tancer - RankMe

70 papers A* 14A 2B 1Journal 53

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