Follow
Yelena Yuditsky
Yelena Yuditsky
Université libre de Bruxelles
Verified email at ulb.be - Homepage
Title
Cited by
Cited by
Year
Approximation schemes for covering and packing
R Aschner, MJ Katz, G Morgenstern, Y Yuditsky
International Workshop on Algorithms and Computation, 89-100, 2013
352013
Polychromatic coloring for half-planes
S Smorodinsky, Y Yuditsky
Journal of Combinatorial Theory, Series A 119 (1), 146-154, 2012
202012
Integer programs with bounded subdeterminants and two nonzeros per row
S Fiorini, G Joret, S Weltge, Y Yuditsky
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 13-24, 2022
162022
Erdős–Szekeres without induction
S Norin, Y Yuditsky
Discrete & Computational Geometry 55, 963-971, 2016
112016
Almost all string graphs are intersection graphs of plane convex sets
J Pach, B Reed, Y Yuditsky
arXiv preprint arXiv:1803.06710, 2018
72018
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
72015
Almost all string graphs are intersection graphs of plane convex sets
J Pach, B Reed, Y Yuditsky
Discrete & Computational Geometry 63 (4), 888-917, 2020
52020
Polychromatic coloring for half-planes
S Smorodinsky, Y Yuditsky
Scandinavian Workshop on Algorithm Theory, 118-126, 2010
52010
Weak coloring numbers of intersection graphs
Z Dvořák, J Pekárek, T Ueckerdt, Y Yuditsky
arXiv preprint arXiv:2103.17094, 2021
42021
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
42012
Erd\H {o} s-Szekeres without induction
S Norin, Y Yuditsky
arXiv preprint arXiv:1509.03332, 2015
22015
Counterexamples to Thomassen’s conjecture on decomposition of cubic graphs
T Bellitto, T Klimošová, M Merker, M Witkowski, Y Yuditsky
Graphs and Combinatorics 37, 2595-2599, 2021
12021
Typical structure of hereditary graph families. II. Exotic examples
S Norin, Y Yuditsky
arXiv preprint arXiv:2007.00688, 2020
12020
Efficient private distributed computation on unbounded input streams
S Dolev, J Garay, N Gilboa, V Kolesnikov, Y Yuditsky
arXiv preprint arXiv:1208.4909, 2012
12012
Total Matching and Subdeterminants
L Ferrarini, S Fiorini, S Kober, Y Yuditsky
arXiv preprint arXiv:2312.17630, 2023
2023
On Separating Path and Tree Systems in Graphs
A Biniaz, P Bose, JL De Carufel, A Maheshwari, B Miraftab, S Odak, ...
arXiv preprint arXiv:2312.14295, 2023
2023
Conflict-Free Colouring of Subsets
B Jartoux, C Keller, S Smorodinsky, Y Yuditsky
Discrete & Computational Geometry, 1-16, 2023
2023
The -t-Net Problem
N Alon, B Jartoux, C Keller, S Smorodinsky, Y Yuditsky
Discrete & Computational Geometry 68 (2), 618-644, 2022
2022
On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs
B Jartoux, C Keller, S Smorodinsky, Y Yuditsky
SIAM Journal on Discrete Mathematics 36 (3), 1848-1860, 2022
2022
Typical structure of hereditary graph families. I. Apex-free families
S Norin, Y Yuditsky
arXiv preprint arXiv:2007.00686, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20