Shiri Chechik - RankMe

109 papers A* 48A 6B 3Journal 43Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	(α, β)-Spanners and Hybrid Spanners with Nearly Tight Bounds. SODA Shiri Chechik, Gur Lifshitz
2026	J	`jnl`	Girth Approximations in the CONGEST Model. CoRR Shiri Chechik, Gur Lifshitz, Doron Mukhtar
2025	A*	`conf`	Improved Streaming Edge Coloring. ICALP Shiri Chechik, Hongyi Chen, Tianyi Zhang
2025	J	`jnl`	Improved Streaming Edge Coloring. CoRR Shiri Chechik, Hongyi Chen, Tianyi Zhang
2025	A*	`conf`	New Approximation Algorithms and Reductions for SODA Shiri Chechik, Itay Hoch, Gur Lifshitz
2025	A*	`conf`	Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. STOC Itai Boneh, Shiri Chechik, Shay Golan, Shay Mozes, Oren Weimann
2025	J	`jnl`	Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs. CoRR Itai Boneh, Shiri Chechik, Shay Golan, Shay Mozes, Oren Weimann
2024	J	`jnl`	Approximate Distance Sensitivity Oracles in Subquadratic Space. TheoretiCS Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2024	A*	`conf`	Faster Algorithms for Dual-Failure Replacement Paths. ICALP Shiri Chechik, Tianyi Zhang
2024	J	`jnl`	Faster Algorithms for Dual-Failure Replacement Paths. CoRR Shiri Chechik, Tianyi Zhang
2024	A*	`conf`	Improved Distance (Sensitivity) Oracles with Subquadratic Space. FOCS Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2024	J	`jnl`	Improved Distance (Sensitivity) Oracles with Subquadratic Space. CoRR Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2024	A*	`conf`	Nearly Optimal Approximate Dual-Failure Replacement Paths. SODA Shiri Chechik, Tianyi Zhang
2024	A*	`conf`	Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size. ICALP Shiri Chechik, Tianyi Zhang
2024	A*	`conf`	Streaming Edge Coloring with Subquadratic Palette Size. ICALP Shiri Chechik, Doron Mukhtar, Tianyi Zhang
2023	A*	`conf`	Approximate Distance Sensitivity Oracles in Subquadratic Space. STOC Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	J	`jnl`	Approximate Distance Sensitivity Oracles in Subquadratic Space. CoRR Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck
2023	A*	`conf`	Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths. SODA Shiri Chechik, Tianyi Zhang
2023	J	`jnl`	Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs. CoRR Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Martin Schirneck
2023	J	`jnl`	Streaming Edge Coloring with Subquadratic Palette Size. CoRR Shiri Chechik, Doron Mukhtar, Tianyi Zhang
2023	J	`jnl`	Õptimal Fault-Tolerant Reachability Labeling in Planar Graphs. CoRR Shiri Chechik, Shay Mozes, Oren Weimann
2022	A	`ed.`	30th Annual European Symposium on Algorithms, ESA 2022, Berlin/Potsdam, Germany, September 5-9, 2022 ESA Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman
2022	A*	`conf`	Constant Approximation of Min-Distances in Near-Linear Time. FOCS Shiri Chechik, Tianyi Zhang
2022	A*	`conf`	Constant-Round Near-Optimal Spanners in Congested Clique. PODC Shiri Chechik, Tianyi Zhang
2022	J	`jnl`	Dynamic Graph Algorithms (Dagstuhl Seminar 22461). Dagstuhl Reports Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, Nicole Wein
2022	A*	`conf`	Nearly 2-Approximate Distance Oracles in Subquadratic Time. SODA Shiri Chechik, Tianyi Zhang
2022	J	`jnl`	Single-source shortest paths in the CONGEST model with improved bounds. Distributed Comput. Shiri Chechik, Doron Mukhtar
2021	A*	`conf`	Incremental Single Source Shortest Paths in Sparse Digraphs. SODA Shiri Chechik, Tianyi Zhang
2021	A*	`conf`	Optimal Girth Approximation for Dense Directed Graphs. SODA Shiri Chechik, Gur Lifshitz
2020	A*	`conf`	Constant girth approximation for directed graphs in subquadratic time. STOC Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford
2020	A*	`conf`	Distance sensitivity oracles with subcubic preprocessing time and fast query time. STOC Shiri Chechik, Sarel Cohen
2020	A*	`conf`	Dynamic Low-Stretch Spanning Trees in Subpolynomial Time. SODA Shiri Chechik, Tianyi Zhang
2020	A*	`conf`	Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem. ICALP Shiri Chechik, Ofer Magen
2020	J	`jnl`	Near Optimal Algorithm for the Directed Single Source Replacement Paths Problem. CoRR Shiri Chechik, Ofer Magen
2020	J	`jnl`	Ramsey Spanning Trees and Their Applications. ACM Trans. Algorithms Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman
2020	A*	`conf`	Simplifying and Unifying Replacement Paths Algorithms in Weighted Directed Graphs. ICALP Shiri Chechik, Moran Nechushtan
2020	A*	`conf`	Single-Source Shortest Paths in the CONGEST Model with Improved Bound. PODC Shiri Chechik, Doron Mukhtar
2019	A*	`conf`	Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles. ICALP Noga Alon, Shiri Chechik, Sarel Cohen
2019	J	`jnl`	Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles. CoRR Noga Alon, Shiri Chechik, Sarel Cohen
2019	A*	`conf`	Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. FOCS Shiri Chechik, Tianyi Zhang
2019	J	`jnl`	Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. CoRR Shiri Chechik, Tianyi Zhang
2019	J	`jnl`	Improved Girth Approximation and Roundtrip Spanners. CoRR Shiri Chechik, Yang P. Liu, Omer Rotem, Aaron Sidford
2019	A*	`conf`	Near Optimal Algorithms For The Single Source Replacement Paths Problem. SODA Shiri Chechik, Sarel Cohen
2019	A*	`conf`	Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model. SODA Shiri Chechik, Doron Mukhtar
2019	A	`conf`	Reachability and Shortest Paths in the Broadcast CONGEST Model. DISC Shiri Chechik, Doron Mukhtar
2019	J	`jnl`	Reachability and Shortest Paths in the Broadcast CONGEST Model. CoRR Shiri Chechik, Doron Mukhtar
2019	J	`jnl`	Special Issue: APPROX-RANDOM 2016: Guest Editors' Foreword. Theory Comput. Shiri Chechik, Ronen Shaltiel
2018	A*	`conf`	Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS. AAAI Edith Cohen, Shiri Chechik, Haim Kaplan
2018	A*	`conf`	Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. ICALP Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc
2018	A*	`conf`	Incremental Topological Sort and Cycle Detection in Expected Total Time. SODA Aaron Bernstein, Shiri Chechik
2018	A*	`conf`	Near-Optimal Approximate Decremental All Pairs Shortest Paths. FOCS Shiri Chechik
2018	J	`jnl`	Near-Optimal Light Spanners. ACM Trans. Algorithms Shiri Chechik, Christian Wulff-Nilsen
2018	J	`jnl`	Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model. CoRR Shiri Chechik, Doron Mukhtar
2018	A*	`conf`	Ramsey Spanning Trees and their Applications. SODA Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman
2017	A*	`conf`	(1 + ∊)-Approximate SODA Shiri Chechik, Sarel Cohen, Amos Fiat, Haim Kaplan
2017	J	`jnl`	Clustering over Multi-Objective Samples: The one2all Sample. CoRR Edith Cohen, Shiri Chechik, Haim Kaplan
2017	A*	`conf`	Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs. SODA Aaron Bernstein, Shiri Chechik
2017	J	`jnl`	Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. CoRR Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc
2017	A*	`conf`	Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. SODA Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis
2017	J	`jnl`	Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. CoRR Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis
2017	A*	`conf`	Fully dynamic all-pairs shortest paths with worst-case update-time revisited. SODA Ittai Abraham, Shiri Chechik, Sebastian Krinninger
2017	J	`jnl`	Ramsey Spanning Trees and their Applications. CoRR Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman
2017	J	`jnl`	Secluded Connectivity Problems. Algorithmica Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg
2016	—	`ch.`	Additive Spanners. Encyclopedia of Algorithms Shiri Chechik
2016	A	`conf`	Bottleneck Paths and Trees and Deterministic Graphical Games. STACS Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick
2016	—	`ch.`	Compact Routing Schemes. Encyclopedia of Algorithms Shiri Chechik
2016	A*	`conf`	Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. FOCS Shiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Lacki, Nikos Parotsidis
2016	A*	`conf`	Deterministic decremental single source shortest paths: beyond the o(mn) bound. STOC Aaron Bernstein, Shiri Chechik
2016	J	`jnl`	Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension. ACM Trans. Algorithms Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg
2016	J	`jnl`	Fully dynamic all-pairs shortest paths with worst-case update-time revisited. CoRR Ittai Abraham, Shiri Chechik, Sebastian Krinninger
2016	A*	`conf`	Near-Optimal Light Spanners. SODA Shiri Chechik, Christian Wulff-Nilsen
2016	A*	`conf`	On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. SODA Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
2015	A*	`conf`	Approximate Distance Oracles with Improved Bounds. STOC Shiri Chechik
2015	—	`conf`	Approximate Nearest Neighbor Search in Metrics of Planar Graphs. APPROX-RANDOM Ittai Abraham, Shiri Chechik, Robert Krauthgamer, Udi Wieder
2015	—	`conf`	Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. APPROX-RANDOM Shiri Chechik, Edith Cohen, Haim Kaplan
2015	J	`jnl`	Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. CoRR Shiri Chechik, Edith Cohen, Haim Kaplan
2015	J	`jnl`	Fault tolerant additive and (μ, α)-spanners. Theor. Comput. Sci. Gilad Braunschvig, Shiri Chechik, David Peleg, Adam Sealfon
2015	J	`jnl`	Low-Distortion Inference of Latent Similarities from a Multiplex Social Network. SIAM J. Comput. Ittai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins
2015	J	`jnl`	The fault-tolerant capacitated K-center problem. Theor. Comput. Sci. Shiri Chechik, David Peleg
2014	A*	`conf`	Approximate distance oracles with constant query time. STOC Shiri Chechik
2014	A*	`conf`	Better Approximation Algorithms for the Graph Diameter. SODA Shiri Chechik, Daniel H. Larkin, Liam Roditty, Grant Schoenebeck, Robert Endre Tarjan, Virginia Vassilevska Williams
2014	—	`conf`	Distance Labels with Optimal Local Stretch. ICALP (1) Ittai Abraham, Shiri Chechik
2014	—	`conf`	Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier. APPROX-RANDOM Ittai Abraham, Shiri Chechik, Kunal Talwar
2014	J	`jnl`	Robust fault tolerant uncapacitated facility location. Theor. Comput. Sci. Shiri Chechik, David Peleg
2013	J	`jnl`	Approximate Distance Oracle with Constant Query Time CoRR Shiri Chechik
2013	A*	`conf`	Compact routing schemes with improved stretch. PODC Shiri Chechik
2013	J	`jnl`	Dynamic Decremental Approximate Distance Oracles with (1+ε, 2) stretch. CoRR Ittai Abraham, Shiri Chechik
2013	J	`jnl`	Fault-tolerant compact routing schemes for general graphs. Inf. Comput. Shiri Chechik
2013	A*	`conf`	Low-distortion Inference of Latent Similarities from a Multiplex Social Network. SODA Ittai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins
2013	A*	`conf`	New Additive Spanners. SODA Shiri Chechik
2013	A	`conf`	Secluded Connectivity Problems. ESA Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg
2012	B	`conf`	Fault Tolerant Additive Spanners. WG Gilad Braunschvig, Shiri Chechik, David Peleg
2012	A*	`conf`	Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. STOC Ittai Abraham, Shiri Chechik, Cyril Gavoille
2012	A	`conf`	Improved Distance Oracles and Spanners for Vertex-Labeled Graphs. ESA Shiri Chechik
2012	J	`jnl`	Low-distortion Inference of Latent Similarities from a Multiplex Social Network CoRR Ittai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins
2012	—	`conf`	Multipath Spanners via Fault-Tolerant Spanners. MedAlg Shiri Chechik, Quentin Godfroy, David Peleg
2012	J	`jnl`	Secluded Connectivity Problems CoRR Shiri Chechik, Matthew P. Johnson, Merav Parter, David Peleg
2012	J	`jnl`	Sparse reliable graph backbones. Inf. Comput. Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg
2012	B	`conf`	The Fault Tolerant Capacitated k-Center Problem. SIROCCO Shiri Chechik, David Peleg
2012	J	`jnl`	f-Sensitivity Distance Oracles and Routing Schemes. Algorithmica Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty
2011	—	`conf`	Fault-Tolerant Compact Routing Schemes for General Graphs. ICALP (2) Shiri Chechik
2011	J	`jnl`	Improved Distance Oracles for Vertex-Labeled Graphs CoRR Shiri Chechik
2010	J	`jnl`	Fault Tolerant Spanners for General Graphs. SIAM J. Comput. Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty
2010	A*	`conf`	Forbidden-set distance labels for graphs of bounded doubling dimension. PODC Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg
2010	A	`conf`	Robust Fault Tolerant Uncapacitated Facility Location. STACS Shiri Chechik, David Peleg
2010	—	`conf`	Sparse Reliable Graph Backbones. ICALP (2) Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg
2009	A*	`conf`	Fault-tolerant spanners for general graphs. STOC Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty
2009	B	`conf`	Low-Port Tree Representations. WG Shiri Chechik, David Peleg
2009	J	`jnl`	Robust Fault Tolerant uncapacitated facility location CoRR Shiri Chechik, David Peleg