Shiri Chechik

1.3k total citations
46 papers, 367 citations indexed

About

Shiri Chechik is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Shiri Chechik has authored 46 papers receiving a total of 367 indexed citations (citations by other indexed papers that have themselves been cited), including 39 papers in Computational Theory and Mathematics, 16 papers in Computer Networks and Communications and 16 papers in Artificial Intelligence. Recurrent topics in Shiri Chechik's work include Complexity and Algorithms in Graphs (39 papers), Advanced Graph Theory Research (21 papers) and Optimization and Search Problems (11 papers). Shiri Chechik is often cited by papers focused on Complexity and Algorithms in Graphs (39 papers), Advanced Graph Theory Research (21 papers) and Optimization and Search Problems (11 papers). Shiri Chechik collaborates with scholars based in Israel, United States and Denmark. Shiri Chechik's co-authors include David Peleg, Liam Roditty, Aaron Bernstein, Michael Langberg, Ittai Abraham, Virginia Vassilevska Williams, Grant Schoenebeck, Robert E. Tarjan, Aleksandrs Slivkins and David Kempe and has published in prestigious journals such as SHILAP Revista de lepidopterología, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Shiri Chechik

43 papers receiving 346 citations

Peers

Shiri Chechik

CTM

CNC

AI

CGCD

CVPR

Surender Baswana India

Eden Chlamtáč United States

Loukas Georgiadis Greece

Naomi Nishimura Canada

Toshihiro Fujito Japan

Stanislav Živný United Kingdom

Morteza Monemizadeh United States

Dana Moshkovitz United States

Stephan Kreutzer Germany

Nicolas Nisse France

Surender Baswana India

Shiri Chechik

388 ×1.4

CTM

252 ×1.2

CNC

155 ×1.6

AI

80 ×1.6

CGCD

52 ×1.7

CVPR

Citations per year, relative to Shiri Chechik Shiri Chechik (= 1×) peers Surender Baswana

Countries citing papers authored by Shiri Chechik

Since Specialization

Citations

This map shows the geographic impact of Shiri Chechik's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Shiri Chechik with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Shiri Chechik more than expected).

Fields of papers citing papers by Shiri Chechik

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Shiri Chechik. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Shiri Chechik. The network helps show where Shiri Chechik may publish in the future.

Co-authorship network of co-authors of Shiri Chechik

This figure shows the co-authorship network connecting the top 25 collaborators of Shiri Chechik. A scholar is included among the top collaborators of Shiri Chechik based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Shiri Chechik. Shiri Chechik is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Bilò, Davide, et al.. (2024). Approximate Distance Sensitivity Oracles in Subquadratic Space. SHILAP Revista de lepidopterología. Volume 3.

2.

Chechik, Shiri & Tianyi Zhang. (2022). Constant-Round Near-Optimal Spanners in Congested Clique. 325–334. 1 indexed citations

3.

Chechik, Shiri, et al.. (2019). Optimal distributed coloring algorithms for planar graphs in the LOCAL model. Symposium on Discrete Algorithms. 787–804. 3 indexed citations

4.

Chechik, Shiri, et al.. (2018). Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 5 indexed citations

5.

Bernstein, Aaron & Shiri Chechik. (2017). Deterministic partially dynamic single source shortest paths for sparse graphs. Symposium on Discrete Algorithms. 453–469. 10 indexed citations

6.

Chechik, Shiri, et al.. (2017). Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs. arXiv (Cornell University). 1900–1918. 4 indexed citations

7.

Chechik, Shiri, et al.. (2016). Secluded Connectivity Problems. Algorithmica. 79(3). 708–741. 10 indexed citations

8.

Chechik, Shiri, et al.. (2016). Bottleneck Paths and Trees and Deterministic Graphical Games. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 47(47). 13. 2 indexed citations

9.

Chechik, Shiri, et al.. (2015). Fault tolerant additive and (μ,α)-spanners. Theoretical Computer Science. 580. 94–100. 8 indexed citations

10.

Abraham, Ittai, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, & Renato F. Werneck. (2015). On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. 740–753.

11.

Chechik, Shiri, Edith Cohen, & Haim Kaplan. (2015). Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 659–679. 3 indexed citations

12.

Chechik, Shiri & David Peleg. (2014). The fault-tolerant capacitated K-center problem. Theoretical Computer Science. 566. 12–25. 9 indexed citations

13.

Chechik, Shiri & David Peleg. (2014). Robust fault tolerant uncapacitated facility location. Theoretical Computer Science. 543. 9–23. 1 indexed citations

14.

Abraham, Ittai, Shiri Chechik, & Kunal Talwar. (2014). Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 10 indexed citations

15.

Abraham, Ittai, Shiri Chechik, David Kempe, & Aleksandrs Slivkins. (2013). Low-distortion inference of latent similarities from a multiplex social network. Symposium on Discrete Algorithms. 1853–1883. 12 indexed citations

16.

Chechik, Shiri. (2013). New additive spanners. Symposium on Discrete Algorithms. 498–512. 24 indexed citations

17.

Chechik, Shiri. (2013). New Additive Spanners. 498–512. 15 indexed citations

18.

Chechik, Shiri. (2012). Fault-tolerant compact routing schemes for general graphs. Information and Computation. 222. 36–44. 5 indexed citations

19.

Chechik, Shiri. (2011). Improved Distance Oracles for Vertex-Labeled Graphs. arXiv (Cornell University). 2 indexed citations

20.

Chechik, Shiri, Yuval Emek, Boaz Patt-Shamir, & David Peleg. (2011). Sparse reliable graph backbones. Information and Computation. 210. 31–39. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact