Author image not provided
 Shiri Chechik

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article4.18
Citation Count142
Publication count34
Publication years2009-2018
Available for download17
Average downloads per article165.94
Downloads (cumulative)2,821
Downloads (12 Months)645
Downloads (6 Weeks)60
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


34 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 34
Result page: 1 2

Sort by:

1
January 2018 SODA '18: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 7,   Downloads (12 Months): 7,   Downloads (Overall): 7

Full text available: PDFPDF
In the incremental cycle detection problem edges are inserted to a directed graph (initially empty) and the algorithm has to report once a directed cycle is formed in the graph. A closely related problem to the incremental cycle detection is that of the incremental topological sort problem, in which edges ...

2
January 2018 SODA '18: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,   Downloads (12 Months): 4,   Downloads (Overall): 4

Full text available: PDFPDF
The metric Ramsey problem asks for the largest subset S of a metric space that can be embedded into an ultrametric (more generally into a Hilbert space) with a given distortion. Study of this problem was motivated as a non-linear version of Dvoretzky theorem. Mendel and Naor [MN07] devised the ...

3
November 2017 Algorithmica: Volume 79 Issue 3, November 2017
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Consider a setting where possibly sensitive information sent over a path in a network is visible to every neighbor of the path, i.e., every neighbor of some node on the path, thus including the nodes on the path itself. The exposure of a path P can be measured as the ...

4
January 2017 SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 4,   Downloads (12 Months): 11,   Downloads (Overall): 11

Full text available: PDFPDF
Connectivity related concepts are of fundamental interest in graph theory. The area has received extensive attention over four decades, but many problems remain unsolved, especially for directed graphs. A directed graph is 2-edge-connected (resp., 2-vertex-connected) if the removal of any edge (resp., vertex) leaves the graph strongly connected. In this ...

5
January 2017 SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 7,   Downloads (12 Months): 36,   Downloads (Overall): 36

Full text available: PDFPDF
An f -Sensitive Distance Oracle with stretch α preprocesses a graph G ( V, E ) and produces a small data structure that is used to answer subsequent queries. A query is a triple consisting of a set F ⊂ E of at most f edges, and vertices s and ...

6
January 2017 SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 4,   Downloads (12 Months): 64,   Downloads (Overall): 64

