vix.ing · top · new · best · stats · spec

Tancer, Martin

  1. Shellability is NP-complete
    2017/11/22 by Goaoc, Xavier, Paták, Pavel, Patáková, Zuzana +2 · 3 citations
    #Combinatorics (math.CO) #Computational Geometry (cs.CG) #FOS: Computer and information sciences #FOS: Mathematics #Geometric Topology (math.GT)
  2. Barycentric cuts through a convex body
    2020/03/27 by Patáková, Zuzana, Tancer, Martin, Wagner, Uli · 3 citations
    #Combinatorics (math.CO) #Computational Geometry (cs.CG) #FOS: Computer and information sciences #FOS: Mathematics #Probability (math.PR)
  3. d-Representability of simplicial complexes of fixed dimension
    2011/07/06 by Martin Tancer, Tancer, Martin · 2 citations
    Mathematics · #05E45 #52A20 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05E45 #msc:52A20
  4. On the Complexity of Planar Covering of Small Graphs
    2011/07/30 by Ondřej Bílka, Jozef Jirásek, Bílka, Ondřej +7 · 2 citations
    Computer Science · Mathematics · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO
  5. Recognition of collapsible complexes is NP-complete
    2012/11/27 by Martin Tancer, Tancer, Martin · 2 citations
    Computer Science · #05E45 #68Q17 #Computational Geometry (cs.CG) #F.2.2 #FOS: Computer and information sciences #acm:05E45 #acm:68Q17 #cs.CG #msc:05E45 #msc:68Q17
  6. Hardness of embedding simplicial complexes in \Rd
    2008/07/02 by Jiřı́ Matoušek, Jiří Matoušek, Matoušek, Jiří +4 · 2 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Computational Geometry (cs.CG) #Digital Image Processing Techniques #FOS: Computer and information sciences #FOS: Mathematics #Geometric Topology (math.GT) #Topological and Geometric Data Analysis #cs.CG #math.GT
  7. A geometric proof of the colored Tverberg theorem
    2010/08/31 by Jiří Matoušek, Martin Tancer, Matoušek, Jiří +3 · 1 citation
    Mathematics · #52A35 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:52A35
  8. The unbearable hardness of unknotting
    2018/10/08 by de Mesmay, Arnaud, Rieck, Yo'av, Sedgwick, Eric +1 · 1 citation
    #FOS: Mathematics #Geometric Topology (math.GT)