List of publications

Manuscripts

  1. Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n5/3) time. Haim Kaplan, Paweł Gawrychowski, Shay Mozes, Micha Sharir and Oren Weimann. arXiv:cs.ds/1704.02793
  2. Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). Karl Bringmann, Paweł Gawrychowski, Shay Mozes and Oren Weimann. arXiv:cs.ds/1703.08940
  3. Near-Optimal Compression for the Planar Graph Metric. Amir Abboud, Paweł Gawrychowski, Shay Mozes and Oren Weimann. arXiv:cs.ds/1703.04814
  4. Faster Shortest Paths in Dense Distance Graphs, with Applications. Shay Mozes, Yahav Nussbaum and Oren Weimann. arXiv:cs.ds/1404.0977

Conference Papers

  1. The Nearest Colored Node in a Tree. . Paweł Gawrychowski, Gad M. Landau, Shay Mozes and Oren Weimann. In Proceedings of the 27th Annual symposium on Combinatorial Pattern Matching (CPM 2016). 25:1-25:12. pdf version  
  2. Efficient Vertex-Label Distance Oracles for Planar Graphs. Shay Mozes and Eyal E. Skop. In proceedings of the 13th International Workshop on Approximation and Online Algorithms (WAOA 2015). pages 97-109. arXiv:cs.ds/1504.04690. slides.
  3. Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Search. . Paweł Gawrychowski, Shay Mozes and Oren Weimann. In proceedings of the 42n International Colloquium on Automata, Languages, and Programming (ICALP 2015). pages 580-592. arXiv:cs.ds/1502.07663 pdf version  
  4. A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection. Kyle Fox, Philip Klein, and Shay Mozes. In proceedings of the 47th ACM Symposium on Theory of Computing (STOC 2015). pages 841-850. arXiv:cs.ds/1504.08008   ACM DL Author-ize
		  service
  5. Improved Submatrix Maximum Queries in Monge Matrices. Paweł Gawrychowski, Shay Mozes and Oren Weimann. In proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014). pages 525-537   pdf version  
  6. Structured Recursive Separator Decompositions for Planar Graphs in Linear Time. Philip Klein, Shay Mozes and Christian Sommer. In proceedings of the 45th ACM Symposium on Theory of Computing (STOC 2013). pages 505-514. ACM DL Author-ize
		  service
  7. Short and Simple Cycle Separators in Planar Graphs. Eli Fox-Epstein, Shay Mozes, Phitchaya Mangpo Phothilimthana, and Christian Sommer. In Proceedings of the 15th Workshop on Algorithm Engineering and Experiments (ALENEX 2013), pages 26-40. 
  8. Submatrix Maximum Queries in Monge Matrices and Monge Partial Matrices, and Their Applications. Haim Kaplan, Shay Mozes, Yahav Nussbaum and Micha Sharir. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pages 338-355.  pdf version  
  9. Exact Distance Oracles for Planar Graphs. Shay Mozes and Christian Sommer. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pages 209-222.  arXiv:cs.ds/1011.5549 pdf version  
  10. Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. Glencora Borradaile, Philip Klein, Shay Mozes, Yahav Nussbaum and Christian Wulff-Nilsen. in Proceedings of the 52nd Annual Symposium on Foundations of Computer Science (FOCS 2011), pages 170-179. arXiv:cs.dm/1105.2228 pdf version slides
  11. Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter n log n) Time. Philip Klein and Shay Mozes. In Proceedings of the 12th Algorithms and Data Structures Symposium (WADS 2011), pages 571-582. pdf version  
  12. The Train Delivery Problem - Vehicle Routing Meets Bin Packing. Aparna Das, Claire Mathieu and Shay Mozes. In Proceedings of the 8th Workshop on Approximation and Online Algorithms (WAOA 2010), pages 94-105. pdf version  
  13. Recipient of the ESA 2010 best student paper award:
    Shortest Paths in Planar Graphs with Real Lengths in O(n log2n / loglog n) Time. Shay Mozes and Christian Wulff-Nilsen. In Proceedings of the 18th Annual European Symposium on Algorithms (ESA 2010), pages 206-217. pdf version  
  14. Efficient Algorithms for Analyzing Segmental Duplications, Deletions, and Inversions in Genomes. Crystal Kahn, Shay Mozes and Ben Raphael. In Proceedings of the 9th International Workshop (WABI 2009), pages 169-180  pdf version slides
  15. Shortest Paths in Directed Planar Graphs with Negative Lengths: a Linear-Space O(n log2 n)-Time Algorithm. Philip Klein, Shay Mozes and Oren Weimann. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pages 236-245.  pdf version slides
  16. Fast Algorithms for Computing Tree LCS. Shay Mozes, Dekel Tsur , Oren Weimann and Michal Ziv-Ukelson. In Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching (CPM 2008), pages 230-243.  pdf version
  17. Finding an Optimal Tree Searching Strategy in Linear Time. Shay Mozes, Krzysztof Onak and Oren Weimann. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pages 1096-1105.   pdf version slides   comment
  18. Recipient of the CPM 2007 best paper award:
    Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Shay Mozes, Oren Weimann and Michal Ziv-Ukelson. In Proceedings of the 18th annual symposium on Combinatorial Pattern Matching (CPM 2007), pages 4-15.  pdf version slides C++/Java Implementation
  19. An Optimal Decomposition Algorithm for Tree Edit Distance. Erik Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), pages 146-157.  arXiv:cs.ds/0604037 pdf version slides

