No photo of Shiri Chechik

View Scopus Profile

Shiri Chechik

Professor

Former affiliation
20092025

Research activity per year

Filter
Conference contribution

Search results

  • 2025

    New Approximation Algorithms and Reductions for n-Pairs Shortest Paths and All-Nodes Shortest Cycles

    Chechik, S., Hoch, I. & Lifshitz, G., 2025, Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025. Association for Computing Machinery, p. 5207-5238 32 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 8).

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

  • 2024

    Faster Algorithms for Dual-Failure Replacement Paths

    Chechik, S. & Zhang, T., 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, 41. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).

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

  • Improved Distance (Sensitivity) Oracles with Subquadratic Space

    Bilo, D., Chechik, S., Choudhary, K., Cohen, S., Friedrich, T. & Schirneck, M., 2024, Proceedings - 2024 IEEE 65th Annual Symposium on Foundations of Computer Science, FOCS 2024. IEEE Computer Society, p. 1550-1558 9 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

    Open Access

  • Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size

    Chechik, S. & Zhang, T., 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, 42. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).

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

    1 Scopus citations

  • Streaming Edge Coloring with Subquadratic Palette Size

    Chechik, S., Mukhtar, D. & Zhang, T., 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, 40. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).

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

    3 Scopus citations
  • 2023

    Approximate Distance Sensitivity Oracles in Subquadratic Space

    Bilò, D., Chechik, S., Choudhary, K., Cohen, S., Friedrich, T., Krogmann, S. & Schirneck, M., 2 Jun 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). Association for Computing Machinery, p. 1396-1409 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
    6 Scopus citations

  • Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths

    Chechik, S. & Zhang, T., 2023, 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023. Association for Computing Machinery, p. 87-99 13 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2023-January).

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

    9 Scopus citations
  • 2022

    Constant Approximation of Min-Distances in Near-Linear Time

    Chechik, S. & Zhang, T., 2022, Proceedings - 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022. IEEE Computer Society, p. 896-906 11 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2022-October).

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

    1 Scopus citations

  • Constant-Round Near-Optimal Spanners in Congested Clique

    Chechik, S. & Zhang, T., 20 Jul 2022, PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 325-334 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

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

    3 Scopus citations

  • Nearly 2-Approximate Distance Oracles in Subquadratic Time

    Chechik, S. & Zhang, T., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 551-580 30 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).

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

    10 Scopus citations
  • 2021

    Incremental single source shortest paths in sparse digraphs

    Chechik, S. & Zhang, T., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). Association for Computing Machinery, p. 2463-2477 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    7 Scopus citations

  • Optimal girth approximation for dense directed graphs

    Chechik, S. & Lifshitz, G., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). Association for Computing Machinery, p. 290-300 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    6 Scopus citations
  • 2020

    Constant girth approximation for directed graphs in subquadratic time

    Chechik, S., Liu, Y. P., Rotem, O. & Sidford, A., 8 Jun 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). Association for Computing Machinery, p. 1010-1023 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
    10 Scopus citations

  • Distance sensitivity oracles with subcubic preprocessing time and fast query time

    Chechik, S. & Cohen, S., 8 Jun 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). Association for Computing Machinery, p. 1375-1388 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    22 Scopus citations

  • Dynamic low-stretch spanning trees in subpolynomial time

    Chechik, S. & Zhang, T., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 463-475 13 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2020-January).

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

    13 Scopus citations

  • Near optimal algorithm for the directed single source replacement paths problem

    Chechik, S. & Magen, 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, 81. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 168).

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

    10 Scopus citations

  • Simplifying and unifying replacement paths algorithms in weighted directed graphs

    Chechik, S. & Nechushtan, M., 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, 29. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 168).

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

    6 Scopus citations

  • Single-Source Shortest Paths in the CONGEST Model with Improved Bound

    Chechik, S. & Mukhtar, D., 31 Jul 2020, PODC 2020 - Proceedings of the 39th Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 464-473 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

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

    17 Scopus citations
  • 2019

    Deterministic combinatorial replacement paths and distance sensitivity oracles

    Alon, N., Chechik, S. & Cohen, S., 1 Jul 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 12. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 132).

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

    17 Scopus citations

  • Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time

    Chechik, S. & Zhang, T., Nov 2019, Proceedings - 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, FOCS 2019. IEEE Computer Society, p. 370-381 12 p. 8948632. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2019-November).

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

    Open Access
    34 Scopus citations

  • Reachability and shortest paths in the broadcast congest model

    Chechik, S. & Mukhtar, D., Oct 2019, 33rd International Symposium on Distributed Computing, DISC 2019. Suomela, J. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 11. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 146).

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

    7 Scopus citations
  • 2018

    Clustering small samples with quality guarantees: Adaptivity with One2ALL PPs

    Cohen, E., Chechik, S. & Kaplan, H., 2018, 32nd AAAI Conference on Artificial Intelligence, AAAI 2018. AAAI press, p. 2884-2891 8 p. (32nd AAAI Conference on Artificial Intelligence, AAAI 2018).

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

    6 Scopus citations

  • Dynamic matching: Reducing integral algorithms to approximately-maximal fractional algorithms

    Arar, M., Chechik, S., Cohen, S., Stein, C. & Wajc, D., 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, 7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 107).

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

    38 Scopus citations

  • Incremental topological sort and cycle detection in Õ (m √n) expected total time

    Bernstein, A. & Chechik, S., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Association for Computing Machinery, p. 21-34 14 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
    21 Scopus citations

  • Near-optimal approximate decremental all pairs shortest paths

    Chechik, S., 30 Nov 2018, Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018. Thorup, M. (ed.). IEEE Computer Society, p. 170-181 12 p. 8555103. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2018-October).

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

    32 Scopus citations

  • Ramsey spanning trees and their applications

    Abraham, I., Chechik, S., Elkin, M., Filtser, A. & Neiman, O., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Association for Computing Machinery, p. 1650-1664 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
    9 Scopus citations
  • 2017

    (1 + ϵ)-Approximate f-sensitive distance oracles

    Chechik, S., Cohen, S., Fiat, A. & Kaplan, H., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 1479-1496 18 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

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

    36 Scopus citations

  • Deterministic partially dynamic single source shortest paths for sparse graphs

    Bernstein, A. & Chechik, S., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 453-469 17 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

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

    34 Scopus citations

  • Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs

    Chechik, S., Hanseny, T. D., Italiano, G. F., Loitzenbauer, V. & Parotsidis, N., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 1900-1918 19 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

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

    Open Access
    21 Scopus citations

  • Fully dynamic all-pairs shortest paths with worst-case update-time revisited

    Abraham, I., Chechik, S. & Krinninger, S., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 440-452 13 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

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

    Open Access
    48 Scopus citations
  • 2016

    Bottleneck paths and trees and deterministic Graphical games

    Chechik, S., Kaplan, H., Thorup, M., Zamir, O. & Zwick, U., 1 Feb 2016, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016. Vollmer, H. & Ollinger, N. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 47).

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

    3 Scopus citations

  • Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time

    Chechik, S., Hansen, T. D., Italiano, G. F., Lacki, J. & Parotsidis, N., 14 Dec 2016, Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016. IEEE Computer Society, p. 315-324 10 p. 7782945. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2016-December).

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

    26 Scopus citations

  • Deterministic decremental single source shortest paths: Beyond the O(mn) bound

    Bernstein, A. & Chechik, S., 19 Jun 2016, STOC 2016 - Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing. Mansour, Y. & Wichs, D. (eds.). Association for Computing Machinery, p. 389-397 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 19-21-June-2016).

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

    49 Scopus citations

  • Near-optimal light spanners

    Chechik, S. & Wulff-Nilsen, C., 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Krauthgamer, R. (ed.). Association for Computing Machinery, p. 883-892 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2).

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

    15 Scopus citations

  • On dynamic approximate shortest paths for planar graphs with worst-case costs

    Abraham, I., Chechik, S., Delling, D., Goldberg, A. V. & Werneck, R. F., 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Krauthgamer, R. (ed.). Association for Computing Machinery, p. 740-753 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2).

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

    Open Access
    14 Scopus citations
  • 2015

    Approximate distance oracles with improved bounds

    Chechik, S., 14 Jun 2015, STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 1-10 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 14-17-June-2015).

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

    58 Scopus citations

  • Approximate nearest neighbor search in metrics of planar graphs

    Abraham, I., Chechik, S., Krauthgamer, R. & Wieder, U., 1 Aug 2015, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 18th International Workshop, APPROX 2015, and 19th International Workshop, RANDOM 2015. Garg, N., Jansen, K., Rao, A. & Rolim, J. D. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 20-42 23 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 40).

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

    7 Scopus citations

  • Average distance queries through weighted samples in graphs and metric spaces: High scalability with tight statistical guarantees

    Chechik, S., Cohen, E. & Kaplan, H., 1 Aug 2015, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 18th International Workshop, APPROX 2015, and 19th International Workshop, RANDOM 2015. Garg, N., Jansen, K., Rao, A. & Rolim, J. D. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 659-679 21 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 40).

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

    20 Scopus citations
  • 2014

    Approximate distance oracles with constant query time

    Chechik, S., 2014, STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 654-663 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    77 Scopus citations

  • Better approximation algorithms for the graph diameter

    Chechik, S., Larkin, D. H., Roditty, L., Schoenebeck, G., Tarjan, R. E. & Williams, V. V., 2014, Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, p. 1041-1052 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    95 Scopus citations

  • Distance labels with optimal local stretch

    Abraham, I. & Chechik, S., 2014, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 1 ed. Springer Verlag, p. 52-63 12 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

    2 Scopus citations

  • Fully dynamic all-Pairs shortest paths: Breaking the o(n) barrier

    Abraham, I., Chechik, S. & Talwar, K., 1 Sep 2014, Leibniz International Proceedings in Informatics, LIPIcs. Jansen, K., Rolim, J. D. P., Devanur, N. R. & Moore, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 1-16 16 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 28).

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

    30 Scopus citations
  • 2013

    Compact routing schemes with improved stretch

    Chechik, S., 2013, PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing. p. 33-41 9 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

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

    44 Scopus citations

  • Low-distortion inference of latent similarities from a multiplex social network

    Abraham, I., Chechik, S., Kempe, D. & Slivkins, A., 2013, Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013. Association for Computing Machinery, p. 1853-1872 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
    11 Scopus citations

  • New additive spanners

    Chechik, S., 2013, Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013. Association for Computing Machinery, p. 498-512 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

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

    80 Scopus citations

  • Secluded connectivity problems

    Chechik, S., Johnson, M. P., Parter, M. & Peleg, D., 2013, Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings. p. 301-312 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

    10 Scopus citations
  • 2012

    Fault tolerant additive spanners

    Braunschvig, G., Chechik, S. & Peleg, D., 2012, Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Revised Selcted Papers. p. 206-214 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7551 LNCS).

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

    15 Scopus citations

  • Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels

    Abraham, I., Chechik, S. & Gavoille, C., 2012, STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing. p. 1199-1217 19 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    52 Scopus citations

  • Improved distance oracles and spanners for vertex-labeled graphs

    Chechik, S., 2012, Algorithms, ESA 2012 - 20th Annual European Symposium, Proceedings. p. 325-336 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7501 LNCS).

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

    13 Scopus citations

  • Multipath Spanners via Fault-Tolerant Spanners

    Chechik, S., Godfroy, Q. & Peleg, D., 2012, Design and Analysis of Algorithms - 1st Mediterranean Conference on Algorithms, MedAlg 2012, Proceedings. Even, G. & Rawitz, D. (eds.). Springer Science and Business Media Deutschland GmbH, p. 108-119 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7659 LNNS).

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

    1 Scopus citations