Michael Krivelevich
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
30
Venues
8
Active years
1998–2026
Best venue rank
A*
Where they publish
Papers
30 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | SODA | On Independent Spanning Trees in Random Graphs. | Nemanja Draganic, Keith Frankston, Michael Krivelevich, Alexey Pokrovskiy, Liana Yepremyan |
| 2026 | SODA | On the edge expansion of random polytopes. | Asaf Ferber, Michael Krivelevich, Marcelo Sales, Wojciech Samotij |
| 2025 | ESA | Reconstructing Random Graphs from Distance Queries. | Michael Krivelevich, Maksim Zhukovskii |
| 2025 | STOC | Disjoint Connected Dominating Sets in Pseudorandom Graphs. | Nemanja Draganic, Michael Krivelevich |
| 2021 | SODA | Rolling backwards can move you forward: on embedding problems in sparse expanders. | Nemanja Draganic, Michael Krivelevich, Rajko Nenadov |
| 2020 | AofA | Greedy Maximal Independent Sets via Local Limits. | Michael Krivelevich, Tams Mszros, Peleg Michaeli, Clara Shikhelman |
| 2020 | SODA | Very fast construction of bounded-degree spanning graphs via the semi-random graph process. | Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich |
| 2018 | AofA | The Genus of the Erds-Rnyi Random Graph and the Fragile Genus Property. | Chris Dowden, Mihyun Kang, Michael Krivelevich |
| 2015 | SODA | Contagious Sets in Expanders. | Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman |
| 2012 | SODA | Expanders are universal for the class of all spanning trees. | Daniel Johannsen, Michael Krivelevich, Wojciech Samotij |
| 2011 | SODA | Hitting time results for Maker-Breaker games. | Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich |
| 2011 | SODA | Packing tight Hamilton cycles in 3-uniform hypergraphs. | Alan M. Frieze, Michael Krivelevich, Po-Shen Loh |
| 2009 | SODA | On smoothed | Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik |
| 2008 | SODA | Comparing the strength of query types in property testing: the case of testing | Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron |
| 2007 | ICALP | Parameterized Algorithms for Directed Maximum Leaf Problems. | Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh |
| 2007 | STACS | Why Almost All | Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik |
| 2006 | SODA | Testing triangle-freeness in general graphs. | Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron |
| 2006 | SODA | Solving random satisfiable 3CNF formulas in expected polynomial time. | Michael Krivelevich, Dan Vilenchik |
| 2005 | SODA | On the random 2-stage minimum spanning tree. | Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich |
| 2005 | SODA | Approximation algorithms for cycle packing problems. | Michael Krivelevich, Zeev Nutov, Raphael Yuster |
| 2004 | ISIT | Bounds on distance distributions in codes of known size. | Alexei Ashikhmin, Grard D. Cohen, Michael Krivelevich, Simon Litsyn |
| 2001 | SODA | Approximating coloring and maximum independent sets in 3-uniform hypergraphs. | Michael Krivelevich, Ram Nathaniel, Benny Sudakov |
| 2001 | STACS | Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods. | Andreas Goerdt, Michael Krivelevich |
| 2000 | ICALP | Two-coloring Random Hypergraphs. | Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali |
| 2000 | ICALP | Scalable Secure Storage when Half the System Is Faulty. | Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern |
| 2000 | ICALP | Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time. | Michael Krivelevich, Van H. Vu |
| 1999 | FOCS | Efficient Testing of Large Graphs. | Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy |
| 1999 | FOCS | Regular Languages Are Testable with a Constant Number of Queries. | Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy |
| 1998 | ESA | Approximate Coloring of Uniform Hypergraphs (Extended Abstract). | Michael Krivelevich, Benny Sudakov |
| 1998 | SODA | Finding a Large Hidden Clique in a Random Graph. | Noga Alon, Michael Krivelevich, Benny Sudakov |