Shiri Chechik

According to our database1, Shiri Chechik authored at least 52 papers between 2009 and 2020.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Dynamic Low-Stretch Spanning Trees in Subpolynomial Time.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Improved Girth Approximation and Roundtrip Spanners.
CoRR, 2019

Reachability and Shortest Paths in the Broadcast CONGEST Model.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Near Optimal Algorithms For The Single Source Replacement Paths Problem.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
Near-Optimal Light Spanners.
ACM Trans. Algorithms, 2018

Incremental Topological Sort and Cycle Detection in Expected Total Time.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Ramsey Spanning Trees and their Applications.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Near-Optimal Approximate Decremental All Pairs Shortest Paths.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Clustering Small Samples With Quality Guarantees: Adaptivity With One2all PPS.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Clustering over Multi-Objective Samples: The one2all Sample.
CoRR, 2017

Secluded Connectivity Problems.
Algorithmica, 2017

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

(1 + ∊)-Approximate f-Sensitive Distance Oracles.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Fully dynamic all-pairs shortest paths with worst-case update-time revisited.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Compact Routing Schemes.
Encyclopedia of Algorithms, 2016

Additive Spanners.
Encyclopedia of Algorithms, 2016

Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension.
ACM Trans. Algorithms, 2016

Deterministic decremental single source shortest paths: beyond the o(mn) bound.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Bottleneck Paths and Trees and Deterministic Graphical Games.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
The fault-tolerant capacitated K-center problem.
Theor. Comput. Sci., 2015

Fault tolerant additive and (μ, α)-spanners.
Theor. Comput. Sci., 2015

Low-Distortion Inference of Latent Similarities from a Multiplex Social Network.
SIAM J. Comput., 2015

Approximate Distance Oracles with Improved Bounds.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees.
Proceedings of the Approximation, 2015

Approximate Nearest Neighbor Search in Metrics of Planar Graphs.
Proceedings of the Approximation, 2015

2014
Robust fault tolerant uncapacitated facility location.
Theor. Comput. Sci., 2014

Approximate distance oracles with constant query time.
Proceedings of the Symposium on Theory of Computing, 2014

Better Approximation Algorithms for the Graph Diameter.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Distance Labels with Optimal Local Stretch.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier.
Proceedings of the Approximation, 2014

2013
Fault-tolerant compact routing schemes for general graphs.
Inf. Comput., 2013

Approximate Distance Oracle with Constant Query Time
CoRR, 2013

Dynamic Decremental Approximate Distance Oracles with (1+ε, 2) stretch.
CoRR, 2013

New Additive Spanners.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Compact routing schemes with improved stretch.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012
Sparse reliable graph backbones.
Inf. Comput., 2012

f-Sensitivity Distance Oracles and Routing Schemes.
Algorithmica, 2012

Fault Tolerant Additive Spanners.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Multipath Spanners via Fault-Tolerant Spanners.
Proceedings of the Design and Analysis of Algorithms, 2012

Improved Distance Oracles and Spanners for Vertex-Labeled Graphs.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Improved Distance Oracles for Vertex-Labeled Graphs
CoRR, 2011

2010
Fault Tolerant Spanners for General Graphs.
SIAM J. Comput., 2010

f-Sensitivity Distance Oracles and Routing Schemes.
Proceedings of the Algorithms, 2010

2009
Low-Port Tree Representations.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009


  Loading...