Michael Krivelevich

272 papers A* 22A 4B 1C 2Journal 231Unranked 9
YearRankTypeTitle / Venue / Authors
2026 J jnl
Large Matchings and nearly Spanning, nearly Regular Subgraphs of Random Subgraphs.
Electron. J. Comb.
Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich
2026 A* conf
On Independent Spanning Trees in Random Graphs.
SODA
Nemanja Draganic, Keith Frankston, Michael Krivelevich, Alexey Pokrovskiy, Liana Yepremyan
2026 A* conf
On the edge expansion of random polytopes.
SODA
Asaf Ferber, Michael Krivelevich, Marcelo Sales, Wojciech Samotij
2025 J jnl
Colouring random subgraphs.
Comb. Probab. Comput.
Boris Bukh, Michael Krivelevich, Bhargav Narayanan
2025 A* conf
Disjoint Connected Dominating Sets in Pseudorandom Graphs.
STOC
Nemanja Draganic, Michael Krivelevich
2025 J jnl
Long Cycles in Percolated Expanders.
Electron. J. Comb.
Maurício Collares, Sahar Diskin, Joshua Erde, Michael Krivelevich
2025 J jnl
Minors, connectivity, and diameter in randomly perturbed sparse graphs.
Eur. J. Comb.
Elad Aigner-Horev, Dan Hefetz, Michael Krivelevich
2025 J jnl
On the edge expansion of random polytopes.
CoRR
Asaf Ferber, Michael Krivelevich, Marcelo Sales, Wojciech Samotij
2025 J jnl
Percolation on High-Dimensional Product Graphs.
Random Struct. Algorithms
Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich
2025 A conf
Reconstructing Random Graphs from Distance Queries.
ESA
Michael Krivelevich, Maksim Zhukovskii
2025 J jnl
Rigid partitions: From high connectivity to random graphs.
J. Comb. Theory B
Michael Krivelevich, Alan Lew, Peleg Michaeli
2025 J jnl
Sparse Pancyclic Subgraphs of Random Graphs.
SIAM J. Discret. Math.
Yahav Alon, Michael Krivelevich
2024 J jnl
Expansion in supercritical random subgraphs of expanders and its consequences.
Random Struct. Algorithms
Sahar Diskin, Michael Krivelevich
2024 J jnl
Greedy maximal independent sets via local limits.
Random Struct. Algorithms
Michael Krivelevich, Tamás Mészáros, Peleg Michaeli, Clara Shikhelman
2024 J jnl
Hamilton completion and the path cover number of sparse random graphs.
Eur. J. Comb.
Yahav Alon, Michael Krivelevich
2024 J jnl
Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs.
Comb.
Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich
2024 J jnl
Maximum chordal subgraphs of random graphs.
Comb. Probab. Comput.
Michael Krivelevich, Maksim Zhukovskii
2024 J jnl
On vertex Ramsey graphs with forbidden subgraphs.
Discret. Math.
Sahar Diskin, Ilay Hoshen, Michael Krivelevich, Maksim Zhukovskii
2024 J jnl
Percolation on irregular high-dimensional product graphs.
Comb. Probab. Comput.
Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich
2023 J jnl
Complete minors and average degree: A short proof.
J. Graph Theory
Noga Alon, Michael Krivelevich, Benny Sudakov
2023 J jnl
Cycle lengths in randomly perturbed graphs.
Random Struct. Algorithms
Elad Aigner-Horev, Dan Hefetz, Michael Krivelevich
2023 J jnl
Largest subgraph from a hereditary property in a random graph.
Discret. Math.
Noga Alon, Michael Krivelevich, Wojciech Samotij
2023 J jnl
On subgraphs with degrees of prescribed residues in the random graph.
Random Struct. Algorithms
Asaf Ferber, Liam Hardiman, Michael Krivelevich
2023 J jnl
Oriented discrepancy of Hamilton cycles.
J. Graph Theory
Lior Gishboliner, Michael Krivelevich, Peleg Michaeli
2023 J jnl
Robin Thomas (1962-2020).
J. Comb. Theory B
Michael Krivelevich, Bojan Mohar
2023 J jnl
Site percolation on pseudo-random graphs.
Random Struct. Algorithms
Sahar Diskin, Michael Krivelevich
2023 J jnl
Supercritical site percolation on the hypercube: small components are small.
Comb. Probab. Comput.
Sahar Diskin, Michael Krivelevich
2022 J jnl
Color-biased Hamilton cycles in random graphs.
Random Struct. Algorithms
Lior Gishboliner, Michael Krivelevich, Peleg Michaeli
2022 J jnl
Component Games on Random Graphs.
Comb.
Rani Hod, Michael Krivelevich, Tobias Müller, Alon Naor, Nicholas C. Wormald
2022 J jnl
Cycle lengths in sparse random graphs.
Random Struct. Algorithms
Yahav Alon, Michael Krivelevich, Eyal Lubetzky
2022 J jnl
Discrepancies of spanning trees and Hamilton cycles.
J. Comb. Theory B
Lior Gishboliner, Michael Krivelevich, Peleg Michaeli
2022 J jnl
Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs.
SIAM J. Discret. Math.
Yahav Alon, Michael Krivelevich
2022 J jnl
On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs.
Electron. J. Comb.
Sahar Diskin, Michael Krivelevich
2022 J jnl
Short proofs for long induced paths.
Comb. Probab. Comput.
Nemanja Draganic, Stefan Glock, Michael Krivelevich
2022 J jnl
Spanning Trees at the Connectivity Threshold.
SIAM J. Discret. Math.
Yahav Alon, Michael Krivelevich, Peleg Michaeli
2022 J jnl
The largest hole in sparse random graphs.
Random Struct. Algorithms
Nemanja Draganic, Stefan Glock, Michael Krivelevich
2021 J jnl
Cycle Lengths in Expanding Graphs.
Comb.
Limor Friedman, Michael Krivelevich
2021 J jnl
Divisible subdivisions.
J. Graph Theory
Noga Alon, Michael Krivelevich
2021 J jnl
Large complete minors in random subgraphs.
Comb. Probab. Comput.
Joshua Erde, Mihyun Kang, Michael Krivelevich
2021 A* conf
Rolling backwards can move you forward: on embedding problems in sparse expanders.
SODA
Nemanja Draganic, Michael Krivelevich, Rajko Nenadov
2021 J jnl
The size-Ramsey number of short subdivisions.
Random Struct. Algorithms
Nemanja Draganic, Michael Krivelevich, Rajko Nenadov
2020 J jnl
Asymptotics in percolation on high-girth expanders.
Random Struct. Algorithms
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
2020 J jnl
Edge-statistics on large graphs.
Comb. Probab. Comput.
Noga Alon, Dan Hefetz, Michael Krivelevich, Mykhaylo Tyomkyn
2020 J jnl
Finding a Hamilton cycle fast on average using rotations and extensions.
Random Struct. Algorithms
Yahav Alon, Michael Krivelevich
2020 C conf
Greedy Maximal Independent Sets via Local Limits.
AofA
Michael Krivelevich, Tamás Mészáros, Peleg Michaeli, Clara Shikhelman
2020 J jnl
Random Graph's Hamiltonicity is Strongly Tied to its Minimum Degree.
Electron. J. Comb.
Yahav Alon, Michael Krivelevich
2020 J jnl
Ron Graham (1935-2020).
J. Comb. Theory B
Michael Krivelevich, Bojan Mohar
2020 J jnl
The Kőnig graph process.
Random Struct. Algorithms
Nina Kamcev, Michael Krivelevich, Natasha Morrison, Benny Sudakov
2020 J jnl
The genus of the Erdős-Rényi random graph and the fragile genus property.
Random Struct. Algorithms
Chris Dowden, Mihyun Kang, Michael Krivelevich
2020 A* conf
Very fast construction of bounded-degree spanning graphs via the semi-random graph process.
SODA
Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
2020 J jnl
Very fast construction of bounded-degree spanning graphs via the semi-random graph process.
Random Struct. Algorithms
Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
2019 — conf
Expanders - how to find them, and what to find in them.
BCC
Michael Krivelevich
2019 J jnl
Goldberg's conjecture is true for random multigraphs.
J. Comb. Theory B
Penny Haxell, Michael Krivelevich, Gal Kronenberg
2019 J jnl
Long Cycles in Locally Expanding Graphs, with Applications.
Comb.
Michael Krivelevich
2019 J jnl
Optimal shattering of complex networks.
Appl. Netw. Sci.
Nicole Balashov, Reuven Cohen, Avieli Haber, Michael Krivelevich, Simi Haber
2019 J jnl
Optimal shattering of complex networks.
CoRR
Nicole Balashov, Reuven Cohen, Avieli Haber, Michael Krivelevich, Simi Haber
2019 J jnl
Very fast construction of bounded-degree spanning graphs via the semi-random graph process.
CoRR
Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich
2018 J jnl
Clique coloring of dense random graphs.
J. Graph Theory
Noga Alon, Michael Krivelevich
2018 J jnl
Elegantly Colored Paths and Cycles in Edge Colored Random Graphs.
SIAM J. Discret. Math.
Lisa Espig, Alan M. Frieze, Michael Krivelevich
2018 J jnl
Finding and Using Expanders in Locally Sparse Graphs.
SIAM J. Discret. Math.
Michael Krivelevich
2018 J jnl
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments.
Random Struct. Algorithms
Lior Gishboliner, Michael Krivelevich, Gal Kronenberg
2018 J jnl
Packing Hamilton Cycles Online.
Comb. Probab. Comput.
Joseph Briggs, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
2018 J jnl
Proper colouring Painter-Builder game.
Discret. Math.
Malgorzata Bednarska-Bzdega, Michael Krivelevich, Viola Mészáros, Clément Requilé
2018 C conf
The Genus of the Erdös-Rényi Random Graph and the Fragile Genus Property.
AofA
Chris Dowden, Mihyun Kang, Michael Krivelevich
2018 J jnl
The random k-matching-free process.
Random Struct. Algorithms
Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov
2017 J jnl
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.
SIAM J. Discret. Math.
Michael Krivelevich, Matthew Kwan, Benny Sudakov
2017 J jnl
Compatible Hamilton cycles in Dirac graphs.
Comb.
Michael Krivelevich, Choongbum Lee, Benny Sudakov
2017 J jnl
Counting and packing Hamilton cycles in dense graphs and oriented graphs.
J. Comb. Theory B
Asaf Ferber, Michael Krivelevich, Benny Sudakov
2017 J jnl
Efficient Winning Strategies in Random-Turn Maker-Breaker Games.
J. Graph Theory
Asaf Ferber, Michael Krivelevich, Gal Kronenberg
2017 J jnl
Finding paths in sparse random graphs requires many queries.
Random Struct. Algorithms
Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira
2017 J jnl
Small Subgraphs in the Trace of a Random Walk.
Electron. J. Comb.
Michael Krivelevich, Peleg Michaeli
2017 J jnl
Waiter-Client and Client-Waiter Hamiltonicity games on random graphs.
Eur. J. Comb.
Dan Hefetz, Michael Krivelevich, Wei En Tan
2016 J jnl
Client-Waiter Games on Complete and Random Graphs.
Electron. J. Comb.
Oren Dean, Michael Krivelevich
2016 J jnl
Compatible Hamilton cycles in random graphs.
Random Struct. Algorithms
Michael Krivelevich, Choongbum Lee, Benny Sudakov
2016 J jnl
Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs.
Comb. Probab. Comput.
Michael Krivelevich, Matthew Kwan, Benny Sudakov
2016 J jnl
Editorial.
J. Comb. Theory B
Michael Krivelevich, Bojan Mohar
2016 J jnl
Finding Hamilton cycles in random graphs with few queries.
Random Struct. Algorithms
Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira
2016 J jnl
Manipulative Waiters with Probabilistic Intuition.
Comb. Probab. Comput.
Malgorzata Bednarska-Bzdega, Dan Hefetz, Michael Krivelevich, Tomasz Luczak
2016 J jnl
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments.
CoRR
Lior Gishboliner, Michael Krivelevich, Gal Kronenberg
2016 J jnl
On saturation games.
Eur. J. Comb.
Dan Hefetz, Michael Krivelevich, Alon Naor, Milos Stojakovic
2016 — book
Random Graphs, Geometry and Asymptotic Structure.
Michael Krivelevich, Konstantinos Panagiotou, Mathew D. Penrose, Colin J. H. McDiarmid
2016 J jnl
Some Remarks on Rainbow Connectivity.
J. Graph Theory
Nina Kamcev, Michael Krivelevich, Benny Sudakov
2016 J jnl
The Phase Transition in Site Percolation on Pseudo-Random Graphs.
Electron. J. Comb.
Michael Krivelevich
2016 J jnl
Waiter-Client and Client-Waiter planarity, colorability and minor games.
Discret. Math.
Dan Hefetz, Michael Krivelevich, Wei En Tan
2015 J jnl
Biased games on random boards.
Random Struct. Algorithms
Asaf Ferber, Roman Glebov, Michael Krivelevich, Alon Naor
2015 A* conf
Contagious Sets in Expanders.
SODA
Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman
2015 J jnl
Cycles and matchings in randomly perturbed digraphs and hypergraphs.
Electron. Notes Discret. Math.
Michael Krivelevich, Matthew Kwan, Benny Sudakov
2015 J jnl
Decomposing Random Graphs into Few Cycles and Edges.
Comb. Probab. Comput.
Dániel Korándi, Michael Krivelevich, Benny Sudakov
2015 J jnl
Generating random graphs in biased Maker-Breaker games.
Random Struct. Algorithms
Asaf Ferber, Michael Krivelevich, Humberto Naves
2015 J jnl
Large Subgraphs without Short Cycles.
SIAM J. Discret. Math.
Florent Foucaud, Michael Krivelevich, Guillem Perarnau
2015 J jnl
Long paths and cycles in random subgraphs of graphs with large minimum degree.
Random Struct. Algorithms
Michael Krivelevich, Choongbum Lee, Benny Sudakov
2015 J jnl
Random-Player Maker-Breaker games.
Electron. J. Comb.
Michael Krivelevich, Gal Kronenberg
2015 J jnl
Smoothed Analysis on Connected Graphs.
SIAM J. Discret. Math.
Michael Krivelevich, Daniel Reichman, Wojciech Samotij
2015 J jnl
Some Remarks on Rainbow Connectivity.
Electron. Notes Discret. Math.
Nina Kamcev, Michael Krivelevich, Benny Sudakov
2015 J jnl
Walker-Breaker Games.
SIAM J. Discret. Math.
Lisa Espig, Alan M. Frieze, Michael Krivelevich, Wesley Pegden
2014 J jnl
Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-free Graphs.
Electron. J. Comb.
Michael Krivelevich, Wojciech Samotij
2014 J jnl
On covering expander graphs by hamilton cycles.
Random Struct. Algorithms
Roman Glebov, Michael Krivelevich, Tibor Szabó
2014 J jnl
Packing Tree Factors in Random and Pseudo-random Graphs.
Electron. J. Comb.
Deepak Bal, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
2014 — conf
Smoothed Analysis on Connected Graphs.
APPROX-RANDOM
Michael Krivelevich, Daniel Reichman, Wojciech Samotij
2013 J jnl
Avoider-Enforcer games played on edge disjoint hypergraphs.
Discret. Math.
Asaf Ferber, Michael Krivelevich, Alon Naor
2013 J jnl
Comparing the strength of query types in property testing: The case of k-colorability.
Comput. Complex.
Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron
2013 J jnl
Contagious Sets in Expanders.
CoRR
Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman
2013 J jnl
Expanders Are Universal for the Class of All Spanning Trees.
Comb. Probab. Comput.
Daniel Johannsen, Michael Krivelevich, Wojciech Samotij
2013 J jnl
Longest cycles in sparse random digraphs.
Random Struct. Algorithms
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
2013 J jnl
On the Non-Planarity of a Random Subgraph.
Comb. Probab. Comput.
Alan M. Frieze, Michael Krivelevich
2013 J jnl
On the Number of Hamilton Cycles in Sparse Random Graphs.
SIAM J. Discret. Math.
Roman Glebov, Michael Krivelevich
2013 J jnl
The Biased Odd Cycle Game.
Electron. J. Comb.
Asaf Ferber, Roman Glebov, Michael Krivelevich, Hong Liu, Cory Palmer, Tomás Valla, Máté Vizer
2013 J jnl
The phase transition in random graphs: A simple proof.
Random Struct. Algorithms
Michael Krivelevich, Benny Sudakov
2012 J jnl
Biased orientation games.
Discret. Math.
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
2012 J jnl
Creating Small Subgraphs in Achlioptas Processes With Growing Parameter.
SIAM J. Discret. Math.
Michael Krivelevich, Reto Spöhel
2012 A* conf
Expanders are universal for the class of all spanning trees.
SODA
Daniel Johannsen, Michael Krivelevich, Wojciech Samotij
2012 J jnl
Fast Strategies In Maker-Breaker Games Played on Random Boards.
Comb. Probab. Comput.
Dennis Clemens, Asaf Ferber, Michael Krivelevich, Anita Liebenau
2012 J jnl
Fast embedding of spanning trees in biased Maker-Breaker games.
Eur. J. Comb.
Asaf Ferber, Dan Hefetz, Michael Krivelevich
2012 J jnl
Hierarchy Theorems for Property Testing.
Comput. Complex.
Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg
2012 J jnl
Hitting time results for Maker-Breaker games.
Random Struct. Algorithms
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich
2012 J jnl
Long cycles in subgraphs of (pseudo)random directed graphs.
J. Graph Theory
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
2012 J jnl
On the Number of Hamilton Cycles in Pseudo-Random Graphs.
Electron. J. Comb.
Michael Krivelevich
2012 J jnl
Optimal Packings of Hamilton Cycles in Sparse Random Graphs.
SIAM J. Discret. Math.
Michael Krivelevich, Wojciech Samotij
2012 J jnl
Packing hamilton cycles in random and pseudo-random hypergraphs.
Random Struct. Algorithms
Alan M. Frieze, Michael Krivelevich
2012 J jnl
Packing tight Hamilton cycles in 3-uniform hypergraphs.
Random Struct. Algorithms
Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
2012 J jnl
Sharp threshold for the appearance of certain spanning trees in random graphs.
Random Struct. Algorithms
Dan Hefetz, Michael Krivelevich, Tibor Szabó
2012 J jnl
The size Ramsey number of a directed path.
J. Comb. Theory B
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
2012 J jnl
Variations on cops and robbers.
J. Graph Theory
Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
2011 J jnl
Fast embedding of spanning trees in biased Maker-Breaker games.
Electron. Notes Discret. Math.
Dan Hefetz, Asaf Ferber, Michael Krivelevich
2011 J jnl
Global Maker-Breaker games on sparse graphs.
Eur. J. Comb.
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
2011 A* conf
Hitting time results for Maker-Breaker games.
SODA
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich
2011 J jnl
Local Resilience and Hamiltonicity Maker-Breaker Games in Random Regular Graphs.
Comb. Probab. Comput.
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov
2011 J jnl
On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs.
SIAM J. Discret. Math.
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov
2011 J jnl
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs
CoRR
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov
2011 A* conf
Packing tight Hamilton cycles in 3-uniform hypergraphs.
SODA
Alan M. Frieze, Michael Krivelevich, Po-Shen Loh
2011 J jnl
Ramsey games with giants.
Random Struct. Algorithms
Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov
2011 J jnl
Regular induced subgraphs of a random Graph.
Random Struct. Algorithms
Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald
2011 J jnl
The Number of
Electron. J. Comb.
Noga Alon, Simi Haber, Michael Krivelevich
2010 J jnl
A note on regular Ramsey graphs.
J. Graph Theory
Noga Alon, Sonny Ben-Shimon, Michael Krivelevich
2010 J jnl
Avoider-Enforcer: The rules of the game.
J. Comb. Theory A
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
2010 — ch.
Comparing the Strength of Query Types in Property Testing: The Case of Testing
Property Testing
Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron
2010 J jnl
Embedding Spanning Trees in Random Graphs.
SIAM J. Discret. Math.
Michael Krivelevich
2010 J jnl
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence.
SIAM J. Discret. Math.
Colin Cooper, Alan M. Frieze, Michael Krivelevich
2010 J jnl
Hamiltonicity thresholds in Achlioptas processes.
Random Struct. Algorithms
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
2010 — ch.
Hierarchy Theorems for Property Testing.
Property Testing
Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg
2010 J jnl
Hitting time results for Maker-Breaker games
CoRR
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich
2010 J jnl
Offline thresholds for Ramsey-type games on random graphs.
Random Struct. Algorithms
Michael Krivelevich, Reto Spöhel, Angelika Steger
2010 J jnl
Playing to Retain the Advantage.
Comb. Probab. Comput.
Noga Alon, Dan Hefetz, Michael Krivelevich
2010 J jnl
Resilient Pancyclicity of Random and Pseudorandom Graphs.
SIAM J. Discret. Math.
Michael Krivelevich, Choongbum Lee, Benny Sudakov
2010 J jnl
The rainbow connection of a graph is (at most) reciprocal to its minimum degree.
J. Graph Theory
Michael Krivelevich, Raphael Yuster
2010 J jnl
Why Almost All
Theory Comput. Syst.
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik
2009 J jnl
A sharp threshold for the Hamilton cycle Maker-Breaker game.
Random Struct. Algorithms
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
2009 J jnl
Avoider-Enforcer: The Rules of the Game.
Electron. Notes Discret. Math.
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
2009 J jnl
Avoiding small subgraphs in Achlioptas processes.
Random Struct. Algorithms
Michael Krivelevich, Po-Shen Loh, Benny Sudakov
2009 J jnl
Equitable coloring of random graphs.
Random Struct. Algorithms
Michael Krivelevich, Balázs Patkós
2009 J jnl
Fast Winning Strategies in Avoider-Enforcer Games.
Graphs Comb.
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
2009 J jnl
Fast winning strategies in Maker-Breaker games.
J. Comb. Theory B
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
2009 J jnl
Hamilton cycles in highly connected and expanding graphs.
Comb.
Dan Hefetz, Michael Krivelevich, Tibor Szabó
2009 — conf
Hierarchy Theorems for Property Testing.
APPROX-RANDOM
Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg
2009 A* conf
On smoothed
SODA
Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik
2009 J jnl
On the Random Satisfiable Process.
Comb. Probab. Comput.
Michael Krivelevich, Benny Sudakov, Dan Vilenchik
2009 J jnl
Perfectly Balanced Partitions of Smoothed Graphs.
Electron. J. Comb.
Ido Ben-Eliezer, Michael Krivelevich
2009 J jnl
Playing to retain the advantage.
Electron. Notes Discret. Math.
Dan Hefetz, Noga Alon, Michael Krivelevich
2009 J jnl
Random regular graphs of non-constant degree: Concentration of the chromatic number.
Discret. Math.
Sonny Ben-Shimon, Michael Krivelevich
2009 J jnl
Spanning Directed Trees with Many Leaves.
SIAM J. Discret. Math.
Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2009 J jnl
Vertex percolation on expander graphs.
Eur. J. Comb.
Sonny Ben-Shimon, Michael Krivelevich
2008 J jnl
A note on regular Ramsey graphs
CoRR
Noga Alon, Sonny Ben-Shimon, Michael Krivelevich
2008 J jnl
Biased Positional Games and Small Hypergraphs with Large Covers.
Electron. J. Comb.
Michael Krivelevich, Tibor Szabó
2008 A* conf
Comparing the strength of query types in property testing: the case of testing
SODA
Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron
2008 J jnl
Corrigendum: On fractional K-factors of random graphs.
Random Struct. Algorithms
Simi Haber, Michael Krivelevich
2008 J jnl
Hierarchy Theorems for Property Testing.
Electron. Colloquium Comput. Complex.
Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg
2008 J jnl
Large Nearly Regular Induced Subgraphs.
SIAM J. Discret. Math.
Noga Alon, Michael Krivelevich, Benny Sudakov
2008 J jnl
On Rainbow Trees and Cycles.
Electron. J. Comb.
Alan M. Frieze, Michael Krivelevich
2008 J jnl
On the random satisfiable process
CoRR
Michael Krivelevich, Benny Sudakov, Dan Vilenchik
2008 J jnl
Planarity, Colorability, and Minor Games.
SIAM J. Discret. Math.
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
2008 — conf
Small Sample Spaces Cannot Fool Low Degree Polynomials.
APPROX-RANDOM
Noga Alon, Ido Ben-Eliezer, Michael Krivelevich
2008 J jnl
Spanning directed trees with many leaves
CoRR
Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2008 J jnl
Testing Triangle-Freeness in General Graphs.
SIAM J. Discret. Math.
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron
2008 J jnl
The isoperimetric constant of the random graph process.
Random Struct. Algorithms
Itai Benjamini, Simi Haber, Michael Krivelevich, Eyal Lubetzky
2008 J jnl
Winning Fast in Sparse Graph Construction Games.
Comb. Probab. Comput.
Ohad N. Feldheim, Michael Krivelevich
2007 J jnl
Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213].
Inf. Comput.
Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
2007 J jnl
Approximation algorithms and hardness results for cycle packing problems.
ACM Trans. Algorithms
Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraëte, Raphael Yuster
2007 J jnl
Avoider-Enforcer games.
J. Comb. Theory A
Dan Hefetz, Michael Krivelevich, Tibor Szabó
2007 J jnl
Bart-Moe games, JumbleG and discrepancy.
Eur. J. Comb.
Dan Hefetz, Michael Krivelevich, Tibor Szabó
2007 J jnl
Better Algorithms and Bounds for Directed Maximum Leaf Problems
CoRR
Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007 — conf
Better Algorithms and Bounds for Directed Maximum Leaf Problems.
FSTTCS
Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007 J jnl
Embedding nearly-spanning bounded degree trees.
Comb.
Noga Alon, Michael Krivelevich, Benny Sudakov
2007 J jnl
Fast winning strategies in positional games.
Electron. Notes Discret. Math.
Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó
2007 J jnl
On fractional
Random Struct. Algorithms
Simi Haber, Michael Krivelevich
2007 J jnl
On the Chromatic Number of Random Graphs with a Fixed Degree Sequence.
Comb. Probab. Comput.
Alan M. Frieze, Michael Krivelevich, Cliff Smyth
2007 J jnl
Parameterized Algorithms for Directed Maximum Leaf Problems
CoRR
Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007 A* conf
Parameterized Algorithms for Directed Maximum Leaf Problems.
ICALP
Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh
2007 J jnl
Vertex Percolation on Expander Graphs.
CoRR
Sonny Ben-Shimon, Michael Krivelevich
2007 A conf
Why Almost All
STACS
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik
2006 J jnl
Almost universal graphs.
Random Struct. Algorithms
Alan M. Frieze, Michael Krivelevich
2006 J jnl
Coloring complete bipartite graphs from random lists.
Random Struct. Algorithms
Michael Krivelevich, Asaf Nachmias
2006 J jnl
On smoothed analysis in dense graphs and formulas.
Random Struct. Algorithms
Michael Krivelevich, Benny Sudakov, Prasad Tetali
2006 J jnl
On the asymptotic value of the choice number of complete multi-partite graphs.
J. Graph Theory
Nurit Gazit, Michael Krivelevich
2006 J jnl
On the random 2-stage minimum spanning tree.
Random Struct. Algorithms
Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich
2006 J jnl
Preface.
Eur. J. Comb.
Michael Krivelevich, Benny Sudakov
2006 — conf
Semirandom Models as Benchmarks for Coloring Algorithms.
ANALCO
Michael Krivelevich, Dan Vilenchik
2006 A* conf
Solving random satisfiable 3CNF formulas in expected polynomial time.
SODA
Michael Krivelevich, Dan Vilenchik
2006 A* conf
Testing triangle-freeness in general graphs.
SODA
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron
2005 A* conf
Approximation algorithms for cycle packing problems.
SODA
Michael Krivelevich, Zeev Nutov, Raphael Yuster
2005 J jnl
Bounds on distance distributions in codes of known size.
IEEE Trans. Inf. Theory
Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
2005 J jnl
Discrepancy Games.
Electron. J. Comb.
Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó
2005 J jnl
On packing Hamilton cycles in ?-regular graphs.
J. Comb. Theory B
Alan M. Frieze, Michael Krivelevich
2005 A* conf
On the random 2-stage minimum spanning tree.
SODA
Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich
2005 J jnl
Random regular graphs of non-constant degree: Concentration of the chromatic number.
CoRR
Sonny Ben-Shimon, Michael Krivelevich
2005 J jnl
Recognizing More Unsatisfiable Random k-SAT Instances Efficiently.
SIAM J. Comput.
Joel Friedman, Andreas Goerdt, Michael Krivelevich
2005 J jnl
Testing Reed-Muller codes.
IEEE Trans. Inf. Theory
Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
2005 J jnl
The Strong Chromatic Index of Random Graphs.
SIAM J. Discret. Math.
Alan M. Frieze, Michael Krivelevich, Benny Sudakov
2004 J jnl
Adding random edges to dense graphs.
Random Struct. Algorithms
Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan R. Martin
2004 J jnl
Algorithms with large domination ratio.
J. Algorithms
Noga Alon, Gregory Z. Gutin, Michael Krivelevich
2004 B conf
Bounds on distance distributions in codes of known size.
ISIT
Alexei Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
2004 J jnl
Colouring powers of cycles from random lists.
Eur. J. Comb.
Michael Krivelevich, Asaf Nachmias
2004 J jnl
The emergence of a giant component in random subgraphs of pseudo-random graphs.
Random Struct. Algorithms
Alan M. Frieze, Michael Krivelevich, Ryan R. Martin
2004 J jnl
Tight Bounds for Testing Bipartiteness in General Graphs.
SIAM J. Comput.
Tali Kaufman, Michael Krivelevich, Dana Ron
2004 J jnl
Triangle Factors In Sparse Pseudo-Random Graphs.
Comb.
Michael Krivelevich, Benny Sudakov, Tibor Szabó
2003 J jnl
Approximate coloring of uniform hypergraphs.
J. Algorithms
Michael Krivelevich, Benny Sudakov
2003 J jnl
Covering codes with improved density.
IEEE Trans. Inf. Theory
Michael Krivelevich, Benny Sudakov, Van H. Vu
2003 J jnl
Generalized hashing and parent-identifying codes.
J. Comb. Theory A
Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
2003 J jnl
Induced subgraphs of prescribed size.
J. Graph Theory
Noga Alon, Michael Krivelevich, Benny Sudakov
2003 J jnl
Maximum cuts and judicious partitions in graphs without short cycles.
J. Comb. Theory B
Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov
2003 J jnl
On the probability of independent sets in random graphs.
Random Struct. Algorithms
Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
2003 J jnl
Sparse pseudo-random graphs are Hamiltonian.
J. Graph Theory
Michael Krivelevich, Benny Sudakov
2003 — conf
Testing Low-Degree Polynomials over GF(2(.
RANDOM-APPROX
Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
2003 J jnl
The Largest Eigenvalue Of Sparse Random Graphs.
Comb. Probab. Comput.
Michael Krivelevich, Benny Sudakov
2003 — conf
Tight Bounds for Testing Bipartiteness in General Graphs.
RANDOM-APPROX
Tali Kaufman, Michael Krivelevich, Dana Ron
2003 J jnl
Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions.
Comb. Probab. Comput.
Noga Alon, Michael Krivelevich, Benny Sudakov
2002 J jnl
A Sharp Threshold For Network Reliability.
Comb. Probab. Comput.
Michael Krivelevich, Benny Sudakov, Van H. Vu
2002 J jnl
Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time.
J. Comb. Optim.
Michael Krivelevich, Van H. Vu
2002 J jnl
Deciding k-colorability in expected polynomial time.
Inf. Process. Lett.
Michael Krivelevich
2002 J jnl
Fractional Planks.
Discret. Comput. Geom.
Ron Aharoni, Ron Holzman, Michael Krivelevich, Roy Meshulam
2002 J jnl
Hamilton cycles in random subgraphs of pseudo-random graphs.
Discret. Math.
Alan M. Frieze, Michael Krivelevich
2002 J jnl
Scalable Secure Storage When Half the System Is Faulty.
Inf. Comput.
Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
2002 J jnl
Sparse Graphs Usually Have Exponentially Many Optimal Colorings.
Electron. J. Comb.
Michael Krivelevich
2002 J jnl
Testing k-colorability.
SIAM J. Discret. Math.
Noga Alon, Michael Krivelevich
2002 J jnl
Two-coloring random hypergraphs.
Random Struct. Algorithms
Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali
2002 J jnl
Upper bounds on the rate of LDPC Codes.
IEEE Trans. Inf. Theory
David Burshtein, Michael Krivelevich, Simon Litsyn, Gadi Miller
2001 J jnl
Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs.
J. Algorithms
Michael Krivelevich, Ram Nathaniel, Benny Sudakov
2001 A* conf
Approximating coloring and maximum independent sets in 3-uniform hypergraphs.
SODA
Michael Krivelevich, Ram Nathaniel, Benny Sudakov
2001 J jnl
Choosability in Random Hypergraphs.
J. Comb. Theory B
Michael Krivelevich, Van H. Vu
2001 A conf
Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods.
STACS
Andreas Goerdt, Michael Krivelevich
2001 J jnl
Random regular graphs of high degree.
Random Struct. Algorithms
Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
2000 A* conf
Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time.
ICALP
Michael Krivelevich, Van H. Vu
2000 J jnl
Efficient Testing of Large Graphs.
Comb.
Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy
2000 J jnl
Long cycles in critical graphs.
J. Graph Theory
Noga Alon, Michael Krivelevich, Paul D. Seymour
2000 J jnl
Regular Languages are Testable with a Constant Number of Queries.
SIAM J. Comput.
Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy
2000 A* conf
Scalable Secure Storage when Half the System Is Faulty.
ICALP
Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern
2000 J jnl
Sharp thresholds for certain Ramsey properties of random graphs.
Random Struct. Algorithms
Ehud Friedgut, Michael Krivelevich
2000 J jnl
The Choice Number Of Dense Random Graphs.
Comb. Probab. Comput.
Michael Krivelevich
2000 — conf
Two-coloring Random Hypergraphs.
ICALP Satellite Workshops
Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali
1999 J jnl
Coloring Graphs with Sparse Neighborhoods.
J. Comb. Theory B
Noga Alon, Michael Krivelevich, Benny Sudakov
1999 A* conf
Efficient Testing of Large Graphs.
FOCS
Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy
1999 J jnl
List Coloring of Random and Pseudo-Random Graphs.
Comb.
Noga Alon, Michael Krivelevich, Benny Sudakov
1999 A* conf
Regular Languages Are Testable with a Constant Number of Queries.
FOCS
Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy
1998 J jnl
A lower bound for irredundant Ramsey numbers.
Discret. Math.
Michael Krivelevich
1998 J jnl
An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs.
Electron. J. Comb.
Michael Krivelevich
1998 A conf
Approximate Coloring of Uniform Hypergraphs (Extended Abstract).
ESA
Michael Krivelevich, Benny Sudakov
1998 J jnl
Coloring Random Graphs.
Inf. Process. Lett.
Michael Krivelevich, Benny Sudakov
1998 A* conf
Finding a Large Hidden Clique in a Random Graph.
SODA
Noga Alon, Michael Krivelevich, Benny Sudakov
1998 J jnl
Finding a large hidden clique in a random graph.
Random Struct. Algorithms
Noga Alon, Michael Krivelevich, Benny Sudakov
1998 J jnl
The chromatic numbers of random hypergraphs.
Random Struct. Algorithms
Michael Krivelevich, Benny Sudakov
1997 J jnl
Almost perfect matchings in random uniform hypergraphs.
Discret. Math.
Michael Krivelevich
1997 J jnl
Approximate Set Covering in Uniform Hypergraphs.
J. Algorithms
Michael Krivelevich
1997 J jnl
Constructive Bounds for a Ramsey-Type Problem.
Graphs Comb.
Noga Alon, Michael Krivelevich
1997 J jnl
On the Minimal Number of Edges in Color-Critical Graphs.
Comb.
Michael Krivelevich
1997 J jnl
The Concentration of the Chromatic Number of Random Graphs.
Comb.
Noga Alon, Michael Krivelevich
1997 J jnl
Triangle Factors in Random Graphs.
Comb. Probab. Comput.
Michael Krivelevich
1996 J jnl
On
J. Graph Theory
Noga Alon, Paul Erdös, Ron Holzman, Michael Krivelevich
1996 J jnl
On a Theorem of Lovász on Covers in tau-Partite Hypergraphs.
Comb.
Ron Aharoni, Ron Holzman, Michael Krivelevich
1996 J jnl
Perfect fractional matchings in random hypergraphs.
Random Struct. Algorithms
Michael Krivelevich
1995 J jnl
Bounding Ramsey Numbers through Large Deviation Inequalities.
Random Struct. Algorithms
Michael Krivelevich
1995 J jnl
On a conjecture of Tuza about packing and covering of triangles.
Discret. Math.
Michael Krivelevich
1995 J jnl
On the Edge Distribution in Triangle-free Graphs.
J. Comb. Theory B
Michael Krivelevich
1994 J jnl
K
Comb. Probab. Comput.
Michael Krivelevich