default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenny Sudakov
Benjamin Sudakov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j238]Lior Gishboliner
, Zhihan Jin, Benny Sudakov:
Ramsey Problems for Monotone Paths in Graphs and Hypergraphs. Comb. 44(3): 509-529 (2024)- [j237]Oliver Janzer, Benny Sudakov, István Tomon:
Small Subgraphs with Large Average Degree. Comb. 44(4): 785-800 (2024) - [j236]Domagoj Bradac, Nemanja Draganic, Benny Sudakov:
Effective Bounds for Induced Size-Ramsey Numbers of Cycles. Comb. 44(5): 1011-1039 (2024) - [j235]Lior Gishboliner, Zhihan Jin, Benny Sudakov:
The minimum degree removal lemma thresholds. J. Comb. Theory B 166: 203-221 (2024) - [j234]Domagoj Bradac, Lior Gishboliner, Benny Sudakov:
On Ramsey Size-Linear Graphs and Related Questions. SIAM J. Discret. Math. 38(1): 225-242 (2024) - [c19]Akaki Mamageishvili, Christoph Schlegel, Benny Sudakov:
Searcher Competition in Block Building. AFT 2024: 21:1-21:12 - [i21]Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty, David Munhá Correia, Benny Sudakov:
Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs. CoRR abs/2401.11590 (2024) - [i20]Akaki Mamageishvili, Christoph Schlegel, Benny Sudakov, Danning Sui:
Searcher Competition in Block Building. CoRR abs/2407.07474 (2024) - 2023
- [j233]Domagoj Bradac, Lior Gishboliner, Oliver Janzer, Benny Sudakov:
Asymptotics of the Hypergraph Bipartite Turán Problem. Comb. 43(3): 429-446 (2023) - [j232]Matija Bucic, Benny Sudakov:
Large Independent Sets from Local Considerations. Comb. 43(3): 505-546 (2023) - [j231]Lior Gishboliner, Benny Sudakov:
Maximal chordal subgraphs. Comb. Probab. Comput. 32(5): 724-741 (2023) - [j230]David Conlon, Jacob Fox, Benny Sudakov, Fan Wei:
Threshold Ramsey multiplicity for paths and even cycles. Eur. J. Comb. 107: 103612 (2023) - [j229]Nemanja Draganic, David Munhá Correia, Benny Sudakov:
Tight bounds for powers of Hamilton cycles in tournaments. J. Comb. Theory B 158(Part): 305-340 (2023) - [j228]Noga Alon, Michael Krivelevich, Benny Sudakov:
Complete minors and average degree: A short proof. J. Graph Theory 103(3): 599-602 (2023) - [c18]Oliver Janzer, Benny Sudakov, István Tomon:
Small subgraphs with large average degree. SODA 2023: 2345-2353 - [i19]Benny Sudakov, István Tomon:
Matrix discrepancy and the log-rank conjecture. CoRR abs/2311.18524 (2023) - 2022
- [j227]Benny Sudakov, István Tomon, Adam Zsolt Wagner:
Infinite Sperner's theorem. J. Comb. Theory A 187: 105558 (2022) - [j226]Stefan Glock, Benny Sudakov:
An average degree condition for independent transversals. J. Comb. Theory B 154: 370-391 (2022) - [j225]Nemanja Draganic, David Munhá Correia, Benny Sudakov, Raphael Yuster:
Ramsey number of 1-subdivisions of transitive tournaments. J. Comb. Theory B 157: 176-183 (2022) - [j224]Benny Sudakov, István Tomon, Adam Zsolt Wagner:
Uniform chain decompositions and applications. Random Struct. Algorithms 60(2): 261-286 (2022) - [j223]Matija Bucic, Jacob Fox, Benny Sudakov:
Clique minors in graphs with a forbidden subgraph. Random Struct. Algorithms 60(3): 327-338 (2022) - 2021
- [j222]Matija Bucic, Eoin Long, Asaf Shapira, Benny Sudakov:
Tournament Quasirandomness from Local Counting. Comb. 41(2): 175-208 (2021) - [j221]Matija Bucic, Dániel Korándi, Benny Sudakov:
Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs. Comb. 41(3): 319-352 (2021) - [j220]Nemanja Draganic, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex D. Scott, Benny Sudakov:
Powers of paths in tournaments. Comb. Probab. Comput. 30(6): 894-898 (2021) - [j219]Matija Bucic, Nemanja Draganic, Benny Sudakov:
Universal and unavoidable graphs. Comb. Probab. Comput. 30(6): 942-955 (2021) - [j218]Matija Bucic, Nemanja Draganic, Benny Sudakov, Tuan Tran:
Unavoidable hypergraphs. J. Comb. Theory B 151: 307-338 (2021) - [j217]Shagnik Das, Alexey Pokrovskiy, Benny Sudakov:
Isomorphic bisections of cubic graphs. J. Comb. Theory B 151: 465-481 (2021) - [j216]Oliver Cooley, Nemanja Draganic, Mihyun Kang, Benny Sudakov:
Large Induced Matchings in Random Graphs. SIAM J. Discret. Math. 35(1): 267-280 (2021) - [j215]Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming. SIAM J. Discret. Math. 35(3): 1557-1568 (2021) - [i18]Stefan Glock, David Munhá Correia, Benny Sudakov:
The n-queens completion problem. CoRR abs/2111.11402 (2021) - 2020
- [j214]Matthew Kwan, Shoham Letzter, Benny Sudakov, Tuan Tran:
Dense Induced Bipartite Subgraphs in Triangle-Free Graphs. Comb. 40(2): 283-305 (2020) - [j213]Asaf Ferber, Vishesh Jain, Benny Sudakov:
Number of 1-Factorizations of Regular High-Degree Graphs. Comb. 40(3): 315-344 (2020) - [j212]Rajko Nenadov, Mehtab Sawhney, Benny Sudakov, Adam Zsolt Wagner:
Bounded Degree Spanners of the Hypercube. Electron. J. Comb. 27(3): 3 (2020) - [j211]Omer Angel, Asaf Ferber, Benny Sudakov, Vincent Tassion:
Long Monotone Trails in Random Edge-Labellings of Random Graphs. Comb. Probab. Comput. 29(1): 22-30 (2020) - [j210]Matija Bucic, Sven Heberle, Shoham Letzter, Benny Sudakov:
Monochromatic trees in random tournaments. Comb. Probab. Comput. 29(3): 318-345 (2020) - [j209]Igor Balla, Shoham Letzter, Benny Sudakov:
Orthonormal Representations of H-Free Graphs. Discret. Comput. Geom. 64(3): 654-670 (2020) - [j208]Frederik Benzing, Alexey Pokrovskiy, Benny Sudakov:
Long directed rainbow cycles and rainbow spanning trees. Eur. J. Comb. 88: 103102 (2020) - [j207]Shoham Letzter, Benny Sudakov:
The oriented size Ramsey number of directed paths. Eur. J. Comb. 88: 103103 (2020) - [j206]Matija Bucic, Erik Jahn, Alexey Pokrovskiy, Benny Sudakov:
2-factors with k cycles in Hamiltonian graphs. J. Comb. Theory B 144: 150-166 (2020) - [j205]Rajko Nenadov, Benny Sudakov, Adam Zsolt Wagner:
Completion and deficiency problems. J. Comb. Theory B 145: 214-240 (2020) - [j204]Michael Krivelevich, Eyal Lubetzky, Benny Sudakov:
Asymptotics in percolation on high-girth expanders. Random Struct. Algorithms 56(4): 927-947 (2020) - [j203]David Conlon, Jacob Fox, Benny Sudakov:
Short proofs of some extremal results III. Random Struct. Algorithms 57(4): 958-982 (2020) - [j202]Nina Kamcev, Michael Krivelevich, Natasha Morrison, Benny Sudakov:
The Kőnig graph process. Random Struct. Algorithms 57(4): 1272-1302 (2020) - [j201]David Conlon, Jacob Fox, Benny Sudakov:
Books versus Triangles at the Extremal Density. SIAM J. Discret. Math. 34(1): 385-398 (2020) - [j200]Alexey Pokrovskiy, Benny Sudakov:
Ramsey Goodness of Cycles. SIAM J. Discret. Math. 34(3): 1884-1908 (2020) - [c17]Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut via Semidefinite Programming. LATIN 2020: 479-490
2010 – 2019
- 2019
- [j199]Lenny Fukshansky, Deanna Needell, Benny Sudakov:
An algebraic perspective on integer sparse recovery. Appl. Math. Comput. 340: 31-42 (2019) - [j198]Martin Nägele, Benny Sudakov, Rico Zenklusen:
Submodular Minimization Under Congruency Constraints. Comb. 39(6): 1351-1386 (2019) - [j197]Matija Bucic, Shoham Letzter, Benny Sudakov:
Multicolour Bipartite Ramsey Number of Paths. Electron. J. Comb. 26(3): 3 (2019) - [j196]Igor Balla, Benny Sudakov:
Equiangular Subspaces in Euclidean Spaces. Discret. Comput. Geom. 61(1): 81-90 (2019) - [j195]Matija Bucic, Shoham Letzter, Benny Sudakov:
Directed Ramsey number for trees. J. Comb. Theory B 137: 145-177 (2019) - [j194]Shagnik Das, Roman Glebov, Benny Sudakov, Tuan Tran:
Colouring set families without monochromatic k-chains. J. Comb. Theory A 168: 84-119 (2019) - [j193]Matija Bucic, Shoham Letzter, Benny Sudakov:
3-Color bipartite Ramsey number of cycles and paths. J. Graph Theory 92(4): 445-459 (2019) - [j192]Matthew Kwan, Benny Sudakov, Tuan Tran:
Anticoncentration for subgraph statistics. J. Lond. Math. Soc. 99(3): 757-777 (2019) - [j191]Matija Bucic, Shoham Letzter, Benny Sudakov:
Monochromatic paths in random tournaments. Random Struct. Algorithms 54(1): 69-81 (2019) - [j190]Thomas Kalinowski, Nina Kamcev, Benny Sudakov:
The Zero Forcing Number of Graphs. SIAM J. Discret. Math. 33(1): 95-115 (2019) - [i17]Sergei Konyagin, Benny Sudakov:
An extremal problem for integer sparse recovery. CoRR abs/1904.08661 (2019) - 2018
- [j189]Igor Balla, Alexey Pokrovskiy, Benny Sudakov:
Ramsey Goodness of Bounded Degree Trees. Comb. Probab. Comput. 27(3): 289-309 (2018) - [j188]Nina Kamcev, Tomasz Luczak, Benny Sudakov:
Anagram-Free Colourings of Graphs. Comb. Probab. Comput. 27(4): 623-642 (2018) - [j187]Alexey Pokrovskiy, Benny Sudakov:
Linearly many rainbow trees in properly edge-coloured complete graphs. J. Comb. Theory B 132: 134-156 (2018) - [j186]Jonathan A. Noel, Alex Scott, Benny Sudakov:
Supersaturation in posets and applications involving the container method. J. Comb. Theory A 154: 247-284 (2018) - [j185]Matthew Kwan, Benny Sudakov, Pedro Vieira:
Non-trivially intersecting multi-part families. J. Comb. Theory A 156: 44-60 (2018) - [j184]Matthew Kwan, Benny Sudakov:
Intercalates and discrepancy in random Latin squares. Random Struct. Algorithms 52(2): 181-196 (2018) - [j183]Asaf Ferber, Matthew Kwan, Benny Sudakov:
Counting Hamilton cycles in sparse random directed graphs. Random Struct. Algorithms 53(4): 592-603 (2018) - [j182]Dániel Korándi, Frank Mousset, Rajko Nenadov, Nemanja Skoric, Benny Sudakov:
Monochromatic cycle covers in random graphs. Random Struct. Algorithms 53(4): 667-691 (2018) - [j181]Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov:
The random k-matching-free process. Random Struct. Algorithms 53(4): 692-716 (2018) - [j180]Benny Sudakov, Pedro Vieira:
Two Remarks on Eventown and Oddtown Problems. SIAM J. Discret. Math. 32(1): 280-295 (2018) - [c16]Martin Nägele, Benny Sudakov, Rico Zenklusen:
Submodular Minimization Under Congruency Constraints. SODA 2018: 849-866 - 2017
- [j179]Alexandr V. Kostochka, Benny Sudakov, Jacques Verstraëte:
Cycles in triangle-free graphs of large chromatic number. Comb. 37(3): 481-494 (2017) - [j178]Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Compatible Hamilton cycles in Dirac graphs. Comb. 37(4): 697-732 (2017) - [j177]Benny Sudakov, Jacques Verstraëte:
The Extremal Function for Cycles of Length l mod k. Electron. J. Comb. 24(1): 1 (2017) - [j176]Roman Glebov, Humberto Naves, Benny Sudakov:
The Threshold Probability for Long Cycles. Comb. Probab. Comput. 26(2): 208-247 (2017) - [j175]Nina Kamcev, Benny Sudakov, Jan Volec:
Bounded colorings of multipartite graphs and hypergraphs. Eur. J. Comb. 66: 235-249 (2017) - [j174]Igor Balla, Felix Dräxler, Peter Keevash, Benny Sudakov:
Equiangular lines and subspaces in Euclidean spaces. Electron. Notes Discret. Math. 61: 85-91 (2017) - [j173]Matija Bucic, Shoham Letzter, Benny Sudakov:
Directed Ramsey number for trees. Electron. Notes Discret. Math. 61: 169-175 (2017) - [j172]Matija Bucic, Shoham Letzter, Benny Sudakov:
Monochromatic paths in random tournaments. Electron. Notes Discret. Math. 61: 177-183 (2017) - [j171]Nina Kamcev, Tomasz Luczak, Benny Sudakov:
Anagram-free colorings of graphs. Electron. Notes Discret. Math. 61: 671-677 (2017) - [j170]Alexey Pokrovskiy, Benny Sudakov:
Edge-disjoint rainbow trees in properly coloured complete graphs. Electron. Notes Discret. Math. 61: 995-1001 (2017) - [j169]Asaf Ferber, Michael Krivelevich, Benny Sudakov:
Counting and packing Hamilton cycles in dense graphs and oriented graphs. J. Comb. Theory B 122: 196-220 (2017) - [j168]David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov:
Ordered Ramsey numbers. J. Comb. Theory B 122: 353-383 (2017) - [j167]Alexey Pokrovskiy, Benny Sudakov:
Ramsey goodness of paths. J. Comb. Theory B 122: 384-390 (2017) - [j166]Benny Sudakov, Jan Volec:
Properly colored and rainbow copies of graphs with few cherries. J. Comb. Theory B 122: 391-416 (2017) - [j165]Dániel Korándi, Benny Sudakov:
Domination in 3-tournaments. J. Comb. Theory A 146: 165-168 (2017) - [j164]Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira:
Finding paths in sparse random graphs requires many queries. Random Struct. Algorithms 50(1): 71-85 (2017) - [j163]Dániel Korándi, Benny Sudakov:
Saturation in random graphs. Random Struct. Algorithms 51(1): 169-181 (2017) - [j162]Michael Krivelevich, Matthew Kwan, Benny Sudakov:
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs. SIAM J. Discret. Math. 31(1): 155-171 (2017) - [j161]Eli Shamir, Benny Sudakov:
Two-Sided, Unbiased Version of Hall's Marriage Theorem. Am. Math. Mon. 124(1): 79-80 (2017) - [j160]Noga Alon, Klim Efremenko, Benny Sudakov:
Testing Equality in Communication Graphs. IEEE Trans. Inf. Theory 63(11): 7569-7574 (2017) - [c15]Benny Sudakov:
Robustness of graph properties. BCC 2017: 372-408 - [i16]Martin Nägele, Benny Sudakov, Rico Zenklusen:
Submodular Minimization Under Congruency Constraints. CoRR abs/1707.06212 (2017) - 2016
- [j159]David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov:
Ramsey numbers of cubes versus cliques. Comb. 36(1): 37-70 (2016) - [j158]Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov:
On the densities of cliques and independent sets in graphs. Comb. 36(5): 493-512 (2016) - [j157]Shagnik Das, Wenying Gan, Benny Sudakov:
The minimum number of disjoint pairs in set systems and related problems. Comb. 36(6): 623-660 (2016) - [j156]Michael Krivelevich, Matthew Kwan, Benny Sudakov:
Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs. Comb. Probab. Comput. 25(6): 909-927 (2016) - [j155]David Conlon, Jacob Fox, Benny Sudakov:
Short proofs of some extremal results II. J. Comb. Theory B 121: 173-196 (2016) - [j154]Shagnik Das, Benny Sudakov, Pedro Vieira:
Almost-Fisher families. J. Comb. Theory A 138: 175-207 (2016) - [j153]Nina Kamcev, Michael Krivelevich, Benny Sudakov:
Some Remarks on Rainbow Connectivity. J. Graph Theory 83(4): 372-383 (2016) - [j152]Choongbum Lee, Po-Shen Loh, Benny Sudakov:
Judicious partitions of directed graphs. Random Struct. Algorithms 48(1): 147-170 (2016) - [j151]Dan Hefetz, Angelika Steger, Benny Sudakov:
Random directed graphs are robustly Hamiltonian. Random Struct. Algorithms 49(2): 345-362 (2016) - [j150]Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Compatible Hamilton cycles in random graphs. Random Struct. Algorithms 49(3): 533-557 (2016) - [j149]Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira:
Finding Hamilton cycles in random graphs with few queries. Random Struct. Algorithms 49(4): 635-668 (2016) - [j148]Dániel Korándi, Yuval Peled, Benny Sudakov:
A Random Triadic Process. SIAM J. Discret. Math. 30(1): 1-19 (2016) - [j147]Noga Alon, Humberto Naves, Benny Sudakov:
On the Maximum Quartet Distance between Phylogenetic Trees. SIAM J. Discret. Math. 30(2): 718-735 (2016) - [c14]Noga Alon, Humberto Naves, Benny Sudakov:
On the maximum quartet distance between phylogenetic trees. SODA 2016: 2095-2106 - [i15]Noga Alon, Klim Efremenko, Benny Sudakov:
Testing Equality in Communication Graphs. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j146]Asaf Shapira, Benny Sudakov:
Small complete minors above the extremal edge density. Comb. 35(1): 75-94 (2015) - [j145]Shagnik Das, Benny Sudakov:
Most Probably Intersecting Hypergraphs. Electron. J. Comb. 22(1): 1 (2015) - [j144]Wenying Gan, Po-Shen Loh, Benny Sudakov:
Maximizing the Number of Independent Sets of a Fixed Size. Comb. Probab. Comput. 24(3): 521-527 (2015) - [j143]Shagnik Das, Wenying Gan, Benny Sudakov:
Sperner's Theorem and a Problem of Erdős, Katona and Kleitman. Comb. Probab. Comput. 24(4): 585-608 (2015) - [j142]Dániel Korándi, Michael Krivelevich, Benny Sudakov:
Decomposing Random Graphs into Few Cycles and Edges. Comb. Probab. Comput. 24(6): 857-872 (2015) - [j141]Wenying Gan, Dániel Korándi, Benny Sudakov:
Ks, t-saturated bipartite graphs. Eur. J. Comb. 45: 12-20 (2015) - [j140]Nina Kamcev, Michael Krivelevich, Benny Sudakov:
Some Remarks on Rainbow Connectivity. Electron. Notes Discret. Math. 49: 123-131 (2015) - [j139]Michael Krivelevich, Matthew Kwan, Benny Sudakov:
Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electron. Notes Discret. Math. 49: 181-187 (2015) - [j138]Dániel Korándi, Yuval Peled, Benny Sudakov:
A random triadic process. Electron. Notes Discret. Math. 49: 189-196 (2015) - [j137]Shagnik Das, Benny Sudakov, Pedro Vieira:
Almost-Fisher families. Electron. Notes Discret. Math. 49: 293-300 (2015) - [j136]Benny Sudakov, Jan Volec:
Properly colored and rainbow copies of graphs with few cherries. Electron. Notes Discret. Math. 49: 315-321 (2015) - [j135]Wojciech Samotij, Benny Sudakov:
On the number of monotone sequences. J. Comb. Theory B 115: 132-163 (2015) - [j134]Noga Alon, Shagnik Das, Roman Glebov, Benny Sudakov:
Comparable pairs in families of sets. J. Comb. Theory B 115: 164-185 (2015) - [j133]Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Long paths and cycles in random subgraphs of graphs with large minimum degree. Random Struct. Algorithms 46(2): 320-345 (2015) - [j132]Jie Ma, Humberto Naves, Benny Sudakov:
Discrepancy of random graphs and hypergraphs. Random Struct. Algorithms 47(1): 147-162 (2015) - [p1]David Conlon, Jacob Fox, Benny Sudakov:
Recent developments in graph Ramsey theory. Surveys in Combinatorics 2015: 49-118 - [i14]Noga Alon, Humberto Naves, Benny Sudakov:
On the maximum quartet distance between phylogenetic trees. CoRR abs/1505.04344 (2015) - 2014
- [j131]Roman Glebov, Benny Sudakov, Tibor Szabó:
How Many Colors Guarantee a Rainbow Matching? Electron. J. Comb. 21(1): 1 (2014) - [j130]Hao Huang, Benny Sudakov:
The Minimum Number of Nonnegative Edges in Hypergraphs. Electron. J. Comb. 21(3): 3 (2014) - [j129]David Conlon, Jacob Fox, Benny Sudakov:
Short Proofs of Some Extremal Results. Comb. Probab. Comput. 23(1): 8-28 (2014) - [j128]Peter Allen, Peter Keevash, Benny Sudakov, Jacques Verstraëte:
Turán numbers of bipartite graphs plus an odd cycle. J. Comb. Theory B 106: 134-162 (2014) - [j127]Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov:
On the 3-Local Profiles of Graphs. J. Graph Theory 76(3): 236-248 (2014) - [j126]David Conlon, Jacob Fox, Benny Sudakov:
Cycle packing. Random Struct. Algorithms 45(4): 608-626 (2014) - [j125]Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov:
Musical Chairs. SIAM J. Discret. Math. 28(3): 1578-1600 (2014) - 2013
- [j124]Nathaniel Parrish, Benjamin Sudakov, Eleazar Eskin:
Genome reassembly with high-throughput sequencing data. BMC Genom. 14(S-1): S8 (2013) - [j123]Jacob Fox, Choongbum Lee, Benny Sudakov:
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz. Comb. 33(2): 181-197 (2013) - [j122]Peter Keevash, Benny Sudakov, Jacques Verstraëte:
On a conjecture of Erdős and Simonovits: Even cycles. Comb. 33(6): 699-732 (2013) - [j121]Hao Huang, Jie Ma, Asaf Shapira, Benny Sudakov, Raphael Yuster:
Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs. Comb. Probab. Comput. 22(6): 859-873 (2013) - [j120]David Conlon, Jacob Fox, Benny Sudakov:
An improved bound for the stepping-up lemma. Discret. Appl. Math. 161(9): 1191-1196 (2013) - [j119]Shagnik Das, Choongbum Lee, Benny Sudakov:
Rainbow Turán problem for even cycles. Eur. J. Comb. 34(5): 905-915 (2013) - [j118]Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick:
All-pairs shortest paths in O(n2) time with high probability. J. ACM 60(4): 26:1-26:25 (2013) - [j117]Shagnik Das, Hao Huang, Jie Ma, Humberto Naves, Benny Sudakov:
A problem of Erdős on the minimum number of k-cliques. J. Comb. Theory B 103(3): 344-373 (2013) - [j116]Choongbum Lee, Po-Shen Loh, Benny Sudakov:
Bisections of graphs. J. Comb. Theory B 103(5): 599-629 (2013) - [j115]Michael Krivelevich, Eyal Lubetzky, Benny Sudakov:
Longest cycles in sparse random digraphs. Random Struct. Algorithms 43(1): 1-15 (2013) - [j114]Michael Krivelevich, Benny Sudakov:
The phase transition in random graphs: A simple proof. Random Struct. Algorithms 43(2): 131-138 (2013) - [j113]Choongbum Lee, Po-Shen Loh, Benny Sudakov:
Self-Similarity of Graphs. SIAM J. Discret. Math. 27(2): 959-972 (2013) - [c13]David Conlon, Jacob Fox, János Pach, Benny Sudakov, Andrew Suk:
Ramsey-type results for semi-algebraic relations. SoCG 2013: 309-318 - 2012
- [j112]Hao Huang, Benny Sudakov:
A counterexample to the Alon-Saks-Seymour conjecture and related problems. Comb. 32(2): 205-219 (2012) - [j111]David Conlon, Jacob Fox, Benny Sudakov:
On two problems in graph Ramsey theory. Comb. 32(5): 513-535 (2012) - [j110]Hao Huang, Po-Shen Loh, Benny Sudakov:
The Size of a Hypergraph and its Matching Number. Comb. Probab. Comput. 21(3): 442-450 (2012) - [j109]Choongbum Lee, Benny Sudakov, Dan Vilenchik:
Getting a Directed Hamilton Cycle Two Times Faster. Comb. Probab. Comput. 21(5): 773-801 (2012) - [j108]Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov:
Biased orientation games. Discret. Math. 312(10): 1732-1742 (2012) - [j107]Choongbum Lee, Benny Sudakov:
Hamiltonicity, independence number, and pancyclicity. Eur. J. Comb. 33(4): 449-457 (2012) - [j106]Hao Huang, Choongbum Lee, Benny Sudakov:
Bandwidth theorem for random graphs. J. Comb. Theory B 102(1): 14-37 (2012) - [j105]Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov:
The size Ramsey number of a directed path. J. Comb. Theory B 102(3): 743-755 (2012) - [j104]Noga Alon, Hao Huang, Benny Sudakov:
Nonnegative k-sums, fractional covers, and probability of small deviations. J. Comb. Theory B 102(3): 784-796 (2012) - [j103]David Conlon, Jacob Fox, Benny Sudakov:
Erdős-Hajnal-type theorems in hypergraphs. J. Comb. Theory B 102(5): 1142-1154 (2012) - [j102]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 A 119(6): 1200-1215 (2012) - [j101]Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov:
Long cycles in subgraphs of (pseudo)random directed graphs. J. Graph Theory 70(3): 284-296 (2012) - [j100]Choongbum Lee, Benny Sudakov:
Dirac's theorem for random graphs. Random Struct. Algorithms 41(3): 293-305 (2012) - [c12]Noga Alon, Ankur Moitra, Benny Sudakov:
Nearly complete graphs decomposable into large induced matchings and their applications. STOC 2012: 1079-1090 - [i13]Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov:
Musical chairs. CoRR abs/1208.0813 (2012) - [i12]Asaf Shapira, Benny Sudakov:
Small Complete Minors Above the Extremal Edge Density. CoRR abs/1208.3568 (2012) - 2011
- [j99]Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov:
Local Resilience and Hamiltonicity Maker-Breaker Games in Random Regular Graphs. Comb. Probab. Comput. 20(2): 173-211 (2011) - [j98]David Ellis, Benny Sudakov:
Generating all subsets of a finite set with disjoint unions. J. Comb. Theory A 118(8): 2319-2345 (2011) - [j97]Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov:
Ramsey games with giants. Random Struct. Algorithms 38(1-2): 1-32 (2011) - [j96]Jacob Fox, Benny Sudakov:
Dependent random choice. Random Struct. Algorithms 38(1-2): 68-99 (2011) - [j95]Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald:
Regular induced subgraphs of a random Graph. Random Struct. Algorithms 38(3): 235-250 (2011) - [j94]Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov:
On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs. SIAM J. Discret. Math. 25(3): 1176-1193 (2011) - [j93]Alex Scott, Benny Sudakov:
A Bound for the Cops and Robbers Problem. SIAM J. Discret. Math. 25(3): 1438-1442 (2011) - [c11]Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov:
Oblivious Collaboration. DISC 2011: 489-504 - [i11]Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov:
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs. CoRR abs/1101.3099 (2011) - [i10]David Conlon, Jacob Fox, Benny Sudakov:
Erdos-Hajnal-type theorems in hypergraphs. CoRR abs/1104.5544 (2011) - [i9]Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick:
All-Pairs Shortest Paths in O(n2) time with high probability. CoRR abs/1105.3770 (2011) - [i8]Yehuda Afek, Yakov Babichenko, Uriel Feige, Eli Gafni, Nati Linial, Benny Sudakov:
Oblivious Collaboration. CoRR abs/1106.2065 (2011) - [i7]Choongbum Lee, Po-Shen Loh, Benny Sudakov:
Bisections of graphs. CoRR abs/1109.3180 (2011) - [i6]Noga Alon, Ankur Moitra, Benny Sudakov:
Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications. CoRR abs/1111.0253 (2011) - [i5]David Conlon, Jacob Fox, Benny Sudakov:
Two extensions of Ramsey's theorem. CoRR abs/1112.1548 (2011) - 2010
- [j92]Benny Sudakov, Jan Vondrák:
A randomized embedding algorithm for trees. Comb. 30(4): 445-470 (2010) - [j91]Jacob Fox, Peter Keevash, Benny Sudakov:
Directed Graphs Without Short Cycles. Comb. Probab. Comput. 19(2): 285-301 (2010) - [j90]Jacob Fox, Benny Sudakov:
Decompositions into Subgraphs of Small Diameter. Comb. Probab. Comput. 19(5-6): 753-774 (2010) - [j89]Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson:
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors. J. ACM 57(4): 20:1-20:52 (2010) - [j88]Peter Keevash, Benny Sudakov:
Pancyclicity of Hamiltonian and highly connected graphs. J. Comb. Theory B 100(5): 456-467 (2010) - [j87]Michael Krivelevich, Eyal Lubetzky, Benny Sudakov:
Hamiltonicity thresholds in Achlioptas processes. Random Struct. Algorithms 37(1): 1-24 (2010) - [j86]Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Resilient Pancyclicity of Random and Pseudorandom Graphs. SIAM J. Discret. Math. 24(1): 1-16 (2010) - [c10]Yuval Peres, Dmitry Sotnikov, Benny Sudakov, Uri Zwick:
All-Pairs Shortest Paths in O(n2) Time with High Probability. FOCS 2010: 663-672 - [i4]Jacob Fox, Choongbum Lee, Benny Sudakov:
Maximum union-free subfamilies. CoRR abs/1012.3127 (2010) - [i3]Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson:
Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors. Electron. Colloquium Comput. Complex. TR10 (2010) - [i2]Hao Huang, Benny Sudakov:
A counterexample to the Alon-Saks-Seymour conjecture and related problems. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j85]Jacob Fox, Benny Sudakov:
Density theorems for bipartite graphs and related Ramsey-type results. Comb. 29(2): 153-196 (2009) - [j84]Jacob Fox, Benny Sudakov:
Paths and Stability Number in Digraphs. Electron. J. Comb. 16(1) (2009) - [j83]Po-Shen Loh, Benny Sudakov:
Constrained Ramsey Numbers. Comb. Probab. Comput. 18(1-2): 247-258 (2009) - [j82]Michael Krivelevich, Benny Sudakov, Dan Vilenchik:
On the Random Satisfiable Process. Comb. Probab. Comput. 18(5): 775-801 (2009) - [j81]Jacob Fox, Benny Sudakov:
Two remarks on the Burr-Erdos conjecture. Eur. J. Comb. 30(7): 1630-1645 (2009) - [j80]Jacob Fox, Po-Shen Loh, Benny Sudakov:
Large induced trees in Kr-free graphs. J. Comb. Theory B 99(2): 494-501 (2009) - [j79]Peter Keevash, Benny Sudakov:
Triangle packings and 1-factors in oriented graphs. J. Comb. Theory B 99(4): 709-727 (2009) - [j78]Michael Krivelevich, Po-Shen Loh, Benny Sudakov:
Avoiding small subgraphs in Achlioptas processes. Random Struct. Algorithms 34(1): 165-195 (2009) - [j77]David Conlon, Jacob Fox, Benny Sudakov:
Ramsey numbers of sparse hypergraphs. Random Struct. Algorithms 35(1): 1-14 (2009) - 2008
- [j76]Benny Sudakov, Jacques Verstraëte:
Cycle lengths in sparse graphs. Comb. 28(3): 357-372 (2008) - [j75]Po-Shen Loh, Benny Sudakov:
On the Strong Chromatic Number of Random Graphs. Comb. Probab. Comput. 17(2): 271-286 (2008) - [j74]Jacob Fox, Benny Sudakov:
On a problem of Duke-Erdös-Rödl on cycle-connected subgraphs. J. Comb. Theory B 98(5): 1056-1062 (2008) - [j73]Jacob Fox, Benny Sudakov:
Unavoidable patterns. J. Comb. Theory A 115(8): 1561-1569 (2008) - [j72]Tom Bohman, Alan M. Frieze, Benny Sudakov:
The game chromatic number of random graphs. Random Struct. Algorithms 32(2): 223-235 (2008) - [j71]Benny Sudakov, Jan Vondrák:
How many random edges make a dense hypergraph non-2-colorable? Random Struct. Algorithms 32(3): 290-306 (2008) - [j70]Benny Sudakov, Van H. Vu:
Local resilience of graphs. Random Struct. Algorithms 33(4): 409-433 (2008) - [j69]Noga Alon, Michael Krivelevich, Benny Sudakov:
Large Nearly Regular Induced Subgraphs. SIAM J. Discret. Math. 22(4): 1325-1337 (2008) - [j68]Jacob Fox, Benny Sudakov:
Ramsey-Type Problem for an Almost Monochromatic K4. SIAM J. Discret. Math. 23(1): 155-162 (2008) - [i1]Michael Krivelevich, Benny Sudakov, Dan Vilenchik:
On the random satisfiable process. CoRR abs/0807.4326 (2008) - 2007
- [j67]Benny Sudakov:
Note making a K 4-free graph bipartite. Comb. 27(4): 509-518 (2007) - [j66]Noga Alon, Michael Krivelevich, Benny Sudakov:
Embedding nearly-spanning bounded degree trees. Comb. 27(6): 629-644 (2007) - [j65]Peter Keevash, Dhruv Mubayi, Benny Sudakov, Jacques Verstraëte:
Rainbow Turán Problems. Comb. Probab. Comput. 16(1): 109-126 (2007) - [j64]Jeong Han Kim, Benny Sudakov, Van H. Vu:
Small subgraphs of random regular graphs. Discret. Math. 307(15): 1961-1967 (2007) - [j63]Po-Shen Loh, Benny Sudakov:
Constrained Ramsey Numbers. Electron. Notes Discret. Math. 29: 41-45 (2007) - [j62]Jacob Fox, Benny Sudakov:
Induced Ramsey-type theorems. Electron. Notes Discret. Math. 29: 53-58 (2007) - [j61]Boris Bukh, Benny Sudakov:
Induced subgraphs of Ramsey graphs with many distinct degrees. J. Comb. Theory B 97(4): 612-619 (2007) - [j60]Po-Shen Loh, Benny Sudakov:
Independent transversals in locally sparse graphs. J. Comb. Theory B 97(6): 904-918 (2007) - [j59]Noga Alon, Benny Sudakov:
On graphs with subgraphs having large independence numbers. J. Graph Theory 56(2): 149-157 (2007) - [j58]Benny Sudakov:
Ramsey Numbers and the Size of Graphs. SIAM J. Discret. Math. 21(4): 980-986 (2007) - 2006
- [j57]Noga Alon, Benny Sudakov:
H-Free Graphs of Large Minimum Degree. Electron. J. Comb. 13(1) (2006) - [j56]Peter Keevash, Po-Shen Loh, Benny Sudakov:
Bounding the Number of Edges in Permutation Graphs. Electron. J. Comb. 13(1) (2006) - [j55]Michael Krivelevich, Benny Sudakov:
Preface. Eur. J. Comb. 27(8): 1225-1226 (2006) - [j54]Peter Keevash, Benny Sudakov:
Sparse halves in triangle-free graphs. J. Comb. Theory B 96(4): 614-620 (2006) - [j53]József Balogh, Peter Keevash, Benny Sudakov:
On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs. J. Comb. Theory B 96(6): 919-932 (2006) - [j52]Peter Keevash, Benny Sudakov:
On a restricted cross-intersection problem. J. Comb. Theory A 113(7): 1536-1542 (2006) - [j51]Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák:
A Ramsey-type result for the hypercube. J. Graph Theory 53(3): 196-208 (2006) - [j50]Michael Krivelevich, Benny Sudakov, Prasad Tetali:
On smoothed analysis in dense graphs and formulas. Random Struct. Algorithms 29(2): 180-193 (2006) - [c9]Noga Alon, Asaf Shapira, Benny Sudakov:
Additive Approximation for Edge-Deletion Problems (Abstract). ICALP (1) 2006: 1-2 - 2005
- [j49]Benny Sudakov:
A New Lower Bound For A Ramsey-Type Problem. Comb. 25(4): 487-498 (2005) - [j48]Peter Keevash, Benny Sudakov:
The Turán Number Of The Fano Plane. Comb. 25(5): 561-574 (2005) - [j47]Peter Keevash, Benny Sudakov:
On A Hypergraph Turán Problem Of Frankl. Comb. 25(6): 673-706 (2005) - [j46]József Balogh, Peter Keevash, Benny Sudakov:
Disjoint representability of sets and their complements. J. Comb. Theory B 95(1): 12-28 (2005) - [j45]Benny Sudakov, Tibor Szabó, Van H. Vu:
A generalization of Turán's theorem. J. Graph Theory 49(3): 187-195 (2005) - [j44]Benny Sudakov:
Large Kr-free subgraphs in Ks-free graphs and some other Ramsey-type problems. Random Struct. Algorithms 26(3): 253-265 (2005) - [j43]Peter Keevash, Benny Sudakov:
Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices. SIAM J. Discret. Math. 18(4): 713-727 (2005) - [j42]Alan M. Frieze, Michael Krivelevich, Benny Sudakov:
The Strong Chromatic Index of Random Graphs. SIAM J. Discret. Math. 19(3): 719-727 (2005) - [c8]Noga Alon, Asaf Shapira, Benny Sudakov:
Additive Approximation for Edge-Deletion Problems. FOCS 2005: 419-428 - [c7]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 - 2004
- [j41]Peter Keevash, Michael E. Saks, Benny Sudakov, Jacques Verstraëte:
Multicolour Turán problems. Adv. Appl. Math. 33(2): 238-262 (2004) - [j40]Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov:
On the Value of a Random Minimum Weight Steiner Tree. Comb. 24(2): 187-207 (2004) - [j39]Michael Krivelevich, Benny Sudakov, Tibor Szabó:
Triangle Factors In Sparse Pseudo-Random Graphs. Comb. 24(3): 403-426 (2004) - [j38]Bruce A. Reed, Benny Sudakov:
List Colouring When The Chromatic Number Is Close To the Order Of The Graph. Comb. 25(1): 117-123 (2004) - [j37]Peter Keevash, Benny Sudakov:
On the number of edges not covered by monochromatic copies of a fixed graph. J. Comb. Theory B 90(1): 41-53 (2004) - [j36]Zoltán Füredi, Benny Sudakov:
Extremal set systems with restricted k-wise intersections. J. Comb. Theory A 105(1): 143-159 (2004) - [j35]Béla Bollobás, Peter Keevash, Benny Sudakov:
Multicoloured extremal problems. J. Comb. Theory A 107(2): 295-312 (2004) - [j34]Peter Keevash, Benny Sudakov:
Packing triangles in a graph and its complement. J. Graph Theory 47(3): 203-216 (2004) - [j33]Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov:
Learning a Hidden Matching. SIAM J. Comput. 33(2): 487-501 (2004) - 2003
- [j32]Michael Krivelevich, Benny Sudakov:
The Largest Eigenvalue Of Sparse Random Graphs. Comb. Probab. Comput. 12(1): 61-72 (2003) - [j31]Peter Keevash, Benny Sudakov:
Local Density In Graphs With Forbidden Subgraphs. Comb. Probab. Comput. 12(2): 139-153 (2003) - [j30]Noga Alon, Michael Krivelevich, Benny Sudakov:
Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions. Comb. Probab. Comput. 12(5-6): 477-494 (2003) - [j29]Alexandr V. Kostochka, Benny Sudakov:
On Ramsey Numbers of Sparse Graphs. Comb. Probab. Comput. 12(5-6): 627-641 (2003) - [j28]Michael Krivelevich, Benny Sudakov:
Approximate coloring of uniform hypergraphs. J. Algorithms 49(1): 2-12 (2003) - [j27]Benny Sudakov:
A few remarks on Ramsey-Tura'n-type problems. J. Comb. Theory B 88(1): 99-106 (2003) - [j26]Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov:
Maximum cuts and judicious partitions in graphs without short cycles. J. Comb. Theory B 88(2): 329-346 (2003) - [j25]Michael Krivelevich, Benny Sudakov:
Sparse pseudo-random graphs are Hamiltonian. J. Graph Theory 42(1): 17-33 (2003) - [j24]Noga Alon, Michael Krivelevich, Benny Sudakov:
Induced subgraphs of prescribed size. J. Graph Theory 43(4): 239-251 (2003) - [j23]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) - [j22]Michael Krivelevich, Benny Sudakov, Van H. Vu:
Covering codes with improved density. IEEE Trans. Inf. Theory 49(7): 1812-1815 (2003) - 2002
- [j21]Benny Sudakov:
A Note on Odd Cycle-Complete Graph Ramsey Numbers. Electron. J. Comb. 9(1) (2002) - [j20]Michael Krivelevich, Benny Sudakov, Van H. Vu:
A Sharp Threshold For Network Reliability. Comb. Probab. Comput. 11(5): 465-474 (2002) - [j19]Bruce A. Reed, Benny Sudakov:
Asymptotically the List Colouring Constants Are 1. J. Comb. Theory B 86(1): 27-37 (2002) - [j18]Vince Grolmusz, Benny Sudakov:
On k-wise set-intersections and k-wise Hamming-distances. J. Comb. Theory A 99(1): 180-190 (2002) - [j17]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) - [c6]Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov:
Learning a Hidden Matching. FOCS 2002: 197- - 2001
- [j16]Alexander K. Kelmans, Dhruv Mubayi, Benny Sudakov:
Asymptotically Optimal Tree-Packings in Regular Graphs. Electron. J. Comb. 8(1) (2001) - [j15]Michael Krivelevich, Ram Nathaniel, Benny Sudakov:
Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs. J. Algorithms 41(1): 99-113 (2001) - [j14]Benny Sudakov:
Nowhere-Zero Flows in Random Graphs. J. Comb. Theory B 81(2): 209-223 (2001) - [j13]Noga Alon, Benny Sudakov, Ayal Zaks:
Acyclic edge colorings of graphs. J. Graph Theory 37(3): 157-167 (2001) - [j12]Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald:
Random regular graphs of high degree. Random Struct. Algorithms 18(4): 346-363 (2001) - [j11]Noga Alon, Benny Sudakov, Uri Zwick:
Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms. SIAM J. Discret. Math. 15(1): 58-72 (2001) - [c5]Noga Alon, Benny Sudakov, Uri Zwick:
Constructing worst case instances for semidefinite programming based approximation algorithms. SODA 2001: 92-100 - [c4]Michael Krivelevich, Ram Nathaniel, Benny Sudakov:
Approximating coloring and maximum independent sets in 3-uniform hypergraphs. SODA 2001: 327-328 - 2000
- [j10]Noga Alon, Benny Sudakov:
Bipartite Subgraphs And The Smallest Eigenvalue. Comb. Probab. Comput. 9(1): 1-12 (2000)
1990 – 1999
- 1999
- [j9]Noga Alon, Michael Krivelevich, Benny Sudakov:
List Coloring of Random and Pseudo-Random Graphs. Comb. 19(4): 453-472 (1999) - [j8]Noga Alon, Benny Sudakov:
On Two Segmentation Problems. J. Algorithms 33(1): 173-184 (1999) - [j7]Noga Alon, Michael Krivelevich, Benny Sudakov:
Coloring Graphs with Sparse Neighborhoods. J. Comb. Theory B 77(1): 73-82 (1999) - 1998
- [j6]Gregory Z. Gutin, Benny Sudakov, Anders Yeo:
Note on alternating directed cycles. Discret. Math. 191(1-3): 101-107 (1998) - [j5]Michael Krivelevich, Benny Sudakov:
Coloring Random Graphs. Inf. Process. Lett. 67(2): 71-74 (1998) - [j4]Michael Krivelevich, Benny Sudakov:
The chromatic numbers of random hypergraphs. Random Struct. Algorithms 12(4): 381-403 (1998) - [j3]Noga Alon, Michael Krivelevich, Benny Sudakov:
Finding a large hidden clique in a random graph. Random Struct. Algorithms 13(3-4): 457-466 (1998) - [c3]Michael Krivelevich, Benny Sudakov:
Approximate Coloring of Uniform Hypergraphs (Extended Abstract). ESA 1998: 477-489 - [c2]Noga Alon, Michael Krivelevich, Benny Sudakov:
Finding a Large Hidden Clique in a Random Graph. SODA 1998: 594-598 - 1997
- [j2]Benny Sudakov:
A Note on τ-Critical Linear Hypergraphs. Graphs Comb. 13(3): 281-285 (1997) - 1995
- [j1]Noga Alon, Benny Sudakov:
Disjoint Systems. Random Struct. Algorithms 6(1): 13-20 (1995) - 1993
- [c1]Noga Alon, Benny Sudakov:
Disjoint Systems (Extended Abstract). Algebraic Coding 1993: 159-163
Coauthor Index
[j228] [j204] [j202] [j181] [j178] [j169] [j164] [j162] [j156] [j153] [j150] [j149] [j142] [j140] [j139] [j133] [j115] [j114] [j108] [j105] [j101] [j99] [j97] [j95] [j94] [i11] [j87] [j86] [j82] [j78] [j69] [i1] [j66] [j55] [j50] [j42] [j39] [j32] [j30] [j28] [j26] [j25] [j24] [j23] [j22] [j20] [j15] [j12] [c4] [j9] [j7] [j5] [j4] [j3] [c3] [c2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
