| 2009 |
|---|
| 80 | EE | Po-Shen Loh,
Benny Sudakov:
Constrained Ramsey Numbers.
Combinatorics, Probability & Computing 18(1-2): 247-258 (2009) |
| 79 | EE | Jacob Fox,
Po-Shen Loh,
Benny Sudakov:
Large induced trees in Kr-free graphs.
J. Comb. Theory, Ser. B 99(2): 494-501 (2009) |
| 78 | EE | Michael Krivelevich,
Po-Shen Loh,
Benny Sudakov:
Avoiding small subgraphs in Achlioptas processes.
Random Struct. Algorithms 34(1): 165-195 (2009) |
| 2008 |
|---|
| 77 | EE | Michael Krivelevich,
Benny Sudakov,
Dan Vilenchik:
On the random satisfiable process
CoRR abs/0807.4326: (2008) |
| 76 | EE | Benny Sudakov,
Jacques Verstraëte:
Cycle lengths in sparse graphs.
Combinatorica 28(3): 357-372 (2008) |
| 75 | EE | Po-Shen Loh,
Benny Sudakov:
On the Strong Chromatic Number of Random Graphs.
Combinatorics, Probability & Computing 17(2): 271-286 (2008) |
| 74 | EE | Jacob Fox,
Benny Sudakov:
Unavoidable patterns.
J. Comb. Theory, Ser. A 115(8): 1561-1569 (2008) |
| 73 | EE | Jacob Fox,
Benny Sudakov:
On a problem of Duke-Erdös-Rödl on cycle-connected subgraphs.
J. Comb. Theory, Ser. B 98(5): 1056-1062 (2008) |
| 72 | EE | Tom Bohman,
Alan M. Frieze,
Benny Sudakov:
The game chromatic number of random graphs.
Random Struct. Algorithms 32(2): 223-235 (2008) |
| 71 | EE | Benny Sudakov,
Jan Vondrák:
How many random edges make a dense hypergraph non-2-colorable?
Random Struct. Algorithms 32(3): 290-306 (2008) |
| 70 | EE | Benny Sudakov,
Van H. Vu:
Local resilience of graphs.
Random Struct. Algorithms 33(4): 409-433 (2008) |
| 2007 |
|---|
| 69 | EE | Peter Keevash,
Dhruv Mubayi,
Benny Sudakov,
Jacques Verstraëte:
Rainbow Turán Problems.
Combinatorics, Probability & Computing 16(1): 109-126 (2007) |
| 68 | EE | Jeong Han Kim,
Benny Sudakov,
Van H. Vu:
Small subgraphs of random regular graphs.
Discrete Mathematics 307(15): 1961-1967 (2007) |
| 67 | EE | Po-Shen Loh,
Benny Sudakov:
Constrained Ramsey Numbers.
Electronic Notes in Discrete Mathematics 29: 41-45 (2007) |
| 66 | EE | Jacob Fox,
Benny Sudakov:
Induced Ramsey-type theorems.
Electronic Notes in Discrete Mathematics 29: 53-58 (2007) |
| 65 | EE | Boris Bukh,
Benny Sudakov:
Induced subgraphs of Ramsey graphs with many distinct degrees.
J. Comb. Theory, Ser. B 97(4): 612-619 (2007) |
| 64 | EE | Po-Shen Loh,
Benny Sudakov:
Independent transversals in locally sparse graphs.
J. Comb. Theory, Ser. B 97(6): 904-918 (2007) |
| 63 | EE | Noga Alon,
Benny Sudakov:
On graphs with subgraphs having large independence numbers.
Journal of Graph Theory 56(2): 149-157 (2007) |
| 62 | EE | Benny Sudakov:
Ramsey Numbers and the Size of Graphs.
SIAM J. Discrete Math. 21(4): 980-986 (2007) |
| 2006 |
|---|
| 61 | EE | Noga Alon,
Asaf Shapira,
Benny Sudakov:
Additive Approximation for Edge-Deletion Problems (Abstract).
ICALP (1) 2006: 1-2 |
| 60 | EE | Peter Keevash,
Po-Shen Loh,
Benny Sudakov:
Bounding the Number of Edges in Permutation Graphs.
Electr. J. Comb. 13(1): (2006) |
| 59 | EE | Noga Alon,
Benny Sudakov:
H-Free Graphs of Large Minimum Degree.
Electr. J. Comb. 13(1): (2006) |
| 58 | EE | Michael Krivelevich,
Benny Sudakov:
Preface.
Eur. J. Comb. 27(8): 1225-1226 (2006) |
| 57 | EE | Peter Keevash,
Benny Sudakov:
On a restricted cross-intersection problem.
J. Comb. Theory, Ser. A 113(7): 1536-1542 (2006) |
| 56 | EE | Peter Keevash,
Benny Sudakov:
Sparse halves in triangle-free graphs.
J. Comb. Theory, Ser. B 96(4): 614-620 (2006) |
| 55 | EE | 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 96(6): 919-932 (2006) |
| 54 | EE | Noga Alon,
Rados Radoicic,
Benny Sudakov,
Jan Vondrák:
A Ramsey-type result for the hypercube.
Journal of Graph Theory 53(3): 196-208 (2006) |
| 53 | EE | Michael Krivelevich,
Benny Sudakov,
Prasad Tetali:
On smoothed analysis in dense graphs and formulas.
Random Struct. Algorithms 29(2): 180-193 (2006) |
| 2005 |
|---|
| 52 | EE | Noga Alon,
Asaf Shapira,
Benny Sudakov:
Additive Approximation for Edge-Deletion Problems.
FOCS 2005: 419-428 |
| 51 | EE | Boaz Barak,
Guy Kindler,
Ronen Shaltiel,
Benny Sudakov,
Avi Wigderson:
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors.
STOC 2005: 1-10 |
| 50 | EE | Benny Sudakov:
A New Lower Bound For A Ramsey-Type Problem.
Combinatorica 25(4): 487-498 (2005) |
| 49 | EE | Peter Keevash,
Benny Sudakov:
The Turán Number Of The Fano Plane.
Combinatorica 25(5): 561-574 (2005) |
| 48 | EE | Peter Keevash,
Benny Sudakov:
On A Hypergraph Turán Problem Of Frankl.
Combinatorica 25(6): 673-706 (2005) |
| 47 | EE | József Balogh,
Peter Keevash,
Benny Sudakov:
Disjoint representability of sets and their complements.
J. Comb. Theory, Ser. B 95(1): 12-28 (2005) |
| 46 | EE | Benny Sudakov,
Tibor Szabó,
Van H. Vu:
A generalization of Turán's theorem.
Journal of Graph Theory 49(3): 187-195 (2005) |
| 45 | EE | Benny Sudakov:
Large Kr-free subgraphs in Ks-free graphs and some other Ramsey-type problems.
Random Struct. Algorithms 26(3): 253-265 (2005) |
| 44 | EE | Peter Keevash,
Benny Sudakov:
Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices.
SIAM J. Discrete Math. 18(4): 713-727 (2005) |
| 43 | EE | Alan M. Frieze,
Michael Krivelevich,
Benny Sudakov:
The Strong Chromatic Index of Random Graphs.
SIAM J. Discrete Math. 19(3): 719-727 (2005) |
| 2004 |
|---|
| 42 | EE | Béla Bollobás,
David Gamarnik,
Oliver Riordan,
Benny Sudakov:
On the Value of a Random Minimum Weight Steiner Tree.
Combinatorica 24(2): 187-207 (2004) |
| 41 | EE | Michael Krivelevich,
Benny Sudakov,
Tibor Szabó:
Triangle Factors In Sparse Pseudo-Random Graphs.
Combinatorica 24(3): 403-426 (2004) |
| 40 | EE | Bruce A. Reed,
Benny Sudakov:
List Colouring When The Chromatic Number Is Close To the Order Of The Graph.
Combinatorica 25(1): 117-123 (2004) |
| 39 | EE | Zoltán Füredi,
Benny Sudakov:
Extremal set systems with restricted k-wise intersections.
J. Comb. Theory, Ser. A 105(1): 143-159 (2004) |
| 38 | EE | Béla Bollobás,
Peter Keevash,
Benny Sudakov:
Multicoloured extremal problems.
J. Comb. Theory, Ser. A 107(2): 295-312 (2004) |
| 37 | EE | Peter Keevash,
Benny Sudakov:
On the number of edges not covered by monochromatic copies of a fixed graph.
J. Comb. Theory, Ser. B 90(1): 41-53 (2004) |
| 36 | EE | Peter Keevash,
Benny Sudakov:
Packing triangles in a graph and its complement.
Journal of Graph Theory 47(3): 203-216 (2004) |
| 35 | EE | Noga Alon,
Richard Beigel,
Simon Kasif,
Steven Rudich,
Benny Sudakov:
Learning a Hidden Matching.
SIAM J. Comput. 33(2): 487-501 (2004) |
| 2003 |
|---|
| 34 | | Michael Krivelevich,
Benny Sudakov:
The Largest Eigenvalue Of Sparse Random Graphs.
Combinatorics, Probability & Computing 12(1): (2003) |
| 33 | | Peter Keevash,
Benny Sudakov:
Local Density In Graphs With Forbidden Subgraphs.
Combinatorics, Probability & Computing 12(2): (2003) |
| 32 | | Noga Alon,
Michael Krivelevich,
Benny Sudakov:
Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions.
Combinatorics, Probability & Computing 12(5-6): 477-494 (2003) |
| 31 | | Alexandr V. Kostochka,
Benny Sudakov:
On Ramsey Numbers of Sparse Graphs.
Combinatorics, Probability & Computing 12(5-6): 627-641 (2003) |
| 30 | | Michael Krivelevich,
Benny Sudakov,
Van H. Vu:
Covering codes with improved density.
IEEE Transactions on Information Theory 49(7): 1812-1815 (2003) |
| 29 | EE | Michael Krivelevich,
Benny Sudakov:
Approximate coloring of uniform hypergraphs.
J. Algorithms 49(1): 2-12 (2003) |
| 28 | EE | Benny Sudakov:
A few remarks on Ramsey-Tura'n-type problems.
J. Comb. Theory, Ser. B 88(1): 99-106 (2003) |
| 27 | EE | 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 88(2): 329-346 (2003) |
| 26 | EE | Michael Krivelevich,
Benny Sudakov,
Van H. Vu,
Nicholas C. Wormald:
On the probability of independent sets in random graphs.
Random Struct. Algorithms 22(1): 1-14 (2003) |
| 2002 |
|---|
| 25 | EE | Noga Alon,
Richard Beigel,
Simon Kasif,
Steven Rudich,
Benny Sudakov:
Learning a Hidden Matching.
FOCS 2002: 197- |
| 24 | | Michael Krivelevich,
Benny Sudakov,
Van H. Vu:
A Sharp Threshold For Network Reliability.
Combinatorics, Probability & Computing 11(5): (2002) |
| 23 | EE | Benny Sudakov:
A Note on Odd Cycle-Complete Graph Ramsey Numbers.
Electr. J. Comb. 9(1): (2002) |
| 22 | EE | Vince Grolmusz,
Benny Sudakov:
On k-wise set-intersections and k-wise Hamming-distances.
J. Comb. Theory, Ser. A 99(1): 180-190 (2002) |
| 21 | EE | Bruce A. Reed,
Benny Sudakov:
Asymptotically the List Colouring Constants Are 1.
J. Comb. Theory, Ser. B 86(1): 27-37 (2002) |
| 20 | EE | Jeong Han Kim,
Benny Sudakov,
Van H. Vu:
On the asymmetry of random regular graphs and random graphs.
Random Struct. Algorithms 21(3-4): 216-224 (2002) |
| 2001 |
|---|
| 19 | EE | Michael Krivelevich,
Ram Nathaniel,
Benny Sudakov:
Approximating coloring and maximum independent sets in 3-uniform hypergraphs.
SODA 2001: 327-328 |
| 18 | EE | Noga Alon,
Benny Sudakov,
Uri Zwick:
Constructing worst case instances for semidefinite programming based approximation algorithms.
SODA 2001: 92-100 |
| 17 | EE | Alexander K. Kelmans,
Dhruv Mubayi,
Benny Sudakov:
Asymptotically Optimal Tree-Packings in Regular Graphs.
Electr. J. Comb. 8(1): (2001) |
| 16 | | Michael Krivelevich,
Ram Nathaniel,
Benny Sudakov:
Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs.
J. Algorithms 41(1): 99-113 (2001) |
| 15 | EE | Benny Sudakov:
Nowhere-Zero Flows in Random Graphs.
J. Comb. Theory, Ser. B 81(2): 209-223 (2001) |
| 14 | | Michael Krivelevich,
Benny Sudakov,
Van H. Vu,
Nicholas C. Wormald:
Random regular graphs of high degree.
Random Struct. Algorithms 18(4): 346-363 (2001) |
| 13 | EE | Noga Alon,
Benny Sudakov,
Uri Zwick:
Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms.
SIAM J. Discrete Math. 15(1): 58-72 (2001) |
| 2000 |
|---|
| 12 | | Noga Alon,
Benny Sudakov:
Bipartite Subgraphs And The Smallest Eigenvalue.
Combinatorics, Probability & Computing 9(1): (2000) |
| 1999 |
|---|
| 11 | EE | Noga Alon,
Michael Krivelevich,
Benny Sudakov:
List Coloring of Random and Pseudo-Random Graphs.
Combinatorica 19(4): 453-472 (1999) |
| 10 | | Noga Alon,
Benny Sudakov:
On Two Segmentation Problems.
J. Algorithms 33(1): 173-184 (1999) |
| 9 | EE | Noga Alon,
Michael Krivelevich,
Benny Sudakov:
Coloring Graphs with Sparse Neighborhoods.
J. Comb. Theory, Ser. B 77(1): 73-82 (1999) |
| 1998 |
|---|
| 8 | EE | Michael Krivelevich,
Benny Sudakov:
Approximate Coloring of Uniform Hypergraphs (Extended Abstract).
ESA 1998: 477-489 |
| 7 | | Noga Alon,
Michael Krivelevich,
Benny Sudakov:
Finding a Large Hidden Clique in a Random Graph.
SODA 1998: 594-598 |
| 6 | EE | Gregory Gutin,
Benny Sudakov,
Anders Yeo:
Note on alternating directed cycles.
Discrete Mathematics 191(1-3): 101-107 (1998) |
| 5 | EE | Michael Krivelevich,
Benny Sudakov:
Coloring Random Graphs.
Inf. Process. Lett. 67(2): 71-74 (1998) |
| 4 | | Michael Krivelevich,
Benny Sudakov:
The chromatic numbers of random hypergraphs.
Random Struct. Algorithms 12(4): 381-403 (1998) |
| 3 | | Noga Alon,
Michael Krivelevich,
Benny Sudakov:
Finding a large hidden clique in a random graph.
Random Struct. Algorithms 13(3-4): 457-466 (1998) |
| 1995 |
|---|
| 2 | | Noga Alon,
Benny Sudakov:
Disjoint Systems.
Random Struct. Algorithms 6(1): 13-20 (1995) |
| 1993 |
|---|
| 1 | | Noga Alon,
Benny Sudakov:
Disjoint Systems (Extended Abstract).
Algebraic Coding 1993: 159-163 |
