| 2026 | ICALP | Simpler and Improved Replacement Path Coverings. | Davide Bil, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Martin Schirneck |
| 2026 | ICALP | Faster Deterministic Streaming Vertex Coloring. | Shiri Chechik, Hongyi Chen, Tianyi Zhang |
| 2026 | PODC | Girth Approximations in the CONGEST Model. | Shiri Chechik, Gur Lifshitz, Doron Mukhtar |
| 2026 | SODA | (α, β)-Spanners and Hybrid Spanners with Nearly Tight Bounds. | Shiri Chechik, Gur Lifshitz |
| 2025 | ICALP | Improved Streaming Edge Coloring. | Shiri Chechik, Hongyi Chen, Tianyi Zhang |
| 2025 | SODA | New Approximation Algorithms and Reductions for | Shiri Chechik, Itay Hoch, Gur Lifshitz |
| 2025 | STOC | ptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. | Itai Boneh, Shiri Chechik, Shay Golan, Shay Mozes, Oren Weimann |
| 2024 | FOCS | Improved Distance (Sensitivity) Oracles with Subquadratic Space. | Davide Bil, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck |
| 2024 | ICALP | Faster Algorithms for Dual-Failure Replacement Paths. | Shiri Chechik, Tianyi Zhang |
| 2024 | ICALP | Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size. | Shiri Chechik, Tianyi Zhang |
| 2024 | ICALP | Streaming Edge Coloring with Subquadratic Palette Size. | Shiri Chechik, Doron Mukhtar, Tianyi Zhang |
| 2024 | SODA | Nearly Optimal Approximate Dual-Failure Replacement Paths. | Shiri Chechik, Tianyi Zhang |
| 2023 | SODA | Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths. | Shiri Chechik, Tianyi Zhang |
| 2023 | STOC | Approximate Distance Sensitivity Oracles in Subquadratic Space. | Davide Bil, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck |
| 2022 | FOCS | Constant Approximation of Min-Distances in Near-Linear Time. | Shiri Chechik, Tianyi Zhang |
| 2022 | PODC | Constant-Round Near-Optimal Spanners in Congested Clique. | Shiri Chechik, Tianyi Zhang |
| 2022 | SODA | Nearly 2-Approximate Distance Oracles in Subquadratic Time. | Shiri Chechik, Tianyi Zhang |
| 2021 | SODA | Optimal Girth Approximation for Dense Directed Graphs. | Shiri Chechik, Gur Lifshitz |
| 2021 | SODA | Incremental Single Source Shortest Paths in Sparse Digraphs. | Shiri Chechik, Tianyi Zhang |
| 2020 | ICALP | Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem. | Shiri Chechik, Ofer Magen |
| 2020 | ICALP | Simplifying and Unifying Replacement Paths Algorithms in Weighted Directed Graphs. | Shiri Chechik, Moran Nechushtan |
| 2020 | PODC | Single-Source Shortest Paths in the CONGEST Model with Improved Bound. | Shiri Chechik, Doron Mukhtar |
| 2020 | SODA | Dynamic Low-Stretch Spanning Trees in Subpolynomial Time. | Shiri Chechik, Tianyi Zhang |
| 2020 | STOC | Distance sensitivity oracles with subcubic preprocessing time and fast query time. | Shiri Chechik, Sarel Cohen |
| 2020 | STOC | Constant girth approximation for directed graphs in subquadratic time. | Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford |
| 2019 | FOCS | Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. | Shiri Chechik, Tianyi Zhang |
| 2019 | ICALP | Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles. | Noga Alon, Shiri Chechik, Sarel Cohen |
| 2019 | SODA | Near Optimal Algorithms For The Single Source Replacement Paths Problem. | Shiri Chechik, Sarel Cohen |
| 2019 | SODA | Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model. | Shiri Chechik, Doron Mukhtar |
| 2018 | AAAI | Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS. | Edith Cohen, Shiri Chechik, Haim Kaplan |
| 2018 | FOCS | Near-Optimal Approximate Decremental All Pairs Shortest Paths. | Shiri Chechik |
| 2018 | ICALP | Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. | Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc |
| 2018 | SODA | Ramsey Spanning Trees and their Applications. | Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman |
| 2018 | SODA | Incremental Topological Sort and Cycle Detection in Expected Total Time. | Aaron Bernstein, Shiri Chechik |
| 2017 | SODA | Fully dynamic all-pairs shortest paths with worst-case update-time revisited. | Ittai Abraham, Shiri Chechik, Sebastian Krinninger |
| 2017 | SODA | Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs. | Aaron Bernstein, Shiri Chechik |
| 2017 | SODA | (1 + ∊)-Approximate | Shiri Chechik, Sarel Cohen, Amos Fiat, Haim Kaplan |
| 2017 | SODA | Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. | Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis |
| 2016 | FOCS | Decremental Single-Source Reachability and Strongly Connected Components in (m√n) Total Update Time. | Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis |
| 2016 | SODA | On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. | Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck |
| 2016 | SODA | Near-Optimal Light Spanners. | Shiri Chechik, Christian Wulff-Nilsen |
| 2016 | STOC | Deterministic decremental single source shortest paths: beyond the o(mn) bound. | Aaron Bernstein, Shiri Chechik |
| 2016 | STACS | Bottleneck Paths and Trees and Deterministic Graphical Games. | Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick |
| 2015 | STOC | Approximate Distance Oracles with Improved Bounds. | Shiri Chechik |
| 2014 | ICALP | Distance Labels with Optimal Local Stretch. | Ittai Abraham, Shiri Chechik |
| 2014 | SODA | Better Approximation Algorithms for the Graph Diameter. | Shiri Chechik, Daniel H. Larkin, Liam Roditty, Grant Schoenebeck, Robert Endre Tarjan, Virginia Vassilevska Williams |
| 2014 | STOC | Approximate distance oracles with constant query time. | Shiri Chechik |
| 2013 | ESA | Secluded Connectivity Problems. | Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg |
| 2013 | PODC | Compact routing schemes with improved stretch. | Shiri Chechik |
| 2013 | SODA | Low-distortion Inference of Latent Similarities from a Multiplex Social Network. | Ittai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins |
| 2013 | SODA | New Additive Spanners. | Shiri Chechik |
| 2012 | ESA | Improved Distance Oracles and Spanners for Vertex-Labeled Graphs. | Shiri Chechik |
| 2012 | STOC | Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. | Ittai Abraham, Shiri Chechik, Cyril Gavoille |
| 2012 | SIROCCO | The Fault Tolerant Capacitated k-Center Problem. | Shiri Chechik, David Peleg |
| 2012 | WG | Fault Tolerant Additive Spanners. | Gilad Braunschvig, Shiri Chechik, David Peleg |
| 2011 | ICALP | Fault-Tolerant Compact Routing Schemes for General Graphs. | Shiri Chechik |
| 2010 | ESA | Untitled record | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
| 2010 | ICALP | Sparse Reliable Graph Backbones. | Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg |
| 2010 | PODC | Forbidden-set distance labels for graphs of bounded doubling dimension. | Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg |
| 2010 | STACS | Robust Fault Tolerant Uncapacitated Facility Location. | Shiri Chechik, David Peleg |
| 2009 | STOC | Fault-tolerant spanners for general graphs. | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
| 2009 | WG | Low-Port Tree Representations. | Shiri Chechik, David Peleg |