2012
31Nonnegative k-sums, fractional covers, and probability of small deviations. Noga Alon, Hao Huang, Benny Sudakov. J. Comb. Theory, Ser. B (102): 784-796 (2012). Web SearchBibTeXDownload
30Nearly complete graphs decomposable into large induced matchings and their applications. Noga Alon, Ankur Moitra, Benny Sudakov. STOC 2012, 1079-1090. Web SearchBibTeXDownload
2011
29Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications. Noga Alon, Ankur Moitra, Benny Sudakov. CoRR (abs/1111.0253) (2011). Web SearchBibTeXDownload
2010
28A randomized embedding algorithm for trees. Benny Sudakov, Jan Vondrák. Combinatorica (30): 445-470 (2010). Web SearchBibTeXDownload
27Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors. Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson. Electronic Colloquium on Computational Complexity (ECCC) (17): 37 (2010). Web SearchBibTeXDownload
26Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors. Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson. J. ACM (57) (2010). Web SearchBibTeXDownload
2008
25How many random edges make a dense hypergraph non-2-colorable?. Benny Sudakov, Jan Vondrák. Random Struct. Algorithms (32): 290-306 (2008). Web SearchBibTeXDownload
24Large Nearly Regular Induced Subgraphs. Noga Alon, Michael Krivelevich, Benny Sudakov. SIAM J. Discrete Math. (22): 1325-1337 (2008). Web SearchBibTeXDownload
2007
23Embedding nearly-spanning bounded degree trees. Noga Alon, Michael Krivelevich, Benny Sudakov. Combinatorica (27): 629-644 (2007). Web SearchBibTeXDownload
22On graphs with subgraphs having large independence numbers. Noga Alon, Benny Sudakov. Journal of Graph Theory (56): 149-157 (2007). Web SearchBibTeXDownload
2006
21H-Free Graphs of Large Minimum Degree. Noga Alon, Benny Sudakov. Electr. J. Comb. (13) (2006). Web SearchBibTeXDownload
20Additive Approximation for Edge-Deletion Problems (Abstract). Noga Alon, Asaf Shapira, Benny Sudakov. ICALP (1) 2006, 1-2. Web SearchBibTeXDownload
19A Ramsey-type result for the hypercube. Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák. Journal of Graph Theory (53): 196-208 (2006). Web SearchBibTeXDownload
2005
18Additive Approximation for Edge-Deletion Problems. Noga Alon, Asaf Shapira, Benny Sudakov. FOCS 2005, 419-428. Web SearchBibTeXDownload
17Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson. STOC 2005, 1-10. Web SearchBibTeXDownload
2004
16Learning a Hidden Matching. Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov. SIAM J. Comput. (33): 487-501 (2004). Web SearchBibTeXDownload
2003
15Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions. Noga Alon, Michael Krivelevich, Benny Sudakov. Combinatorics, Probability & Computing (12): 477-494 (2003). Web SearchBibTeXDownload
14Maximum cuts and judicious partitions in graphs without short cycles. Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov. J. Comb. Theory, Ser. B (88): 329-346 (2003). Web SearchBibTeXDownload
13Induced subgraphs of prescribed size. Noga Alon, Michael Krivelevich, Benny Sudakov. Journal of Graph Theory (43): 239-251 (2003). Web SearchBibTeXDownload
2002
12Learning a Hidden Matching. Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov. FOCS 2002, 197. Web SearchBibTeXDownload
2001
11Acyclic edge colorings of graphs. Noga Alon, Benny Sudakov, Ayal Zaks. Journal of Graph Theory (37): 157-167 (2001). Web SearchBibTeXDownload
10Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms. Noga Alon, Benny Sudakov, Uri Zwick. SIAM J. Discrete Math. (15): 58-72 (2001). Web SearchBibTeXDownload
9Constructing worst case instances for semidefinite programming based approximation algorithms. Noga Alon, Benny Sudakov, Uri Zwick. SODA 2001, 92-100. Web SearchBibTeXDownload
2000
8Bipartite Subgraphs And The Smallest Eigenvalue. Noga Alon, Benny Sudakov. Combinatorics, Probability & Computing (9): 1-12 (2000). Web SearchBibTeXDownload
1999
7List Coloring of Random and Pseudo-Random Graphs. Noga Alon, Michael Krivelevich, Benny Sudakov. Combinatorica (19): 453-472 (1999). Web SearchBibTeXDownload
6On Two Segmentation Problems. Noga Alon, Benny Sudakov. J. Algorithms (33): 173-184 (1999). Web SearchBibTeXDownload
5Coloring Graphs with Sparse Neighborhoods. Noga Alon, Michael Krivelevich, Benny Sudakov. J. Comb. Theory, Ser. B (77): 73-82 (1999). Web SearchBibTeXDownload
1998
4Finding a large hidden clique in a random graph. Noga Alon, Michael Krivelevich, Benny Sudakov. Random Struct. Algorithms (13): 457-466 (1998). Web SearchBibTeXDownload
3Finding a Large Hidden Clique in a Random Graph. Noga Alon, Michael Krivelevich, Benny Sudakov. SODA 1998, 594-598. Web SearchBibTeXDownload
1995
2Disjoint Systems. Noga Alon, Benny Sudakov. Random Struct. Algorithms (6): 13-20 (1995). Web SearchBibTeXDownload
1993
1Disjoint Systems (Extended Abstract). Noga Alon, Benny Sudakov. Algebraic Coding 1993, 159-163. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research