| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Noga Alon, Hao Huang, Benny Sudakov |
Nonnegative k-sums, fractional covers, and probability of small deviations.  |
J. Comb. Theory, Ser. B  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hao Huang, Choongbum Lee, Benny Sudakov |
Bandwidth theorem for random graphs. |
J. Comb. Theory, Ser. B |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Peter Frankl, Hao Huang, Vojtech Rödl, Andrzej Rucinski, Benny Sudakov |
Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels. |
J. Comb. Theory, Ser. A |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov |
The size Ramsey number of a directed path. |
J. Comb. Theory, Ser. B |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov |
Biased orientation games. |
Discrete Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Choongbum Lee, Benny Sudakov |
Hamiltonicity, independence number, and pancyclicity. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov |
Ramsey games with giants. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald |
Regular induced subgraphs of a random Graph. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Fox, Benny Sudakov |
Dependent random choice. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov |
Local Resilience and Hamiltonicity Maker-Breaker Games in Random Regular Graphs. |
Combinatorics, Probability & Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov |
Oblivious Collaboration |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Conlon, Jacob Fox, Benny Sudakov |
Erdos-Hajnal-type theorems in hypergraphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Conlon, Jacob Fox, Benny Sudakov |
Two extensions of Ramsey's theorem |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick |
All-Pairs Shortest Paths in $O(n^2)$ time with high probability |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Ankur Moitra, Benny Sudakov |
Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov |
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Choongbum Lee, Po-Shen Loh, Benny Sudakov |
Bisections of graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov |
On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alex Scott, Benny Sudakov |
A Bound for the Cops and Robbers Problem. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov |
Oblivious Collaboration. |
DISC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Benny Sudakov |
Pancyclicity of Hamiltonian and highly connected graphs. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson |
Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hao Huang, Benny Sudakov |
A counterexample to the Alon-Saks-Seymour conjecture and related problems. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Krivelevich, Eyal Lubetzky, Benny Sudakov |
Hamiltonicity thresholds in Achlioptas processes. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Fox, Peter Keevash, Benny Sudakov |
Directed Graphs Without Short Cycles. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Fox, Benny Sudakov |
Decompositions into Subgraphs of Small Diameter. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson |
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Sudakov, Jan Vondrák |
A randomized embedding algorithm for trees. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Fox, Choongbum Lee, Benny Sudakov |
Maximum union-free subfamilies |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Krivelevich, Choongbum Lee, Benny Sudakov |
Resilient Pancyclicity of Random and Pseudorandom Graphs. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick |
All-Pairs Shortest Paths in O(n2) Time with High Probability. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Fox, Po-Shen Loh, Benny Sudakov |
Large induced trees in Kr-free graphs. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Benny Sudakov |
Triangle packings and 1-factors in oriented graphs. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Fox, Benny Sudakov |
Two remarks on the Burr-Erdos conjecture. |
Eur. J. Comb. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Fox, Benny Sudakov |
Paths and Stability Number in Digraphs. |
Electr. J. Comb. |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Conlon, Jacob Fox, Benny Sudakov |
Ramsey numbers of sparse hypergraphs. |
Random Struct. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Po-Shen Loh, Benny Sudakov |
Avoiding small subgraphs in Achlioptas processes. |
Random Struct. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov, Dan Vilenchik |
On the Random Satisfiable Process. |
Combinatorics, Probability & Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Po-Shen Loh, Benny Sudakov |
Constrained Ramsey Numbers. |
Combinatorics, Probability & Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Fox, Benny Sudakov |
Density theorems for bipartite graphs and related Ramsey-type results. |
Combinatorica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Fox, Benny Sudakov |
Unavoidable patterns. |
J. Comb. Theory, Ser. A |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Fox, Benny Sudakov |
On a problem of Duke-Erdös-Rödl on cycle-connected subgraphs. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Sudakov, Jan Vondrák |
How many random edges make a dense hypergraph non-2-colorable? |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tom Bohman, Alan M. Frieze, Benny Sudakov |
The game chromatic number of random graphs. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Sudakov, Van H. Vu |
Local resilience of graphs. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Po-Shen Loh, Benny Sudakov |
On the Strong Chromatic Number of Random Graphs. |
Combinatorics, Probability & Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Sudakov, Jacques Verstraëte |
Cycle lengths in sparse graphs. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C35, 05C38 |
| 1 | Michael Krivelevich, Benny Sudakov, Dan Vilenchik |
On the random satisfiable process |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Michael Krivelevich, Benny Sudakov |
Large Nearly Regular Induced Subgraphs. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Fox, Benny Sudakov |
Ramsey-Type Problem for an Almost Monochromatic K4. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Po-Shen Loh, Benny Sudakov |
Independent transversals in locally sparse graphs. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Bukh, Benny Sudakov |
Induced subgraphs of Ramsey graphs with many distinct degrees. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Po-Shen Loh, Benny Sudakov |
Constrained Ramsey Numbers. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Fox, Benny Sudakov |
Induced Ramsey-type theorems. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeong Han Kim, Benny Sudakov, Van H. Vu |
Small subgraphs of random regular graphs. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte |
Rainbow Turán Problems. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Sudakov |
Note making a K 4-free graph bipartite. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Michael Krivelevich, Benny Sudakov |
Embedding nearly-spanning bounded degree trees. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Sudakov |
Ramsey Numbers and the Size of Graphs. |
SIAM J. Discrete Math. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Benny Sudakov |
On graphs with subgraphs having large independence numbers. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Benny Sudakov |
On a restricted cross-intersection problem. |
J. Comb. Theory, Ser. A |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | József Balogh, Peter Keevash, Benny Sudakov |
On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Benny Sudakov |
Sparse halves in triangle-free graphs. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov |
Preface. |
Eur. J. Comb. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Po-Shen Loh, Benny Sudakov |
Bounding the Number of Edges in Permutation Graphs. |
Electr. J. Comb. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Benny Sudakov |
H-Free Graphs of Large Minimum Degree. |
Electr. J. Comb. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov, Prasad Tetali |
On smoothed analysis in dense graphs and formulas. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák |
A Ramsey-type result for the hypercube. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira, Benny Sudakov |
Additive Approximation for Edge-Deletion Problems (Abstract). |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | József Balogh, Peter Keevash, Benny Sudakov |
Disjoint representability of sets and their complements. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Sudakov |
Large Kr-free subgraphs in Ks-free graphs and some other Ramsey-type problems. |
Random Struct. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Sudakov |
A New Lower Bound For A Ramsey-Type Problem. |
Combinatorica |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C35, 05D10, 05C55 |
| 1 | Peter Keevash, Benny Sudakov |
The Turán Number Of The Fano Plane. |
Combinatorica |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C65, 05C35 |
| 1 | Peter Keevash, Benny Sudakov |
On A Hypergraph Turán Problem Of Frankl. |
Combinatorica |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C35, 05E35, 05D05, 05C65 |
| 1 | Alan M. Frieze, Michael Krivelevich, Benny Sudakov |
The Strong Chromatic Index of Random Graphs. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Benny Sudakov |
Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Sudakov, Tibor Szabó, Van H. Vu |
A generalization of Turán's theorem. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Asaf Shapira, Benny Sudakov |
Additive Approximation for Edge-Deletion Problems. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson |
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
dispersers condenser, constructions, extractors, explicit, ramsey graphs |
| 1 | Peter Keevash, Benny Sudakov |
On the number of edges not covered by monochromatic copies of a fixed graph. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, Benny Sudakov |
Extremal set systems with restricted k-wise intersections. |
J. Comb. Theory, Ser. A |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Peter Keevash, Benny Sudakov |
Multicoloured extremal problems. |
J. Comb. Theory, Ser. A |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov |
On the Value of a Random Minimum Weight Steiner Tree. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C80, 68R10, 60C05 |
| 1 | Michael Krivelevich, Benny Sudakov, Tibor Szabó |
Triangle Factors In Sparse Pseudo-Random Graphs. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C70, 05C80 |
| 1 | Bruce A. Reed, Benny Sudakov |
List Colouring When The Chromatic Number Is Close To the Order Of The Graph. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C15, 05D40 |
| 1 | Peter Keevash, Benny Sudakov |
Packing triangles in a graph and its complement. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov |
Learning a Hidden Matching. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Sudakov |
A few remarks on Ramsey-Tura'n-type problems. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov |
Maximum cuts and judicious partitions in graphs without short cycles. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald |
On the probability of independent sets in random graphs. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov |
The Largest Eigenvalue Of Sparse Random Graphs. |
Combinatorics, Probability & Computing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Keevash, Benny Sudakov |
Local Density In Graphs With Forbidden Subgraphs. |
Combinatorics, Probability & Computing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr V. Kostochka, Benny Sudakov |
On Ramsey Numbers of Sparse Graphs. |
Combinatorics, Probability & Computing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Michael Krivelevich, Benny Sudakov |
Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions. |
Combinatorics, Probability & Computing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov |
Approximate coloring of uniform hypergraphs. |
J. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov, Van H. Vu |
Covering codes with improved density. |
IEEE Transactions on Information Theory |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce A. Reed, Benny Sudakov |
Asymptotically the List Colouring Constants Are 1. |
J. Comb. Theory, Ser. B |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Vince Grolmusz, Benny Sudakov |
On k-wise set-intersections and k-wise Hamming-distances. |
J. Comb. Theory, Ser. A |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Sudakov |
A Note on Odd Cycle-Complete Graph Ramsey Numbers. |
Electr. J. Comb. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Jeong Han Kim, Benny Sudakov, Van H. Vu |
On the asymmetry of random regular graphs and random graphs. |
Random Struct. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")