The following pages link to Yuri Rabinovich (Q193720):
Displaying 43 items.
- (Q664541) (redirect page) (← links)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543) (← links)
- Cuts, trees and \(\ell_1\)-embeddings of graphs (Q705742) (← links)
- On average distortion of embedding metrics into the line (Q938313) (← links)
- A note on the influence of an \(\epsilon\)-biased random source (Q1305932) (← links)
- Local and global clique numbers (Q1328379) (← links)
- Lower bounds on the distortion of embedding finite metric spaces in graphs (Q1380790) (← links)
- Extremal hypercuts and shadows of simplicial complexes (Q1717600) (← links)
- A lower bound on the distortion of embedding planar metrics into Euclidean space (Q1864139) (← links)
- The geometry of graphs and some of its algorithmic applications (Q1894703) (← links)
- Witness sets for families of binary vectors (Q1906149) (← links)
- Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes (Q2040016) (← links)
- A generalization of the blind rotating table game (Q2122785) (← links)
- On connectivity of the facet graphs of simplicial complexes (Q2279942) (← links)
- (Q2722006) (← links)
- On Multiplicative $\lambda$-Approximations and Some Geometric Applications (Q2848204) (← links)
- Upper Bounds on Boolean-Width with Applications to Exact Algorithms (Q2867092) (← links)
- Local Versus Global Properties of Metric Spaces (Q2884582) (← links)
- (Q2921660) (← links)
- (Q3002805) (← links)
- On the Boolean-Width of a Graph: Structure and Applications (Q3057622) (← links)
- Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces (Q3119488) (← links)
- On average distortion of embedding metrics into the line and into L <sub>1</sub> (Q3581251) (← links)
- Local versus global properties of metric spaces (Q3581570) (← links)
- Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs (Q3588402) (← links)
- Hard Metrics from Cayley Graphs of Abelian Groups (Q3590931) (← links)
- On Complexity of the Subpattern Problem (Q3629466) (← links)
- (Q4230353) (← links)
- (Q4234054) (← links)
- Techniques for bounding the convergence rate of genetic algorithms (Q4238438) (← links)
- Deterministic approximation of the cover time (Q4417001) (← links)
- (Q4471340) (← links)
- A lower bound on the distortion of embedding planar metrics into Euclidean space (Q4557541) (← links)
- Testing for Forbidden Order Patterns in an Array (Q4575847) (← links)
- Rational Polygons: Odd Compression Ratio and Odd Plane Coverings (Q4604395) (← links)
- A computational view of population genetics (Q4705315) (← links)
- (Q4942227) (← links)
- Testing for forbidden order patterns in an array (Q5242883) (← links)
- Embedding k-Outerplanar Graphs into l1 (Q5470821) (← links)
- (Q5743377) (← links)
- On dominated \(\ell_1\) metrics (Q5939287) (← links)
- (Q6059200) (← links)
- Large simple \(d\)-cycles in simplicial complexes (Q6074040) (← links)
