Deciding k-colorability in expected polynomial timeKRIVELEVICH, Michael.Information processing letters. 2002, Vol 81, Num 1, pp 1-6, issn 0020-0190Article

EMBEDDING SPANNING TREES IN RANDOM GRAPHSKRIVELEVICH, Michael.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 4, pp 1495-1500, issn 0895-4801, 6 p.Article

Random regular graphs of non-constant degree: Concentration of the chromatic numberBEN-SHIMON, Sonny; KRIVELEVICH, Michael.Discrete mathematics. 2009, Vol 309, Num 12, pp 4147-4159, issn 0012-365X, 13 p.Article

Approximating the independence number and the chromatic number in expected polynomial timeKRIVELEVICH, Michael; VU, Van H.Journal of combinatorial optimization. 2002, Vol 6, Num 2, pp 143-155, issn 1382-6905Article

Hamilton cycles in random subgraphs of pseudo-random graphsFRIEZE, Alan; KRIVELEVICH, Michael.Discrete mathematics. 2002, Vol 256, Num 1-2, pp 137-150, issn 0012-365XArticle

Testing k-colorabilityALON, Noga; KRIVELEVICH, Michael.SIAM journal on discrete mathematics (Print). 2002, Vol 15, Num 2, pp 211-227, issn 0895-4801Article

HAMILTON CYCLES IN RANDOM GRAPHS WITH A FIXED DEGREE SEQUENCECOOPER, Colin; FRIEZE, Alan; KRIVELEVICH, Michael et al.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 2, pp 558-569, issn 0895-4801, 12 p.Article

RESILIENT PANCYCLICITY OF RANDOM AND PSEUDORANDOM GRAPHSKRIVELEVICH, Michael; LEE, Choongbum; SUDAKOV, Benny et al.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 1, pp 1-16, issn 0895-4801, 16 p.Article

PLANARITY, COLORABILITY, AND MINOR GAMESHEFETZ, Dan; KRIVELEVICH, Michael; STOJAKOVIC, Milos et al.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 1, pp 194-212, issn 0895-4801, 19 p.Article

LARGE NEARLY REGULAR INDUCED SUBGRAPHSALON, Noga; KRIVELEVICH, Michael; SUDAKOV, Benny et al.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 4, pp 1325-1337, issn 0895-4801, 13 p.Article

The strong chromatic index of random graphsFRIEZE, Alan; KRIVELEVICH, Michael; SUDAKOV, Benny et al.SIAM journal on discrete mathematics (Print). 2006, Vol 19, Num 3, pp 719-727, issn 0895-4801, 9 p.Article

Tight bounds for testing bipartiteness in general graphsKAUFMAN, Tali; KRIVELEVICH, Michael; RON, Dana et al.SIAM journal on computing (Print). 2004, Vol 33, Num 6, pp 1441-1483, issn 0097-5397, 43 p.Article

Regular languages are testable with a constant number of queriesALON, Noga; KRIVELEVICH, Michael; NEWMAN, Ilan et al.SIAM journal on computing (Print). 2001, Vol 30, Num 6, pp 1842-1862, issn 0097-5397Article

Efficient recognition of random unsatisfiable k-SAT instances by spectral methodsGOERDT, Andreas; KRIVELEVICH, Michael.Lecture notes in computer science. 2001, pp 294-304, issn 0302-9743, isbn 3-540-41695-1Conference Paper

Testing reed-muller codesALON, Noga; KAUFMAN, Tali; KRIVELEVICH, Michael et al.IEEE transactions on information theory. 2005, Vol 51, Num 11, pp 4032-4039, issn 0018-9448, 8 p.Article

Bounds on distance distributions in codes of known sizeASHIKHMIN, Alexei E; COHEN, Gérard D; KRIVELEVICH, Michael et al.IEEE transactions on information theory. 2005, Vol 51, Num 1, pp 250-258, issn 0018-9448, 9 p.Article