default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Tancer
Person information
- affiliation: Charles University, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Pavel Paták, Martin Tancer
:
Embeddings of k-Complexes into 2k-Manifolds. Discret. Comput. Geom. 71(3): 960-991 (2024)- [j33]Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer:
Parameterized Complexity of Untangling Knots. SIAM J. Comput. 53(2): 431-479 (2024) - [c17]Martin Tancer:
Pach's Animal Problem Within the Bounding Box. SoCG 2024: 78:1-78:18 - 2023
- [j32]Denys Bulavka, Martin Tancer, Mykhaylo Tyomkyn:
Weak Saturation of Multipartite Hypergraphs. Comb. 43(6): 1081-1102 (2023) - [j31]Michael Skotnica, Martin Tancer:
NP-Hardness of Computing PL Geometric Category in Dimension 2. SIAM J. Discret. Math. 37(3): 2016-2029 (2023) - [c16]Pavel Paták, Martin Tancer:
Shellability Is Hard Even for Balls. STOC 2023: 1271-1284 - [i18]Martin Tancer:
Simpler algorithmically unrecognizable 4-manifolds. CoRR abs/2310.07421 (2023) - 2022
- [j30]Vojtech Kaluza, Martin Tancer:
Even Maps, the Colin de Verdière Number and Representations of Graphs. Comb. 42(Supplement 2): 1317-1345 (2022) - [j29]Zuzana Patáková, Martin Tancer, Uli Wagner:
Barycentric Cuts Through a Convex Body. Discret. Comput. Geom. 68(4): 1133-1154 (2022) - [c15]Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer:
Parameterized Complexity of Untangling Knots. ICALP 2022: 88:1-88:17 - [i17]Michael Skotnica, Martin Tancer:
NP-hardness of computing PL geometric category in dimension 2. CoRR abs/2204.13981 (2022) - [i16]Pavel Paták, Martin Tancer:
Shellability is hard even for balls. CoRR abs/2211.07978 (2022) - 2021
- [j28]Thomas Magnard, Michael Skotnica, Martin Tancer:
Shellings and Sheddings Induced by Collapses. SIAM J. Discret. Math. 35(3): 1978-2002 (2021) - [c14]Denys Bulavka, Afshin Goodarzi, Martin Tancer:
Optimal Bounds for the Colorful Fractional Helly Theorem. SoCG 2021: 19:1-19:14 - [i15]Clément Legrand-Duchesne, Ashutosh Rai, Martin Tancer:
Parameterized complexity of untangling knots. CoRR abs/2111.05001 (2021) - 2020
- [j27]Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer:
Embeddability in R3 is NP-hard. J. ACM 67(4): 20:1-20:29 (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 A 169 (2020) - [c13]Zuzana Patáková, Martin Tancer, Uli Wagner:
Barycentric Cuts Through a Convex Body. SoCG 2020: 62:1-62:16 - [c12]Vojtech Kaluza, Martin Tancer:
Even maps, the Colin de Verdière number and representations of graphs. SODA 2020: 2642-2657 - [i14]Zuzana Patáková, Martin Tancer, Uli Wagner:
Barycentric cuts through a convex body. CoRR abs/2003.13536 (2020)
2010 – 2019
- 2019
- [j25]Arkadiy Skopenkov, Martin Tancer:
Hardness of almost embedding simplicial complexes in Rd. Discret. Comput. Geom. 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. SoCG 2019: 49:1-49:19 - [i13]Pavel Paták, Martin Tancer:
Embeddings of k-complexes into 2k-manifolds. CoRR abs/1904.02404 (2019) - [i12]Vojtech Kaluza, Martin Tancer:
Even maps, the Colin de~Verdière number and representations of graphs. CoRR abs/1907.05055 (2019) - 2018
- [j23]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): 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. SoCG 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. Discret. Comput. Geom. 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. Discret. Comput. Geom. 55(1): 21-38 (2016) - [c8]Alfredo Hubard, Vojtech Kaluza, Arnaud de Mesmay, Martin Tancer:
Shortest Path Embeddings of Graphs on Surfaces. SoCG 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. GD 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. Comb. Probab. Comput. 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. Discret. Comput. Geom. 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. SoCG 2015: 476-490 - [c5]Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
Bounding Helly Numbers via Betti Numbers. SoCG 2015: 507-521 - 2014
- [j16]Martin Tancer, Kathrin Vorwerk:
Non-Embeddability of Geometric Lattices and Buildings. Discret. Comput. Geom. 51(4): 779-801 (2014) - [c4]Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner:
Embeddability in the 3-sphere is decidable. SoCG 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. GD 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. Discret. Comput. Geom. 47(2): 245-265 (2012) - [j13]Martin Tancer:
A Counterexample to Wegner's Conjecture on Good Covers. Discret. Comput. Geom. 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 Discret. Math. 6(2) (2011) - [j11]Martin Tancer:
d-representability of simplicial complexes of fixed dimension. J. Comput. Geom. 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. Chic. J. Theor. Comput. Sci. 2010 (2010) - [j9]Jozef Miskuf, Riste Skrekovski, Martin Tancer:
Backbone colorings of graphs with bounded degree. Discret. Appl. Math. 158(5): 534-542 (2010)
2000 – 2009
- 2009
- [j8]Anders Björner, Martin Tancer:
Note: Combinatorial Alexander Duality - A Short and Elementary Proof. Discret. Comput. Geom. 42(4): 586-593 (2009) - [j7]Jirí Matousek, Martin Tancer:
Dimension Gaps between Representability and Collapsibility. Discret. Comput. Geom. 42(4): 631-639 (2009) - [j6]Borut Luzar, Riste Skrekovski, Martin Tancer:
Injective colorings of planar graphs with few colors. Discret. Math. 309(18): 5636-5649 (2009) - [j5]Martin Tancer:
d-collapsibility is NP-complete for d>=4. Electron. Notes Discret. Math. 34: 53-57 (2009) - [j4]Jozef Miskuf, Riste Skrekovski, Martin Tancer:
Backbone Colorings and Generalized Mycielski Graphs. SIAM J. Discret. 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. Electron. J. Comb. 15(1) (2008) - [j2]Zdenek Dvorák, Riste Skrekovski, Martin Tancer:
List-Coloring Squares of Sparse Subcubic Graphs. SIAM J. Discret. 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. Discret. Math. 20(2): 536-543 (2006)
Coauthor Index
aka: Zuzana Safernová
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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, opencitations.net, and semanticscholar.org to load article reference 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, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and 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 and semanticscholar.org 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 as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional 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 information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
