pith. sign in

Martin Tancer

Identifiers

  • name variant Martin Tancer 0.60 · backfill

Papers (26)

  1. The unbearable hardness of unknotting math.GT · 2018 · author #4
  2. Shellability is NP-complete math.CO · 2017 · author #4
  3. Embeddability in $\mathbb{R}^3$ is NP-hard math.GT · 2017 · author #4
  4. On Generalized Heawood Inequalities for Manifolds: a van Kampen--Flores-type Nonembeddability Result math.CO · 2016 · author #5
  5. Pach's selection theorem does not admit a topological extension math.CO · 2016 · author #4
  6. A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane cs.CG · 2016 · author #5
  7. Shortest path embeddings of graphs on surfaces cs.CG · 2016 · author #4
  8. Bounds for Pach's selection theorem and for the minimum solid angle in a simplex math.MG · 2014 · author #5
  9. Embeddability in the 3-sphere is decidable math.GT · 2014 · author #3
  10. Bounding Helly numbers via Betti numbers math.CO · 2013 · author #4
  11. Shellability of the higher pinched Veronese posets math.CO · 2013 · author #1
  12. Untangling two systems of noncrossing curves math.CO · 2013 · author #3
  13. Recognition of collapsible complexes is NP-complete cs.CG · 2012 · author #1
  14. Non-embeddability of geometric lattices and buildings math.CO · 2012 · author #1
  15. Simplifying inclusion-exclusion formulas math.CO · 2012 · author #5
  16. Good covers are algorithmically unrecognizable cs.CG · 2012 · author #1
  17. On the Complexity of Planar Covering of Small Graphs math.CO · 2011 · author #4
  18. d-Representability of simplicial complexes of fixed dimension math.CO · 2011 · author #1
  19. Intersection patterns of convex sets via simplicial complexes, a survey math.CO · 2011 · author #1
  20. A geometric proof of the colored Tverberg theorem math.CO · 2010 · author #2
  21. A counterexample to Wegner's conjecture on good covers math.CO · 2010 · author #1
  22. Non-representability of finite projective planes by convex sets math.CO · 2009 · author #1
  23. d-collapsibility is NP-complete for d greater or equal to 4 math.CO · 2008 · author #1
  24. Hardness of embedding simplicial complexes in $\R^d$ cs.CG · 2008 · author #2
  25. On the gap between representability and collapsibility math.CO · 2008 · author #2
  26. Combinatorial Alexander Duality -- a Short and Elementary Proof math.CO · 2007 · author #2

Mentions

  • 1305.3159 #1 · backfill · confidence 0.70 Martin Tancer
  • 1302.6475 #3 · backfill · confidence 0.70 Martin Tancer
  • 1211.6254 #1 · backfill · confidence 0.70 Martin Tancer
  • 1211.2409 #1 · backfill · confidence 0.70 Martin Tancer
  • 1207.2591 #5 · backfill · confidence 0.70 Martin Tancer
  • 1205.6082 #1 · backfill · confidence 0.70 Martin Tancer
  • 1108.0064 #4 · backfill · confidence 0.70 Martin Tancer
  • 1107.1170 #1 · backfill · confidence 0.70 Martin Tancer
  • 1102.0417 #1 · backfill · confidence 0.70 Martin Tancer
  • 1008.5275 #2 · backfill · confidence 0.70 Martin Tancer
  • 1008.1895 #1 · backfill · confidence 0.70 Martin Tancer
  • 0908.4038 #1 · backfill · confidence 0.70 Martin Tancer
  • 0808.1991 #1 · backfill · confidence 0.70 Martin Tancer
  • 0807.0336 #2 · backfill · confidence 0.70 Martin Tancer
  • 0803.3520 #2 · backfill · confidence 0.70 Martin Tancer
  • 0710.1172 #2 · backfill · confidence 0.70 Martin Tancer

Frequent Coauthors