Journal Articles

  1. Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications. Haim Kaplan, Shay Mozes, Yahav Nussbaum and Micha Sharir. ACM Transactions on Algorithms (TALG): 13 (2):26 (2016) ACM DL Author-ize
		  service
  2. Short and Simple Cycle Separators in Planar Graphs. Eli Fox-Epstein, Shay Mozes, Phitchaya Mangpo Phothilimthana, and Christian Sommer. Invited submission to ACM Journal of Experimental Algorithmics special issue for ALENEX 2013 (JEA), 21(1):2.2 (2016) ACM DL Author-ize
		  service
  3. Efficient Algorithms for Analyzing Segmental Duplications with Deletions and Inversions in Genomes . Crystal Kahn, Shay Mozes and Ben Raphael. Algorithms for Molecular Biology 2010, 5:11 pdf version
  4. Shortest Paths in Directed Planar Graphs with Negative Lengths: a Linear-Space O(n log2 n)-Time Algorithm. Philip Klein, Shay Mozes and Oren Weimann. Invited submission to ACM Transactions on Algorithms special issue for SODA 2009 (TALG), 6(2): (2010) ACM DL Author-ize
		  service
  5. Fast Algorithms for Computing Tree LCS. Shay Mozes, Dekel Tsur , Oren Weimann and Michal Ziv-Ukelson. Theoretical Computer Science, 410 (43): 4303-4314 (2009)  pdf version
  6. An Optimal Decomposition Algorithm for Tree Edit Distance. Erik Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann. ACM Transactions on Algorithms (TALG), 6(1): (2009) ACM DL Author-ize
		  service
  7. Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Shay Mozes, Yury Lifshits , Oren Weimann and Michal Ziv-Ukelson. Algorithmica, Vol.54 (3) (2009), Page 379 .  pdf version Algorithmica C++/Java Implementation
  8. A new construction for a QMA complete 3-local Hamiltonian. Daniel Nagaj and Shay Mozes. J. Math. Phys. 48, 072104 (2007). J.Math.Phys.  arXiv:quant-ph/0612113
  9. Deterministic Dense Coding with Partially Entangled states. Shay Mozes, Jonathan Oppenheim and Benni Reznik. Phys. Rev.  A. 71, 012311, (2005).  PRA  arXiv:quant-ph/0403189
  10. The effect of unitary noise on Grover's quantum search algorithm. Daniel Shapira, Shay Mozes and Ofer Biham. Phys. Rev.  A. 67, 042301, (2003).   PRA  arXiv:quant-ph/0307142

Book Chapters

  1. Recursive Separator Decompositions for Planar Graphs. Shay Mozes. Encyclopedia of Algorithms 2015.

smozesidcacil

Home