Benny Sudakov - RankMe

294 papers A* 13A 2B 2Journal 273Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Communication Complexity of Disjointness under Product Distributions. CoRR Zach Hunter, Aleksa Milojevic, Benny Sudakov, István Tomon
2026	J	`jnl`	Saturation in random hypergraphs. Comb. Probab. Comput. Sahar Diskin, Ilay Hoshen, Dániel Korándi, Benny Sudakov, Maksim Zhukovskii
2025	J	`jnl`	Ascending subgraph decomposition. J. Comb. Theory B Kyriakos Katsamaktsis, Shoham Letzter, Alexey Pokrovskiy, Benny Sudakov
2025	J	`jnl`	C CoRR Zach Hunter, Aleksa Milojevic, István Tomon, Benny Sudakov
2025	J	`jnl`	Canonical Ramsey Numbers of Sparse Graphs. SIAM J. Discret. Math. Lior Gishboliner, Aleksa Milojevic, Benny Sudakov, Yuval Wigderson
2025	A*	`conf`	Economic Censorship Games in Fraud Proofs. EC Ben Berger, Edward W. Felten, Akaki Mamageishvili, Benny Sudakov
2025	J	`jnl`	Economic Censorship Games in Fraud Proofs. CoRR Ben Berger, Edward W. Felten, Akaki Mamageishvili, Benny Sudakov
2025	J	`jnl`	Induced Subgraphs of K Comb. Lior Gishboliner, Oliver Janzer, Benny Sudakov
2025	J	`jnl`	Kővári-Sós-Turán theorem for hereditary families. J. Comb. Theory B Zach Hunter, Aleksa Milojevic, Benny Sudakov, István Tomon
2025	J	`jnl`	Matrix discrepancy and the log-rank conjecture. Math. Program. Benny Sudakov, István Tomon
2025	J	`jnl`	Sunflowers and Ramsey problems for restricted intersections. CoRR Barnabás Janzer, Zhihan Jin, Benny Sudakov, Kewen Wu
2025	J	`jnl`	The Cost of Restaking vs. Proof-of-Stake. CoRR Akaki Mamageishvili, Benny Sudakov
2024	J	`jnl`	A generalization of Bondy's pancyclicity theorem. Comb. Probab. Comput. Nemanja Draganic, David Munhá Correia, Benny Sudakov
2024	J	`jnl`	Cycles with many chords. Random Struct. Algorithms Nemanja Draganic, Abhishek Methuku, David Munhá Correia, Benny Sudakov
2024	J	`jnl`	Effective Bounds for Induced Size-Ramsey Numbers of Cycles. Comb. Domagoj Bradac, Nemanja Draganic, Benny Sudakov
2024	J	`jnl`	Evasive Sets, Covering by Subspaces, and Point-Hyperplane Incidences. Discret. Comput. Geom. Benny Sudakov, István Tomon
2024	J	`jnl`	On Ramsey Size-Linear Graphs and Related Questions. SIAM J. Discret. Math. Domagoj Bradac, Lior Gishboliner, Benny Sudakov
2024	J	`jnl`	Ramsey Problems for Monotone Paths in Graphs and Hypergraphs. Comb. Lior Gishboliner, Zhihan Jin, Benny Sudakov
2024	J	`jnl`	Restricted subgraphs of edge-colored graphs and applications. CoRR Benny Sudakov
2024	B	`conf`	Searcher Competition in Block Building. AFT Akaki Mamageishvili, Christoph Schlegel, Benny Sudakov
2024	J	`jnl`	Searcher Competition in Block Building. CoRR Akaki Mamageishvili, Christoph Schlegel, Benny Sudakov, Danning Sui
2024	J	`jnl`	Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs. CoRR Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty, David Munhá Correia, Benny Sudakov
2024	J	`jnl`	Small Subgraphs with Large Average Degree. Comb. Oliver Janzer, Benny Sudakov, István Tomon
2024	J	`jnl`	The minimum degree removal lemma thresholds. J. Comb. Theory B Lior Gishboliner, Zhihan Jin, Benny Sudakov
2023	J	`jnl`	Asymptotics of the Hypergraph Bipartite Turán Problem. Comb. Domagoj Bradac, Lior Gishboliner, Oliver Janzer, Benny Sudakov
2023	J	`jnl`	Complete minors and average degree: A short proof. J. Graph Theory Noga Alon, Michael Krivelevich, Benny Sudakov
2023	J	`jnl`	Large Independent Sets from Local Considerations. Comb. Matija Bucic, Benny Sudakov
2023	J	`jnl`	Matrix discrepancy and the log-rank conjecture. CoRR Benny Sudakov, István Tomon
2023	J	`jnl`	Maximal chordal subgraphs. Comb. Probab. Comput. Lior Gishboliner, Benny Sudakov
2023	A*	`conf`	Small subgraphs with large average degree. SODA Oliver Janzer, Benny Sudakov, István Tomon
2023	J	`jnl`	Threshold Ramsey multiplicity for paths and even cycles. Eur. J. Comb. David Conlon, Jacob Fox, Benny Sudakov, Fan Wei
2023	J	`jnl`	Tight bounds for powers of Hamilton cycles in tournaments. J. Comb. Theory B Nemanja Draganic, David Munhá Correia, Benny Sudakov
2022	J	`jnl`	An average degree condition for independent transversals. J. Comb. Theory B Stefan Glock, Benny Sudakov
2022	J	`jnl`	Clique minors in graphs with a forbidden subgraph. Random Struct. Algorithms Matija Bucic, Jacob Fox, Benny Sudakov
2022	J	`jnl`	Infinite Sperner's theorem. J. Comb. Theory A Benny Sudakov, István Tomon, Adam Zsolt Wagner
2022	J	`jnl`	Ramsey number of 1-subdivisions of transitive tournaments. J. Comb. Theory B Nemanja Draganic, David Munhá Correia, Benny Sudakov, Raphael Yuster
2022	J	`jnl`	Uniform chain decompositions and applications. Random Struct. Algorithms Benny Sudakov, István Tomon, Adam Zsolt Wagner
2021	J	`jnl`	Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs. Comb. Matija Bucic, Dániel Korándi, Benny Sudakov
2021	J	`jnl`	Isomorphic bisections of cubic graphs. J. Comb. Theory B Shagnik Das, Alexey Pokrovskiy, Benny Sudakov
2021	J	`jnl`	Large Induced Matchings in Random Graphs. SIAM J. Discret. Math. Oliver Cooley, Nemanja Draganic, Mihyun Kang, Benny Sudakov
2021	J	`jnl`	Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming. SIAM J. Discret. Math. Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan
2021	J	`jnl`	Powers of paths in tournaments. Comb. Probab. Comput. Nemanja Draganic, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex D. Scott, Benny Sudakov
2021	J	`jnl`	The n-queens completion problem. CoRR Stefan Glock, David Munhá Correia, Benny Sudakov
2021	J	`jnl`	Tournament Quasirandomness from Local Counting. Comb. Matija Bucic, Eoin Long, Asaf Shapira, Benny Sudakov
2021	J	`jnl`	Unavoidable hypergraphs. J. Comb. Theory B Matija Bucic, Nemanja Draganic, Benny Sudakov, Tuan Tran
2021	J	`jnl`	Universal and unavoidable graphs. Comb. Probab. Comput. Matija Bucic, Nemanja Draganic, Benny Sudakov
2020	J	`jnl`	2-factors with J. Comb. Theory B Matija Bucic, Erik Jahn, Alexey Pokrovskiy, Benny Sudakov
2020	J	`jnl`	Asymptotics in percolation on high-girth expanders. Random Struct. Algorithms Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
2020	J	`jnl`	Books versus Triangles at the Extremal Density. SIAM J. Discret. Math. David Conlon, Jacob Fox, Benny Sudakov
2020	J	`jnl`	Bounded Degree Spanners of the Hypercube. Electron. J. Comb. Rajko Nenadov, Mehtab Sawhney, Benny Sudakov, Adam Zsolt Wagner
2020	J	`jnl`	Completion and deficiency problems. J. Comb. Theory B Rajko Nenadov, Benny Sudakov, Adam Zsolt Wagner
2020	J	`jnl`	Dense Induced Bipartite Subgraphs in Triangle-Free Graphs. Comb. Matthew Kwan, Shoham Letzter, Benny Sudakov, Tuan Tran
2020	J	`jnl`	Long Monotone Trails in Random Edge-Labellings of Random Graphs. Comb. Probab. Comput. Omer Angel, Asaf Ferber, Benny Sudakov, Vincent Tassion
2020	J	`jnl`	Long directed rainbow cycles and rainbow spanning trees. Eur. J. Comb. Frederik Benzing, Alexey Pokrovskiy, Benny Sudakov
2020	B	`conf`	Lower Bounds for Max-Cut via Semidefinite Programming. LATIN Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan
2020	J	`jnl`	Monochromatic trees in random tournaments. Comb. Probab. Comput. Matija Bucic, Sven Heberle, Shoham Letzter, Benny Sudakov
2020	J	`jnl`	Number of 1-Factorizations of Regular High-Degree Graphs. Comb. Asaf Ferber, Vishesh Jain, Benny Sudakov
2020	J	`jnl`	Orthonormal Representations of H-Free Graphs. Discret. Comput. Geom. Igor Balla, Shoham Letzter, Benny Sudakov
2020	J	`jnl`	Ramsey Goodness of Cycles. SIAM J. Discret. Math. Alexey Pokrovskiy, Benny Sudakov
2020	J	`jnl`	Short proofs of some extremal results III. Random Struct. Algorithms David Conlon, Jacob Fox, Benny Sudakov
2020	J	`jnl`	The Kőnig graph process. Random Struct. Algorithms Nina Kamcev, Michael Krivelevich, Natasha Morrison, Benny Sudakov
2020	J	`jnl`	The oriented size Ramsey number of directed paths. Eur. J. Comb. Shoham Letzter, Benny Sudakov
2019	J	`jnl`	3-Color bipartite Ramsey number of cycles and paths. J. Graph Theory Matija Bucic, Shoham Letzter, Benny Sudakov
2019	J	`jnl`	An algebraic perspective on integer sparse recovery. Appl. Math. Comput. Lenny Fukshansky, Deanna Needell, Benny Sudakov
2019	J	`jnl`	An extremal problem for integer sparse recovery. CoRR Sergei Konyagin, Benny Sudakov
2019	J	`jnl`	Anticoncentration for subgraph statistics. J. Lond. Math. Soc. Matthew Kwan, Benny Sudakov, Tuan Tran
2019	J	`jnl`	Colouring set families without monochromatic J. Comb. Theory A Shagnik Das, Roman Glebov, Benny Sudakov, Tuan Tran
2019	J	`jnl`	Directed Ramsey number for trees. J. Comb. Theory B Matija Bucic, Shoham Letzter, Benny Sudakov
2019	J	`jnl`	Equiangular Subspaces in Euclidean Spaces. Discret. Comput. Geom. Igor Balla, Benny Sudakov
2019	J	`jnl`	Monochromatic paths in random tournaments. Random Struct. Algorithms Matija Bucic, Shoham Letzter, Benny Sudakov
2019	J	`jnl`	Multicolour Bipartite Ramsey Number of Paths. Electron. J. Comb. Matija Bucic, Shoham Letzter, Benny Sudakov
2019	J	`jnl`	Submodular Minimization Under Congruency Constraints. Comb. Martin Nägele, Benny Sudakov, Rico Zenklusen
2019	J	`jnl`	The Zero Forcing Number of Graphs. SIAM J. Discret. Math. Thomas Kalinowski, Nina Kamcev, Benny Sudakov
2018	J	`jnl`	Anagram-Free Colourings of Graphs. Comb. Probab. Comput. Nina Kamcev, Tomasz Luczak, Benny Sudakov
2018	J	`jnl`	Counting Hamilton cycles in sparse random directed graphs. Random Struct. Algorithms Asaf Ferber, Matthew Kwan, Benny Sudakov
2018	J	`jnl`	Intercalates and discrepancy in random Latin squares. Random Struct. Algorithms Matthew Kwan, Benny Sudakov
2018	J	`jnl`	Linearly many rainbow trees in properly edge-coloured complete graphs. J. Comb. Theory B Alexey Pokrovskiy, Benny Sudakov
2018	J	`jnl`	Monochromatic cycle covers in random graphs. Random Struct. Algorithms Dániel Korándi, Frank Mousset, Rajko Nenadov, Nemanja Skoric, Benny Sudakov
2018	J	`jnl`	Non-trivially intersecting multi-part families. J. Comb. Theory A Matthew Kwan, Benny Sudakov, Pedro Vieira
2018	J	`jnl`	Ramsey Goodness of Bounded Degree Trees. Comb. Probab. Comput. Igor Balla, Alexey Pokrovskiy, Benny Sudakov
2018	A*	`conf`	Submodular Minimization Under Congruency Constraints. SODA Martin Nägele, Benny Sudakov, Rico Zenklusen
2018	J	`jnl`	Supersaturation in posets and applications involving the container method. J. Comb. Theory A Jonathan A. Noel, Alex Scott, Benny Sudakov
2018	J	`jnl`	The random k-matching-free process. Random Struct. Algorithms Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov
2018	J	`jnl`	Two Remarks on Eventown and Oddtown Problems. SIAM J. Discret. Math. Benny Sudakov, Pedro Vieira
2017	J	`jnl`	Anagram-free colorings of graphs. Electron. Notes Discret. Math. Nina Kamcev, Tomasz Luczak, Benny Sudakov
2017	J	`jnl`	Bounded colorings of multipartite graphs and hypergraphs. Eur. J. Comb. Nina Kamcev, Benny Sudakov, Jan Volec
2017	J	`jnl`	Bounded-Degree Spanning Trees in Randomly Perturbed Graphs. SIAM J. Discret. Math. Michael Krivelevich, Matthew Kwan, Benny Sudakov
2017	J	`jnl`	Compatible Hamilton cycles in Dirac graphs. Comb. Michael Krivelevich, Choongbum Lee, Benny Sudakov
2017	J	`jnl`	Counting and packing Hamilton cycles in dense graphs and oriented graphs. J. Comb. Theory B Asaf Ferber, Michael Krivelevich, Benny Sudakov
2017	J	`jnl`	Cycles in triangle-free graphs of large chromatic number. Comb. Alexandr V. Kostochka, Benny Sudakov, Jacques Verstraëte
2017	J	`jnl`	Directed Ramsey number for trees. Electron. Notes Discret. Math. Matija Bucic, Shoham Letzter, Benny Sudakov
2017	J	`jnl`	Domination in 3-tournaments. J. Comb. Theory A Dániel Korándi, Benny Sudakov
2017	J	`jnl`	Edge-disjoint rainbow trees in properly coloured complete graphs. Electron. Notes Discret. Math. Alexey Pokrovskiy, Benny Sudakov
2017	J	`jnl`	Equiangular lines and subspaces in Euclidean spaces. Electron. Notes Discret. Math. Igor Balla, Felix Dräxler, Peter Keevash, Benny Sudakov
2017	J	`jnl`	Finding paths in sparse random graphs requires many queries. Random Struct. Algorithms Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira
2017	J	`jnl`	Monochromatic paths in random tournaments. Electron. Notes Discret. Math. Matija Bucic, Shoham Letzter, Benny Sudakov
2017	J	`jnl`	Ordered Ramsey numbers. J. Comb. Theory B David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov
2017	J	`jnl`	Properly colored and rainbow copies of graphs with few cherries. J. Comb. Theory B Benny Sudakov, Jan Volec
2017	J	`jnl`	Ramsey goodness of paths. J. Comb. Theory B Alexey Pokrovskiy, Benny Sudakov
2017	—	`conf`	Robustness of graph properties. BCC Benny Sudakov
2017	J	`jnl`	Saturation in random graphs. Random Struct. Algorithms Dániel Korándi, Benny Sudakov
2017	J	`jnl`	Submodular Minimization Under Congruency Constraints. CoRR Martin Nägele, Benny Sudakov, Rico Zenklusen
2017	J	`jnl`	Testing Equality in Communication Graphs. IEEE Trans. Inf. Theory Noga Alon, Klim Efremenko, Benny Sudakov
2017	J	`jnl`	The Extremal Function for Cycles of Length l mod k. Electron. J. Comb. Benny Sudakov, Jacques Verstraëte
2017	J	`jnl`	The Threshold Probability for Long Cycles. Comb. Probab. Comput. Roman Glebov, Humberto Naves, Benny Sudakov
2017	J	`jnl`	Two-Sided, Unbiased Version of Hall's Marriage Theorem. Am. Math. Mon. Eli Shamir, Benny Sudakov
2016	J	`jnl`	A Random Triadic Process. SIAM J. Discret. Math. Dániel Korándi, Yuval Peled, Benny Sudakov
2016	J	`jnl`	Almost-Fisher families. J. Comb. Theory A Shagnik Das, Benny Sudakov, Pedro Vieira
2016	J	`jnl`	Compatible Hamilton cycles in random graphs. Random Struct. Algorithms Michael Krivelevich, Choongbum Lee, Benny Sudakov
2016	J	`jnl`	Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs. Comb. Probab. Comput. Michael Krivelevich, Matthew Kwan, Benny Sudakov
2016	J	`jnl`	Finding Hamilton cycles in random graphs with few queries. Random Struct. Algorithms Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira
2016	J	`jnl`	Judicious partitions of directed graphs. Random Struct. Algorithms Choongbum Lee, Po-Shen Loh, Benny Sudakov
2016	J	`jnl`	On the Maximum Quartet Distance between Phylogenetic Trees. SIAM J. Discret. Math. Noga Alon, Humberto Naves, Benny Sudakov
2016	J	`jnl`	On the densities of cliques and independent sets in graphs. Comb. Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov
2016	A*	`conf`	On the maximum quartet distance between phylogenetic trees. SODA Noga Alon, Humberto Naves, Benny Sudakov
2016	J	`jnl`	Ramsey numbers of cubes versus cliques. Comb. David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov
2016	J	`jnl`	Random directed graphs are robustly Hamiltonian. Random Struct. Algorithms Dan Hefetz, Angelika Steger, Benny Sudakov
2016	J	`jnl`	Short proofs of some extremal results II. J. Comb. Theory B David Conlon, Jacob Fox, Benny Sudakov
2016	J	`jnl`	Some Remarks on Rainbow Connectivity. J. Graph Theory Nina Kamcev, Michael Krivelevich, Benny Sudakov
2016	J	`jnl`	Testing Equality in Communication Graphs. Electron. Colloquium Comput. Complex. Noga Alon, Klim Efremenko, Benny Sudakov
2016	J	`jnl`	The minimum number of disjoint pairs in set systems and related problems. Comb. Shagnik Das, Wenying Gan, Benny Sudakov
2015	J	`jnl`	A random triadic process. Electron. Notes Discret. Math. Dániel Korándi, Yuval Peled, Benny Sudakov
2015	J	`jnl`	Almost-Fisher families. Electron. Notes Discret. Math. Shagnik Das, Benny Sudakov, Pedro Vieira
2015	J	`jnl`	Comparable pairs in families of sets. J. Comb. Theory B Noga Alon, Shagnik Das, Roman Glebov, Benny Sudakov
2015	J	`jnl`	Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electron. Notes Discret. Math. Michael Krivelevich, Matthew Kwan, Benny Sudakov
2015	J	`jnl`	Decomposing Random Graphs into Few Cycles and Edges. Comb. Probab. Comput. Dániel Korándi, Michael Krivelevich, Benny Sudakov
2015	J	`jnl`	Discrepancy of random graphs and hypergraphs. Random Struct. Algorithms Jie Ma, Humberto Naves, Benny Sudakov
2015	J	`jnl`	K Eur. J. Comb. Wenying Gan, Dániel Korándi, Benny Sudakov
2015	J	`jnl`	Long paths and cycles in random subgraphs of graphs with large minimum degree. Random Struct. Algorithms Michael Krivelevich, Choongbum Lee, Benny Sudakov
2015	J	`jnl`	Maximizing the Number of Independent Sets of a Fixed Size. Comb. Probab. Comput. Wenying Gan, Po-Shen Loh, Benny Sudakov
2015	J	`jnl`	Most Probably Intersecting Hypergraphs. Electron. J. Comb. Shagnik Das, Benny Sudakov
2015	J	`jnl`	On the maximum quartet distance between phylogenetic trees. CoRR Noga Alon, Humberto Naves, Benny Sudakov
2015	J	`jnl`	On the number of monotone sequences. J. Comb. Theory B Wojciech Samotij, Benny Sudakov
2015	J	`jnl`	Properly colored and rainbow copies of graphs with few cherries. Electron. Notes Discret. Math. Benny Sudakov, Jan Volec
2015	—	`ch.`	Recent developments in graph Ramsey theory. Surveys in Combinatorics David Conlon, Jacob Fox, Benny Sudakov
2015	J	`jnl`	Small complete minors above the extremal edge density. Comb. Asaf Shapira, Benny Sudakov
2015	J	`jnl`	Some Remarks on Rainbow Connectivity. Electron. Notes Discret. Math. Nina Kamcev, Michael Krivelevich, Benny Sudakov
2015	J	`jnl`	Sperner's Theorem and a Problem of Erdős, Katona and Kleitman. Comb. Probab. Comput. Shagnik Das, Wenying Gan, Benny Sudakov
2014	J	`jnl`	Cycle packing. Random Struct. Algorithms David Conlon, Jacob Fox, Benny Sudakov
2014	J	`jnl`	How Many Colors Guarantee a Rainbow Matching? Electron. J. Comb. Roman Glebov, Benny Sudakov, Tibor Szabó
2014	J	`jnl`	Musical Chairs. SIAM J. Discret. Math. Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov
2014	J	`jnl`	On the 3-Local Profiles of Graphs. J. Graph Theory Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov
2014	J	`jnl`	Short Proofs of Some Extremal Results. Comb. Probab. Comput. David Conlon, Jacob Fox, Benny Sudakov
2014	J	`jnl`	The Minimum Number of Nonnegative Edges in Hypergraphs. Electron. J. Comb. Hao Huang, Benny Sudakov
2014	J	`jnl`	Turán numbers of bipartite graphs plus an odd cycle. J. Comb. Theory B Peter Allen, Peter Keevash, Benny Sudakov, Jacques Verstraëte
2013	J	`jnl`	A problem of Erdős on the minimum number of k-cliques. J. Comb. Theory B Shagnik Das, Hao Huang, Jie Ma, Humberto Naves, Benny Sudakov
2013	J	`jnl`	All-pairs shortest paths in J. ACM Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick
2013	J	`jnl`	An improved bound for the stepping-up lemma. Discret. Appl. Math. David Conlon, Jacob Fox, Benny Sudakov
2013	J	`jnl`	Bisections of graphs. J. Comb. Theory B Choongbum Lee, Po-Shen Loh, Benny Sudakov
2013	J	`jnl`	Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz. Comb. Jacob Fox, Choongbum Lee, Benny Sudakov
2013	J	`jnl`	Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs. Comb. Probab. Comput. Hao Huang, Jie Ma, Asaf Shapira, Benny Sudakov, Raphael Yuster
2013	J	`jnl`	Longest cycles in sparse random digraphs. Random Struct. Algorithms Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
2013	J	`jnl`	On a conjecture of Erdős and Simonovits: Even cycles. Comb. Peter Keevash, Benny Sudakov, Jacques Verstraëte
2013	J	`jnl`	Rainbow Turán problem for even cycles. Eur. J. Comb. Shagnik Das, Choongbum Lee, Benny Sudakov
2013	A*	`conf`	Ramsey-type results for semi-algebraic relations. SoCG David Conlon, Jacob Fox, János Pach, Benny Sudakov, Andrew Suk
2013	J	`jnl`	Self-Similarity of Graphs. SIAM J. Discret. Math. Choongbum Lee, Po-Shen Loh, Benny Sudakov
2013	J	`jnl`	The phase transition in random graphs: A simple proof. Random Struct. Algorithms Michael Krivelevich, Benny Sudakov
2012	J	`jnl`	A counterexample to the Alon-Saks-Seymour conjecture and related problems. Comb. Hao Huang, Benny Sudakov
2012	J	`jnl`	Bandwidth theorem for random graphs. J. Comb. Theory B Hao Huang, Choongbum Lee, Benny Sudakov
2012	J	`jnl`	Biased orientation games. Discret. Math. Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
2012	J	`jnl`	Dirac's theorem for random graphs. Random Struct. Algorithms Choongbum Lee, Benny Sudakov
2012	J	`jnl`	Erdős-Hajnal-type theorems in hypergraphs. J. Comb. Theory B David Conlon, Jacob Fox, Benny Sudakov
2012	J	`jnl`	Getting a Directed Hamilton Cycle Two Times Faster. Comb. Probab. Comput. Choongbum Lee, Benny Sudakov, Dan Vilenchik
2012	J	`jnl`	Hamiltonicity, independence number, and pancyclicity. Eur. J. Comb. Choongbum Lee, Benny Sudakov
2012	J	`jnl`	Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels. J. Comb. Theory A Noga Alon, Peter Frankl, Hao Huang, Vojtech Rödl, Andrzej Rucinski, Benny Sudakov
2012	J	`jnl`	Long cycles in subgraphs of (pseudo)random directed graphs. J. Graph Theory Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
2012	J	`jnl`	Musical chairs CoRR Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov
2012	A*	`conf`	Nearly complete graphs decomposable into large induced matchings and their applications. STOC Noga Alon, Ankur Moitra, Benny Sudakov
2012	J	`jnl`	Nonnegative k-sums, fractional covers, and probability of small deviations. J. Comb. Theory B Noga Alon, Hao Huang, Benny Sudakov
2012	J	`jnl`	On two problems in graph Ramsey theory. Comb. David Conlon, Jacob Fox, Benny Sudakov
2012	J	`jnl`	Small Complete Minors Above the Extremal Edge Density CoRR Asaf Shapira, Benny Sudakov
2012	J	`jnl`	The Size of a Hypergraph and its Matching Number. Comb. Probab. Comput. Hao Huang, Po-Shen Loh, Benny Sudakov
2012	J	`jnl`	The size Ramsey number of a directed path. J. Comb. Theory B Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
2011	J	`jnl`	A Bound for the Cops and Robbers Problem. SIAM J. Discret. Math. Alex Scott, Benny Sudakov
2011	J	`jnl`	All-Pairs Shortest Paths in O(n CoRR Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick
2011	J	`jnl`	Bisections of graphs CoRR Choongbum Lee, Po-Shen Loh, Benny Sudakov
2011	J	`jnl`	Dependent random choice. Random Struct. Algorithms Jacob Fox, Benny Sudakov
2011	J	`jnl`	Erdos-Hajnal-type theorems in hypergraphs CoRR David Conlon, Jacob Fox, Benny Sudakov
2011	J	`jnl`	Generating all subsets of a finite set with disjoint unions. J. Comb. Theory A David Ellis, Benny Sudakov
2011	J	`jnl`	Local Resilience and Hamiltonicity Maker-Breaker Games in Random Regular Graphs. Comb. Probab. Comput. Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov
2011	J	`jnl`	Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications CoRR Noga Alon, Ankur Moitra, Benny Sudakov
2011	J	`jnl`	Oblivious Collaboration CoRR Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov
2011	A	`conf`	Oblivious Collaboration. DISC Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov
2011	J	`jnl`	On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs. SIAM J. Discret. Math. Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov
2011	J	`jnl`	On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs CoRR Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov
2011	J	`jnl`	Ramsey games with giants. Random Struct. Algorithms Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov
2011	J	`jnl`	Regular induced subgraphs of a random Graph. Random Struct. Algorithms Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald
2011	J	`jnl`	Two extensions of Ramsey's theorem CoRR David Conlon, Jacob Fox, Benny Sudakov
2010	J	`jnl`	A counterexample to the Alon-Saks-Seymour conjecture and related problems. Electron. Colloquium Comput. Complex. Hao Huang, Benny Sudakov
2010	J	`jnl`	A randomized embedding algorithm for trees. Comb. Benny Sudakov, Jan Vondrák
2010	A*	`conf`	All-Pairs Shortest Paths in O(n FOCS Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick
2010	J	`jnl`	Decompositions into Subgraphs of Small Diameter. Comb. Probab. Comput. Jacob Fox, Benny Sudakov
2010	J	`jnl`	Directed Graphs Without Short Cycles. Comb. Probab. Comput. Jacob Fox, Peter Keevash, Benny Sudakov
2010	J	`jnl`	Hamiltonicity thresholds in Achlioptas processes. Random Struct. Algorithms Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
2010	J	`jnl`	Maximum union-free subfamilies CoRR Jacob Fox, Choongbum Lee, Benny Sudakov
2010	J	`jnl`	Pancyclicity of Hamiltonian and highly connected graphs. J. Comb. Theory B Peter Keevash, Benny Sudakov
2010	J	`jnl`	Resilient Pancyclicity of Random and Pseudorandom Graphs. SIAM J. Discret. Math. Michael Krivelevich, Choongbum Lee, Benny Sudakov
2010	J	`jnl`	Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors. Electron. Colloquium Comput. Complex. Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson
2010	J	`jnl`	Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors. J. ACM Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson
2009	J	`jnl`	Avoiding small subgraphs in Achlioptas processes. Random Struct. Algorithms Michael Krivelevich, Po-Shen Loh, Benny Sudakov
2009	J	`jnl`	Constrained Ramsey Numbers. Comb. Probab. Comput. Po-Shen Loh, Benny Sudakov
2009	J	`jnl`	Density theorems for bipartite graphs and related Ramsey-type results. Comb. Jacob Fox, Benny Sudakov
2009	J	`jnl`	Large induced trees in K J. Comb. Theory B Jacob Fox, Po-Shen Loh, Benny Sudakov
2009	J	`jnl`	On the Random Satisfiable Process. Comb. Probab. Comput. Michael Krivelevich, Benny Sudakov, Dan Vilenchik
2009	J	`jnl`	Paths and Stability Number in Digraphs. Electron. J. Comb. Jacob Fox, Benny Sudakov
2009	J	`jnl`	Ramsey numbers of sparse hypergraphs. Random Struct. Algorithms David Conlon, Jacob Fox, Benny Sudakov
2009	J	`jnl`	Triangle packings and 1-factors in oriented graphs. J. Comb. Theory B Peter Keevash, Benny Sudakov
2009	J	`jnl`	Two remarks on the Burr-Erdos conjecture. Eur. J. Comb. Jacob Fox, Benny Sudakov
2008	J	`jnl`	Cycle lengths in sparse graphs. Comb. Benny Sudakov, Jacques Verstraëte
2008	J	`jnl`	How many random edges make a dense hypergraph non-2-colorable? Random Struct. Algorithms Benny Sudakov, Jan Vondrák
2008	J	`jnl`	Large Nearly Regular Induced Subgraphs. SIAM J. Discret. Math. Noga Alon, Michael Krivelevich, Benny Sudakov
2008	J	`jnl`	Local resilience of graphs. Random Struct. Algorithms Benny Sudakov, Van H. Vu
2008	J	`jnl`	On a problem of Duke-Erdös-Rödl on cycle-connected subgraphs. J. Comb. Theory B Jacob Fox, Benny Sudakov
2008	J	`jnl`	On the Strong Chromatic Number of Random Graphs. Comb. Probab. Comput. Po-Shen Loh, Benny Sudakov
2008	J	`jnl`	On the random satisfiable process CoRR Michael Krivelevich, Benny Sudakov, Dan Vilenchik
2008	J	`jnl`	Ramsey-Type Problem for an Almost Monochromatic K SIAM J. Discret. Math. Jacob Fox, Benny Sudakov
2008	J	`jnl`	The game chromatic number of random graphs. Random Struct. Algorithms Tom Bohman, Alan M. Frieze, Benny Sudakov
2008	J	`jnl`	Unavoidable patterns. J. Comb. Theory A Jacob Fox, Benny Sudakov
2007	J	`jnl`	Constrained Ramsey Numbers. Electron. Notes Discret. Math. Po-Shen Loh, Benny Sudakov
2007	J	`jnl`	Embedding nearly-spanning bounded degree trees. Comb. Noga Alon, Michael Krivelevich, Benny Sudakov
2007	J	`jnl`	Independent transversals in locally sparse graphs. J. Comb. Theory B Po-Shen Loh, Benny Sudakov
2007	J	`jnl`	Induced Ramsey-type theorems. Electron. Notes Discret. Math. Jacob Fox, Benny Sudakov
2007	J	`jnl`	Induced subgraphs of Ramsey graphs with many distinct degrees. J. Comb. Theory B Boris Bukh, Benny Sudakov
2007	J	`jnl`	Note making a Comb. Benny Sudakov
2007	J	`jnl`	On graphs with subgraphs having large independence numbers. J. Graph Theory Noga Alon, Benny Sudakov
2007	J	`jnl`	Rainbow Turán Problems. Comb. Probab. Comput. Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte
2007	J	`jnl`	Ramsey Numbers and the Size of Graphs. SIAM J. Discret. Math. Benny Sudakov
2007	J	`jnl`	Small subgraphs of random regular graphs. Discret. Math. Jeong Han Kim, Benny Sudakov, Van H. Vu
2006	J	`jnl`	A Ramsey-type result for the hypercube. J. Graph Theory Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák
2006	—	`conf`	Additive Approximation for Edge-Deletion Problems (Abstract). ICALP (1) Noga Alon, Asaf Shapira, Benny Sudakov
2006	J	`jnl`	Bounding the Number of Edges in Permutation Graphs. Electron. J. Comb. Peter Keevash, Po-Shen Loh, Benny Sudakov
2006	J	`jnl`	H-Free Graphs of Large Minimum Degree. Electron. J. Comb. Noga Alon, Benny Sudakov
2006	J	`jnl`	On a restricted cross-intersection problem. J. Comb. Theory A Peter Keevash, Benny Sudakov
2006	J	`jnl`	On smoothed analysis in dense graphs and formulas. Random Struct. Algorithms Michael Krivelevich, Benny Sudakov, Prasad Tetali
2006	J	`jnl`	On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs. J. Comb. Theory B József Balogh, Peter Keevash, Benny Sudakov
2006	J	`jnl`	Preface. Eur. J. Comb. Michael Krivelevich, Benny Sudakov
2006	J	`jnl`	Sparse halves in triangle-free graphs. J. Comb. Theory B Peter Keevash, Benny Sudakov
2005	J	`jnl`	A New Lower Bound For A Ramsey-Type Problem. Comb. Benny Sudakov
2005	J	`jnl`	A generalization of Turán's theorem. J. Graph Theory Benny Sudakov, Tibor Szabó, Van H. Vu
2005	A*	`conf`	Additive Approximation for Edge-Deletion Problems. FOCS Noga Alon, Asaf Shapira, Benny Sudakov
2005	J	`jnl`	Disjoint representability of sets and their complements. J. Comb. Theory B József Balogh, Peter Keevash, Benny Sudakov
2005	J	`jnl`	Large Kr-free subgraphs in Ks-free graphs and some other Ramsey-type problems. Random Struct. Algorithms Benny Sudakov
2005	J	`jnl`	On A Hypergraph Turán Problem Of Frankl. Comb. Peter Keevash, Benny Sudakov
2005	J	`jnl`	Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices. SIAM J. Discret. Math. Peter Keevash, Benny Sudakov
2005	A*	`conf`	Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. STOC Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson
2005	J	`jnl`	The Strong Chromatic Index of Random Graphs. SIAM J. Discret. Math. Alan M. Frieze, Michael Krivelevich, Benny Sudakov
2005	J	`jnl`	The Turán Number Of The Fano Plane. Comb. Peter Keevash, Benny Sudakov
2004	J	`jnl`	Extremal set systems with restricted k-wise intersections. J. Comb. Theory A Zoltán Füredi, Benny Sudakov
2004	J	`jnl`	Learning a Hidden Matching. SIAM J. Comput. Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov
2004	J	`jnl`	List Colouring When The Chromatic Number Is Close To the Order Of The Graph. Comb. Bruce A. Reed, Benny Sudakov
2004	J	`jnl`	Multicolour Turán problems. Adv. Appl. Math. Peter Keevash, Michael E. Saks, Benny Sudakov, Jacques Verstraëte
2004	J	`jnl`	Multicoloured extremal problems. J. Comb. Theory A Béla Bollobás, Peter Keevash, Benny Sudakov
2004	J	`jnl`	On the Value of a Random Minimum Weight Steiner Tree. Comb. Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov
2004	J	`jnl`	On the number of edges not covered by monochromatic copies of a fixed graph. J. Comb. Theory B Peter Keevash, Benny Sudakov
2004	J	`jnl`	Packing triangles in a graph and its complement. J. Graph Theory Peter Keevash, Benny Sudakov
2004	J	`jnl`	Triangle Factors In Sparse Pseudo-Random Graphs. Comb. Michael Krivelevich, Benny Sudakov, Tibor Szabó
2003	J	`jnl`	A few remarks on Ramsey-Tura'n-type problems. J. Comb. Theory B Benny Sudakov
2003	J	`jnl`	Approximate coloring of uniform hypergraphs. J. Algorithms Michael Krivelevich, Benny Sudakov
2003	J	`jnl`	Covering codes with improved density. IEEE Trans. Inf. Theory Michael Krivelevich, Benny Sudakov, Van H. Vu
2003	J	`jnl`	Induced subgraphs of prescribed size. J. Graph Theory Noga Alon, Michael Krivelevich, Benny Sudakov
2003	J	`jnl`	Local Density In Graphs With Forbidden Subgraphs. Comb. Probab. Comput. Peter Keevash, Benny Sudakov
2003	J	`jnl`	Maximum cuts and judicious partitions in graphs without short cycles. J. Comb. Theory B Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov
2003	J	`jnl`	On Ramsey Numbers of Sparse Graphs. Comb. Probab. Comput. Alexandr V. Kostochka, Benny Sudakov
2003	J	`jnl`	On the probability of independent sets in random graphs. Random Struct. Algorithms Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
2003	J	`jnl`	Sparse pseudo-random graphs are Hamiltonian. J. Graph Theory Michael Krivelevich, Benny Sudakov
2003	J	`jnl`	The Largest Eigenvalue Of Sparse Random Graphs. Comb. Probab. Comput. Michael Krivelevich, Benny Sudakov
2003	J	`jnl`	Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions. Comb. Probab. Comput. Noga Alon, Michael Krivelevich, Benny Sudakov
2002	J	`jnl`	A Note on Odd Cycle-Complete Graph Ramsey Numbers. Electron. J. Comb. Benny Sudakov
2002	J	`jnl`	A Sharp Threshold For Network Reliability. Comb. Probab. Comput. Michael Krivelevich, Benny Sudakov, Van H. Vu
2002	J	`jnl`	Asymptotically the List Colouring Constants Are 1. J. Comb. Theory B Bruce A. Reed, Benny Sudakov
2002	A*	`conf`	Learning a Hidden Matching. FOCS Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov
2002	J	`jnl`	On k-wise set-intersections and k-wise Hamming-distances. J. Comb. Theory A Vince Grolmusz, Benny Sudakov
2002	J	`jnl`	On the asymmetry of random regular graphs and random graphs. Random Struct. Algorithms Jeong Han Kim, Benny Sudakov, Van H. Vu
2001	J	`jnl`	Acyclic edge colorings of graphs. J. Graph Theory Noga Alon, Benny Sudakov, Ayal Zaks
2001	J	`jnl`	Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs. J. Algorithms Michael Krivelevich, Ram Nathaniel, Benny Sudakov
2001	A*	`conf`	Approximating coloring and maximum independent sets in 3-uniform hypergraphs. SODA Michael Krivelevich, Ram Nathaniel, Benny Sudakov
2001	J	`jnl`	Asymptotically Optimal Tree-Packings in Regular Graphs. Electron. J. Comb. Alexander K. Kelmans, Dhruv Mubayi, Benny Sudakov
2001	J	`jnl`	Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms. SIAM J. Discret. Math. Noga Alon, Benny Sudakov, Uri Zwick
2001	A*	`conf`	Constructing worst case instances for semidefinite programming based approximation algorithms. SODA Noga Alon, Benny Sudakov, Uri Zwick
2001	J	`jnl`	Nowhere-Zero Flows in Random Graphs. J. Comb. Theory B Benny Sudakov
2001	J	`jnl`	Random regular graphs of high degree. Random Struct. Algorithms Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
2000	J	`jnl`	Bipartite Subgraphs And The Smallest Eigenvalue. Comb. Probab. Comput. Noga Alon, Benny Sudakov
1999	J	`jnl`	Coloring Graphs with Sparse Neighborhoods. J. Comb. Theory B Noga Alon, Michael Krivelevich, Benny Sudakov
1999	J	`jnl`	List Coloring of Random and Pseudo-Random Graphs. Comb. Noga Alon, Michael Krivelevich, Benny Sudakov
1999	J	`jnl`	On Two Segmentation Problems. J. Algorithms Noga Alon, Benny Sudakov
1998	A	`conf`	Approximate Coloring of Uniform Hypergraphs (Extended Abstract). ESA Michael Krivelevich, Benny Sudakov
1998	J	`jnl`	Coloring Random Graphs. Inf. Process. Lett. Michael Krivelevich, Benny Sudakov
1998	A*	`conf`	Finding a Large Hidden Clique in a Random Graph. SODA Noga Alon, Michael Krivelevich, Benny Sudakov
1998	J	`jnl`	Finding a large hidden clique in a random graph. Random Struct. Algorithms Noga Alon, Michael Krivelevich, Benny Sudakov
1998	J	`jnl`	Note on alternating directed cycles. Discret. Math. Gregory Z. Gutin, Benny Sudakov, Anders Yeo
1998	J	`jnl`	The chromatic numbers of random hypergraphs. Random Struct. Algorithms Michael Krivelevich, Benny Sudakov
1997	J	`jnl`	A Note on τ-Critical Linear Hypergraphs. Graphs Comb. Benny Sudakov
1995	J	`jnl`	Disjoint Systems. Random Struct. Algorithms Noga Alon, Benny Sudakov
1993	—	`conf`	Disjoint Systems (Extended Abstract). Algebraic Coding Noga Alon, Benny Sudakov