Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarMartin Tancer
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
upcoming
- 2020
[j26]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)
2010 – today
- 2019
- [j25]Arkadiy Skopenkov, Martin Tancer:
Hardness of almost embedding simplicial complexes in $$\mathbb {R}^d$$ R d. Discrete & Computational Geometry 61(2): 452-463 (2019) - [j24]Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
Shellability is NP-complete. J. ACM 66(3): 21:1-21:18 (2019) - [c11]Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer:
The Unbearable Hardness of Unknotting. Symposium on Computational Geometry 2019: 49:1-49:19 - [i12]Pavel Paták, Martin Tancer:
Embeddings of k-complexes into 2k-manifolds. CoRR abs/1904.02404 (2019) - 2018
- [j23]Imre Bárány, Roy Meshulam
, Eran Nevo, Martin Tancer:
Pach's Selection Theorem Does Not Admit a Topological Extension. Discrete & Computational Geometry 60(2): 420-429 (2018) - [j22]Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
Embeddability in the 3-Sphere Is Decidable. J. ACM 65(1): 5:1-5:49 (2018) - [c10]Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
Shellability is NP-Complete. Symposium on Computational Geometry 2018: 41:1-41:15 - [c9]Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer:
Embeddability in ℝ3 is NP-hard. SODA 2018: 1316-1329 - 2017
- [j21]Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer:
Shortest Path Embeddings of Graphs on Surfaces. Discrete & Computational Geometry 58(4): 921-945 (2017) - [j20]É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): 939-981 (2017) - [i11]Arkadiy Skopenkov, Martin Tancer:
Hardness of almost embedding simplicial complexes in Rd. CoRR abs/1703.06305 (2017) - [i10]Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer:
Embeddability in R3 is NP-hard. CoRR abs/1708.07734 (2017) - [i9]Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
Shellability is NP-complete. CoRR abs/1711.08436 (2017) - 2016
- [j19]Martin Tancer:
Recognition of Collapsible Complexes is NP-Complete. Discrete & Computational Geometry 55(1): 21-38 (2016) - [c8]Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer:
Shortest Path Embeddings of Graphs on Surfaces. Symposium on Computational Geometry 2016: 43:1-43:16 - [c7]É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: 454-467 - [i8]Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer:
Shortest path embeddings of graphs on surfaces. CoRR abs/1602.06778 (2016) - [i7]É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 abs/1608.07855 (2016) - 2015
- [j18]Xavier Goaoc, Jirí Matousek, Pavel Paták, Zuzana Safernová, Martin Tancer:
Simplifying Inclusion-Exclusion Formulas. Combinatorics, Probability & Computing 24(2): 438-456 (2015) - [j17]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. Discrete & Computational Geometry 54(3): 610-636 (2015) - [c6]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. Symposium on Computational Geometry 2015: 476-490 - [c5]Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
Bounding Helly Numbers via Betti Numbers. Symposium on Computational Geometry 2015: 507-521 - 2014
- [j16]Martin Tancer, Kathrin Vorwerk:
Non-Embeddability of Geometric Lattices and Buildings. Discrete & Computational Geometry 51(4): 779-801 (2014) - [c4]Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
Embeddability in the 3-sphere is decidable. Symposium on Computational Geometry 2014: 78 - [i6]Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
Embeddability in the 3-sphere is decidable. CoRR abs/1402.0815 (2014) - 2013
- [j15]Martin Tancer, Dmitry Tonkonog:
Nerves of Good Covers Are Algorithmically Unrecognizable. SIAM J. Comput. 42(4): 1697-1719 (2013) - [c3]Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
Untangling Two Systems of Noncrossing Curves. Graph Drawing 2013: 472-483 - [i5]Xavier Goaoc, Pavel Paták, Zuzana Safernová, Martin Tancer, Uli Wagner:
Bounding Helly numbers via Betti numbers. CoRR abs/1310.4613 (2013) - 2012
- [j14]Jirí Matousek, Martin Tancer, Uli Wagner:
A Geometric Proof of the Colored Tverberg Theorem. Discrete & Computational Geometry 47(2): 245-265 (2012) - [j13]Martin Tancer:
A Counterexample to Wegner's Conjecture on Good Covers. Discrete & Computational Geometry 47(2): 266-274 (2012) - [i4]Martin Tancer, Dmitry Tonkonog:
Good covers are algorithmically unrecognizable. CoRR abs/1205.6082 (2012) - [i3]Martin Tancer:
Recognition of collapsible complexes is NP-complete. CoRR abs/1211.6254 (2012) - 2011
- [j12]Martin Tancer:
Strong d-collapsibility. Contributions to Discrete Mathematics 6(2) (2011) - [j11]Martin Tancer:
d-representability of simplicial complexes of fixed dimension. JoCG 2(1): 183-188 (2011) - [c2]Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec:
On the Complexity of Planar Covering of Small Graphs. WG 2011: 83-94 - [i2]Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec:
On the Complexity of Planar Covering of Small Graphs. CoRR abs/1108.0064 (2011) - 2010
- [j10]Martin Tancer:
d-collapsibility is NP-complete for d greater or equal to 4. Chicago J. Theor. Comput. Sci. 2010 (2010) - [j9]Jozef Miskuf, Riste Skrekovski, Martin Tancer:
Backbone colorings of graphs with bounded degree. Discrete Applied Mathematics 158(5): 534-542 (2010)
2000 – 2009
- 2009
- [j8]Anders Björner, Martin Tancer:
Note: Combinatorial Alexander Duality - A Short and Elementary Proof. Discrete & Computational Geometry 42(4): 586-593 (2009) - [j7]Jirí Matousek, Martin Tancer:
Dimension Gaps between Representability and Collapsibility. Discrete & Computational Geometry 42(4): 631-639 (2009) - [j6]Borut Luzar, Riste Skrekovski, Martin Tancer:
Injective colorings of planar graphs with few colors. Discrete Mathematics 309(18): 5636-5649 (2009) - [j5]Martin Tancer:
d-collapsibility is NP-complete for d>=4. Electronic Notes in Discrete Mathematics 34: 53-57 (2009) - [j4]Jozef Miskuf, Riste Skrekovski, Martin Tancer:
Backbone Colorings and Generalized Mycielski Graphs. SIAM J. Discrete Math. 23(2): 1063-1070 (2009) - [c1]Jirí Matousek, Martin Tancer, Uli Wagner:
Hardness of embedding simplicial complexes in Rd. SODA 2009: 855-864 - 2008
- [j3]Jan Kyncl, Martin Tancer:
The Maximum Piercing Number for some Classes of Convex Sets with the (4, 3)-property. Electr. J. Comb. 15(1) (2008) - [j2]Zdenek Dvorák, Riste Skrekovski, Martin Tancer:
List-Coloring Squares of Sparse Subcubic Graphs. SIAM J. Discrete Math. 22(1): 139-159 (2008) - [i1]Jirí Matousek, Martin Tancer, Uli Wagner:
Hardness of embedding simplicial complexes in Rd. CoRR abs/0807.0336 (2008) - 2006
- [j1]Daniel Král, Riste Skrekovski, Martin Tancer:
Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings. SIAM J. Discrete Math. 20(2): 536-543 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org and opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2019-11-12 22:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
