Yelena Yuditsky

Orcid: 0000-0002-6467-3437

Affiliations:
  • Université libre de Bruxelles, Belgium


According to our database1, Yelena Yuditsky authored at least 22 papers between 2012 and 2025.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Compact Representation of Semilinear and Terrain-like Graphs.
CoRR, July, 2025

Face covers and rooted minors in bounded genus graphs.
CoRR, March, 2025

On graph classes with constant domination-packing ratio.
CoRR, March, 2025

Integer programs with bounded subdeterminants and two nonzeros per row.
J. ACM, February, 2025

On Separating Path and Tree Systems in Graphs.
Discret. Math. Theor. Comput. Sci., 2025

Integer programs with nearly totally unimodular matrices: the cographic case.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024
Conflict-Free Colouring of Subsets.
Discret. Comput. Geom., September, 2024

Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity.
CoRR, 2024

Integer programs with nearly totally unimodular matrices: the cographic case.
CoRR, 2024

Total Matching and Subdeterminants.
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

2022
On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs.
SIAM J. Discret. Math., September, 2022

The ε-t-Net Problem.
Discret. Comput. Geom., 2022

Weak Coloring Numbers of Intersection Graphs.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs.
Graphs Comb., 2021

2020
Almost All String Graphs are Intersection Graphs of Plane Convex Sets.
Discret. Comput. Geom., 2020

2016
Erdős-Szekeres Without Induction.
Discret. Comput. Geom., 2016

2015
Towards efficient private distributed computation on unbounded input streams.
J. Math. Cryptol., 2015

2013
Approximation Schemes for Covering and Packing.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Towards Efficient Private Distributed Computation on Unbounded Input Streams - (Extended Abstract).
Proceedings of the Applied Cryptography and Network Security, 2013

2012
Polychromatic coloring for half-planes.
J. Comb. Theory A, 2012

Efficient Private Distributed Computation on Unbounded Input Streams
CoRR, 2012

Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams.
Proceedings of the Distributed Computing - 26th International Symposium, 2012


  Loading...