The following pages link to Shakhar Smorodinsky (Q458292):
Displaying 50 items.
- (Q209545) (redirect page) (← links)
- On totally positive matrices and geometric incidences (Q458293) (← links)
- Strong conflict-free coloring for intervals (Q487034) (← links)
- Polychromatic coloring for half-planes (Q645968) (← links)
- Colorful strips (Q659707) (← links)
- Hitting sets online and unique-MAX coloring (Q741535) (← links)
- \(k\)-sets in four dimensions (Q818689) (← links)
- Compatible geometric matchings (Q924079) (← links)
- A note on the online first-fit algorithm for coloring \(k\)-inductive graphs (Q975523) (← links)
- Coloring geometric range spaces (Q1017922) (← links)
- Small weak epsilon-nets (Q1025302) (← links)
- On neighbors in geometric permutations. (Q1398279) (← links)
- On piercing numbers of families satisfying the \((p,q)_{r}\) property (Q1615671) (← links)
- On the union complexity of families of axis-parallel rectangles with a low packing number (Q1627208) (← links)
- Improved bounds on the Hadwiger-Debrunner numbers (Q1650467) (← links)
- Distinct distances between points and lines (Q1702254) (← links)
- Sharp bounds on geometric permutations of pairwise disjoint balls in \(\mathbb{R}^d\) (Q1971507) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- A new lower bound on Hadwiger-Debrunner numbers in the plane (Q2055287) (← links)
- The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
- From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem (Q2189732) (← links)
- Conflict-free coloring of intersection graphs of geometric objects (Q2207603) (← links)
- On vertex rankings of graphs and its relatives (Q2342634) (← links)
- Convexity in topological affine planes (Q2464359) (← links)
- Conflict-free coloring of points and simple regions in the plane (Q2486862) (← links)
- Geometric permutations induced by line transversals through a fixed point (Q2571327) (← links)
- Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
- (Q2921677) (← links)
- (Q2921711) (← links)
- (Q3046485) (← links)
- Hitting Sets Online and Vertex Ranking (Q3092243) (← links)
- (Q3132895) (← links)
- Weak ε-nets and interval chains (Q3452194) (← links)
- On Center Regions and Balls Containing Many Points (Q3511348) (← links)
- On The Chromatic Number of Geometric Hypergraphs (Q3519201) (← links)
- Colorful Strips (Q3557004) (← links)
- Conflict-Free Coloring Made Stronger (Q3569883) (← links)
- Polychromatic Coloring for Half-Planes (Q3569884) (← links)
- (Q3579389) (← links)
- On the chromatic number of some geometric hypergraphs (Q3581577) (← links)
- (Q3601520) (← links)
- CONFLICT-FREE COLORINGS OF SHALLOW DISCS (Q3604140) (← links)
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks (Q4441902) (← links)
- Lenses in arrangements of pseudo-circles and their applications (Q4557546) (← links)
- On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers (Q4575896) (← links)
- On interference among moving sensors and related problems (Q4606303) (← links)
- (Q4819250) (← links)
- Strong Conflict-Free Coloring for Intervals (Q4909516) (← links)
- Online Conflict-Free Colouring for Hypergraphs (Q4933597) (← links)
- Deterministic conflict-free coloring for intervals (Q4962749) (← links)
