Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams. - Shlomi Dolev; Juan A. Garay; Niv Gilboa; Vladimir Kolesnikov; Yelena Yuditsky (DISC, 2012)

Efficient Private Distributed Computation on Unbounded Input Streams - Shlomi Dolev; Juan A. Garay; Niv Gilboa; Vladimir Kolesnikov; Yelena Yuditsky (CoRR, 2012)

Polychromatic coloring for half-planes. - Shakhar Smorodinsky; Yelena Yuditsky (J. Comb. Theory A, 2012)

Towards Efficient Private Distributed Computation on Unbounded Input Streams - (Extended Abstract). - Shlomi Dolev; Juan A. Garay; Niv Gilboa; Vladimir Kolesnikov; Yelena Yuditsky (ACNS, 2013)

Approximation Schemes for Covering and Packing. - Rom Aschner; Matthew J. Katz; Gila Morgenstern; Yelena Yuditsky (WALCOM, 2013)

Towards efficient private distributed computation on unbounded input streams. - Shlomi Dolev; Juan A. Garay; Niv Gilboa; Vladimir Kolesnikov; Yelena Yuditsky (J. Math. Cryptol., 2015)

Erdős-Szekeres Without Induction. - Sergey Norin; Yelena Yuditsky (Discret. Comput. Geom., 2016)

Almost All String Graphs are Intersection Graphs of Plane Convex Sets. - János Pach; Bruce A. Reed; Yelena Yuditsky (Discret. Comput. Geom., 2020)

Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs. - Thomas Bellitto; Tereza Klimosová; Martin Merker; Marcin Witkowski; Yelena Yuditsky (Graphs Comb., 2021)

Weak Coloring Numbers of Intersection Graphs. - Zdenek Dvorák 001; Jakub Pekárek; Torsten Ueckerdt; Yelena Yuditsky (SoCG, 2022)

The ε-t-Net Problem. - Noga Alon; Bruno Jartoux; Chaya Keller; Shakhar Smorodinsky; Yelena Yuditsky (Discret. Comput. Geom., 2022)

On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs. - Bruno Jartoux; Chaya Keller; Shakhar Smorodinsky; Yelena Yuditsky (SIAM J. Discret. Math., 2022)

Total Matching and Subdeterminants. - Luca Ferrarini; Samuel Fiorini; Stefan Kober; Yelena Yuditsky (ISCO, 2024)

Integer programs with nearly totally unimodular matrices: the cographic case. - Manuel Aprile; Samuel Fiorini; Gwenaël Joret; Stefan Kober; Michal T. Seweryn; Stefan Weltge; Yelena Yuditsky (CoRR, 2024)

Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity. - James Davies; Yelena Yuditsky (CoRR, 2024)

Conflict-Free Colouring of Subsets. - Bruno Jartoux; Chaya Keller; Shakhar Smorodinsky; Yelena Yuditsky (Discret. Comput. Geom., 2024)

Integer programs with nearly totally unimodular matrices: the cographic case. - Manuel Aprile; Samuel Fiorini; Gwenaël Joret; Stefan Kober; Miehal T. Seweryn; Stefan Weltge; Yelena Yuditsky (SODA, 2025)

On Separating Path and Tree Systems in Graphs. - Ahmad Biniaz; Prosenjit Bose; Jean-Lou De Carufel; Anil Maheshwari; Babak Miraftab; Saeed Odak; Michiel Smid; Shakhar Smorodinsky; Yelena Yuditsky (Discret. Math. Theor. Comput. Sci., 2025)

Integer programs with bounded subdeterminants and two nonzeros per row. - Samuel Fiorini; Gwenaël Joret; Stefan Weltge; Yelena Yuditsky (J. ACM, 2025)

On graph classes with constant domination-packing ratio. - Marthe Bonamy; Mónika Csikós; Anna Gujgiczer; Yelena Yuditsky (CoRR, 2025)

Face covers and rooted minors in bounded genus graphs. - Samuel Fiorini; Stefan Kober; Michal T. Seweryn; Abhinav Shantanam; Yelena Yuditsky (CoRR, 2025)

Compact Representation of Semilinear and Terrain-like Graphs. - Jean Cardinal; Yelena Yuditsky (CoRR, 2025)