Yelena Yuditsky

Orcid: 0000-0002-6467-3437

Affiliations:

Université libre de Bruxelles, Belgium

According to our database¹, Yelena Yuditsky authored at least 22 papers between 2010 and 2025.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

Face covers and rooted minors in bounded genus graphs.

[BibT_eX]

[DOI]

CoRR, March, 2025

On graph classes with constant domination-packing ratio.

[BibT_eX]

[DOI]

CoRR, March, 2025

On Separating Path and Tree Systems in Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2025

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

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Compact Representation of Semilinear and Terrain-Like Graphs.

[BibT_eX]

[DOI]

Jean Cardinal

Yelena Yuditsky

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Conflict-Free Colouring of Subsets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., September, 2024

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

[BibT_eX]

[DOI]

James Davies

Yelena Yuditsky

CoRR, 2024

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

[BibT_eX]

[DOI]

CoRR, 2024

Total Matching and Subdeterminants.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

2022

On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2022

Weak Coloring Numbers of Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

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

[BibT_eX]

[DOI]

Graphs Comb., 2021

Integer programs with bounded subdeterminants and two nonzeros per row.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

The ε-t-Net Problem.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2018

Almost All String Graphs are Intersection Graphs of Plane Convex Sets.

[BibT_eX]

[DOI]

János Pach

Bruce A. Reed

Yelena Yuditsky

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2016

Erdős-Szekeres Without Induction.

[BibT_eX]

[DOI]

Sergey Norin

Yelena Yuditsky

Discret. Comput. Geom., 2016

2013

Towards Efficient Private Distributed Computation on Unbounded Input Streams.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Approximation Schemes for Covering and Packing.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Towards Efficient Private Distributed Computation on Unbounded Input Streams - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2013

2012

Efficient Private Distributed Computation on Unbounded Input Streams

[BibT_eX]

[DOI]

CoRR, 2012

Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 26th International Symposium, 2012

2010

Polychromatic Coloring for Half-Planes.

[BibT_eX]

[DOI]

Shakhar Smorodinsky

Yelena Yuditsky

Proceedings of the Algorithm Theory, 2010

Yelena Yuditsky

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...