default search action
Shay Mozes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j20]Pawel Gawrychowski, Shay Mozes, Oren Weimann
:
Minimum Cut in O(mlog 2 n) Time. Theory Comput. Syst. 68(4): 814-834 (2024) - [c43]Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann
Õptimal Dynamic Time Warping on Run-Length Encoded Strings. ICALP 2024: 30:1-30:17 - 2023
- [j19]Panagiotis Charalampopoulos
Almost Optimal Exact Distance Oracles for Planar Graphs. J. ACM 70(2): 12:1-12:50 (2023) - [c42]Amir Abboud, Shay Mozes, Oren Weimann:
What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs? ESA 2023: 4:1-4:20 - [i35]Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann:
Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings. CoRR abs/2302.06252 (2023) - [i34]Amir Abboud, Shay Mozes, Oren Weimann:
What Else Can Voronoi Diagrams Do For Diameter In Planar Graphs? CoRR abs/2305.02946 (2023) - [i33]Shiri Chechik, Shay Mozes, Oren Weimann:
Õptimal Fault-Tolerant Reachability Labeling in Planar Graphs. CoRR abs/2307.07222 (2023) - 2022
- [j18]Panagiotis Charalampopoulos
Exact Distance Oracles for Planar Graphs with Failing Vertices. ACM Trans. Algorithms 18(2): 18:1-18:23 (2022) - [j17]Aviv Bar-Natan, Panagiotis Charalampopoulos
Fault-tolerant distance labeling for planar graphs. Theor. Comput. Sci. 918: 48-59 (2022) - [c41]Philip Bille
The Fine-Grained Complexity of Episode Matching. CPM 2022: 4:1-4:12 - [c40]Shay Mozes, Nathan Wallheimer, Oren Weimann:
Improved Compression of the Okamura-Seymour Metric. ISAAC 2022: 27:1-27:19 - [c39]Panagiotis Charalampopoulos
On the Hardness of Computing the Edit Distance of Shallow Trees. SPIRE 2022: 290-302 - [i32]Shay Mozes, Nathan Wallheimer, Oren Weimann:
Improved Compression of the Okamura-Seymour Metric. CoRR abs/2202.05127 (2022) - 2021
- [j16]Pawel Gawrychowski
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. SIAM J. Comput. 50(2): 509-554 (2021) - [c38]Panagiotis Charalampopoulos
An Almost Optimal Edit Distance Oracle. ICALP 2021: 48:1-48:20 - [c37]Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen:
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. ISAAC 2021: 25:1-25:12 - [c36]Julian Enoch, Kyle Fox, Dor Mesica, Shay Mozes:
A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities. ISAAC 2021: 72:1-72:16 - [c35]Aviv Bar-Natan, Panagiotis Charalampopoulos
Fault-Tolerant Distance Labeling for Planar Graphs. SIROCCO 2021: 315-333 - [c34]Pawel Gawrychowski
Planar Negative k-Cycle. SODA 2021: 2717-2724 - [c33]Pawel Gawrychowski
A Note on a Recent Algorithm for Minimum Cut. SOSA 2021: 74-79 - [i31]Dor Mesica, Shay Mozes:
A Note on Maximum Integer Flows in Directed Planar Graphs with Vertex Capacities. CoRR abs/2101.11300 (2021) - [i30]Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Fault-Tolerant Distance Labeling for Planar Graphs. CoRR abs/2102.07154 (2021) - [i29]Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
An Almost Optimal Edit Distance Oracle. CoRR abs/2103.03294 (2021) - [i28]Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann:
A Conditional Lower Bound for Episode Matching. CoRR abs/2108.08613 (2021) - 2020
- [j15]Pawel Gawrychowski, Shay Mozes
Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search. ACM Trans. Algorithms 16(2): 16:1-16:24 (2020) - [j14]Karl Bringmann, Pawel Gawrychowski
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can). ACM Trans. Algorithms 16(4): 48:1-48:22 (2020) - [j13]Pawel Gawrychowski
Compressed range minimum queries. Theor. Comput. Sci. 812: 39-48 (2020) - [c32]Panagiotis Charalampopoulos
Dynamic String Alignment. CPM 2020: 9:1-9:13 - [c31]Pawel Gawrychowski
Minimum Cut in O(m log² n) Time. ICALP 2020: 57:1-57:15 - [i27]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
A Note on a Recent Algorithm for Minimum Cut. CoRR abs/2008.02060 (2020) - [i26]Viktor Fredslund-Hansen, Shay Mozes, Christian Wulff-Nilsen:
Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs. CoRR abs/2009.14716 (2020)
2010 – 2019
- 2019
- [j12]Itay Laish, Shay Mozes
Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs. Theory Comput. Syst. 63(8): 1849-1874 (2019) - [c30]Panagiotis Charalampopoulos, Shay Mozes
Exact Distance Oracles for Planar Graphs with Failing Vertices. SODA 2019: 2110-2123 - [c29]Panagiotis Charalampopoulos
Almost optimal distance oracles for planar graphs. STOC 2019: 138-151 - [i25]Pawel Gawrychowski, Seungbum Jo, Shay Mozes, Oren Weimann:
Compressed Range Minimum Queries. CoRR abs/1902.04427 (2019) - [i24]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Minimum Cut in O(m log2n) Time. CoRR abs/1911.01145 (2019) - 2018
- [j11]Shay Mozes
Efficient Vertex-Label Distance Oracles for Planar Graphs. Theory Comput. Syst. 62(2): 419-440 (2018) - [j10]Pawel Gawrychowski, Gad M. Landau, Shay Mozes
The nearest colored node in a tree. Theor. Comput. Sci. 710: 66-73 (2018) - [j9]Shay Mozes
Faster shortest paths in dense distance graphs, with applications. Theor. Comput. Sci. 711: 11-35 (2018) - [c28]Hsien-Chih Chang, Pawel Gawrychowski
Near-Optimal Distance Emulator for Planar Graphs. ESA 2018: 16:1-16:17 - [c27]Shay Mozes
Minimum Cut of Directed Planar Graphs in O(n log log n) Time. SODA 2018: 477-494 - [c26]Pawel Gawrychowski, Haim Kaplan, Shay Mozes
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. SODA 2018: 495-514 - [c25]Pawel Gawrychowski, Shay Mozes
Better Tradeoffs for Exact Distance Oracles in Planar Graphs. SODA 2018: 515-529 - [c24]Amir Abboud, Pawel Gawrychowski, Shay Mozes
Near-Optimal Compression for the Planar Graph Metric. SODA 2018: 530-549 - [c23]Karl Bringmann, Pawel Gawrychowski, Shay Mozes
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). SODA 2018: 1190-1206 - [c22]Seungbum Jo, Shay Mozes
Compressed Range Minimum Queries. SPIRE 2018: 206-217 - [i23]Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Near-Optimal Distance Emulator for Planar Graphs. CoRR abs/1807.01478 (2018) - [i22]Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka:
Exact Distance Oracles for Planar Graphs with Failing Vertices. CoRR abs/1807.05968 (2018) - [i21]Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Almost Optimal Distance Oracles for Planar Graphs. CoRR abs/1811.01551 (2018) - 2017
- [j8]Glencora Borradaile, Philip N. Klein, Shay Mozes
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. SIAM J. Comput. 46(4): 1280-1303 (2017) - [j7]Haim Kaplan, Shay Mozes
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications. ACM Trans. Algorithms 13(2): 26:1-26:42 (2017) - [c21]Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes
Dispersion on Trees. ESA 2017: 40:1-40:13 - [c20]Itay Laish, Shay Mozes
Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs. WAOA 2017: 269-284 - [i20]Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Near-Optimal Compression for the Planar Graph Metric. CoRR abs/1703.04814 (2017) - [i19]Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). CoRR abs/1703.08940 (2017) - [i18]Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n5/3) time. CoRR abs/1704.02793 (2017) - [i17]Pawel Gawrychowski, Nadav Krasnopolsky, Shay Mozes, Oren Weimann:
Dispersion on Trees. CoRR abs/1706.09185 (2017) - [i16]Itay Laish, Shay Mozes:
Efficient Approximate Distance Oracles for Vertex-Labeled Planar Graphs. CoRR abs/1707.02414 (2017) - [i15]Pawel Gawrychowski, Shay Mozes, Oren Weimann, Christian Wulff-Nilsen:
Better Tradeoffs for Exact Distance Oracles in Planar Graphs. CoRR abs/1708.01386 (2017) - 2016
- [j6]Eli Fox-Epstein, Shay Mozes
Short and Simple Cycle Separators in Planar Graphs. ACM J. Exp. Algorithmics 21(1): 2.2:1-2.2:24 (2016) - [c19]Pawel Gawrychowski, Gad M. Landau, Shay Mozes
The Nearest Colored Node in a Tree. CPM 2016: 25:1-25:12 - [r1]Shay Mozes
Recursive Separator Decompositions for Planar Graphs. Encyclopedia of Algorithms 2016: 1797-1801 - 2015
- [c18]Pawel Gawrychowski, Shay Mozes
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search. ICALP (1) 2015: 580-592 - [c17]Kyle Fox, Philip N. Klein, Shay Mozes
A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection. STOC 2015: 841-850 - [c16]Shay Mozes
Efficient Vertex-Label Distance Oracles for Planar Graphs. WAOA 2015: 97-109 - [i14]Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Search. CoRR abs/1502.07663 (2015) - [i13]Shay Mozes, Eyal E. Skop:
Efficient Vertex-Label Distance Oracles for Planar Graphs. CoRR abs/1504.04690 (2015) - [i12]Kyle Fox, Philip N. Klein, Shay Mozes:
A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection. CoRR abs/1504.08008 (2015) - [i11]Shay Mozes, Cyril Nikolaev, Yahav Nussbaum, Oren Weimann:
Minimum Cut of Directed Planar Graphs in O(nloglogn) Time. CoRR abs/1512.02068 (2015) - 2014
- [c15]Pawel Gawrychowski, Shay Mozes
Improved Submatrix Maximum Queries in Monge Matrices. ICALP (1) 2014: 525-537 - [i10]Shay Mozes, Yahav Nussbaum, Oren Weimann:
Faster Shortest Paths in Dense Distance Graphs, with Applications. CoRR abs/1404.0977 (2014) - 2013
- [b1]Shay Mozes:
Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in Planar Graphs. Brown University, USA, 2013 - [c14]Eli Fox-Epstein, Shay Mozes
Short and Simple Cycle Separators in Planar Graphs. ALENEX 2013: 26-40 - [c13]Philip N. Klein, Shay Mozes
Structured recursive separator decompositions for planar graphs in linear time. STOC 2013: 505-514 - [i9]Shay Mozes, Oren Weimann:
Improved Submatrix Maximum Queries in Monge Matrices. CoRR abs/1307.2313 (2013) - 2012
- [c12]Shay Mozes
Exact distance oracles for planar graphs. SODA 2012: 209-222 - [c11]Haim Kaplan, Shay Mozes
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. SODA 2012: 338-355 - [i8]Philip N. Klein, Shay Mozes, Christian Sommer:
Structured Recursive Separator Decompositions for Planar Graphs in Linear Time. CoRR abs/1208.2223 (2012) - 2011
- [c10]Glencora Borradaile, Philip N. Klein, Shay Mozes
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. FOCS 2011: 170-179 - [c9]Philip N. Klein, Shay Mozes
Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time. WADS 2011: 571-582 - [i7]Philip N. Klein, Shay Mozes:
Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time. CoRR abs/1104.4728 (2011) - [i6]Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen:
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. CoRR abs/1105.2228 (2011) - 2010
- [j5]Crystal L. Kahn, Shay Mozes
Efficient algorithms for analyzing segmental duplications with deletions and inversions in genomes. Algorithms Mol. Biol. 5: 11 (2010) - [j4]Philip N. Klein, Shay Mozes
Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm. ACM Trans. Algorithms 6(2): 30:1-30:18 (2010) - [c8]Shay Mozes
Shortest Paths in Planar Graphs with Real Lengths in O(nlog2n/loglogn) Time. ESA (2) 2010: 206-217 - [c7]Aparna Das, Claire Mathieu, Shay Mozes
The Train Delivery Problem - Vehicle Routing Meets Bin Packing. WAOA 2010: 94-105 - [i5]Philip N. Klein, Shay Mozes:
Multiple-source single-sink maximum flow in directed planar graphs in $O(n^{1.5} \log n)$ time. CoRR abs/1008.5332 (2010) - [i4]Shay Mozes, Christian Sommer:
Exact Shortest Path Queries for Planar Graphs Using Linear Space. CoRR abs/1011.5549 (2010) - [i3]Shay Mozes:
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in $O(n^{1.5} \log n)$ Time. CoRR abs/1012.5870 (2010)
2000 – 2009
- 2009
- [j3]Yury Lifshits, Shay Mozes
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Algorithmica 54(3): 379-399 (2009) - [j2]Erik D. Demaine, Shay Mozes
An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms 6(1): 2:1-2:19 (2009) - [j1]Shay Mozes
Fast algorithms for computing tree LCS. Theor. Comput. Sci. 410(43): 4303-4314 (2009) - [c6]Philip N. Klein, Shay Mozes
Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log2 n)-time algorithm. SODA 2009: 236-245 - [c5]Crystal L. Kahn, Shay Mozes
Efficient Algorithms for Analyzing Segmental Duplications, Deletions, and Inversions in Genomes. WABI 2009: 169-180 - [i2]Shay Mozes, Christian Wulff-Nilsen:
Shortest Paths in Planar Graphs with Real Lengths in $O(n\log^2n/\log\log n)$ Time. CoRR abs/0911.4963 (2009) - 2008
- [c4]Shay Mozes
Fast Algorithms for Computing Tree LCS. CPM 2008: 230-243 - [c3]Shay Mozes, Krzysztof Onak, Oren Weimann:
Finding an optimal tree searching strategy in linear time. SODA 2008: 1096-1105 - 2007
- [c2]Shay Mozes
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. CPM 2007: 4-15 - [c1]Erik D. Demaine, Shay Mozes
An Optimal Decomposition Algorithm for Tree Edit Distance. ICALP 2007: 146-157 - 2006
- [i1]Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann:
An O(n^3)-Time Algorithm for Tree Edit Distance. CoRR abs/cs/0604037 (2006)
Coauthor Index
[j20] [c43] [j19] [c42] [i35] [i34] [i33] [j17] [c41] [c40] [c39] [i32] [j16] [c38] [c35] [c34] [c33] [i30] [i29] [i28] [j15] [j14] [j13] [c31] [i27] [c29] [i25] [i24] [j10] [j9] [c28] [c27] [c26] [c25] [c24] [c23] [c22] [i23] [i21] [c21] [i20] [i19] [i18] [i17] [i15] [c19] [c18] [i14] [i11] [c15] [i10] [i9] [j4] [j3] [j2] [j1] [c6] [c4] [c3] [c2] [c1] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: