default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenny Sudakov
- > Home > Persons > Benny Sudakov
Publications
- 2023
[j228]Noga Alon, Michael Krivelevich
, Benny Sudakov:
Complete minors and average degree: A short proof. J. Graph Theory 103(3): 599-602 (2023)- 2017
- [j160]Noga Alon, Klim Efremenko, Benny Sudakov:
Testing Equality in Communication Graphs. IEEE Trans. Inf. Theory 63(11): 7569-7574 (2017) - 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
- [j134]Noga Alon, Shagnik Das, Roman Glebov, Benny Sudakov:
Comparable pairs in families of sets. J. Comb. Theory B 115: 164-185 (2015) - [i14]Noga Alon, Humberto Naves, Benny Sudakov:
On the maximum quartet distance between phylogenetic trees. CoRR abs/1505.04344 (2015) - 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) - [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) - [c12]Noga Alon, Ankur Moitra, Benny Sudakov:
Nearly complete graphs decomposable into large induced matchings and their applications. STOC 2012: 1079-1090 - 2011
- [i6]Noga Alon, Ankur Moitra, Benny Sudakov:
Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications. CoRR abs/1111.0253 (2011) - 2008
- [j69]Noga Alon, Michael Krivelevich, Benny Sudakov:
Large Nearly Regular Induced Subgraphs. SIAM J. Discret. Math. 22(4): 1325-1337 (2008) - 2007
- [j66]Noga Alon, Michael Krivelevich, Benny Sudakov:
Embedding nearly-spanning bounded degree trees. Comb. 27(6): 629-644 (2007) - [j59]Noga Alon, Benny Sudakov:
On graphs with subgraphs having large independence numbers. J. Graph Theory 56(2): 149-157 (2007) - 2006
- [j57]Noga Alon, Benny Sudakov:
H-Free Graphs of Large Minimum Degree. Electron. J. Comb. 13(1) (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) - [c9]Noga Alon, Asaf Shapira, Benny Sudakov:
Additive Approximation for Edge-Deletion Problems (Abstract). ICALP (1) 2006: 1-2 - 2005
- [c8]Noga Alon, Asaf Shapira, Benny Sudakov:
Additive Approximation for Edge-Deletion Problems. FOCS 2005: 419-428 - 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
- [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) - [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) - [j24]Noga Alon, Michael Krivelevich, Benny Sudakov:
Induced subgraphs of prescribed size. J. Graph Theory 43(4): 239-251 (2003) - 2002
- [c6]Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, Benny Sudakov:
Learning a Hidden Matching. FOCS 2002: 197- - 2001
- [j13]Noga Alon, Benny Sudakov, Ayal Zaks:
Acyclic edge colorings of graphs. J. Graph Theory 37(3): 157-167 (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 - 2000
- [j10]Noga Alon, Benny Sudakov:
Bipartite Subgraphs And The Smallest Eigenvalue. Comb. Probab. Comput. 9(1): 1-12 (2000) - 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
- [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) - [c2]Noga Alon, Michael Krivelevich, Benny Sudakov:
Finding a Large Hidden Clique in a Random Graph. SODA 1998: 594-598 - 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
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-09-18 01:09 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:
