The following pages link to Shiri Chechik (Q418119):
Displaying 50 items.
- Sparse reliable graph backbones (Q418121) (← links)
- The fault-tolerant capacitated \(K\)-center problem (Q484314) (← links)
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- Secluded connectivity problems (Q1679225) (← links)
- Fault-tolerant compact routing schemes for general graphs (Q1951569) (← links)
- Single-source shortest paths in the CONGEST model with improved bounds (Q2166365) (← links)
- Robust fault tolerant uncapacitated facility location (Q2250439) (← links)
- Fault tolerant additive and \((\mu, \alpha)\)-spanners (Q2344775) (← links)
- Improved Distance Oracles and Spanners for Vertex-Labeled Graphs (Q2912852) (← links)
- Approximate Distance Oracles with Improved Bounds (Q2941481) (← links)
- Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier (Q2969037) (← links)
- Fault-Tolerant Compact Routing Schemes for General Graphs (Q3012912) (← links)
- Robust Fault Tolerant uncapacitated facility location (Q3113748) (← links)
- f-Sensitivity Distance Oracles and Routing Schemes (Q3586453) (← links)
- Sparse Reliable Graph Backbones (Q3587444) (← links)
- Near-Optimal Light Spanners (Q4554361) (← links)
- On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs (Q4575632) (← links)
- Near-Optimal Light Spanners (Q4575642) (← links)
- Fully dynamic all-pairs shortest paths with worst-case update-time revisited (Q4575765) (← links)
- Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs (Q4575766) (← links)
- (1 + ∊)-Approximate <i>f</i>-Sensitive Distance Oracles (Q4575839) (← links)
- Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs (Q4575870) (← links)
- (Q4601879) (← links)
- (Q4607873) (← links)
- Ramsey Spanning Trees and Their Applications (Q4607997) (← links)
- Multipath Spanners via Fault-Tolerant Spanners (Q4916037) (← links)
- Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension (Q4962222) (← links)
- (Q5002673) (← links)
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles (Q5091160) (← links)
- Distance sensitivity oracles with subcubic preprocessing time and fast query time (Q5145020) (← links)
- Dynamic Low-Stretch Spanning Trees in Subpolynomial Time (Q5146794) (← links)
- Distance Labels with Optimal Local Stretch (Q5167730) (← links)
- Fault-tolerant spanners for general graphs (Q5172738) (← links)
- Compact routing schemes with improved stretch (Q5176080) (← links)
- Forbidden-set distance labels for graphs of bounded doubling dimension (Q5176198) (← links)
- Fault Tolerant Additive Spanners (Q5200507) (← links)
- Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model (Q5236232) (← links)
- Near Optimal Algorithms For The Single Source Replacement Paths Problem (Q5236312) (← links)
- Low-Distortion Inference of Latent Similarities from a Multiplex Social Network (Q5255011) (← links)
- Approximate distance oracles with constant query time (Q5259601) (← links)
- Approximate Nearest Neighbor Search in Metrics of Planar Graphs (Q5351887) (← links)
- (Q5351928) (← links)
- Deterministic decremental single source shortest paths: beyond the o(mn) bound (Q5361846) (← links)
- Better Approximation Algorithms for the Graph Diameter (Q5384040) (← links)
- Fault Tolerant Spanners for General Graphs (Q5390599) (← links)
- Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels (Q5415545) (← links)
- New Additive Spanners (Q5741744) (← links)
- Low-distortion Inference of Latent Similarities from a Multiplex Social Network (Q5741842) (← links)
- Low-Port Tree Representations (Q5851094) (← links)
- Single-Source Shortest Paths in the CONGEST Model with Improved Bound (Q5855273) (← links)
