| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov |
The size Ramsey number of a directed path.  |
J. Comb. Theory, Ser. B  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov |
Biased orientation games. |
Discrete Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Ferber, Dan Hefetz, Michael Krivelevich |
Fast embedding of spanning trees in biased Maker-Breaker games. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Michael Krivelevich, Po-Shen Loh |
Packing tight Hamilton cycles in 3-uniform hypergraphs. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg |
Hierarchy Theorems for Property Testing. |
Computational Complexity |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Michael Krivelevich, Po-Shen Loh |
Variations on cops and robbers. |
Journal of Graph Theory |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Johannsen, Michael Krivelevich, Wojciech Samotij |
Expanders are universal for the class of all spanning trees. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Dan Hefetz, Asaf Ferber, Michael Krivelevich |
Fast embedding of spanning trees in biased Maker-Breaker games. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó |
Global Maker-Breaker games on sparse graphs. |
Eur. J. Comb. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Simi Haber, Michael Krivelevich |
The Number of f-Matchings in Almost Every Tree is a Zero Residue. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov |
Ramsey games with giants. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald |
Regular induced subgraphs of a random Graph. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov |
Local Resilience and Hamiltonicity Maker-Breaker Games in Random Regular Graphs. |
Combinatorics, Probability & Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov |
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov |
On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich |
Hitting time results for Maker-Breaker games. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Alan M. Frieze, Michael Krivelevich, Po-Shen Loh |
Packing tight Hamilton cycles in 3-uniform hypergraphs. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó |
Avoider-Enforcer: The rules of the game. |
J. Comb. Theory, Ser. A |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Reto Spöhel, Angelika Steger |
Offline thresholds for Ramsey-type games on random graphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Eyal Lubetzky, Benny Sudakov |
Hamiltonicity thresholds in Achlioptas processes. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Dan Hefetz, Michael Krivelevich |
Playing to Retain the Advantage. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich |
Hitting time results for Maker-Breaker games |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Krivelevich |
Embedding Spanning Trees in Random Graphs. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin Cooper, Alan M. Frieze, Michael Krivelevich |
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Choongbum Lee, Benny Sudakov |
Resilient Pancyclicity of Random and Pseudorandom Graphs. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik |
Why Almost All k-Colorable Graphs Are Easy to Color. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Raphael Yuster |
The rainbow connection of a graph is (at most) reciprocal to its minimum degree. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Sonny Ben-Shimon, Michael Krivelevich |
A note on regular Ramsey graphs. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg |
Hierarchy Theorems for Property Testing. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron |
Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó |
Fast winning strategies in Maker-Breaker games. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó |
Avoider-Enforcer: The Rules of the Game. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Hefetz, Noga Alon, Michael Krivelevich |
Playing to retain the advantage. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sonny Ben-Shimon, Michael Krivelevich |
Random regular graphs of non-constant degree: Concentration of the chromatic number. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sonny Ben-Shimon, Michael Krivelevich |
Vertex percolation on expander graphs. |
Eur. J. Comb. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ido Ben-Eliezer, Michael Krivelevich |
Perfectly Balanced Partitions of Smoothed Graphs. |
Electr. J. Comb. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó |
A sharp threshold for the Hamilton cycle Maker-Breaker game. |
Random Struct. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Balázs Patkós |
Equitable coloring of random graphs. |
Random Struct. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Po-Shen Loh, Benny Sudakov |
Avoiding small subgraphs in Achlioptas processes. |
Random Struct. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov, Dan Vilenchik |
On the Random Satisfiable Process. |
Combinatorics, Probability & Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó |
Fast Winning Strategies in Avoider-Enforcer Games. |
Graphs and Combinatorics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Hefetz, Michael Krivelevich, Tibor Szabó |
Hamilton cycles in highly connected and expanding graphs. |
Combinatorica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh |
Spanning Directed Trees with Many Leaves. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik |
On smoothed k-CNF formulas and the Walksat algorithm. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg |
Hierarchy Theorems for Property Testing. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
Monotone Graph Properties, Graph Blow-up, One-Sided vs Two-Sided Error, Adaptivity vs Non-adaptivity, Property Testing, Graph Properties |
| 1 | Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg |
Hierarchy Theorems for Property Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Michael Krivelevich, Tibor Szabó |
Biased Positional Games and Small Hypergraphs with Large Covers. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Alan M. Frieze, Michael Krivelevich |
On Rainbow Trees and Cycles. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Simi Haber, Michael Krivelevich |
Corrigendum: On fractional K-factors of random graphs. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Itai Benjamini, Simi Haber, Michael Krivelevich, Eyal Lubetzky |
The isoperimetric constant of the random graph process. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ohad N. Feldheim, Michael Krivelevich |
Winning Fast in Sparse Graph Construction Games. |
Combinatorics, Probability & Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov, Dan Vilenchik |
On the random satisfiable process |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Sonny Ben-Shimon, Michael Krivelevich |
A note on regular Ramsey graphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh |
Spanning directed trees with many leaves |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron |
Testing Triangle-Freeness in General Graphs. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Michael Krivelevich, Benny Sudakov |
Large Nearly Regular Induced Subgraphs. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó |
Planarity, Colorability, and Minor Games. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron |
Comparing the strength of query types in property testing: the case of testing k-colorability. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Ido Ben-Eliezer, Michael Krivelevich |
Small Sample Spaces Cannot Fool Low Degree Polynomials. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Hefetz, Michael Krivelevich, Tibor Szabó |
Avoider-Enforcer games. |
J. Comb. Theory, Ser. A |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó |
Fast winning strategies in positional games. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern |
Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213]. |
Inf. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Hefetz, Michael Krivelevich, Tibor Szabó |
Bart-Moe games, JumbleG and discrepancy. |
Eur. J. Comb. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Simi Haber, Michael Krivelevich |
On fractional K-factors of random graphs. |
Random Struct. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Michael Krivelevich, Clifford D. Smyth |
On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Yuster, Raphael Yuster |
Approximation algorithms and hardness results for cycle packing problems. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
Cycle packing, edge-disjoint, approximation algorithms, hardness of approximation, integrality gap |
| 1 | Noga Alon, Michael Krivelevich, Benny Sudakov |
Embedding nearly-spanning bounded degree trees. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh |
Better Algorithms and Bounds for Directed Maximum Leaf Problems |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh |
Parameterized Algorithms for Directed Maximum Leaf Problems |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh |
Parameterized Algorithms for Directed Maximum Leaf Problems. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik |
Why Almost All k -Colorable Graphs Are Easy. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh |
Better Algorithms and Bounds for Directed Maximum Leaf Problems. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov |
Preface. |
Eur. J. Comb. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Asaf Nachmias |
Coloring complete bipartite graphs from random lists. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov, Prasad Tetali |
On smoothed analysis in dense graphs and formulas. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich |
On the random 2-stage minimum spanning tree. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Michael Krivelevich |
Almost universal graphs. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nurit Gazit, Michael Krivelevich |
On the asymptotic value of the choice number of complete multi-partite graphs. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Dan Vilenchik |
Solving random satisfiable 3CNF formulas in expected polynomial time. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron |
Testing triangle-freeness in general graphs. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Michael Krivelevich |
On packing Hamilton cycles in ?-regular graphs. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó |
Discrepancy Games. |
Electr. J. Comb. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Alan M. Frieze, Michael Krivelevich, Benny Sudakov |
The Strong Chromatic Index of Random Graphs. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Joel Friedman, Andreas Goerdt, Michael Krivelevich |
Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn |
Bounds on distance distributions in codes of known size. |
IEEE Transactions on Information Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron |
Testing Reed-Muller codes. |
IEEE Transactions on Information Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Zeev Nutov, Raphael Yuster |
Approximation algorithms for cycle packing problems. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich |
On the random 2-stage minimum spanning tree. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Asaf Nachmias |
Colouring powers of cycles from random lists. |
Eur. J. Comb. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Michael Krivelevich, Ryan Martin |
The emergence of a giant component in random subgraphs of pseudo-random graphs. |
Random Struct. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan Martin |
Adding random edges to dense graphs. |
Random Struct. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Gregory Gutin, Michael Krivelevich |
Algorithms with large domination ratio. |
J. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov, Tibor Szabó |
Triangle Factors In Sparse Pseudo-Random Graphs. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C70, 05C80 |
| 1 | Tali Kaufman, Michael Krivelevich, Dana Ron |
Tight Bounds for Testing Bipartiteness in General Graphs. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn |
Generalized hashing and parent-identifying codes. |
J. Comb. Theory, Ser. A |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov |
Maximum cuts and judicious partitions in graphs without short cycles. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald |
On the probability of independent sets in random graphs. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov |
The Largest Eigenvalue Of Sparse Random Graphs. |
Combinatorics, Probability & Computing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Michael Krivelevich, Benny Sudakov |
Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions. |
Combinatorics, Probability & Computing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Krivelevich, Benny Sudakov |
Approximate coloring of uniform hypergraphs. |
J. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")