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

Levi, Reut

  1. Local Computation Algorithms for Graphs of Non-Constant Degrees
    2015/02/13 by Reut Levi, Levi, Reut, Ronitt Rubinfeld +3 · 2 citations
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
  2. Testing bounded arboricity
    2017/07/16 by Eden, Talya, Levi, Reut, Ron, Dana · 2 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  3. A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded\n Minor
    2013/02/14 by Reut Levi, Levi, Reut, Dana Ron +1 · 1 citation
    Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Algorithms
  4. Property Testing of Planarity in the CONGEST model
    2018/05/27 by Levi, Reut, Medina, Moti, Ron, Dana · 1 citation
    #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
  5. Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√(n))
    2021/05/11 by Reut Levi, Levi, Reut · 1 citation
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
  6. Testing Ck-freeness in bounded-arboricity graphs
    2024/04/28 by Eden, Talya, Levi, Reut, Ron, Dana · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences