Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Shay Mozes
@article{DBLP:journals/jacm/CharalampopoulosGLMPWW23,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Yaowei Long and
Shay Mozes and
Seth Pettie and
Oren Weimann and
Christian Wulff{-}Nilsen},
title = {Almost Optimal Exact Distance Oracles for Planar Graphs},
journal = {J. {ACM}},
volume = {70},
number = {2},
pages = {12:1--12:50},
year = {2023},
url = {https://doi.org/10.1145/3580474},
doi = {10.1145/3580474},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CharalampopoulosGLMPWW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AbboudMW23,
author = {Amir Abboud and
Shay Mozes and
Oren Weimann},
editor = {Inge Li G{\o}rtz and
Martin Farach{-}Colton and
Simon J. Puglisi and
Grzegorz Herman},
title = {What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs?},
booktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September
4-6, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {274},
pages = {4:1--4:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ESA.2023.4},
doi = {10.4230/LIPICS.ESA.2023.4},
timestamp = {Wed, 30 Aug 2023 15:40:45 +0200},
biburl = {https://dblp.org/rec/conf/esa/AbboudMW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-06252,
author = {Itai Boneh and
Shay Golan and
Shay Mozes and
Oren Weimann},
title = {Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings},
journal = {CoRR},
volume = {abs/2302.06252},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.06252},
doi = {10.48550/ARXIV.2302.06252},
eprinttype = {arXiv},
eprint = {2302.06252},
timestamp = {Mon, 20 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-06252.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-02946,
author = {Amir Abboud and
Shay Mozes and
Oren Weimann},
title = {What Else Can Voronoi Diagrams Do For Diameter In Planar Graphs?},
journal = {CoRR},
volume = {abs/2305.02946},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.02946},
doi = {10.48550/ARXIV.2305.02946},
eprinttype = {arXiv},
eprint = {2305.02946},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-02946.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-07222,
author = {Shiri Chechik and
Shay Mozes and
Oren Weimann},
title = {{\~{O}}ptimal Fault-Tolerant Reachability Labeling in Planar Graphs},
journal = {CoRR},
volume = {abs/2307.07222},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.07222},
doi = {10.48550/ARXIV.2307.07222},
eprinttype = {arXiv},
eprint = {2307.07222},
timestamp = {Mon, 24 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-07222.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Charalampopoulos22,
author = {Panagiotis Charalampopoulos and
Shay Mozes and
Benjamin Tebeka},
title = {Exact Distance Oracles for Planar Graphs with Failing Vertices},
journal = {{ACM} Trans. Algorithms},
volume = {18},
number = {2},
pages = {18:1--18:23},
year = {2022},
url = {https://doi.org/10.1145/3511541},
doi = {10.1145/3511541},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/Charalampopoulos22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bar-NatanCGMW22,
author = {Aviv Bar{-}Natan and
Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Fault-tolerant distance labeling for planar graphs},
journal = {Theor. Comput. Sci.},
volume = {918},
pages = {48--59},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.03.020},
doi = {10.1016/J.TCS.2022.03.020},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Bar-NatanCGMW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BilleGMSW22,
author = {Philip Bille and
Inge Li G{\o}rtz and
Shay Mozes and
Teresa Anna Steiner and
Oren Weimann},
editor = {Hideo Bannai and
Jan Holub},
title = {The Fine-Grained Complexity of Episode Matching},
booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2022,
June 27-29, 2022, Prague, Czech Republic},
series = {LIPIcs},
volume = {223},
pages = {4:1--4:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CPM.2022.4},
doi = {10.4230/LIPICS.CPM.2022.4},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/BilleGMSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MozesWW22,
author = {Shay Mozes and
Nathan Wallheimer and
Oren Weimann},
editor = {Sang Won Bae and
Heejin Park},
title = {Improved Compression of the Okamura-Seymour Metric},
booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC}
2022, December 19-21, 2022, Seoul, Korea},
series = {LIPIcs},
volume = {248},
pages = {27:1--27:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.27},
doi = {10.4230/LIPICS.ISAAC.2022.27},
timestamp = {Wed, 14 Dec 2022 11:53:14 +0100},
biburl = {https://dblp.org/rec/conf/isaac/MozesWW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/Charalampopoulos22a,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Diego Arroyuelo and
Barbara Poblete},
title = {On the Hardness of Computing the Edit Distance of Shallow Trees},
booktitle = {String Processing and Information Retrieval - 29th International Symposium,
{SPIRE} 2022, Concepci{\'{o}}n, Chile, November 8-10, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13617},
pages = {290--302},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-20643-6\_21},
doi = {10.1007/978-3-031-20643-6\_21},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spire/Charalampopoulos22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-05127,
author = {Shay Mozes and
Nathan Wallheimer and
Oren Weimann},
title = {Improved Compression of the Okamura-Seymour Metric},
journal = {CoRR},
volume = {abs/2202.05127},
year = {2022},
url = {https://arxiv.org/abs/2202.05127},
eprinttype = {arXiv},
eprint = {2202.05127},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-05127.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GawrychowskiKMS21,
author = {Pawel Gawrychowski and
Haim Kaplan and
Shay Mozes and
Micha Sharir and
Oren Weimann},
title = {Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic
{\~{O}}(n\({}^{\mbox{5/3}}\)) Time},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {2},
pages = {509--554},
year = {2021},
url = {https://doi.org/10.1137/18M1193402},
doi = {10.1137/18M1193402},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GawrychowskiKMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Charalampopoulos21,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {An Almost Optimal Edit Distance Oracle},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {48:1--48:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.48},
doi = {10.4230/LIPICS.ICALP.2021.48},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Charalampopoulos21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Fredslund-Hansen21,
author = {Viktor Fredslund{-}Hansen and
Shay Mozes and
Christian Wulff{-}Nilsen},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {Truly Subquadratic Exact Distance Oracles with Constant Query Time
for Planar Graphs},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {25:1--25:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.25},
doi = {10.4230/LIPICS.ISAAC.2021.25},
timestamp = {Tue, 30 Nov 2021 14:09:45 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Fredslund-Hansen21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/EnochFMM21,
author = {Julian Enoch and
Kyle Fox and
Dor Mesica and
Shay Mozes},
editor = {Hee{-}Kap Ahn and
Kunihiko Sadakane},
title = {A Faster Algorithm for Maximum Flow in Directed Planar Graphs with
Vertex Capacities},
booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC}
2021, December 6-8, 2021, Fukuoka, Japan},
series = {LIPIcs},
volume = {212},
pages = {72:1--72:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.72},
doi = {10.4230/LIPICS.ISAAC.2021.72},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/EnochFMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/Bar-NatanCGMW21,
author = {Aviv Bar{-}Natan and
Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Tomasz Jurdzinski and
Stefan Schmid},
title = {Fault-Tolerant Distance Labeling for Planar Graphs},
booktitle = {Structural Information and Communication Complexity - 28th International
Colloquium, {SIROCCO} 2021, Wroc{\l}aw, Poland, June 28 - July 1,
2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12810},
pages = {315--333},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79527-6\_18},
doi = {10.1007/978-3-030-79527-6\_18},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/Bar-NatanCGMW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GawrychowskiMW21,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {D{\'{a}}niel Marx},
title = {Planar Negative \emph{k}-Cycle},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {2717--2724},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.161},
doi = {10.1137/1.9781611976465.161},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GawrychowskiMW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/GawrychowskiMW21,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Hung Viet Le and
Valerie King},
title = {A Note on a Recent Algorithm for Minimum Cut},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {74--79},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.8},
doi = {10.1137/1.9781611976496.8},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/GawrychowskiMW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-11300,
author = {Dor Mesica and
Shay Mozes},
title = {A Note on Maximum Integer Flows in Directed Planar Graphs with Vertex
Capacities},
journal = {CoRR},
volume = {abs/2101.11300},
year = {2021},
url = {https://arxiv.org/abs/2101.11300},
eprinttype = {arXiv},
eprint = {2101.11300},
timestamp = {Sun, 31 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-11300.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-07154,
author = {Aviv Bar{-}Natan and
Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Fault-Tolerant Distance Labeling for Planar Graphs},
journal = {CoRR},
volume = {abs/2102.07154},
year = {2021},
url = {https://arxiv.org/abs/2102.07154},
eprinttype = {arXiv},
eprint = {2102.07154},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-07154.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-03294,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {An Almost Optimal Edit Distance Oracle},
journal = {CoRR},
volume = {abs/2103.03294},
year = {2021},
url = {https://arxiv.org/abs/2103.03294},
eprinttype = {arXiv},
eprint = {2103.03294},
timestamp = {Mon, 15 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-03294.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-08613,
author = {Philip Bille and
Inge Li G{\o}rtz and
Shay Mozes and
Teresa Anna Steiner and
Oren Weimann},
title = {A Conditional Lower Bound for Episode Matching},
journal = {CoRR},
volume = {abs/2108.08613},
year = {2021},
url = {https://arxiv.org/abs/2108.08613},
eprinttype = {arXiv},
eprint = {2108.08613},
timestamp = {Mon, 23 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-08613.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GawrychowskiMW20,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Submatrix Maximum Queries in Monge and Partial Monge Matrices Are
Equivalent to Predecessor Search},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {2},
pages = {16:1--16:24},
year = {2020},
url = {https://doi.org/10.1145/3381416},
doi = {10.1145/3381416},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GawrychowskiMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BringmannGMW20,
author = {Karl Bringmann and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless
{APSP} Can)},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {4},
pages = {48:1--48:22},
year = {2020},
url = {https://doi.org/10.1145/3381878},
doi = {10.1145/3381878},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BringmannGMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GawrychowskiJMW20,
author = {Pawel Gawrychowski and
Seungbum Jo and
Shay Mozes and
Oren Weimann},
title = {Compressed range minimum queries},
journal = {Theor. Comput. Sci.},
volume = {812},
pages = {39--48},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2019.07.002},
doi = {10.1016/J.TCS.2019.07.002},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GawrychowskiJMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Charalampopoulos20a,
author = {Panagiotis Charalampopoulos and
Tomasz Kociumaka and
Shay Mozes},
editor = {Inge Li G{\o}rtz and
Oren Weimann},
title = {Dynamic String Alignment},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching, {CPM} 2020,
June 17-19, 2020, Copenhagen, Denmark},
series = {LIPIcs},
volume = {161},
pages = {9:1--9:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CPM.2020.9},
doi = {10.4230/LIPICS.CPM.2020.9},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Charalampopoulos20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GawrychowskiMW20,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Minimum Cut in O(m log{\({^2}\)} n) Time},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {57:1--57:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.57},
doi = {10.4230/LIPICS.ICALP.2020.57},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GawrychowskiMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-02060,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {A Note on a Recent Algorithm for Minimum Cut},
journal = {CoRR},
volume = {abs/2008.02060},
year = {2020},
url = {https://arxiv.org/abs/2008.02060},
eprinttype = {arXiv},
eprint = {2008.02060},
timestamp = {Fri, 07 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-02060.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-14716,
author = {Viktor Fredslund{-}Hansen and
Shay Mozes and
Christian Wulff{-}Nilsen},
title = {Truly Subquadratic Exact Distance Oracles with Constant Query Time
for Planar Graphs},
journal = {CoRR},
volume = {abs/2009.14716},
year = {2020},
url = {https://arxiv.org/abs/2009.14716},
eprinttype = {arXiv},
eprint = {2009.14716},
timestamp = {Wed, 07 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-14716.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LaishM19,
author = {Itay Laish and
Shay Mozes},
title = {Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled
Planar Graphs},
journal = {Theory Comput. Syst.},
volume = {63},
number = {8},
pages = {1849--1874},
year = {2019},
url = {https://doi.org/10.1007/s00224-019-09949-5},
doi = {10.1007/S00224-019-09949-5},
timestamp = {Tue, 26 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/LaishM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Charalampopoulos19,
author = {Panagiotis Charalampopoulos and
Shay Mozes and
Benjamin Tebeka},
editor = {Timothy M. Chan},
title = {Exact Distance Oracles for Planar Graphs with Failing Vertices},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {2110--2123},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.127},
doi = {10.1137/1.9781611975482.127},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/Charalampopoulos19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Charalampopoulos19,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Moses Charikar and
Edith Cohen},
title = {Almost optimal distance oracles for planar graphs},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {138--151},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316316},
doi = {10.1145/3313276.3316316},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Charalampopoulos19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-04427,
author = {Pawel Gawrychowski and
Seungbum Jo and
Shay Mozes and
Oren Weimann},
title = {Compressed Range Minimum Queries},
journal = {CoRR},
volume = {abs/1902.04427},
year = {2019},
url = {http://arxiv.org/abs/1902.04427},
eprinttype = {arXiv},
eprint = {1902.04427},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-04427.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-01145,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Minimum Cut in O(m log\({}^{\mbox{2}}\)n) Time},
journal = {CoRR},
volume = {abs/1911.01145},
year = {2019},
url = {http://arxiv.org/abs/1911.01145},
eprinttype = {arXiv},
eprint = {1911.01145},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-01145.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MozesS18,
author = {Shay Mozes and
Eyal E. Skop},
title = {Efficient Vertex-Label Distance Oracles for Planar Graphs},
journal = {Theory Comput. Syst.},
volume = {62},
number = {2},
pages = {419--440},
year = {2018},
url = {https://doi.org/10.1007/s00224-017-9827-0},
doi = {10.1007/S00224-017-9827-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/MozesS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GawrychowskiLMW18,
author = {Pawel Gawrychowski and
Gad M. Landau and
Shay Mozes and
Oren Weimann},
title = {The nearest colored node in a tree},
journal = {Theor. Comput. Sci.},
volume = {710},
pages = {66--73},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.08.021},
doi = {10.1016/J.TCS.2017.08.021},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GawrychowskiLMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MozesNW18,
author = {Shay Mozes and
Yahav Nussbaum and
Oren Weimann},
title = {Faster shortest paths in dense distance graphs, with applications},
journal = {Theor. Comput. Sci.},
volume = {711},
pages = {11--35},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.10.034},
doi = {10.1016/J.TCS.2017.10.034},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/MozesNW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChangGMW18,
author = {Hsien{-}Chih Chang and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Near-Optimal Distance Emulator for Planar Graphs},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {16:1--16:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.16},
doi = {10.4230/LIPICS.ESA.2018.16},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/ChangGMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MozesNNW18,
author = {Shay Mozes and
Kirill Nikolaev and
Yahav Nussbaum and
Oren Weimann},
editor = {Artur Czumaj},
title = {Minimum Cut of Directed Planar Graphs in \emph{O}(\emph{n} log log
\emph{n}) Time},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {477--494},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.32},
doi = {10.1137/1.9781611975031.32},
timestamp = {Thu, 11 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/MozesNNW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GawrychowskiKMS18,
author = {Pawel Gawrychowski and
Haim Kaplan and
Shay Mozes and
Micha Sharir and
Oren Weimann},
editor = {Artur Czumaj},
title = {Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic
\emph{{\~{O}}}(\emph{n}\({}^{\mbox{5/3}}\)) Time},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {495--514},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.33},
doi = {10.1137/1.9781611975031.33},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GawrychowskiKMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GawrychowskiMWW18,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann and
Christian Wulff{-}Nilsen},
editor = {Artur Czumaj},
title = {Better Tradeoffs for Exact Distance Oracles in Planar Graphs},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {515--529},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.34},
doi = {10.1137/1.9781611975031.34},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GawrychowskiMWW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AbboudGMW18,
author = {Amir Abboud and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Artur Czumaj},
title = {Near-Optimal Compression for the Planar Graph Metric},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {530--549},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.35},
doi = {10.1137/1.9781611975031.35},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AbboudGMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BringmannGMW18,
author = {Karl Bringmann and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Artur Czumaj},
title = {Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless
{APSP} can)},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1190--1206},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.77},
doi = {10.1137/1.9781611975031.77},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BringmannGMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/JoMW18,
author = {Seungbum Jo and
Shay Mozes and
Oren Weimann},
editor = {Travis Gagie and
Alistair Moffat and
Gonzalo Navarro and
Ernesto Cuadros{-}Vargas},
title = {Compressed Range Minimum Queries},
booktitle = {String Processing and Information Retrieval - 25th International Symposium,
{SPIRE} 2018, Lima, Peru, October 9-11, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11147},
pages = {206--217},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00479-8\_17},
doi = {10.1007/978-3-030-00479-8\_17},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/spire/JoMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-01478,
author = {Hsien{-}Chih Chang and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Near-Optimal Distance Emulator for Planar Graphs},
journal = {CoRR},
volume = {abs/1807.01478},
year = {2018},
url = {http://arxiv.org/abs/1807.01478},
eprinttype = {arXiv},
eprint = {1807.01478},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-01478.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-05968,
author = {Panagiotis Charalampopoulos and
Shay Mozes and
Benjamin Tebeka},
title = {Exact Distance Oracles for Planar Graphs with Failing Vertices},
journal = {CoRR},
volume = {abs/1807.05968},
year = {2018},
url = {http://arxiv.org/abs/1807.05968},
eprinttype = {arXiv},
eprint = {1807.05968},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-05968.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-01551,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Almost Optimal Distance Oracles for Planar Graphs},
journal = {CoRR},
volume = {abs/1811.01551},
year = {2018},
url = {http://arxiv.org/abs/1811.01551},
eprinttype = {arXiv},
eprint = {1811.01551},
timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-01551.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BorradaileKMNW17,
author = {Glencora Borradaile and
Philip N. Klein and
Shay Mozes and
Yahav Nussbaum and
Christian Wulff{-}Nilsen},
title = {Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs
in Near-Linear Time},
journal = {{SIAM} J. Comput.},
volume = {46},
number = {4},
pages = {1280--1303},
year = {2017},
url = {https://doi.org/10.1137/15M1042929},
doi = {10.1137/15M1042929},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BorradaileKMNW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KaplanMNS17,
author = {Haim Kaplan and
Shay Mozes and
Yahav Nussbaum and
Micha Sharir},
title = {Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices,
and Their Applications},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {2},
pages = {26:1--26:42},
year = {2017},
url = {https://doi.org/10.1145/3039873},
doi = {10.1145/3039873},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/KaplanMNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GawrychowskiKMW17,
author = {Pawel Gawrychowski and
Nadav Krasnopolsky and
Shay Mozes and
Oren Weimann},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Dispersion on Trees},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {40:1--40:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.40},
doi = {10.4230/LIPICS.ESA.2017.40},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/GawrychowskiKMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/LaishM17,
author = {Itay Laish and
Shay Mozes},
editor = {Roberto Solis{-}Oba and
Rudolf Fleischer},
title = {Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled
Planar Graphs},
booktitle = {Approximation and Online Algorithms - 15th International Workshop,
{WAOA} 2017, Vienna, Austria, September 7-8, 2017, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10787},
pages = {269--284},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-89441-6\_20},
doi = {10.1007/978-3-319-89441-6\_20},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/LaishM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbboudGMW17,
author = {Amir Abboud and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Near-Optimal Compression for the Planar Graph Metric},
journal = {CoRR},
volume = {abs/1703.04814},
year = {2017},
url = {http://arxiv.org/abs/1703.04814},
eprinttype = {arXiv},
eprint = {1703.04814},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbboudGMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BringmannGMW17,
author = {Karl Bringmann and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless
{APSP} can)},
journal = {CoRR},
volume = {abs/1703.08940},
year = {2017},
url = {http://arxiv.org/abs/1703.08940},
eprinttype = {arXiv},
eprint = {1703.08940},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BringmannGMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiKMS17,
author = {Pawel Gawrychowski and
Haim Kaplan and
Shay Mozes and
Micha Sharir and
Oren Weimann},
title = {Voronoi diagrams on planar graphs, and computing the diameter in deterministic
O{\~}(n\({}^{\mbox{5/3}}\)) time},
journal = {CoRR},
volume = {abs/1704.02793},
year = {2017},
url = {http://arxiv.org/abs/1704.02793},
eprinttype = {arXiv},
eprint = {1704.02793},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiKMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiKMW17,
author = {Pawel Gawrychowski and
Nadav Krasnopolsky and
Shay Mozes and
Oren Weimann},
title = {Dispersion on Trees},
journal = {CoRR},
volume = {abs/1706.09185},
year = {2017},
url = {http://arxiv.org/abs/1706.09185},
eprinttype = {arXiv},
eprint = {1706.09185},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiKMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LaishM17,
author = {Itay Laish and
Shay Mozes},
title = {Efficient Approximate Distance Oracles for Vertex-Labeled Planar Graphs},
journal = {CoRR},
volume = {abs/1707.02414},
year = {2017},
url = {http://arxiv.org/abs/1707.02414},
eprinttype = {arXiv},
eprint = {1707.02414},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LaishM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-01386,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann and
Christian Wulff{-}Nilsen},
title = {Better Tradeoffs for Exact Distance Oracles in Planar Graphs},
journal = {CoRR},
volume = {abs/1708.01386},
year = {2017},
url = {http://arxiv.org/abs/1708.01386},
eprinttype = {arXiv},
eprint = {1708.01386},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-01386.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Fox-EpsteinMP016,
author = {Eli Fox{-}Epstein and
Shay Mozes and
Phitchaya Mangpo Phothilimthana and
Christian Sommer},
title = {Short and Simple Cycle Separators in Planar Graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {2.2:1--2.2:24},
year = {2016},
url = {https://doi.org/10.1145/2957318},
doi = {10.1145/2957318},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Fox-EpsteinMP016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GawrychowskiLMW16,
author = {Pawel Gawrychowski and
Gad M. Landau and
Shay Mozes and
Oren Weimann},
editor = {Roberto Grossi and
Moshe Lewenstein},
title = {The Nearest Colored Node in a Tree},
booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2016,
June 27-29, 2016, Tel Aviv, Israel},
series = {LIPIcs},
volume = {54},
pages = {25:1--25:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CPM.2016.25},
doi = {10.4230/LIPICS.CPM.2016.25},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/cpm/GawrychowskiLMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Mozes16,
author = {Shay Mozes},
title = {Recursive Separator Decompositions for Planar Graphs},
booktitle = {Encyclopedia of Algorithms},
pages = {1797--1801},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_682},
doi = {10.1007/978-1-4939-2864-4\_682},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Mozes16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GawrychowskiMW15,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor
Search},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {580--592},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_47},
doi = {10.1007/978-3-662-47672-7\_47},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GawrychowskiMW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FoxKM15,
author = {Kyle Fox and
Philip N. Klein and
Shay Mozes},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {841--850},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746564},
doi = {10.1145/2746539.2746564},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FoxKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/MozesS15,
author = {Shay Mozes and
Eyal E. Skop},
editor = {Laura Sanit{\`{a}} and
Martin Skutella},
title = {Efficient Vertex-Label Distance Oracles for Planar Graphs},
booktitle = {Approximation and Online Algorithms - 13th International Workshop,
{WAOA} 2015, Patras, Greece, September 17-18, 2015. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9499},
pages = {97--109},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-28684-6\_9},
doi = {10.1007/978-3-319-28684-6\_9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/MozesS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiMW15,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
title = {Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor
Search},
journal = {CoRR},
volume = {abs/1502.07663},
year = {2015},
url = {http://arxiv.org/abs/1502.07663},
eprinttype = {arXiv},
eprint = {1502.07663},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiMW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MozesS15,
author = {Shay Mozes and
Eyal E. Skop},
title = {Efficient Vertex-Label Distance Oracles for Planar Graphs},
journal = {CoRR},
volume = {abs/1504.04690},
year = {2015},
url = {http://arxiv.org/abs/1504.04690},
eprinttype = {arXiv},
eprint = {1504.04690},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MozesS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FoxKM15,
author = {Kyle Fox and
Philip N. Klein and
Shay Mozes},
title = {A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection},
journal = {CoRR},
volume = {abs/1504.08008},
year = {2015},
url = {http://arxiv.org/abs/1504.08008},
eprinttype = {arXiv},
eprint = {1504.08008},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FoxKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MozesNNW15,
author = {Shay Mozes and
Cyril Nikolaev and
Yahav Nussbaum and
Oren Weimann},
title = {Minimum Cut of Directed Planar Graphs in O(nloglogn) Time},
journal = {CoRR},
volume = {abs/1512.02068},
year = {2015},
url = {http://arxiv.org/abs/1512.02068},
eprinttype = {arXiv},
eprint = {1512.02068},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MozesNNW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GawrychowskiMW14,
author = {Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Improved Submatrix Maximum Queries in Monge Matrices},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {525--537},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_44},
doi = {10.1007/978-3-662-43948-7\_44},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GawrychowskiMW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MozesNW14,
author = {Shay Mozes and
Yahav Nussbaum and
Oren Weimann},
title = {Faster Shortest Paths in Dense Distance Graphs, with Applications},
journal = {CoRR},
volume = {abs/1404.0977},
year = {2014},
url = {http://arxiv.org/abs/1404.0977},
eprinttype = {arXiv},
eprint = {1404.0977},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MozesNW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Mozes13,
author = {Shay Mozes},
title = {Efficient Algorithms for Shortest-Path and Maximum-Flow Problems in
Planar Graphs},
school = {Brown University, {USA}},
year = {2013},
url = {https://cs.brown.edu/research/pubs/theses/phd/2013/mozes.pdf},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Mozes13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Fox-EpsteinMPS13,
author = {Eli Fox{-}Epstein and
Shay Mozes and
Phitchaya Mangpo Phothilimthana and
Christian Sommer},
editor = {Peter Sanders and
Norbert Zeh},
title = {Short and Simple Cycle Separators in Planar Graphs},
booktitle = {Proceedings of the 15th Meeting on Algorithm Engineering and Experiments,
{ALENEX} 2013, New Orleans, Louisiana, USA, January 7, 2013},
pages = {26--40},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611972931.3},
doi = {10.1137/1.9781611972931.3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/Fox-EpsteinMPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KleinMS13,
author = {Philip N. Klein and
Shay Mozes and
Christian Sommer},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Structured recursive separator decompositions for planar graphs in
linear time},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {505--514},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488672},
doi = {10.1145/2488608.2488672},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KleinMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MozesW13,
author = {Shay Mozes and
Oren Weimann},
title = {Improved Submatrix Maximum Queries in Monge Matrices},
journal = {CoRR},
volume = {abs/1307.2313},
year = {2013},
url = {http://arxiv.org/abs/1307.2313},
eprinttype = {arXiv},
eprint = {1307.2313},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MozesW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MozesS12,
author = {Shay Mozes and
Christian Sommer},
editor = {Yuval Rabani},
title = {Exact distance oracles for planar graphs},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {209--222},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.19},
doi = {10.1137/1.9781611973099.19},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/MozesS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KaplanMNS12,
author = {Haim Kaplan and
Shay Mozes and
Yahav Nussbaum and
Micha Sharir},
editor = {Yuval Rabani},
title = {Submatrix maximum queries in Monge matrices and Monge partial matrices,
and their applications},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {338--355},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.31},
doi = {10.1137/1.9781611973099.31},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KaplanMNS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-2223,
author = {Philip N. Klein and
Shay Mozes and
Christian Sommer},
title = {Structured Recursive Separator Decompositions for Planar Graphs in
Linear Time},
journal = {CoRR},
volume = {abs/1208.2223},
year = {2012},
url = {http://arxiv.org/abs/1208.2223},
eprinttype = {arXiv},
eprint = {1208.2223},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-2223.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BorradaileKMNW11,
author = {Glencora Borradaile and
Philip N. Klein and
Shay Mozes and
Yahav Nussbaum and
Christian Wulff{-}Nilsen},
editor = {Rafail Ostrovsky},
title = {Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs
in Near-Linear Time},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {170--179},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.73},
doi = {10.1109/FOCS.2011.73},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BorradaileKMNW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/KleinM11,
author = {Philip N. Klein and
Shay Mozes},
editor = {Frank Dehne and
John Iacono and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs
in O(diameter {\(\cdot\)} n log n) Time},
booktitle = {Algorithms and Data Structures - 12th International Symposium, {WADS}
2011, New York, NY, USA, August 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6844},
pages = {571--582},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22300-6\_48},
doi = {10.1007/978-3-642-22300-6\_48},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/KleinM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4728,
author = {Philip N. Klein and
Shay Mozes},
title = {Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs
in O(diameter*n*log(n)) Time},
journal = {CoRR},
volume = {abs/1104.4728},
year = {2011},
url = {http://arxiv.org/abs/1104.4728},
eprinttype = {arXiv},
eprint = {1104.4728},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-4728.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-2228,
author = {Glencora Borradaile and
Philip N. Klein and
Shay Mozes and
Yahav Nussbaum and
Christian Wulff{-}Nilsen},
title = {Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs
in Near-Linear Time},
journal = {CoRR},
volume = {abs/1105.2228},
year = {2011},
url = {http://arxiv.org/abs/1105.2228},
eprinttype = {arXiv},
eprint = {1105.2228},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1105-2228.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/KahnMR10,
author = {Crystal L. Kahn and
Shay Mozes and
Benjamin J. Raphael},
title = {Efficient algorithms for analyzing segmental duplications with deletions
and inversions in genomes},
journal = {Algorithms Mol. Biol.},
volume = {5},
pages = {11},
year = {2010},
url = {https://doi.org/10.1186/1748-7188-5-11},
doi = {10.1186/1748-7188-5-11},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/KahnMR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KleinMW10,
author = {Philip N. Klein and
Shay Mozes and
Oren Weimann},
title = {Shortest paths in directed planar graphs with negative lengths: {A}
linear-space \emph{O}(\emph{n} log\({}^{\mbox{2}}\) \emph{n})-time
algorithm},
journal = {{ACM} Trans. Algorithms},
volume = {6},
number = {2},
pages = {30:1--30:18},
year = {2010},
url = {https://doi.org/10.1145/1721837.1721846},
doi = {10.1145/1721837.1721846},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/KleinMW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/MozesW10,
author = {Shay Mozes and
Christian Wulff{-}Nilsen},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Shortest Paths in Planar Graphs with Real Lengths in \emph{O}(\emph{n}log\({}^{\mbox{2}}\)\emph{n}/loglog\emph{n})
Time},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {6347},
pages = {206--217},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15781-3\_18},
doi = {10.1007/978-3-642-15781-3\_18},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/MozesW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DasMM10,
author = {Aparna Das and
Claire Mathieu and
Shay Mozes},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {The Train Delivery Problem - Vehicle Routing Meets Bin Packing},
booktitle = {Approximation and Online Algorithms - 8th International Workshop,
{WAOA} 2010, Liverpool, UK, September 9-10, 2010. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6534},
pages = {94--105},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-18318-8\_9},
doi = {10.1007/978-3-642-18318-8\_9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/DasMM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-5332,
author = {Philip N. Klein and
Shay Mozes},
title = {Multiple-source single-sink maximum flow in directed planar graphs
in {\textdollar}O(n{\^{}}\{1.5\} {\textbackslash}log n){\textdollar}
time},
journal = {CoRR},
volume = {abs/1008.5332},
year = {2010},
url = {http://arxiv.org/abs/1008.5332},
eprinttype = {arXiv},
eprint = {1008.5332},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-5332.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-5549,
author = {Shay Mozes and
Christian Sommer},
title = {Exact Shortest Path Queries for Planar Graphs Using Linear Space},
journal = {CoRR},
volume = {abs/1011.5549},
year = {2010},
url = {http://arxiv.org/abs/1011.5549},
eprinttype = {arXiv},
eprint = {1011.5549},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-5549.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-5870,
author = {Shay Mozes},
title = {Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs
in {\textdollar}O(n{\^{}}\{1.5\} {\textbackslash}log n){\textdollar}
Time},
journal = {CoRR},
volume = {abs/1012.5870},
year = {2010},
url = {http://arxiv.org/abs/1012.5870},
eprinttype = {arXiv},
eprint = {1012.5870},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1012-5870.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LifshitsMWZ09,
author = {Yury Lifshits and
Shay Mozes and
Oren Weimann and
Michal Ziv{-}Ukelson},
title = {Speeding Up {HMM} Decoding and Training by Exploiting Sequence Repetitions},
journal = {Algorithmica},
volume = {54},
number = {3},
pages = {379--399},
year = {2009},
url = {https://doi.org/10.1007/s00453-007-9128-0},
doi = {10.1007/S00453-007-9128-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LifshitsMWZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DemaineMRW09,
author = {Erik D. Demaine and
Shay Mozes and
Benjamin Rossman and
Oren Weimann},
title = {An optimal decomposition algorithm for tree edit distance},
journal = {{ACM} Trans. Algorithms},
volume = {6},
number = {1},
pages = {2:1--2:19},
year = {2009},
url = {https://doi.org/10.1145/1644015.1644017},
doi = {10.1145/1644015.1644017},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/DemaineMRW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MozesTWZ09,
author = {Shay Mozes and
Dekel Tsur and
Oren Weimann and
Michal Ziv{-}Ukelson},
title = {Fast algorithms for computing tree {LCS}},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4303--4314},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.011},
doi = {10.1016/J.TCS.2009.07.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MozesTWZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KleinMW09,
author = {Philip N. Klein and
Shay Mozes and
Oren Weimann},
editor = {Claire Mathieu},
title = {Shortest paths in directed planar graphs with negative lengths: a
linear-space \emph{O}(\emph{n} log\({}^{\mbox{2}}\) \emph{n})-time
algorithm},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {236--245},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.27},
doi = {10.1137/1.9781611973068.27},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KleinMW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/KahnMR09,
author = {Crystal L. Kahn and
Shay Mozes and
Benjamin J. Raphael},
editor = {Steven Salzberg and
Tandy J. Warnow},
title = {Efficient Algorithms for Analyzing Segmental Duplications, Deletions,
and Inversions in Genomes},
booktitle = {Algorithms in Bioinformatics, 9th International Workshop, {WABI} 2009,
Philadelphia, PA, USA, September 12-13, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5724},
pages = {169--180},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04241-6\_15},
doi = {10.1007/978-3-642-04241-6\_15},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wabi/KahnMR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-4963,
author = {Shay Mozes and
Christian Wulff{-}Nilsen},
title = {Shortest Paths in Planar Graphs with Real Lengths in {\textdollar}O(n{\textbackslash}log{\^{}}2n/{\textbackslash}log{\textbackslash}log
n){\textdollar} Time},
journal = {CoRR},
volume = {abs/0911.4963},
year = {2009},
url = {http://arxiv.org/abs/0911.4963},
eprinttype = {arXiv},
eprint = {0911.4963},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0911-4963.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/MozesTWZ08,
author = {Shay Mozes and
Dekel Tsur and
Oren Weimann and
Michal Ziv{-}Ukelson},
editor = {Paolo Ferragina and
Gad M. Landau},
title = {Fast Algorithms for Computing Tree {LCS}},
booktitle = {Combinatorial Pattern Matching, 19th Annual Symposium, {CPM} 2008,
Pisa, Italy, June 18-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5029},
pages = {230--243},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69068-9\_22},
doi = {10.1007/978-3-540-69068-9\_22},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/MozesTWZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MozesOW08,
author = {Shay Mozes and
Krzysztof Onak and
Oren Weimann},
editor = {Shang{-}Hua Teng},
title = {Finding an optimal tree searching strategy in linear time},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {1096--1105},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347202},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/MozesOW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/MozesWZ07,
author = {Shay Mozes and
Oren Weimann and
Michal Ziv{-}Ukelson},
editor = {Bin Ma and
Kaizhong Zhang},
title = {Speeding Up {HMM} Decoding and Training by Exploiting Sequence Repetitions},
booktitle = {Combinatorial Pattern Matching, 18th Annual Symposium, {CPM} 2007,
London, Canada, July 9-11, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4580},
pages = {4--15},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73437-6\_4},
doi = {10.1007/978-3-540-73437-6\_4},
timestamp = {Mon, 13 Mar 2023 16:58:28 +0100},
biburl = {https://dblp.org/rec/conf/cpm/MozesWZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DemaineMRW07,
author = {Erik D. Demaine and
Shay Mozes and
Benjamin Rossman and
Oren Weimann},
editor = {Lars Arge and
Christian Cachin and
Tomasz Jurdzinski and
Andrzej Tarlecki},
title = {An Optimal Decomposition Algorithm for Tree Edit Distance},
booktitle = {Automata, Languages and Programming, 34th International Colloquium,
{ICALP} 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4596},
pages = {146--157},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73420-8\_15},
doi = {10.1007/978-3-540-73420-8\_15},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DemaineMRW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0604037,
author = {Erik D. Demaine and
Shay Mozes and
Benjamin Rossman and
Oren Weimann},
title = {An O(n{\^{}}3)-Time Algorithm for Tree Edit Distance},
journal = {CoRR},
volume = {abs/cs/0604037},
year = {2006},
url = {http://arxiv.org/abs/cs/0604037},
eprinttype = {arXiv},
eprint = {cs/0604037},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0604037.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:52 CEST 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:
