Preprints

• M. Krivelevich, E. Lubetzky and B. Sudakov, Cores of random graphs are born Hamiltonian, submitted.
• A. Ferber, R. Hod, M. Krivelevich and B. Sudakov, A construction of almost Steiner systems, submitted.
• J. Ma, H. Naves and B. Sudakov, Discrepancy of random graphs and hypergraphs, submitted.
• D. Conlon, J. Fox, J. Pach, B. Sudakov and A. Suk, Ramsey-type results for semi-algebraic relations, submitted.
• A. Ferber, M. Krivelevich and B. Sudakov, Counting and packing Hamilton cycles in dense graphs and oriented graphs, submitted.
• D. Conlon, J. Fox and B. Sudakov, Essays in extremal combinatorics, submitted.
• H. Huang, N. Linial, H. Naves, Y. Peled and B. Sudakov, On the 3-local profiles of graphs, submitted.
• H. Huang, N. Linial, H. Naves, Y. Peled and B. Sudakov, On the densities of cliques and independent sets in graphs, submitted.
• R. Glebov, B. Sudakov and T. Szabo How many colors guarantee a rainbow matching?, submitted.
• P. Allen, P. Keevash, B. Sudakov and J. Verstraete, Turan numbers of bipartite graphs plus an odd cycle, submitted.
• A. Shapira and B. Sudakov, Small Complete Minors Above the Extremal Edge Density, submitted.
• D. Conlon, J. Fox, C. Lee and B. Sudakov, Ramsey numbers of cubes versus cliques, submitted.
• M. Krivelevich, C. Lee and B. Sudakov, Long paths and cycles in random subgraphs of graphs with large minimum degree, submitted.
• H. Huang, J. Ma, A. Shapira, B. Sudakov and R. Yuster, Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs , submitted.
• D. Conlon, J. Fox and B. Sudakov, Two extensions of Ramsey's theorem, submitted.
• C. Lee, P. Loh and B. Sudakov, Bisections of graphs, submitted.
• Y. Afek, Y. Babichenko, U. Feige, E. Gafni, N. Linial and B. Sudakov, Musical chairs , submitted.
  A distributed computing version appeared as: Oblivious Collaboration, Proc. of the 25th Symposium on Distributed Computing (DISC'11), LNCS volume 6950, 2011, 489-504.

To appear

• N. Alon A. Moitra and B. Sudakov, Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications, J. European Math. Soc., to appear.
  A preliminary version appeared in: Proc. of the 44th ACM STOC (2012), 1079-1090
• S. Das, H. Huang, J. Ma, H. Naves and B. Sudakov, A problem of Erdos on the minimum number of k-cliques, J. Combinatorial Theory Ser. B, to appear.
• C. Lee, P. Loh and B. Sudakov, Self-similarity of graphs, SIAM J. of Discrete Math., to appear.
• Y. Peres, D. Sotnikov, B. Sudakov and U. Zwick, All-Pairs shortest paths in O(n^2) time with high probability, Journal of the ACM, to appear.
  A preliminary version appeared in: Proc. of the 51st IEEE FOCS (2010), 663-672.
• M. Krivelevich, C. Lee and B. Sudakov, Robust Hamiltonicity of Dirac graphs, Transactions Amer. Math. Soc., to appear.
• M. Krivelevich and B. Sudakov, The phase transition in random graphs - a simple proof, Random Structures and Algorithms, to appear.
• P. Keevash, B. Sudakov and J. Verstraete, On a conjecture of Erdos and Simonovits: Even cycles, Combinatorica, to appear.
• M. Krivelevich, E. Lubetzky and B. Sudakov, Longest cycles in sparse random digraphs, Random Structures and Algorithms, to appear.
• J. Fox, C. Lee, and B. Sudakov, Chromatic number, clique subdivisions, and the conjectures of Hajos and Erdos-Fajtlowicz, Combinatorica, to appear.

2013

• D. Conlon, J. Fox and B. Sudakov, An improved bound for the stepping-up lemma , Discrete Applied Mathematics 161 (2013) 1191-1196.
• S. Das, C. Lee and B. Sudakov, Rainbow Turan Problem for Even Cycles, European Journal of Combinatorics 34 (2013), 905-915.

2012

• J. Fox, J. Pach, B. Sudakov and A. Suk, Erdos-Szekeres-type theorems for monotone paths and convex bodies, Proc. London Math. Soc. 105 (2012), 953-982.   Erratum to this paper.
• D. Conlon, J. Fox and B. Sudakov, On two problems in graph Ramsey theory, Combinatorica 32 (2012), 513-535.
• J. Fox, C. Lee and B. Sudakov, Maximum union-free subfamilies, Israel Journal of Mathematics 191 (2012), 959-971.
• C. Lee and B. Sudakov, Dirac's theorem for random graphs, Random Structures and Algorithms 41 (2012), 293-305.
• D. Conlon, J. Fox and B. Sudakov, Erdos-Hajnal-type theorems in hypergraphs, J. Combinatorial Theory Ser. B 102 (2012), 1142-1154.
• H. Huang and B. Sudakov, A counterexample to the Alon-Saks-Seymour conjecture and related problems, Combinatorica 32 (2012), 205-219.
• C. Lee, B. Sudakov and D. Vilenchik, Getting directed Hamilton cycle twice faster , Combinatorics, Probability and Computing 21 (2012), 773-801.
• I. Ben-Eliezer, M. Krivelevich and B. Sudakov, Long cycles in subgraphs of (pseudo)random directed graphs, J. Graph Theory 70 (2012), 284-296.
• H. Huang, P. Loh and B. Sudakov, The size of a hypergraph and its matching number, Combinatorics, Probability and Computing 21 (2012), 442-450.
• I. Ben-Eliezer, M. Krivelevich and B. Sudakov, Biased orientation games, Discrete Mathematics 312 (2012), 1732-1742.
• N. Alon, P. Frankl, H. Huang, V. Rodl, A. Rucinski and B. Sudakov, Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels, J. Combinatorial Theory Ser. A 119 (2012), 1200-1215.
• N. Alon, H. Huang and B. Sudakov, Nonnegative k-sums, fractional covers, and probability of small deviations , J. Combinatorial Theory Ser. B 102 (2012), 784-796.
• I. Ben-Eliezer, M. Krivelevich and B. Sudakov, The size Ramsey number of a directed path, J. Combinatorial Theory Ser. B 102 (2012), 743-755.
• C. Lee and B. Sudakov, Hamiltonicity, independence number, and pancyclicity, European Journal of Combinatorics 33 (2012), 449-457.
• H. Huang, C. Lee and B. Sudakov, Bandwidth theorem for random graphs, J. Combinatorial Theory Ser. B 102 (2012), 14-37.

2011

• E. Lubetzky, B. Sudakov and V. Vu, Spectra of lifted Ramanujan graphs, Advances in Mathematics 227 (2011), 1612-1645.
• B. Sudakov, A conjecture of Erdos on graph Ramsey numbers, Advances in Mathematics 227 (2011), 601-609.
• A. Scott and B. Sudakov, A bound for the cops and robbers problem, SIAM J. of Discrete Math 25 (2011), 1438-1442.
• D. Ellis and B. Sudakov, Generating all subsets of a finite set with disjoint unions, J. Combinatorial Theory Ser. A 118 (2011), 2319-2345.
• M. Krivelevich, B. Sudakov, N. Wormald Regular induced subgraphs of a random graph , Random Structures and Algorithms 38 (2011), 235-250.
• D. Conlon, J. Fox and B. Sudakov, Large almost monochromatic subsets in hypergraphs, Israel Journal of Mathematics 181 (2011), 423-432.
• S. Ben-Shimon, M. Krivelevich and B. Sudakov, On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs, SIAM J. of Discrete Math 25 (2011), 1176-1193.
• B. Sudakov and J. Verstraete, Cycles in graphs with large independence ratio, Journal of Combinatorics 2 (2011), 82-102.
• J. Fox and B. Sudakov, Dependent Random Choice, Random Structures and Algorithms 38 (2011), 1-32.
• S. Ben-Shimon, M. Krivelevich and B. Sudakov, Local resilience and Hamiltonicity Maker-Breaker games in random regular graph, Combinatorics, Probability and Computing 20 (2011), 173-211.
• T. Bohman, A. Frieze, M. Krivelevich, P. Loh and B. Sudakov, Ramsey games with giants, Random Structures and Algorithms 38 (2011), 68-99.

2010

• D. Conlon, J. Fox and B. Sudakov, An approximate version of Sidorenko's conjecture, Geometric and Functional Analysis 20 (2010), 1354-1366. Short, self-contained exposition.
• B. Sudakov, Recent developments in extremal combinatorics: Ramsey and Turan type problems, Proc. International Congress of Mathematicians, Hyderabad, India, 2010, Vol 4, 2579-2606.
• D. Conlon, J. Fox and B. Sudakov, Hypergraph Ramsey numbers, J. Amer. Math. Soc. 23 (2010), 247-266.
• P. Loh, O. Pikhurko and B. Sudakov, Maximizing the number of q-colorings, Proc. London Math. Soc. 101 (2010), 655-696.
• N. Alon and B. Sudakov, Increasing the chromatic number of a random graph, Journal of Combinatorics 1 (2010), 345-356.
• B. Barak, G. Kindler, R. Shaltiel, B. Sudakov and A. Wigderson, Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors , Journal of the ACM 57 (2010), Article No. 20.
  A preliminary version appeared in: Proc. of the 37-th ACM STOC (2005), 1-10.
• B. Sudakov and J. Vondrak, A randomized embedding algorithm for trees, Combinatorica 30 (2010), 445-470.
• M. Krivelevich, E. Lubetzky and B. Sudakov, Hamiltonicity thresholds in Achlioptas processes, Random Structures and Algorithms 37 (2010), 1-24.
• J. Fox and B. Sudakov, Decompositions into subgraphs of small diameter, Combinatorics, Probability and Computing 19 (2010), 753-774.
• P. Keevash and B. Sudakov, Pancyclicity of Hamiltonian and highly connected graphs, J. Combinatorial Theory Ser. B 100 (2010), 456-467.
• M. Krivelevich, C. Lee and B. Sudakov, Resilient pancyclicity of random and pseudo-random graphs, SIAM J. of Discrete Math. 24 (2010), 1-16.
• J. Fox, P. Keevash and B. Sudakov, Directed graphs without short cycles, Combinatorics, Probability and Computing 19 (2010), 285-301.

2009

• N. Alon, A. Shapira and B. Sudakov, Additive approximation for edge-deletion problems, Annals of Mathematics 170 (2009), 371-411.
  A preliminary version appeared in: Proc. of the 46-th IEEE FOCS (2005), 419-428.
• J. Fox and B. Sudakov, Density theorems for bipartite graphs and related Ramsey-type results, Combinatorica 29 (2009), 153-196.
• M. Krivelevich and B. Sudakov, Minors in expanding graphs, Geometric and Functional Analysis 19 (2009), 294-331.
• N. Alon, B. Bukh and B. Sudakov, Discrete Kakeya-type problems and small bases, Israel Journal of Mathematics 174 (2009), 285-301 .
• J. Fox and B. Sudakov, Two remarks on the Burr-Erdos conjecture , European J. Combinatorics 30 (2009), 1630-1645.
• M. Krivelevich, B. Sudakov and D. Vilenchik, On the random satisfiable process, Combinatorics, Probability and Computing 18 (2009), 775-801.
• D. Conlon, J. Fox and B. Sudakov, Ramsey numbers of sparse hypergraphs, Random Structures and Algorithms 35 (2009), 1-14.
• P. Keevash and B. Sudakov, Triangle packings and 1-factors in oriented graphs , J. Combinatorial Theory Ser. B 99 (2009), 709-727.
• J. Fox and B. Sudakov, Paths and stability number in digraphs, The Electronic J. of Combinatorics 16(1) (2009), N23.
• P. Loh and B. Sudakov, Constrained Ramsey Numbers, Combinatorics, Probability and Computing 18 (2009), 247-258.
• J. Fox, P. Loh and B. Sudakov, Large induced trees in K_r-free graphs, J. Combinatorial Theory Ser. B 99 (2009), 494-501.
• M. Krivelevich, P. Loh and B. Sudakov, Avoiding small subgraphs in Achlioptas processes , Random Structures and Algorithms 34 (2009), 165-195. A full version of this paper appeared on arxiv.

2008

• J. Fox and B. Sudakov, Induced Ramsey-type theorems, Advances in Mathematics 219 (2008), 1771-1800.
• B. Sudakov and V. Vu, Local resilience of graphs, Random Structures and Algorithms 33 (2008), 409-433.
• J. Fox and B. Sudakov, Ramsey-type problem for an almost monochromatic K_4 , SIAM J. of Discrete Math. 23 (2008), 155-162.
• B. Sudakov and J. Verstraete, Cycle lengths in sparse graphs, Combinatorica 28 (2008), 357-372.   Erratum to this paper.
• J. Fox and B. Sudakov, Unavoidable patterns, J. Combinatorial Theory Ser. A 115 (2008), 1561-1569.
• B. Sudakov and J. Vondrak, How many random edges make a dense hypergraph non-2-colorable?, Random Structures and Algorithms 32 (2008), 290-306.
• N. Alon, M. Krivelevich and B. Sudakov, Large nearly regular induced subgraphs, SIAM J. of Discrete Math. 22 (2008), 1325-1337.
• J. Fox and B. Sudakov, On a problem of Duke-Erdos-Rodl on cycle-connected subgraphs, J. Combinatorial Theory Ser. B 98 (2008), 1056-1062.
• P. Loh and B. Sudakov, On the strong chromatic number of random graphs, Combinatorics, Probability and Computing 17 (2008), 271-286.
• T. Bohman, A. Frieze and B. Sudakov, The game chromatic number of random graphs, Random Structures and Algorithms 32 (2008), 223-235.

2007

• N. Alon, M. Krivelevich and B. Sudakov, Embedding nearly-spanning bounded degree trees, Combinatorica 27 (2007), 629-644.
• B. Sudakov, Ramsey numbers and the size of graphs, SIAM J. of Discrete Math. 21 (2007), 980-986.
• B. Sudakov, Making a K_4-free graph bipartite, Combinatorica 27 (2007), 509-518.
• P. Loh and B. Sudakov, Independent transversals in locally sparse graphs, J. Combinatorial Theory Ser. B 97 (2007), 904-918.
• N. Alon and B. Sudakov, On graphs with subgraphs having large independence numbers, J. Graph Theory 56 (2007), 149-157.
• B. Bukh and B. Sudakov, Induced subgraphs of Ramsey graphs with many distinct degrees, J. Combinatorial Theory Ser. B 97 (2007), 612-619.
• J.H. Kim, B. Sudakov and V. Vu, Small subgraphs of random regular graphs, Discrete Mathematics 307 (2007), 1961-1967.
• P. Keevash, D. Mubayi, B. Sudakov and J. Verstraete, Rainbow Turan Problems, Combinatorics, Probability and Computing 16 (2007), 109-126.   Erratum to this paper.

2006

• E. Mossel, R. O'Donnell, O. Regev, J. Steif and B. Sudakov, Non-Interactive Correlation Distillation, Inhomogeneous Markov Chains and the Reverse Bonami-Beckner Inequality, Israel Journal of Mathematics 154 (2006), 299-336.
• J. Balogh, P. Keevash and B. Sudakov, On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs, J. Combinatorial Theory Ser. B 96 (2006), 919-932.
• N. Alon, R. Radoicic, B. Sudakov and J. Vondrak, A Ramsey-type result for the hypercube, J. Graph Theory 53 (2006), 196-208.
• P. Keevash and B. Sudakov, On a restricted cross-intersection problem , J. Combinatorial Theory Ser. A 113 (2006), 1536-1542.
• M. Krivelevich, B. Sudakov and P. Tetali, On smoothed analysis in dense graphs and formulas, Random Structures and Algorithms 29 (2006), 180-193.
• M. Krivelevich and B. Sudakov, Pseudo-random graphs, in: More Sets, Graphs and Numbers, Bolyai Society Mathematical Studies 15, Springer, 2006, 199-262.
• P. Keevash, P. Loh and B. Sudakov, Bounding the number of edges in permutation graphs, The Electronic J. of Combinatorics 13 (2006), R44.
• P. Keevash and B. Sudakov, Sparse halves in triangle-free graphs, J. Combinatorial Theory Ser. B 96 (2006), 614-620.
• N. Alon and B. Sudakov, H-free graphs of large minimum degree, The Electronic J. of Combinatorics 13 (2006), R19.

2005

• B. Sudakov, E. Szemeredi and V. Vu, On a question of Erdos and Moser, Duke Mathematical Journal 129 (2005), 129-155.
• P. Keevash and B. Sudakov, On a hypergraph Turan problem of Frankl, Combinatorica 25 (2005), 673-706.
• N. Alon, M. Krivelevich and B. Sudakov, MaxCut in H-free graphs, Combinatorics, Probability and Computing 14 (2005), 629-647.
• B. Sudakov, A new lower bound for a Ramsey-type problem, Combinatorica 25 (2005), 487-498.
• A. Frieze, M. Krivelevich and B. Sudakov, The strong chromatic index of random graphs, SIAM J. of Discrete Math. 19 (2005), 719-727.
• P. Keevash and B. Sudakov, The exact Turan number of the Fano plane, Combinatorica 25 (2005), 561-574.
• J. Balogh, P. Keevash and B. Sudakov, Disjoint representability of sets and their complements, J. Combinatorial Theory Ser. B 95 (2005), 12-28.
• B. Sudakov, T. Szabo and V. Vu, A generalization of Turan's theorem, J. Graph Theory 49 (2005), 187-195.
• P. Keevash and B. Sudakov, Set systems with restricted cross-intersections and the minimum rank of inclusion matrices, SIAM J. of Discrete Math. 18 (2005), 713-727.
• B. Reed and B. Sudakov, List coloring when the chromatic number is close to the order of the graph, Combinatorica 25 (2005), 117-123.
• B. Sudakov, Large K_r-free subgraphs in K_s-free graphs and some other Ramsey-type problems, Random Structures and Algorithms 26 (2005), 253-265.

2004

• N. Alon, I. Dinur, E. Friedgut and B. Sudakov, Graph products, fourier analysis and spectral techniques, Geometric and Functional Analysis 14 (2004), 913-940.
• N. Alon, J. Balogh, P. Keevash and B. Sudakov, The number of edge colorings with no monochromatic cliques, J. London Mathematical Society 70 (2004), 273-288.
• B. Bollobas, P. Keevash and B. Sudakov, Multicoloured extremal problems, J. Combinatorial Theory Ser. A 107 (2004), 295-312.
• P. Keevash and B. Sudakov, Packing triangles in a graph and its complement, J. Graph Theory 47 (2004), 203-216.
  A magma program implementing an algorithm used in this paper can be downloaded here.
• M. Krivelevich, B. Sudakov and T.Szabo, Triangle factors in pseudo-random graphs, Combinatorica 24 (2004), 403-426.
• N. Alon, R. Beigel, S. Kasif, S. Rudich and B. Sudakov, Learning a hidden matching, SIAM J. on Computing 33 (2004), 487-501.
  A preliminary version appeared in: Proc. of the 43rd IEEE FOCS (2002), 197--206.
• B. Bollobas, D. Gamarnik, O. Riordan and B. Sudakov, On the value of a random minimum length Steiner tree, Combinatorica 24 (2004), 187-207.
• P. Keevash, M. Saks, B. Sudakov and J. Verstraete, Multicolour Turan problems, Advances in Applied Mathematics 33 (2004), 238--262.
• Z. Furedi and B. Sudakov, Extremal set-systems with restricted k-wise intersections, J. Combinatorial Theory Ser. A 105 (2004), 143-159.
• P. Keevash and B. Sudakov, On the number of edges not covered by monochromatic copies of a fixed graph, J. Combinatorial Theory Ser. B 90 (2004), 41-53.

2003

• A. Kostochka and B. Sudakov, On Ramsey numbers of sparse graphs , Combinatorics, Probability and Computing 12 (2003), 627-641.
• N. Alon, M. Krivelevich and B. Sudakov, Turan numbers of bipartite graphs and related Ramsey-type questions , Combinatorics, Probability and Computing 12 (2003), 477-494.
• A. Soshnikov and B. Sudakov, On the largest eigenvalue of a random subgraph of the hypercube, Communications in Mathematical Physics 239 (2003), 53-63.
• M. Krivelevich, B. Sudakov and V. Vu, Covering codes with improved density, IEEE Transactions on Information Theory 49 (2003), 1812-1815.
• N. Alon, M. Krivelevich and B. Sudakov, Induced subgraphs of prescribed size, J. Graph Theory 43 (2003), 239-251.
• M. Krivelevich and B. Sudakov, Approximate coloring of uniform hypergraphs, J. of Algorithms 49 (2003), 2--12.
  Another version of this paper with additional results appeared in: Proc. of the 6th Annual European Symposium on Algorithms (ESA'98), Lecture Notes in Computer Science 1461, Springer Verlag (1998), 477--489.
• N. Alon, B. Bollobas, M. Krivelevich and B. Sudakov, Maximum cuts and judicious partitions in graphs without short cycles, J. Combinatorial Theory Ser. B 88 (2003), 329-346.
• B. Sudakov, Few remarks on the Ramsey-Turan-type problems, J. Combinatorial Theory Ser. B 88 (2003), 99-106.
• P.Keevash and B. Sudakov, Local density in graphs with forbidden subgraphs, Combinatorics, Probability and Computing 12 (2003), 139-153.
• M. Krivelevich, B. Sudakov, V. Vu and N. Wormald, On the probability of independent sets in random graphs, Random Structures and Algorithms 22 (2003), 1-14.
• M. Krivelevich and B. Sudakov, Sparse pseudo-random graphs are Hamiltonian, J. Graph Theory 42 (2003), 17-33.
• M. Krivelevich and B. Sudakov, The largest eigenvalue of sparse random graphs, Combinatorics, Probability and Computing 12 (2003), 61-72.

2002

• M. Krivelevich, B. Sudakov and V. Vu, Sharp threshold for network reliability, Combinatorics, Probability and Computing 11 (2002), 465-474.
• J.H. Kim, B. Sudakov and V. Vu, On asymmetry of random graphs and random regular graphs, Random Structures and Algorithms 21 (2002), 216-224.
• B. Reed and B. Sudakov, Asymptotically the list colouring constants are 1, J. Combinatorial Theory Ser. B 86 (2002), 27-37.
• B. Reed and B. Sudakov, List colouring of graphs with at most   (2-o(1))  vertices, Proc. of the International Congress of Mathematicians, Vol III (Beijing 2002), Higher Education Press, China, 587-603.
• V. Grolmusz and B. Sudakov, On k-wise set-intersections and k-wise hamming-distances, J. Combinatorial Theory Ser. A 99 (2002), 180-190.
• N. Alon, B. Sudakov and U. Zwick, Constructing worst case instances for semidefinite programming based approximation algorithms,, SIAM J. Discrete Math 15 (2002), 58-72.
  A preliminary version appeared in: Proc. of the 12th Annual ACM-SIAM SODA, ACM Press (2001), 92-100.
• B. Sudakov, A note on odd cycle-complete graph Ramsey numbers, The Electronic J. of Combinatorics 9 (2002), N 1, 4pp.

2001

• A. Kelmans, D. Mubayi and B. Sudakov, Asymptotically optimal tree-packings in regular graphs, The Electronic J. of Combinatorics 8 (2001), R 38, 8pp.
• M. Krivelevich, R.Nathaniel and B. Sudakov, Approximating coloring and maximum independent set in 3-uniform hypergraphs, J. of Algorithm 41 (2001), 99-113.
  An extended abstract appeared in: Proc. of the 12th Annual ACM-SIAM SODA, ACM Press (2001), 327-328.
• B. Sudakov, Nowhere-zero flows in random graphs, J. Combinatorial Theory Ser. B 81 (2001), 209-223.
• N. Alon, B. Sudakov and A. Zaks, Acyclic edge colorings of graphs, J. Graph Theory 37 (2001), 157-167.
• M. Krivelevich, B. Sudakov, V. Vu and N. Wormald, Random regular graphs of high degree, Random Structures and Algorithms 18 (2001), 346-363.

1995-2000 (prior to my graduation)

• N. Alon and B. Sudakov, Bipartite subgraphs and the smallest eigenvalue, Combinatorics, Probability and Computing 9 (2000), 1-12.
• N. Alon, M. Krivelevich and B. Sudakov, Coloring graphs with sparse neighborhoods, J. Combinatorial Theory Ser. B. 77 (1999), 73-82.
• N. Alon and B. Sudakov, On two segmentation problems, J. of Algorithm 33 (1999), 173-184.
• N. Alon, M. Krivelevich and B. Sudakov, List coloring of random and pseudo-random graphs, Combinatorica 19 (1999), 453-472.
• G. Gutin, B. Sudakov and A. Yeo, Note on alternating directed cycles, Discrete Mathematics 191 (1998), 101-107.
• M. Krivelevich and B. Sudakov, The chromatic numbers of random hypergraphs, Random Structures and Algorithms 12 (1998), 381-403.
• M. Krivelevich and B. Sudakov, Coloring random graphs, Information Processing Letters 67 (1998), 71-74.
• N. Alon, M. Krivelevich and B. Sudakov, Finding a large hidden clique in a random graph, Random Structures and Algorithms 13 (1998), 457-466.
  A preliminary version appeared in: Proc. of the 9th Annual ACM-SIAM SODA, ACM Press (1998), 594-598.
• B. Sudakov, A note on $\tau$-critical linear hypergraphs, Graph and Combinatorics 13 (1997), 281-285.
• N. Alon, M. Krivelevich and B. Sudakov, Subgraphs with large cochromatic number, J. Graph Theory 25 (1997), 295-297.
• N. Alon and B. Sudakov, Disjoint Systems, Random Structures and Algorithms 6 (1995), 13-20.
  A preliminary version appeared in: Lecture Notes in Computer Science 781, Springer Verlag (1994), 159-163.