Full text available: PDFPDF
In this paper we consider the decremental single-source shortest paths (SSSP) problem, where given a graph G and a source node s the goal is to maintain shortest paths between s and all other nodes in G under a sequence of online adversarial edge deletions. (Our algorithm can also be ...

7
January 2017 SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,   Downloads (12 Months): 30,   Downloads (Overall): 30

Full text available: PDFPDF
We revisit the classic problem of dynamically maintaining shortest paths between all pairs of nodes of a directed weighted graph. The allowed updates are insertions and deletions of nodes and their incident edges. We give worst-case guarantees on the time needed to process a single update (in contrast to related ...

8 published by ACM
June 2016 STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 7,   Downloads (12 Months): 128,   Downloads (Overall): 298

Full text available: PDFPDF
In this paper we consider the decremental single-source shortest paths (SSSP) problem, where given a graph G and a source node s the goal is to maintain shortest paths between s and all other nodes in G under a sequence of online adversarial edge deletions. In their seminal work, Even ...
Keywords: Approximation Algorithms, Dynamic Algorithms, Shortest Paths

9 published by ACM
February 2016 ACM Transactions on Algorithms (TALG): Volume 12 Issue 2, February 2016
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2,   Downloads (12 Months): 25,   Downloads (Overall): 67

Full text available: PDFPDF
This article proposes a forbidden-set labeling scheme for the family of unweighted graphs with doubling dimension bounded by α. For an n -vertex graph G in this family, and for any desired precision parameter ε > 0, the labeling scheme stores an O (1 + ε − 1 ) 2α ...
Keywords: compact routing, distance labeling, forbidden sets, Doubling dimension, fault-tolerance

10
January 2016 SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 5,   Downloads (12 Months): 58,   Downloads (Overall): 119

Full text available: PDFPDF
A spanner H of a weighted undirected graph G is a "sparse" subgraph that approximately preserves distances between every pair of vertices in G. We refer to H as a δ-spanner of G for some parameter δ ≥ 1 if the distance in H between every vertex pair is at ...

11
January 2016 SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 87,   Downloads (Overall): 127

Full text available: PDFPDF
Given a base weighted planar graph G input on n nodes and parameters M , ε we present a dynamic distance oracle with 1 + ε stretch and worst case update and query costs of ε --3 M 4 · poly-log( n ). We allow arbitrary edge weight updates as ...

12 published by ACM
June 2015 STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 2,   Downloads (12 Months): 69,   Downloads (Overall): 588

Full text available: PDFPDF
A distance oracle is a compact data structure capable of quickly estimating distances in a given graph. In this paper we provide a new construction for distance oracles in general undirected weighted graphs. Our data structure, for any integer k, requires O( n 1+1/k ) space, guarantees a stretch of ...
Keywords: shortest paths, constant query-time, distance oracles

13
May 2015 Theoretical Computer Science: Volume 580 Issue C, May 2015
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 2

Graph spanners are sparse subgraphs that preserve the distances of the original graph up to some approximation ratio (the spanner's stretch). A number of algorithms are known for constructing sparse spanners with small multiplicative or additive stretch. Recently, algorithms were introduced for constructing fault-tolerant multiplicative spanners of general graphs. This ...
Keywords: Additive spanners, Fault tolerance, Graph algorithms, Spanners

14 published by ACM
May 2014 STOC '14: Proceedings of the forty-sixth annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 11
Downloads (6 Weeks): 1,   Downloads (12 Months): 22,   Downloads (Overall): 152

Full text available: PDFPDF
An approximate distance oracle is a succinct data structure that provides fast answers to distance queries between any two nodes of a given graph. In this paper we consider approximate distance oracles for general undirected graphs with non-negative edge weights with constant query time. We present a distance oracle of ...
Keywords: distance oracles, constant querytime, shortest paths

15
January 2014 SODA '14: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 1,   Downloads (12 Months): 24,   Downloads (Overall): 137

Full text available: PDFPDF
The diameter is a fundamental graph parameter and its computation is necessary in many applications. The fastest known way to compute the diameter exactly is to solve the All-Pairs Shortest Paths (APSP) problem. In the absence of fast algorithms, attempts were made to seek fast algorithms that approximate the diameter. ...

16 published by ACM
July 2013 PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 2,   Downloads (12 Months): 24,   Downloads (Overall): 281

Full text available: PDFPDF
We consider the problem of compact routing in weighted general undirected graphs, in which the goal is to construct local routing tables that allow information to be sent on short paths in the network. In this paper the first improvement to the work of Thorup and Zwick [SPAA'01] is presented. ...
Keywords: stretch factor, compact routing, name independent routing

17
January 2013 SODA '13: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 18
Downloads (6 Weeks): 1,   Downloads (12 Months): 9,   Downloads (Overall): 41

Full text available: PDFPDF
This paper considers additive and purely additive spanners. We present a new purely additive spanner of size Õ ( n 7/5 ) with additive stretch 4. This construction fills in the gap between the two existing constructions for purely additive spanners, one for 2-additive spanner of size O ( n ...

18
January 2013 SODA '13: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Downloads (Overall): 30

Full text available: PDFPDF
Much of social network analysis is --- implicitly or explicitly --- predicated on the assumption that individuals tend to be more similar to their friends than to strangers. Thus, an observed social network provides a noisy signal about the latent underlying "social space:" the way in which individuals are similar ...

19
January 2013 Information and Computation: Volume 222, January, 2013
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 2

This paper considers compact fault-tolerant routing schemes for weighted general graphs, namely, routing schemes that avoid a set of failed (or forbidden) edges. We present a compact routing scheme capable of handling multiple edge failures. Assume a source node s contains a message M designated to a destination target t ...
Keywords: Compact routing, Fault-tolerance, Forbidden sets

20
December 2012 MedAlg'12: Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

An s -spanner H of a graph G is a subgraph such that the distance between any two vertices u and v in H is greater by at most a multiplicative factor s than the distance in G . In this paper, we focus on an extension of the concept ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us