Oren Weimann

View Scopus Profile

Oren Weimann

 https://orcid.org/0000-0002-4510-7552
    20052024

    Research activity per year

    Filter
    Conference contribution

    Search results

    • 2024

      Brief Announcement: Distributed Maximum Flow in Planar Graphs

      Abd-Elhaleem, Y., Dory, M., Parter, M. & Weimann, O., 24 Oct 2024, 38th International Symposium on Distributed Computing, DISC 2024. Alistarh, D. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 40. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 319).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Õptimal Dynamic Time Warping on Run-Length Encoded Strings

      Boneh, I., Golan, S., Mozes, S. & Weimann, O., Jul 2024, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. Bringmann, K., Grohe, M., Puppis, G. & Svensson, O. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 30. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2023

      What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs?

      Abboud, A., Mozes, S. & Weimann, O., Sep 2023, 31st Annual European Symposium on Algorithms, ESA 2023. Li Gortz, I., Farach-Colton, M., Puglisi, S. J. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 4. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 274).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2022

      Improved Compression of the Okamura-Seymour Metric

      Mozes, S., Wallheimer, N. & Weimann, O., 1 Dec 2022, 33rd International Symposium on Algorithms and Computation, ISAAC 2022. Bae, S. W. & Park, H. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 248).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • On the Hardness of Computing the Edit Distance of Shallow Trees

      Charalampopoulos, P., Gawrychowski, P., Mozes, S. & Weimann, O., 2022, String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings. Arroyuelo, D., Arroyuelo, D. & Poblete, B. (eds.). Springer Science and Business Media Deutschland GmbH, p. 290-302 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13617 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • The Fine-Grained Complexity of Episode Matching

      Bille, P., Gørtz, I. L., Mozes, S., Steiner, T. A. & Weimann, O., 1 Jun 2022, 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022. Bannai, H. & Holub, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 4. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 223).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2021

      An almost optimal edit distance oracle

      Charalampopoulos, P., Gawrychowski, P., Mozes, S. & Weimann, O., 1 Jul 2021, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021. Bansal, N., Merelli, E. & Worrell, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 48. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 198).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • A Note on a Recent Algorithm for Minimum Cut

      Gawrychowski, P., Mozes, S. & Weimann, O., 2021, 4th Symposium on Simplicity in Algorithms, SOSA 2021. King, V. & Le, H. V. (eds.). Society for Industrial and Applied Mathematics Publications, p. 74-79 6 p. (4th Symposium on Simplicity in Algorithms, SOSA 2021).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Fault-Tolerant Distance Labeling for Planar Graphs

      Bar-Natan, A., Charalampopoulos, P., Gawrychowski, P., Mozes, S. & Weimann, O., 2021, Structural Information and Communication Complexity - 28th International Colloquium, SIROCCO 2021, Proceedings. Jurdziński, T. & Schmid, S. (eds.). Springer Science and Business Media Deutschland GmbH, p. 315-333 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12810 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Planar negative k-cycle

      Gawrychowski, P., Mozes, S. & Weimann, O., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). Association for Computing Machinery, p. 2717-2724 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2020

      Minimum cut in O(m log2 n) time

      Gawrychowski, P., Mozes, S. & Weimann, O., 1 Jun 2020, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020. Czumaj, A., Dawar, A. & Merelli, E. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 57. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 168).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • On the fine-grained complexity of parity problems

      Abboud, A., Feller, S. & Weimann, O., 1 Jun 2020, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020. Czumaj, A., Dawar, A. & Merelli, E. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 5. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 168).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2019

      Almost optimal distance oracles for planar graphs

      Charalampopoulos, P., Gawrychowski, P., Mozes, S. & Weimann, O., 23 Jun 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (eds.). Association for Computing Machinery, p. 138-151 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Top tree compression of tries

      Bille, P., Gawrychowski, P., Gørtz, I. L., Landau, G. M. & Weimann, O., Dec 2019, 30th International Symposium on Algorithms and Computation, ISAAC 2019. Lu, P. & Zhang, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 4. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 149).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2018

      A faster construction of greedy consensus trees

      Gawrychowski, P., Landau, G. M., Sung, W. K. & Weimann, O., 1 Jul 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 63. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 107).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • A faster FPTAS for #knapsack

      Gawrychowski, P., Markin, L. & Weimann, O., 1 Jul 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 64. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 107).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Better tradeoffs for exact distance oracles in planar graphs

      Gawrychowski, P., Mozes, S., Weimann, O. & Wulff-Nilsen, C., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Association for Computing Machinery, p. 515-529 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Compressed range minimum queries

      Jo, S., Mozes, S. & Weimann, O., 2018, String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Proceedings. Gagie, T., Moffat, A., Navarro, G. & Cuadros-Vargas, E. (eds.). Springer Verlag, p. 206-217 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11147 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Minimum cut of directed planar graphs in O(n log log n) time

      Mozes, S., Nikolaev, K., Nussbaum, Y. & Weimann, O., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Association for Computing Machinery, p. 477-494 18 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Near-optimal compression for the planar graph metric

      Abboud, A., Gawrychowski, P., Mozes, S. & Weimann, O., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Association for Computing Machinery, p. 530-549 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Near-optimal distance emulator for planar graphs

      Chang, H. C., Gawrychowski, P., Mozes, S. & Weimann, O., 1 Aug 2018, 26th European Symposium on Algorithms, ESA 2018. Bast, H., Herman, G. & Azar, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 112).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Tree edit distance cannot be computed in strongly subcubic time (unless APSP can)

      Bringmann, K., Gawrychowski, P., Mozes, S. & Weimann, O., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Association for Computing Machinery, p. 1190-1206 17 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ (n5/3) time

      Gawrychowski, P., Kaplan, H., Mozes, S., Sharir, M. & Weimann, O., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Association for Computing Machinery, p. 495-514 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2017

      Dispersion on trees

      Gawrychowski, P., Krasnopolsky, N., Mozes, S. & Weimann, O., 1 Sep 2017, 25th European Symposium on Algorithms, ESA 2017. Sohler, C., Sohler, C. & Pruhs, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 40. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 87).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Optimal distance labeling schemes for trees

      Freedman, O., Gawrychowski, P., Nicholson, P. K. & Weimann, O., 26 Jul 2017, PODC 2017 - Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 185-194 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; vol. Part F129314).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2016

      Bookmarks in grammar-compressed strings

      Cording, P. H., Gawrychowski, P. & Weimann, O., 2016, String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Proceedings. Inenaga, S., Sadakane, K. & Sakai, T. (eds.). Springer Verlag, p. 153-159 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9954 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • The nearest colored node in a tree

      Gawrychowski, P., Landau, G. M., Mozes, S. & Weimann, O., 1 Jun 2016, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. Grossi, R. & Lewenstein, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 25.1-25.12 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 54).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2015

      Longest common extensions in trees

      Bille, P., Gawrychowski, P., Gørtz, I. L., Landau, G. M. & Weimann, O., 2015, Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings. Vaccaro, U., Porat, E. & Cicalese, F. (eds.). Springer Verlag, p. 52-64 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9133).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Submatrix maximum queries in monge matrices are equivalent to predecessor search

      Gawrychowski, P., Mozes, S. & Weimann, O., 2015, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings. Halldorsson, M. M., Kobayashi, N., Speckmann, B. & Iwama, K. (eds.). Springer Verlag, p. 580-592 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9134).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2014

      Consequences of faster alignment of sequences

      Abboud, A., Williams, V. V. & Weimann, O., 2014, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 1 ed. Springer Verlag, p. 39-51 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8572 LNCS, no. PART 1).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Improved submatrix maximum queries in Monge matrices

      Gawrychowski, P., Mozes, S. & Weimann, O., 2014, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 1 ed. Springer Verlag, p. 525-537 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8572 LNCS, no. PART 1).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2013

      Approximating the diameter of planar graphs in near linear time

      Weimann, O. & Yuster, R., 2013, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 1 ed. p. 828-839 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7965 LNCS, no. PART 1).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access

    • Binary jumbled pattern matching on trees and tree-like structures

      Gagie, T., Hermelin, D., Landau, G. M. & Weimann, O., 2013, Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings. p. 517-528 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8125 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Improved bounds for online preemptive matching

      Epstein, L., Levin, A., Segev, D. & Weimann, O., 2013, 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013. p. 389-399 11 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 20).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Tree compression with top trees

      Bille, P., Gørtz, I. L., Landau, G. M. & Weimann, O., 2013, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 1 ed. p. 160-171 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7965 LNCS, no. PART 1).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2012

      Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence

      Cicalese, F., Laber, E., Weimann, O. & Yuster, R., 2012, Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Proceedings. p. 149-158 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7354 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • On approximating string selection problems with outliers

      Boucher, C., Landau, G. M., Levy, A., Pritchard, D. & Weimann, O., 2012, Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Proceedings. p. 427-438 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7354 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2011

      Distance oracles for vertex-labeled graphs

      Hermelin, D., Levy, A., Weimann, O. & Yuster, R., 2011, Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings. PART 2 ed. p. 490-501 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6756 LNCS, no. PART 2).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Optimal packed string matching

      Ben-Kiki, O., Bille, P., Breslauer, D., Ga̧sieniec, L., Grossi, R. & Weimann, O., 2011, 31st International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011. p. 423-432 10 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 13).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Random access to grammar-compressed strings

      Bille, P., Landau, G. M., Raman, R., Sadakane, K., Satti, S. R. & Weimann, O., 2011, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. Association for Computing Machinery, p. 373-389 17 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2010

      Indexing a dictionary for subset matching queries

      Landau, G. M., Tsur, D. & Weimann, O., 2010, Algorithms and Applications - Essays Dedicated to Esko Ukkonen on the Occasion of His 60th Birthday. Elomaa, T., Mannila, H. & Orponen, P. (eds.). p. 158-169 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6060 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Replacement paths via fast matrix multiplication

      Weimann, O. & Yuster, R., 2010, Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. IEEE Computer Society, p. 655-662 8 p. 5671330. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
    • 2009

      A unified algorithm for accelerating edit-distance computation via text-compression

      Hermelin, D., Landau, G. M., Landau, S. & Weimann, O., 2009, STACS 2009 - 26th International Symposium on Theoretical Aspects of Computer Science. p. 529-540 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 3).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Computing the girth of a planar graph in O(n logn) time

      Weimann, O. & Yuster, R., 2009, Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings. PART 1 ed. p. 764-773 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5555 LNCS, no. PART 1).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Fast RNA structure alignment for crossing input structures

      Backofen, R., Landau, G. M., Möhl, M., Tsur, D. & Weimann, O., 2009, Combinatorial Pattern Matching - 20th Annual Symposium, CPM 2009, Proceedings. p. 236-248 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5577 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • On cartesian trees and range minimum queries

      Demaine, E. D., Landau, G. M. & Weimann, O., 2009, Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings. PART 1 ed. p. 341-353 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5555 LNCS, no. PART 1).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm

      Klein, P., Mozes, S. & Weimann, O., 2009, Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 236-245 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • The stackelberg minimum spanning tree game on planar and bounded-treewidth graphs

      Cardinal, J., Demaine, E. D., Fiorini, S., Joret, G., Newman, I. & Weimann, O., 2009, Internet and Network Economics - 5th International Workshop, WINE 2009, Proceedings. p. 125-136 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5929 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2008

      Fast algorithms for computing tree LCS

      Mozes, S., Tsur, D., Weimann, O. & Ziv-Ukelson, M., 2008, Combinatorial Pattern Matching - 19th Annual Symposium, CPM 2008, Proceedings. p. 230-243 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5029 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Finding an optimal tree searching strategy in linear time

      Mozes, S., Onak, K. & Weimann, O., 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 1096-1105 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review