Low-Port Tree Representations. - Shiri Chechik; David Peleg (WG, 2009)

f-Sensitivity Distance Oracles and Routing Schemes. - Shiri Chechik; Michael Langberg; David Peleg; Liam Roditty (ESA (1), 2010)

Fault Tolerant Spanners for General Graphs. - Shiri Chechik; Michael Langberg; David Peleg; Liam Roditty (SIAM J. Comput., 2010)

Improved Distance Oracles for Vertex-Labeled Graphs - Shiri Chechik (CoRR, 2011)

Improved Distance Oracles and Spanners for Vertex-Labeled Graphs. - Shiri Chechik (ESA, 2012)

Multipath Spanners via Fault-Tolerant Spanners. - Shiri Chechik; Quentin Godfroy; David Peleg (MedAlg, 2012)

Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. - Ittai Abraham; Shiri Chechik; Cyril Gavoille (STOC, 2012)

Fault Tolerant Additive Spanners. - Gilad Braunschvig; Shiri Chechik; David Peleg (WG, 2012)

f-Sensitivity Distance Oracles and Routing Schemes. - Shiri Chechik; Michael Langberg; David Peleg; Liam Roditty (Algorithmica, 2012)

Sparse reliable graph backbones. - Shiri Chechik; Yuval Emek; Boaz Patt-Shamir; David Peleg (Inf. Comput., 2012)

Compact routing schemes with improved stretch. - Shiri Chechik (PODC, 2013)

New Additive Spanners. - Shiri Chechik (SODA, 2013)

Dynamic Decremental Approximate Distance Oracles with (1+ε, 2) stretch. - Ittai Abraham; Shiri Chechik (CoRR, 2013)

Approximate Distance Oracle with Constant Query Time - Shiri Chechik (CoRR, 2013)

Fault-tolerant compact routing schemes for general graphs. - Shiri Chechik (Inf. Comput., 2013)

Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier. - Ittai Abraham; Shiri Chechik; Kunal Talwar (APPROX-RANDOM, 2014)

Distance Labels with Optimal Local Stretch. - Ittai Abraham; Shiri Chechik (ICALP (1), 2014)

Better Approximation Algorithms for the Graph Diameter. - Shiri Chechik; Daniel H. Larkin; Liam Roditty; Grant Schoenebeck; Robert Endre Tarjan; Virginia Vassilevska Williams (SODA, 2014)

Approximate distance oracles with constant query time. - Shiri Chechik (STOC, 2014)

Robust fault tolerant uncapacitated facility location. - Shiri Chechik; David Peleg (Theor. Comput. Sci., 2014)

Approximate Nearest Neighbor Search in Metrics of Planar Graphs. - Ittai Abraham; Shiri Chechik; Robert Krauthgamer; Udi Wieder (APPROX-RANDOM, 2015)

Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. - Shiri Chechik; Edith Cohen; Haim Kaplan (APPROX-RANDOM, 2015)

Approximate Distance Oracles with Improved Bounds. - Shiri Chechik (STOC, 2015)

Low-Distortion Inference of Latent Similarities from a Multiplex Social Network. - Ittai Abraham; Shiri Chechik; David Kempe 001; Aleksandrs Slivkins (SIAM J. Comput., 2015)

Fault tolerant additive and (μ, α)-spanners. - Gilad Braunschvig; Shiri Chechik; David Peleg; Adam Sealfon (Theor. Comput. Sci., 2015)

The fault-tolerant capacitated K-center problem. - Shiri Chechik; David Peleg (Theor. Comput. Sci., 2015)

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 (FOCS, 2016)

On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. - Ittai Abraham; Shiri Chechik; Daniel Delling; Andrew V. Goldberg; Renato F. Werneck (SODA, 2016)

Bottleneck Paths and Trees and Deterministic Graphical Games. - Shiri Chechik; Haim Kaplan; Mikkel Thorup; Or Zamir; Uri Zwick (STACS, 2016)

Deterministic decremental single source shortest paths: beyond the o(mn) bound. - Aaron Bernstein; Shiri Chechik (STOC, 2016)

Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension. - Ittai Abraham; Shiri Chechik; Cyril Gavoille; David Peleg (ACM Trans. Algorithms, 2016)

Additive Spanners. - Shiri Chechik (Encyclopedia of Algorithms, 2016)

Compact Routing Schemes. - Shiri Chechik (Encyclopedia of Algorithms, 2016)

Fully dynamic all-pairs shortest paths with worst-case update-time revisited. - Ittai Abraham; Shiri Chechik; Sebastian Krinninger (SODA, 2017)

Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs. - Aaron Bernstein; Shiri Chechik (SODA, 2017)

(1 + ∊)-Approximate f-Sensitive Distance Oracles. - Shiri Chechik; Sarel Cohen; Amos Fiat; Haim Kaplan (SODA, 2017)

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. - Shiri Chechik; Thomas Dueholm Hansen; Giuseppe F. Italiano; Veronika Loitzenbauer; Nikos Parotsidis (SODA, 2017)

Secluded Connectivity Problems. - Shiri Chechik; Matthew P. Johnson 001; Merav Parter; David Peleg (Algorithmica, 2017)

Clustering over Multi-Objective Samples: The one2all Sample. - Edith Cohen; Shiri Chechik; Haim Kaplan (CoRR, 2017)

Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS. - Edith Cohen; Shiri Chechik; Haim Kaplan (AAAI, 2018)

