- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j126 |      | Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron: Comparing the strength of query types in property testing: The case of k-colorability. Computational Complexity 22(1): 89-135 (2013) |
| j125 | | Daniel Johannsen, Michael Krivelevich, Wojciech Samotij: Expanders Are Universal for the Class of All Spanning Trees. Combinatorics, Probability & Computing 22(2): 253-281 (2013) |
| j124 | | Roman Glebov, Michael Krivelevich: On the Number of Hamilton Cycles in Sparse Random Graphs. SIAM J. Discrete Math. 27(1): 27-42 (2013) |
| 2012 | ||
| j123 | | Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg: Hierarchy Theorems for Property Testing. Computational Complexity 21(1): 129-192 (2012) |
| j122 | | Dennis Clemens, Asaf Ferber, Michael Krivelevich, Anita Liebenau: Fast Strategies In Maker-Breaker Games Played on Random Boards. Combinatorics, Probability & Computing 21(6): 897-915 (2012) |
| j121 | | Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov: Biased orientation games. Discrete Mathematics 312(10): 1732-1742 (2012) |
| j120 | | Asaf Ferber, Dan Hefetz, Michael Krivelevich: Fast embedding of spanning trees in biased Maker-Breaker games. Eur. J. Comb. 33(6): 1086-1099 (2012) |
| j119 | | Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov: The size Ramsey number of a directed path. J. Comb. Theory, Ser. B 102(3): 743-755 (2012) |
| j118 | | Alan M. Frieze, Michael Krivelevich, Po-Shen Loh: Variations on cops and robbers. Journal of Graph Theory 69(4): 383-402 (2012) |
| j117 | | Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov: Long cycles in subgraphs of (pseudo)random directed graphs. Journal of Graph Theory 70(3): 284-296 (2012) |
| j116 | | Alan M. Frieze, Michael Krivelevich, Po-Shen Loh: Packing tight Hamilton cycles in 3-uniform hypergraphs. Random Struct. Algorithms 40(3): 269-300 (2012) |
| j115 | | Alan M. Frieze, Michael Krivelevich: Packing hamilton cycles in random and pseudo-random hypergraphs. Random Struct. Algorithms 41(1): 1-22 (2012) |
| j114 | | Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich: Hitting time results for Maker-Breaker games. Random Struct. Algorithms 41(1): 23-46 (2012) |
| j113 | | Dan Hefetz, Michael Krivelevich, Tibor Szabó: Sharp threshold for the appearance of certain spanning trees in random graphs. Random Struct. Algorithms 41(4): 391-412 (2012) |
| j112 | | Michael Krivelevich, Reto Spöhel: Creating Small Subgraphs in Achlioptas Processes With Growing Parameter. SIAM J. Discrete Math. 26(2): 670-686 (2012) |
| j111 | | Michael Krivelevich, Wojciech Samotij: Optimal Packings of Hamilton Cycles in Sparse Random Graphs. SIAM J. Discrete Math. 26(3): 964-982 (2012) |
| c28 | | Daniel Johannsen, Michael Krivelevich, Wojciech Samotij: Expanders are universal for the class of all spanning trees. SODA 2012: 1539-1551 |
| 2011 | ||
| j110 | | Noga Alon, Simi Haber, Michael Krivelevich: The Number of f-Matchings in Almost Every Tree is a Zero Residue. Electr. J. Comb. 18(1) (2011) |
| j109 | | Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov: Local Resilience and Hamiltonicity Maker-Breaker Games in Random Regular Graphs. Combinatorics, Probability & Computing 20(2): 173-211 (2011) |
| j108 | | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Global Maker-Breaker games on sparse graphs. Eur. J. Comb. 32(2): 162-177 (2011) |
| j107 | | Dan Hefetz, Asaf Ferber, Michael Krivelevich: Fast embedding of spanning trees in biased Maker-Breaker games. Electronic Notes in Discrete Mathematics 38: 331-336 (2011) |
| j106 | | 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) |
| j105 | | Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald: Regular induced subgraphs of a random Graph. Random Struct. Algorithms 38(3): 235-250 (2011) |
| j104 | | 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. 25(3): 1176-1193 (2011) |
| c27 | | Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich: Hitting time results for Maker-Breaker games. SODA 2011: 900-912 |
| c26 | | Alan M. Frieze, Michael Krivelevich, Po-Shen Loh: Packing tight Hamilton cycles in 3-uniform hypergraphs. SODA 2011: 913-932 |
| i8 | | 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) |
| 2010 | ||
| j103 | | Noga Alon, Dan Hefetz, Michael Krivelevich: Playing to Retain the Advantage. Combinatorics, Probability & Computing 19(4): 481-491 (2010) |
| j102 | | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Avoider-Enforcer: The rules of the game. J. Comb. Theory, Ser. A 117(2): 152-163 (2010) |
| j101 | | Michael Krivelevich, Raphael Yuster: The rainbow connection of a graph is (at most) reciprocal to its minimum degree. Journal of Graph Theory 63(3): 185-191 (2010) |
| j100 | | Noga Alon, Sonny Ben-Shimon, Michael Krivelevich: A note on regular Ramsey graphs. Journal of Graph Theory 64(3): 244-249 (2010) |
| j99 | | Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik: Why Almost All k-Colorable Graphs Are Easy to Color. Theory Comput. Syst. 46(3): 523-565 (2010) |
| j98 | | Michael Krivelevich, Reto Spöhel, Angelika Steger: Offline thresholds for Ramsey-type games on random graphs. Random Struct. Algorithms 36(1): 57-79 (2010) |
| j97 | | Michael Krivelevich, Eyal Lubetzky, Benny Sudakov: Hamiltonicity thresholds in Achlioptas processes. Random Struct. Algorithms 37(1): 1-24 (2010) |
| j96 | | Michael Krivelevich, Choongbum Lee, Benny Sudakov: Resilient Pancyclicity of Random and Pseudorandom Graphs. SIAM J. Discrete Math. 24(1): 1-16 (2010) |
| j95 | | Colin Cooper, Alan M. Frieze, Michael Krivelevich: Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. SIAM J. Discrete Math. 24(2): 558-569 (2010) |
| j94 | | Michael Krivelevich: Embedding Spanning Trees in Random Graphs. SIAM J. Discrete Math. 24(4): 1495-1500 (2010) |
| c25 | | 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: 253-259 |
| c24 | | Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg: Hierarchy Theorems for Property Testing. Property Testing 2010: 289-294 |
| i7 | | Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich: Hitting time results for Maker-Breaker games. CoRR abs/1008.1865 (2010) |
| 2009 | ||
| j93 | | Dan Hefetz, Michael Krivelevich, Tibor Szabó: Hamilton cycles in highly connected and expanding graphs. Combinatorica 29(5): 547-568 (2009) |
| j92 | | Ido Ben-Eliezer, Michael Krivelevich: Perfectly Balanced Partitions of Smoothed Graphs. Electr. J. Comb. 16(1) (2009) |
| j91 | | Michael Krivelevich, Benny Sudakov, Dan Vilenchik: On the Random Satisfiable Process. Combinatorics, Probability & Computing 18(5): 775-801 (2009) |
| j90 | | Sonny Ben-Shimon, Michael Krivelevich: Random regular graphs of non-constant degree: Concentration of the chromatic number. Discrete Mathematics 309(12): 4149-4161 (2009) |
| j89 | | Sonny Ben-Shimon, Michael Krivelevich: Vertex percolation on expander graphs. Eur. J. Comb. 30(2): 339-350 (2009) |
| j88 | | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Avoider-Enforcer: The Rules of the Game. Electronic Notes in Discrete Mathematics 34: 261-265 (2009) |
| j87 | | Dan Hefetz, Noga Alon, Michael Krivelevich: Playing to retain the advantage. Electronic Notes in Discrete Mathematics 34: 423-427 (2009) |
| j86 | | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Fast Winning Strategies in Avoider-Enforcer Games. Graphs and Combinatorics 25(4): 533-544 (2009) |
| j85 | | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Fast winning strategies in Maker-Breaker games. J. Comb. Theory, Ser. B 99(1): 39-47 (2009) |
| j84 | | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: A sharp threshold for the Hamilton cycle Maker-Breaker game. Random Struct. Algorithms 34(1): 112-122 (2009) |
| j83 | | Michael Krivelevich, Po-Shen Loh, Benny Sudakov: Avoiding small subgraphs in Achlioptas processes. Random Struct. Algorithms 34(1): 165-195 (2009) |
| j82 | | Michael Krivelevich, Balázs Patkós: Equitable coloring of random graphs. Random Struct. Algorithms 35(1): 83-99 (2009) |
| j81 | | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Spanning Directed Trees with Many Leaves. SIAM J. Discrete Math. 23(1): 466-476 (2009) |
| c23 | | Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg: Hierarchy Theorems for Property Testing. APPROX-RANDOM 2009: 504-519 |
| c22 | | Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik: On smoothed k-CNF formulas and the Walksat algorithm. SODA 2009: 451-460 |
| 2008 | ||
| j80 | | |
| j79 | | Michael Krivelevich, Tibor Szabó: Biased Positional Games and Small Hypergraphs with Large Covers. Electr. J. Comb. 15(1) (2008) |
| j78 | | Ohad N. Feldheim, Michael Krivelevich: Winning Fast in Sparse Graph Construction Games. Combinatorics, Probability & Computing 17(6): 781-791 (2008) |
| j77 | | Itai Benjamini, Simi Haber, Michael Krivelevich, Eyal Lubetzky: The isoperimetric constant of the random graph process. Random Struct. Algorithms 32(1): 101-114 (2008) |
| j76 | | Simi Haber, Michael Krivelevich: Corrigendum: On fractional K-factors of random graphs. Random Struct. Algorithms 33(4): 533-535 (2008) |
| j75 | | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Planarity, Colorability, and Minor Games. SIAM J. Discrete Math. 22(1): 194-212 (2008) |
| j74 | | Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron: Testing Triangle-Freeness in General Graphs. SIAM J. Discrete Math. 22(2): 786-819 (2008) |
| j73 | | Noga Alon, Michael Krivelevich, Benny Sudakov: Large Nearly Regular Induced Subgraphs. SIAM J. Discrete Math. 22(4): 1325-1337 (2008) |
| c21 | | Noga Alon, Ido Ben-Eliezer, Michael Krivelevich: Small Sample Spaces Cannot Fool Low Degree Polynomials. APPROX-RANDOM 2008: 266-275 |
| c20 | | 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: 1213-1222 |
| i6 | | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Spanning directed trees with many leaves. CoRR abs/0803.0701 (2008) |
| i5 | | Michael Krivelevich, Benny Sudakov, Dan Vilenchik: On the random satisfiable process. CoRR abs/0807.4326 (2008) |
| i4 | | Noga Alon, Sonny Ben-Shimon, Michael Krivelevich: A note on regular Ramsey graphs. CoRR abs/0812.2386 (2008) |
| i3 | | Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg: Hierarchy Theorems for Property Testing. Electronic Colloquium on Computational Complexity (ECCC) 15(097) (2008) |
| 2007 | ||
| j72 | | Noga Alon, Michael Krivelevich, Benny Sudakov: Embedding nearly-spanning bounded degree trees. Combinatorica 27(6): 629-644 (2007) |
| j71 | | Alan M. Frieze, Michael Krivelevich, Clifford D. Smyth: On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. Combinatorics, Probability & Computing 16(5): 733-746 (2007) |
| j70 | | Dan Hefetz, Michael Krivelevich, Tibor Szabó: Bart-Moe games, JumbleG and discrepancy. Eur. J. Comb. 28(4): 1131-1143 (2007) |
| j69 | | Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó: Fast winning strategies in positional games. Electronic Notes in Discrete Mathematics 29: 213-217 (2007) |
| j68 | | 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. 205(7): 1114-1116 (2007) |
| j67 | | Dan Hefetz, Michael Krivelevich, Tibor Szabó: Avoider-Enforcer games. J. Comb. Theory, Ser. A 114(5): 840-853 (2007) |
| j66 | | Simi Haber, Michael Krivelevich: On fractional K-factors of random graphs. Random Struct. Algorithms 30(4): 441-463 (2007) |
| j65 | | Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Yuster, Raphael Yuster: Approximation algorithms and hardness results for cycle packing problems. ACM Transactions on Algorithms 3(4) (2007) |
| c19 | | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS 2007: 316-327 |
| c18 | | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP 2007: 352-362 |
| c17 | | Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik: Why Almost All k -Colorable Graphs Are Easy. STACS 2007: 121-132 |
| i2 | | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Better Algorithms and Bounds for Directed Maximum Leaf Problems. CoRR abs/0707.1095 (2007) |
| i1 | | Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh: Parameterized Algorithms for Directed Maximum Leaf Problems. CoRR abs/cs/0702049 (2007) |
| 2006 | ||
| j64 | | |
| j63 | | Nurit Gazit, Michael Krivelevich: On the asymptotic value of the choice number of complete multi-partite graphs. Journal of Graph Theory 52(2): 123-134 (2006) |
| j62 | | Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich: On the random 2-stage minimum spanning tree. Random Struct. Algorithms 28(1): 24-36 (2006) |
| j61 | | Alan M. Frieze, Michael Krivelevich: Almost universal graphs. Random Struct. Algorithms 28(4): 499-510 (2006) |
| j60 | | Michael Krivelevich, Benny Sudakov, Prasad Tetali: On smoothed analysis in dense graphs and formulas. Random Struct. Algorithms 29(2): 180-193 (2006) |
| j59 | | Michael Krivelevich, Asaf Nachmias: Coloring complete bipartite graphs from random lists. Random Struct. Algorithms 29(4): 436-449 (2006) |
| c16 | | Michael Krivelevich, Dan Vilenchik: Semirandom Models as Benchmarks for Coloring Algorithms. ANALCO 2006: 211-221 |
| c15 | | Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron: Testing triangle-freeness in general graphs. SODA 2006: 279-288 |
| c14 | | Michael Krivelevich, Dan Vilenchik: Solving random satisfiable 3CNF formulas in expected polynomial time. SODA 2006: 454-463 |
| 2005 | ||
| j58 | | Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó: Discrepancy Games. Electr. J. Comb. 12 (2005) |
| j57 | | Alan M. Frieze, Michael Krivelevich: On packing Hamilton cycles in ?-regular graphs. J. Comb. Theory, Ser. B 94(1): 159-172 (2005) |
| j56 | | Joel Friedman, Andreas Goerdt, Michael Krivelevich: Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. SIAM J. Comput. 35(2): 408-430 (2005) |
| j55 | | Alan M. Frieze, Michael Krivelevich, Benny Sudakov: The Strong Chromatic Index of Random Graphs. SIAM J. Discrete Math. 19(3): 719-727 (2005) |
| j54 | | 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 51(1): 250-258 (2005) |
| j53 | | Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron: Testing Reed-Muller codes. IEEE Transactions on Information Theory 51(11): 4032-4039 (2005) |
| c13 | | Michael Krivelevich, Zeev Nutov, Raphael Yuster: Approximation algorithms for cycle packing problems. SODA 2005: 556-561 |
| c12 | | Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich: On the random 2-stage minimum spanning tree. SODA 2005: 919-926 |
| 2004 | ||
| j52 | | Michael Krivelevich, Benny Sudakov, Tibor Szabó: Triangle Factors In Sparse Pseudo-Random Graphs. Combinatorica 24(3): 403-426 (2004) |
| j51 | | Michael Krivelevich, Asaf Nachmias: Colouring powers of cycles from random lists. Eur. J. Comb. 25(7): 961-968 (2004) |
| j50 | | Noga Alon, Gregory Gutin, Michael Krivelevich: Algorithms with large domination ratio. J. Algorithms 50(1): 118-131 (2004) |
| j49 | | Alan M. Frieze, Michael Krivelevich, Ryan Martin: The emergence of a giant component in random subgraphs of pseudo-random graphs. Random Struct. Algorithms 24(1): 42-50 (2004) |
| j48 | | Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan Martin: Adding random edges to dense graphs. Random Struct. Algorithms 24(2): 105-117 (2004) |
| j47 | | Tali Kaufman, Michael Krivelevich, Dana Ron: Tight Bounds for Testing Bipartiteness in General Graphs. SIAM J. Comput. 33(6): 1441-1483 (2004) |
| 2003 | ||
| j46 | | Michael Krivelevich, Benny Sudakov: The Largest Eigenvalue Of Sparse Random Graphs. Combinatorics, Probability & Computing 12(1): 61-72 (2003) |
| j45 | | Noga Alon, Michael Krivelevich, Benny Sudakov: Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions. Combinatorics, Probability & Computing 12(5-6): 477-494 (2003) |
| j44 | | Michael Krivelevich, Benny Sudakov: Approximate coloring of uniform hypergraphs. J. Algorithms 49(1): 2-12 (2003) |
| j43 | | 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 88(2): 329-346 (2003) |
| j42 | | Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn: Generalized hashing and parent-identifying codes. J. Comb. Theory, Ser. A 104(1): 207-215 (2003) |
| j41 | | Michael Krivelevich, Benny Sudakov: Sparse pseudo-random graphs are Hamiltonian. Journal of Graph Theory 42(1): 17-33 (2003) |
| j40 | | Noga Alon, Michael Krivelevich, Benny Sudakov: Induced subgraphs of prescribed size. Journal of Graph Theory 43(4): 239-251 (2003) |
| j39 | | 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) |
| j38 | | Michael Krivelevich, Benny Sudakov, Van H. Vu: Covering codes with improved density. IEEE Transactions on Information Theory 49(7): 1812-1815 (2003) |
| c11 | | Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron: Testing Low-Degree Polynomials over GF(2(. RANDOM-APPROX 2003: 188-199 |
| c10 | | Tali Kaufman, Michael Krivelevich, Dana Ron: Tight Bounds for Testing Bipartiteness in General Graphs. RANDOM-APPROX 2003: 341-353 |
| 2002 | ||
| j37 | | Michael Krivelevich: Sparse Graphs Usually Have Exponentially Many Optimal Colorings. Electr. J. Comb. 9(1) (2002) |
| j36 | | Michael Krivelevich, Benny Sudakov, Van H. Vu: A Sharp Threshold For Network Reliability. Combinatorics, Probability & Computing 11(5): 465-474 (2002) |
| j35 | | Ron Aharoni, Ron Holzman, Michael Krivelevich, Roy Meshulam: Fractional Planks. Discrete & Computational Geometry 27(4): 585-602 (2002) |
| j34 | | Alan M. Frieze, Michael Krivelevich: Hamilton cycles in random subgraphs of pseudo-random graphs. Discrete Mathematics 256(1-2): 137-150 (2002) |
| j33 | | Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern: Scalable Secure Storage When Half the System Is Faulty. Inf. Comput. 174(2): 203-213 (2002) |
| j32 | | Michael Krivelevich: Deciding k-colorability in expected polynomial time. Inf. Process. Lett. 81(1): 1-6 (2002) |
| j31 | | Michael Krivelevich, Van H. Vu: Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time. J. Comb. Optim. 6(2): 143-155 (2002) |
| j30 | | Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali: Two-coloring random hypergraphs. Random Struct. Algorithms 20(2): 249-259 (2002) |
| j29 | | Noga Alon, Michael Krivelevich: Testing k-colorability. SIAM J. Discrete Math. 15(2): 211-227 (2002) |
| j28 | | David Burshtein, Michael Krivelevich, Simon Litsyn, Gadi Miller: Upper bounds on the rate of LDPC Codes. IEEE Transactions on Information Theory 48(9): 2437-2449 (2002) |
| 2001 | ||
| j27 | | Michael Krivelevich, Ram Nathaniel, Benny Sudakov: Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs. J. Algorithms 41(1): 99-113 (2001) |
| j26 | | Michael Krivelevich, Van H. Vu: Choosability in Random Hypergraphs. J. Comb. Theory, Ser. B 83(2): 241-257 (2001) |
| j25 | | Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald: Random regular graphs of high degree. Random Struct. Algorithms 18(4): 346-363 (2001) |
| c9 | | Michael Krivelevich, Ram Nathaniel, Benny Sudakov: Approximating coloring and maximum independent sets in 3-uniform hypergraphs. SODA 2001: 327-328 |
| c8 | | Andreas Goerdt, Michael Krivelevich: Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods. STACS 2001: 294-304 |
| 2000 | ||
| j24 | | Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy: Efficient Testing of Large Graphs. Combinatorica 20(4): 451-476 (2000) |
| j23 | | Michael Krivelevich: The Choice Number Of Dense Random Graphs. Combinatorics, Probability & Computing 9(1): 19-26 (2000) |
| j22 | | Noga Alon, Michael Krivelevich, Paul D. Seymour: Long cycles in critical graphs. Journal of Graph Theory 35(3): 193-196 (2000) |
| j21 | | Ehud Friedgut, Michael Krivelevich: Sharp thresholds for certain Ramsey properties of random graphs. Random Struct. Algorithms 17(1): 1-19 (2000) |
| j20 | | Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy: Regular Languages are Testable with a Constant Number of Queries. SIAM J. Comput. 30(6): 1842-1862 (2000) |
| c7 | | Michael Krivelevich, Van H. Vu: Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time. ICALP 2000: 13-24 |
| c6 |  | Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali: Two-coloring Random Hypergraphs. ICALP Satellite Workshops 2000: 85-96 |
| c5 | | Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern: Scalable Secure Storage when Half the System Is Faulty. ICALP 2000: 576-587 |
| 1999 | ||
| j19 | | Noga Alon, Michael Krivelevich, Benny Sudakov: List Coloring of Random and Pseudo-Random Graphs. Combinatorica 19(4): 453-472 (1999) |
| j18 | | Noga Alon, Michael Krivelevich, Benny Sudakov: Coloring Graphs with Sparse Neighborhoods. J. Comb. Theory, Ser. B 77(1): 73-82 (1999) |
| c4 | | Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy: Regular Languages Are Testable with a Constant Number of Queries. FOCS 1999: 645-655 |
| c3 | | Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy: Efficient Testing of Large Graphs. FOCS 1999: 656-666 |
| 1998 | ||
| j17 | | Michael Krivelevich: An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs. Electr. J. Comb. 5 (1998) |
| j16 | | Michael Krivelevich: A lower bound for irredundant Ramsey numbers. Discrete Mathematics 183(1-3): 185-192 (1998) |
| j15 | | |
| j14 | | Michael Krivelevich, Benny Sudakov: The chromatic numbers of random hypergraphs. Random Struct. Algorithms 12(4): 381-403 (1998) |
| j13 | | 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 | | Michael Krivelevich, Benny Sudakov: Approximate Coloring of Uniform Hypergraphs (Extended Abstract). ESA 1998: 477-489 |
| c1 | | Noga Alon, Michael Krivelevich, Benny Sudakov: Finding a Large Hidden Clique in a Random Graph. SODA 1998: 594-598 |
| 1997 | ||
| j12 | | Noga Alon, Michael Krivelevich: The Concentration of the Chromatic Number of Random Graphs. Combinatorica 17(3): 303-313 (1997) |
| j11 | | Michael Krivelevich: On the Minimal Number of Edges in Color-Critical Graphs. Combinatorica 17(3): 401-426 (1997) |
| j10 | | Michael Krivelevich: Triangle Factors in Random Graphs. Combinatorics, Probability & Computing 6(3): 337-347 (1997) |
| j9 | | Michael Krivelevich: Almost perfect matchings in random uniform hypergraphs. Discrete Mathematics 170(1-3): 259-263 (1997) |
| j8 | | Michael Krivelevich: Approximate Set Covering in Uniform Hypergraphs. J. Algorithms 25(1): 118-143 (1997) |
| 1996 | ||
| j7 | | Ron Aharoni, Ron Holzman, Michael Krivelevich: On a Theorem of Lovász on Covers in tau-Partite Hypergraphs. Combinatorica 16(2): 149-174 (1996) |
| j6 | | Noga Alon, Paul Erdös, Ron Holzman, Michael Krivelevich: On k-saturated graphs with restrictions on the degrees. Journal of Graph Theory 23(1): 1-20 (1996) |
| j5 | | Michael Krivelevich: Perfect fractional matchings in random hypergraphs. Random Struct. Algorithms 9(3): 317-334 (1996) |
| 1995 | ||
| j4 | | Michael Krivelevich: On a conjecture of Tuza about packing and covering of triangles. Discrete Mathematics 142(1-3): 281-286 (1995) |
| j3 | | Michael Krivelevich: On the Edge Distribution in Triangle-free Graphs. J. Comb. Theory, Ser. B 63(2): 245-260 (1995) |
| j2 | | Michael Krivelevich: Bounding Ramsey Numbers through Large Deviation Inequalities. Random Struct. Algorithms 7(2): 145-156 (1995) |
| 1994 | ||
| j1 | | Michael Krivelevich: Ks-Free Graphs Without Large Kr-Free Subgraphs. Combinatorics, Probability & Computing 3: 349-354 (1994) |
Data released under the ODC-BY 1.0 license — See also our legal information page