Yelena Yuditsky

I am a postdoctoral researcher in the Department of Mathematics at Université libre de Bruxelles with Samuel Fiorini and Gwenaël Joret. Before arriving in Brussels, I was a postdoctoral researcher at Ben-Gurion University of the Negev and Karlsruhe institute of technology.

I did my PhD at McGill University under the supervision of Bruce Reed and Sergey Norin.

My research interests are in extremal combinatorics and structural graph theory. I am also interested in discrete geometry.

Papers:

Submitted:

    • B. Jatroux, C. Keller, S. Smorodinsky and Y. Yuditsky. Conflict-Free Colouring of Subsets.

    • Z. Dvořák, J. Pekárek, T. Ueckerdt and Y. Yuditsky. Weak Coloring Numbers of Intersection Graphs. arxiv.

    • B. Jatroux, C. Keller, S. Smorodinsky and Y. Yuditsky. On Multicolour Ramsey Numbers and Subset-Colouring of Hypergraphs. arxiv.

    • S. Norin and Y. Yuditsky. Typical structure of hereditary graph families. I. Apex-free families. arxiv.

    • S. Norin and Y. Yuditsky. Typical structure of hereditary graph families. II. Exotic examples. arxiv.

Published:

    • S. Fiorini, G. Joret, S. Weltge and Y. Yuditsky. Integer programs with bounded subdeterminants and two nonzeros per row. Proceedings of the Symposium on Foundations of Computer Science (FOCS), (2021). arxiv.

    • T. Bellitto, T. Klimošová, M. Merker, M. Witkowski and Y. Yuditsky. Counterexamples to Thomassen's conjecture on decomposition of cubic graphs. Graphs and Combinatorics, 37: 2595–2599, (2021). arxiv, G&C.

    • N. Alon, B. Jatroux, C. Keller, S. Smorodinsky and Y. Yuditsky. The ε-t-Net Problem. Proceedings of the 36th International Symposium on Computational Geometry (SoCG), 5: 1-15 (2020). arxiv.

    • J. Pach, B. Reed and Y. Yuditsky. Almost All String Graphs are Intersection Graphs of Plane Convex Sets. Proceedings of the 34th International Symposium on Computational Geometry (SoCG), 68: 1-14 (2018). arxiv, DCG.

    • S. Norin and Y. Yuditsky. Erdős-Szekeres without induction. Discrete & Computational Geometry 55(4): 963-971 (2016). DCG.

    • R. Aschner, M. J. Katz, G. Morgenstern and Y. Yuditsky. Approximation Schemes for Covering and Packing. Proceedings of the Workshop on Algorithms and Computation (WALCOM): 89-100, (2013). WALCOM.

    • S. Smorodinsky and Y. Yuditsky. Polychromatic coloring for half-planes. Journal of Combinatorial Theory, Series A, 119(1): 146-154 (2012). JCTA.

    • S. Dolev, J. A. Garay, N. Gilboa, V. Kolesnikov and Y. Yuditsky Towards Efficient Private Distributed Computation on Unbounded Input Streams. Brief announcement appeared at The International Symposium on Distributed Computing (DISC) 431-432 (2012). The full version of the paper appeared in Journal of Mathematical Cryptology, 9(2): 79-94, (2015). ACNS.