Approximation schemes for covering and packing R Aschner, MJ Katz, G Morgenstern, Y Yuditsky International Workshop on Algorithms and Computation, 89-100, 2013 | 25 | 2013 |

Polychromatic coloring for half-planes S Smorodinsky, Y Yuditsky Journal of Combinatorial Theory, Series A 119 (1), 146-154, 2012 | 13 | 2012 |

Erdős–Szekeres without induction S Norin, Y Yuditsky Discrete & Computational Geometry 55 (4), 963-971, 2016 | 11 | 2016 |

Towards efficient private distributed computation on unbounded input streams S Dolev, J Garay, N Gilboa, V Kolesnikov, Y Yuditsky Journal of Mathematical Cryptology 9 (2), 79-94, 2015 | 11 | 2015 |

Almost all string graphs are intersection graphs of plane convex sets J Pach, B Reed, Y Yuditsky arXiv preprint arXiv:1803.06710, 2018 | 7 | 2018 |

Brief announcement: Efficient private distributed computation on unbounded input streams S Dolev, J Garay, N Gilboa, V Kolesnikov, Y Yuditsky International Symposium on Distributed Computing, 431-432, 2012 | 5 | 2012 |

Polychromatic coloring for half-planes S Smorodinsky, Y Yuditsky Scandinavian Workshop on Algorithm Theory, 118-126, 2010 | 5 | 2010 |

Almost all string graphs are intersection graphs of plane convex sets J Pach, B Reed, Y Yuditsky Discrete & Computational Geometry 63, 888-917, 2020 | 2 | 2020 |

Erd\H {o} s-Szekeres without induction S Norin, Y Yuditsky arXiv preprint arXiv:1509.03332, 2015 | 2 | 2015 |

Typical structure of hereditary graph families. II. Exotic examples S Norin, Y Yuditsky arXiv preprint arXiv:2007.00688, 2020 | 1 | 2020 |

Efficient private distributed computation on unbounded input streams S Dolev, J Garay, N Gilboa, V Kolesnikov, Y Yuditsky arXiv preprint arXiv:1208.4909, 2012 | 1 | 2012 |

Weak Coloring Numbers of Intersection Graphs Z Dvořák, J Pekárek, T Ueckerdt, Y Yuditsky arXiv preprint arXiv:2103.17094, 2021 | | 2021 |

On Multicolour Ramsey Numbers and Subset-Colouring of Hypergraphs B Jartoux, C Keller, S Smorodinsky, Y Yuditsky arXiv preprint arXiv:2103.12627, 2021 | | 2021 |

Typical structure of hereditary graph families. I. Apex-free families S Norin, Y Yuditsky arXiv preprint arXiv:2007.00686, 2020 | | 2020 |

The --Net Problem N Alon, B Jartoux, C Keller, S Smorodinsky, Y Yuditsky arXiv preprint arXiv:2003.07061, 2020 | | 2020 |

Counterexamples to Thomassen's conjecture on decomposition of cubic graphs T Bellitto, T Klimošová, M Merker, M Witkowski, Y Yuditsky arXiv preprint arXiv:1908.06697, 2019 | | 2019 |

Properties of Typical *T*-Free GraphsY Yuditsky McGill University (Canada), 2018 | | 2018 |

The ϵ-t-Net Problem N Alon, B Jartoux, C Keller, S Smorodinsky, Y Yuditsky | | |