default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYelena Yuditsky
Person information
- affiliation: Université libre de Bruxelles, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Bruno Jartoux
, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky:
Conflict-Free Colouring of Subsets. Discret. Comput. Geom. 72(2): 876-891 (2024)- [c9]Luca Ferrarini, Samuel Fiorini, Stefan Kober, Yelena Yuditsky:
Total Matching and Subdeterminants. ISCO 2024: 192-204 - [i12]Manuel Aprile, Samuel Fiorini, Gwenaël Joret, Stefan Kober, Michal T. Seweryn, Stefan Weltge, Yelena Yuditsky:
Integer programs with nearly totally unimodular matrices: the cographic case. CoRR abs/2407.09477 (2024) - [i11]James Davies, Yelena Yuditsky:
Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity. CoRR abs/2407.16882 (2024) - 2023
- [i10]Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Babak Miraftab, Saeed Odak, Michiel Smid, Shakhar Smorodinsky, Yelena Yuditsky:
On Separating Path and Tree Systems in Graphs. CoRR abs/2312.14295 (2023) - [i9]Luca Ferrarini, Samuel Fiorini, Stefan Kober, Yelena Yuditsky:
Total Matching and Subdeterminants. CoRR abs/2312.17630 (2023) - 2022
- [j7]Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky:
Theε -t-Net Problem. Discret. Comput. Geom. 68(2): 618-644 (2022) - [j6]Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky:
On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs. SIAM J. Discret. Math. 36(3): 1848-1860 (2022) - [c8]Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky:
Weak Coloring Numbers of Intersection Graphs. SoCG 2022: 39:1-39:15 - [i8]Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky:
Conflict-Free Colouring of Subsets. CoRR abs/2207.01041 (2022) - 2021
- [j5]Thomas Bellitto, Tereza Klimosová, Martin Merker, Marcin Witkowski, Yelena Yuditsky:
Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs. Graphs Comb. 37(6): 2595-2599 (2021) - [c7]Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky:
Integer programs with bounded subdeterminants and two nonzeros per row. FOCS 2021: 13-24 - [i7]Zdenek Dvorák, Jakub Pekárek, Torsten Ueckerdt, Yelena Yuditsky:
Weak Coloring Numbers of Intersection Graphs. CoRR abs/2103.17094 (2021) - [i6]Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky:
Integer programs with bounded subdeterminants and two nonzeros per row. CoRR abs/2106.05947 (2021) - 2020
- [j4]János Pach, Bruce A. Reed, Yelena Yuditsky:
Almost All String Graphs are Intersection Graphs of Plane Convex Sets. Discret. Comput. Geom. 63(4): 888-917 (2020) - [c6]Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky:
Theε -t-Net Problem. SoCG 2020: 5:1-5:15 - [i5]Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky:
Theε -t-Net Problem. CoRR abs/2003.07061 (2020)
2010 – 2019
- 2018
- [c5]János Pach, Bruce A. Reed, Yelena Yuditsky:
Almost All String Graphs are Intersection Graphs of Plane Convex Sets. SoCG 2018: 68:1-68:14 - [i4]János Pach, Bruce A. Reed, Yelena Yuditsky:
Almost all string graphs are intersection graphs of plane convex sets. CoRR abs/1803.06710 (2018) - 2016
- [j3]Sergey Norin, Yelena Yuditsky:
Erdős-Szekeres Without Induction. Discret. Comput. Geom. 55(4): 963-971 (2016) - 2015
- [j2]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky:
Towards efficient private distributed computation on unbounded input streams. J. Math. Cryptol. 9(2): 79-94 (2015) - 2013
- [c4]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky:
Towards Efficient Private Distributed Computation on Unbounded Input Streams - (Extended Abstract). ACNS 2013: 69-83 - [c3]Rom Aschner, Matthew J. Katz, Gila Morgenstern, Yelena Yuditsky:
Approximation Schemes for Covering and Packing. WALCOM 2013: 89-100 - [i3]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky:
Towards Efficient Private Distributed Computation on Unbounded Input Streams. IACR Cryptol. ePrint Arch. 2013: 220 (2013) - 2012
- [j1]Shakhar Smorodinsky, Yelena Yuditsky:
Polychromatic coloring for half-planes. J. Comb. Theory A 119(1): 146-154 (2012) - [c2]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky:
Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams. DISC 2012: 431-432 - [i2]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky:
Efficient Private Distributed Computation on Unbounded Input Streams. CoRR abs/1208.4909 (2012) - [i1]Rom Aschner, Matthew J. Katz, Gila Morgenstern, Yelena Yuditsky:
Approximation Schemes for Covering and Packing. CoRR abs/1209.5199 (2012) - 2010
- [c1]Shakhar Smorodinsky, Yelena Yuditsky:
Polychromatic Coloring for Half-Planes. SWAT 2010: 118-126
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
