The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Benny Sudakov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  63. Cycle lengths in sparse graphs. [Citation Graph (, )][DBLP]


  64. Density theorems for bipartite graphs and related Ramsey-type results. [Citation Graph (, )][DBLP]


  65. Note making a K 4-free graph bipartite. [Citation Graph (, )][DBLP]


  66. Embedding nearly-spanning bounded degree trees. [Citation Graph (, )][DBLP]


  67. H-Free Graphs of Large Minimum Degree. [Citation Graph (, )][DBLP]


  68. Bounding the Number of Edges in Permutation Graphs. [Citation Graph (, )][DBLP]


  69. On the random satisfiable process [Citation Graph (, )][DBLP]


  70. Rainbow Turán Problems. [Citation Graph (, )][DBLP]


  71. On the Strong Chromatic Number of Random Graphs. [Citation Graph (, )][DBLP]


  72. Constrained Ramsey Numbers. [Citation Graph (, )][DBLP]


  73. On the Random Satisfiable Process. [Citation Graph (, )][DBLP]


  74. Two remarks on the Burr-Erdos conjecture. [Citation Graph (, )][DBLP]


Search in 0.021secs, Finished in 0.025secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002