Mozes, Shay

1. Minimum Cut in O(mlog² n) Time
   2019/11/04 by Paweł Gawrychowski, Shay Mozes, Gawrychowski, Paweł +3 · 1 voice · 2 citations
   #cs.DS
2. Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless\n APSP can)
   2017/03/27 by Karl Bringmann, Paweł Gawrychowski, Bringmann, Karl +5 · 5 citations
   Computer Science · #Algorithms and Data Compression #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Network Packet Processing and Optimization
3. Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
   2011/05/11 by Borradaile, Glencora, Klein, Philip N., Mozes, Shay +2 · 1 citation
   #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
4. Better Tradeoffs for Exact Distance Oracles in Planar Graphs
   2017/08/04 by Paweł Gawrychowski, Gawrychowski, Paweł, Shay Mozes +5 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
5. Near-Optimal Distance Emulator for Planar Graphs
   2018/07/04 by Chang, Hsien-Chih, Gawrychowski, Paweł, Mozes, Shay +1 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
6. Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs
   2020/09/30 by Fredslund-Hansen, Viktor, Mozes, Shay, Wulff-Nilsen, Christian · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
7. Fault-Tolerant Distance Labeling for Planar Graphs
   2021/02/14 by Bar-Natan, Aviv, Charalampopoulos, Panagiotis, Gawrychowski, Paweł +2 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences