Michael Krivelevich - researchr alias

researchr

You are not signed in
Sign in
Sign up

2009

2008

Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg. Hierarchy Theorems for Property Testing. eccc, 15(097), 2008. [doi]
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 [doi]
Noga Alon, Ido Ben-Eliezer, Michael Krivelevich. Small Sample Spaces Cannot Fool Low Degree Polynomials. approx 2008: 266-275 [doi]
Ohad N. Feldheim, Michael Krivelevich. Winning Fast in Sparse Graph Construction Games. cpc, 17(6):781-791, 2008. [doi]
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron. Testing Triangle-Freeness in General Graphs. siamdm, 22(2):786-819, 2008. [doi]
Simi Haber, Michael Krivelevich. Corrigendum: On fractional K-factors of random graphs. rsa, 33(4):533-535, 2008. [doi]
Itai Benjamini, Simi Haber, Michael Krivelevich, Eyal Lubetzky. The isoperimetric constant of the random graph process. rsa, 32(1):101-114, 2008. [doi]
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó. Planarity, Colorability, and Minor Games. siamdm, 22(1):194-212, 2008. [doi]

2007

Simi Haber, Michael Krivelevich. On fractional ::::K::::-factors of random graphs. rsa, 30(4):441-463, 2007. [doi]
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik. Why Almost All ::::k:::: -Colorable Graphs Are Easy. STACS 2007: 121-132 [doi]
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh. Parameterized Algorithms for Directed Maximum Leaf Problems. icalp 2007: 352-362 [doi]
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó. Fast winning strategies in positional games. endm, 29:213-217, 2007. [doi]
Dan Hefetz, Michael Krivelevich, Tibor Szabó. Avoider-Enforcer games. JCT, 114(5):840-853, 2007. [doi]
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]. iandc, 205(7):1114-1116, 2007. [doi]
Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Yuster, Raphael Yuster. Approximation algorithms and hardness results for cycle packing problems. talg, 3(4), 2007. [doi]
Dan Hefetz, Michael Krivelevich, Tibor Szabó. Bart-Moe games, JumbleG and discrepancy. ejc, 28(4):1131-1143, 2007. [doi]
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh. Better Algorithms and Bounds for Directed Maximum Leaf Problems. fsttcs 2007: 316-327 [doi]
Alan M. Frieze, Michael Krivelevich, Clifford D. Smyth. On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. cpc, 16(5):733-746, 2007. [doi]

2006

Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron. Testing triangle-freeness in general graphs. soda 2006: 279-288 [doi]
Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich. On the random 2-stage minimum spanning tree. rsa, 28(1):24-36, 2006. [doi]
Nurit Gazit, Michael Krivelevich. On the asymptotic value of the choice number of complete multi-partite graphs. jgt, 52(2):123-134, 2006. [doi]
Michael Krivelevich, Benny Sudakov. Preface. ejc, 27(8):1225-1226, 2006. [doi]
Michael Krivelevich, Benny Sudakov, Prasad Tetali. On smoothed analysis in dense graphs and formulas. rsa, 29(2):180-193, 2006. [doi]
Michael Krivelevich, Dan Vilenchik. Solving random satisfiable 3CNF formulas in expected polynomial time. soda 2006: 454-463 [doi]
Michael Krivelevich, Asaf Nachmias. Coloring complete bipartite graphs from random lists. rsa, 29(4):436-449, 2006. [doi]
Alan M. Frieze, Michael Krivelevich. Almost universal graphs. rsa, 28(4):499-510, 2006. [doi]

2005

Joel Friedman, Andreas Goerdt, Michael Krivelevich. Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. siamcomp, 35(2):408-430, 2005. [doi]
Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron. Testing Reed-Muller codes. TIT, 51(11):4032-4039, 2005. [doi]
Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich. On the random 2-stage minimum spanning tree. soda 2005: 919-926 [doi]
Alan M. Frieze, Michael Krivelevich, Benny Sudakov. The Strong Chromatic Index of Random Graphs. siamdm, 19(3):719-727, 2005. [doi]
Alan M. Frieze, Michael Krivelevich. On packing Hamilton cycles in ?-regular graphs. JCT, 94(1):159-172, 2005. [doi]
Michael Krivelevich, Zeev Nutov, Raphael Yuster. Approximation algorithms for cycle packing problems. soda 2005: 556-561 [doi]
Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn. Bounds on distance distributions in codes of known size. TIT, 51(1):250-258, 2005. [doi]
Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó. Discrepancy Games. combinatorics, 12, 2005. [doi]

2004

Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan Martin. Adding random edges to dense graphs. rsa, 24(2):105-117, 2004. [doi]
Noga Alon, Gregory Gutin, Michael Krivelevich. Algorithms with large domination ratio. jal, 50(1):118-131, 2004. [doi]
Alan M. Frieze, Michael Krivelevich, Ryan Martin. The emergence of a giant component in random subgraphs of pseudo-random graphs. rsa, 24(1):42-50, 2004. [doi]
Michael Krivelevich, Benny Sudakov, Tibor Szabó. Triangle Factors In Sparse Pseudo-Random Graphs. combinatorica, 24(3):403-426, 2004. [doi]
Michael Krivelevich, Asaf Nachmias. Colouring powers of cycles from random lists. ejc, 25(7):961-968, 2004. [doi]
Tali Kaufman, Michael Krivelevich, Dana Ron. Tight Bounds for Testing Bipartiteness in General Graphs. siamcomp, 33(6):1441-1483, 2004. [doi]

2003

Tali Kaufman, Michael Krivelevich, Dana Ron. Tight Bounds for Testing Bipartiteness in General Graphs. random 2003: 341-353 [doi]
Michael Krivelevich, Benny Sudakov. The Largest Eigenvalue Of Sparse Random Graphs. cpc, 12(1), 2003.
Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov. Maximum cuts and judicious partitions in graphs without short cycles. JCT, 88(2):329-346, 2003. [doi]
Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn. Generalized hashing and parent-identifying codes. JCT, 104(1):207-215, 2003. [doi]
Michael Krivelevich, Benny Sudakov. Approximate coloring of uniform hypergraphs. jal, 49(1):2-12, 2003. [doi]
Noga Alon, Michael Krivelevich, Benny Sudakov. Tura n Numbers of Bipartite Graphs and Related Ramsey-Type Questions. cpc, 12(5-6):477-494, 2003.
Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald. On the probability of independent sets in random graphs. rsa, 22(1):1-14, 2003. [doi]
Michael Krivelevich, Benny Sudakov, Van H. Vu. Covering codes with improved density. TIT, 49(7):1812-1815, 2003.
Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron. Testing Low-Degree Polynomials over GF(2(. random 2003: 188-199 [doi]

2002

Michael Krivelevich. Deciding k-colorability in expected polynomial time. ipl, 81(1):1-6, 2002. [doi]
Michael Krivelevich, Van H. Vu. Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time. jco, 6(2):143-155, 2002.
Michael Krivelevich, Benny Sudakov, Van H. Vu. A Sharp Threshold For Network Reliability. cpc, 11(5), 2002.
Alan M. Frieze, Michael Krivelevich. Hamilton cycles in random subgraphs of pseudo-random graphs. DM, 256(1-2):137-150, 2002. [doi]
Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali. Two-coloring random hypergraphs. rsa, 20(2):249-259, 2002.
David Burshtein, Michael Krivelevich, Simon Litsyn, Gadi Miller. Upper bounds on the rate of LDPC Codes. TIT, 48(9):2437-2449, 2002.
Ron Aharoni, Ron Holzman, Michael Krivelevich, Roy Meshulam. Fractional Planks. dcg, 27(4):585-602, 2002. [doi]
Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern. Scalable Secure Storage When Half the System Is Faulty. iandc, 174(2):203-213, 2002. [doi]
Michael Krivelevich. Sparse Graphs Usually Have Exponentially Many Optimal Colorings. combinatorics, 9(1), 2002. [doi]

2001

2000

Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali. Two-coloring Random Hypergraphs. icalp 2000: 85-96
Michael Krivelevich. The Choice Number Of Dense Random Graphs. cpc, 9(1), 2000.
Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern. Scalable Secure Storage when Half the System Is Faulty. icalp 2000: 576-587 [doi]
Michael Krivelevich, Van H. Vu. Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time. icalp 2000: 13-24 [doi]
Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy. Efficient Testing of Large Graphs. combinatorica, 20(4):451-476, 2000. [doi]
Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy. Regular Languages are Testable with a Constant Number of Queries. siamcomp, 30(6):1842-1862, 2000. [doi]
Ehud Friedgut, Michael Krivelevich. Sharp thresholds for certain Ramsey properties of random graphs. rsa, 17(1):1-19, 2000.

1999

1998

Michael Krivelevich, Benny Sudakov. Coloring Random Graphs. ipl, 67(2):71-74, 1998. [doi]
Michael Krivelevich. An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs. combinatorics, 5, 1998. [doi]
Michael Krivelevich, Benny Sudakov. The chromatic numbers of random hypergraphs. rsa, 12(4):381-403, 1998.
Noga Alon, Michael Krivelevich, Benny Sudakov. Finding a Large Hidden Clique in a Random Graph. soda 1998: 594-598
Michael Krivelevich, Benny Sudakov. Approximate Coloring of Uniform Hypergraphs (Extended Abstract). esa 1998: 477-489 [doi]
Noga Alon, Michael Krivelevich, Benny Sudakov. Finding a large hidden clique in a random graph. rsa, 13(3-4):457-466, 1998.
Michael Krivelevich. A lower bound for irredundant Ramsey numbers. DM, 183(1-3):185-192, 1998. [doi]

1997

Noga Alon, Michael Krivelevich. The Concentration of the Chromatic Number of Random Graphs. combinatorica, 17(3):303-313, 1997.
Michael Krivelevich. Approximate Set Covering in Uniform Hypergraphs. jal, 25(1):118-143, 1997.
Michael Krivelevich. Triangle Factors in Random Graphs. cpc, 6(3):337-347, 1997.
Michael Krivelevich. Almost perfect matchings in random uniform hypergraphs. DM, 170(1-3):259-263, 1997. [doi]
Michael Krivelevich. On the Minimal Number of Edges in Color-Critical Graphs. combinatorica, 17(3):401-426, 1997.

1996

Ron Aharoni, Ron Holzman, Michael Krivelevich. On a Theorem of Lovász on Covers in tau-Partite Hypergraphs. combinatorica, 16(2):149-174, 1996.
Michael Krivelevich. Perfect fractional matchings in random hypergraphs. rsa, 9(3):317-334, 1996.

1995

Michael Krivelevich. Bounding Ramsey Numbers through Large Deviation Inequalities. rsa, 7(2):145-156, 1995.
Michael Krivelevich. On the Edge Distribution in Triangle-free Graphs. JCT, 63(2):245-260, 1995. [doi]
Michael Krivelevich. On a conjecture of Tuza about packing and covering of triangles. DM, 142(1-3):281-286, 1995. [doi]

1994

Michael Krivelevich. K::s::-Free Graphs Without Large K::r::-Free Subgraphs. cpc, 3:349-354, 1994.