Near-Optimal Approximate Decremental All Pairs Shortest Paths. - Shiri Chechik (FOCS, 2018)

Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. - Moab Arar; Shiri Chechik; Sarel Cohen; Cliff Stein 001; David Wajc (ICALP, 2018)

Incremental Topological Sort and Cycle Detection in Expected Total Time. - Aaron Bernstein; Shiri Chechik (SODA, 2018)

Near-Optimal Light Spanners. - Shiri Chechik; Christian Wulff-Nilsen (ACM Trans. Algorithms, 2018)

Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. - Shiri Chechik; Tianyi Zhang 008 (FOCS, 2019)

Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles. - Noga Alon; Shiri Chechik; Sarel Cohen (ICALP, 2019)

Near Optimal Algorithms For The Single Source Replacement Paths Problem. - Shiri Chechik; Sarel Cohen (SODA, 2019)

Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model. - Shiri Chechik; Doron Mukhtar (SODA, 2019)

Reachability and Shortest Paths in the Broadcast CONGEST Model. - Shiri Chechik; Doron Mukhtar (DISC, 2019)

Improved Girth Approximation and Roundtrip Spanners. - Shiri Chechik; Yang P. Liu; Omer Rotem; Aaron Sidford (CoRR, 2019)

Special Issue: APPROX-RANDOM 2016: Guest Editors' Foreword. - Shiri Chechik; Ronen Shaltiel (Theory Comput., 2019)

Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem. - Shiri Chechik; Ofer Magen (ICALP, 2020)

Simplifying and Unifying Replacement Paths Algorithms in Weighted Directed Graphs. - Shiri Chechik; Moran Nechushtan (ICALP, 2020)

Single-Source Shortest Paths in the CONGEST Model with Improved Bound. - Shiri Chechik; Doron Mukhtar (PODC, 2020)

Dynamic Low-Stretch Spanning Trees in Subpolynomial Time. - Shiri Chechik; Tianyi Zhang 008 (SODA, 2020)

Distance sensitivity oracles with subcubic preprocessing time and fast query time. - Shiri Chechik; Sarel Cohen (STOC, 2020)

Constant girth approximation for directed graphs in subquadratic time. - Shiri Chechik; Yang P. Liu; Omer Rotem; Aaron Sidford (STOC, 2020)

Ramsey Spanning Trees and Their Applications. - Ittai Abraham; Shiri Chechik; Michael Elkin; Arnold Filtser; Ofer Neiman (ACM Trans. Algorithms, 2020)

Optimal Girth Approximation for Dense Directed Graphs. - Shiri Chechik; Gur Lifshitz (SODA, 2021)

Incremental Single Source Shortest Paths in Sparse Digraphs. - Shiri Chechik; Tianyi Zhang 008 (SODA, 2021)

Constant Approximation of Min-Distances in Near-Linear Time. - Shiri Chechik; Tianyi Zhang 008 (FOCS, 2022)

Constant-Round Near-Optimal Spanners in Congested Clique. - Shiri Chechik; Tianyi Zhang 008 (PODC, 2022)

Nearly 2-Approximate Distance Oracles in Subquadratic Time. - Shiri Chechik; Tianyi Zhang 008 (SODA, 2022)

Single-source shortest paths in the CONGEST model with improved bounds. - Shiri Chechik; Doron Mukhtar (Distributed Comput., 2022)

Dynamic Graph Algorithms (Dagstuhl Seminar 22461). - Aaron Bernstein; Shiri Chechik; Sebastian Forster; Tsvi Kopelowitz; Yasamin Nazari; Nicole Wein (Dagstuhl Reports, 2022)

Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths. - Shiri Chechik; Tianyi Zhang 008 (SODA, 2023)

Õptimal Fault-Tolerant Reachability Labeling in Planar Graphs. - Shiri Chechik; Shay Mozes; Oren Weimann (CoRR, 2023)

Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs. - Davide Bilò; Shiri Chechik; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (CoRR, 2023)

Improved Distance (Sensitivity) Oracles with Subquadratic Space. - Davide Bilò; Shiri Chechik; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Martin Schirneck (FOCS, 2024)

Faster Algorithms for Dual-Failure Replacement Paths. - Shiri Chechik; Tianyi Zhang 008 (ICALP, 2024)

Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size. - Shiri Chechik; Tianyi Zhang 008 (ICALP, 2024)

Streaming Edge Coloring with Subquadratic Palette Size. - Shiri Chechik; Doron Mukhtar; Tianyi Zhang 008 (ICALP, 2024)

Nearly Optimal Approximate Dual-Failure Replacement Paths. - Shiri Chechik; Tianyi Zhang 008 (SODA, 2024)

Approximate Distance Sensitivity Oracles in Subquadratic Space. - Davide Bilò; Shiri Chechik; Keerti Choudhary; Sarel Cohen; Tobias Friedrich 001; Simon Krogmann; Martin Schirneck (TheoretiCS, 2024)

Improved Streaming Edge Coloring. - Shiri Chechik; Hongyi Chen; Tianyi Zhang 008 (ICALP, 2025)

New Approximation Algorithms and Reductions for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. - Shiri Chechik; Itay Hoch; Gur Lifshitz (SODA, 2025)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. - Itai Boneh; Shiri Chechik; Shay Golan 001; Shay Mozes; Oren Weimann (STOC, 2025)