The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Michael Krivelevich" ( http://dblp.L3S.de/Authors/Michael_Krivelevich )

URL (Homepage):  https://zbmath.org/authors/?q=ai:krivelevich.michael  Author page on DBLP  Author page in RDF  Community of Michael Krivelevich in ASPL-2

Publication years (Num. hits)
1994-1998 (20) 1999-2001 (17) 2002-2003 (21) 2004-2005 (16) 2006-2007 (23) 2008-2009 (29) 2010-2011 (23) 2012 (15) 2013-2015 (24) 2016-2017 (19) 2018-2019 (11)
Publication types (Num. hits)
article(185) book(1) incollection(2) inproceedings(30)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 12 occurrences of 12 keywords

Results
Found 219 publication records. Showing 218 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Michael Krivelevich Long Cycles in Locally Expanding Graphs, with Applications. Search on Bibsonomy Combinatorica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich Very fast construction of bounded-degree spanning graphs via the semi-random graph process. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Penny Haxell, Michael Krivelevich, Gal Kronenberg Goldberg's conjecture is true for random multigraphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Joseph Briggs, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh Packing Hamilton Cycles Online. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich Finding and Using Expanders in Locally Sparse Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lisa Espig, Alan M. Frieze, Michael Krivelevich Elegantly Colored Paths and Cycles in Edge Colored Random Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Malgorzata Bednarska-Bzdega, Michael Krivelevich, Viola Mészáros, Clément Requilé Proper colouring Painter-Builder game. Search on Bibsonomy Discrete Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lior Gishboliner, Michael Krivelevich, Gal Kronenberg On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov The random k-matching-free process. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Noga Alon, Michael Krivelevich Clique coloring of dense random graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Chris Dowden, Mihyun Kang, Michael Krivelevich The Genus of the Erdös-Rényi Random Graph and the Fragile Genus Property. Search on Bibsonomy AofA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Peleg Michaeli Small Subgraphs in the Trace of a Random Walk. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2017 DBLP  BibTeX  RDF
1Michael Krivelevich, Matthew Kwan, Benny Sudakov Bounded-Degree Spanning Trees in Randomly Perturbed Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Choongbum Lee, Benny Sudakov Compatible Hamilton cycles in Dirac graphs. Search on Bibsonomy Combinatorica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dan Hefetz, Michael Krivelevich, Wei En Tan Waiter-Client and Client-Waiter Hamiltonicity games on random graphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira 0003 Finding paths in sparse random graphs requires many queries. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Michael Krivelevich, Benny Sudakov Counting and packing Hamilton cycles in dense graphs and oriented graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Michael Krivelevich, Gal Kronenberg Efficient Winning Strategies in Random-Turn Maker-Breaker Games. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich The Phase Transition in Site Percolation on Pseudo-Random Graphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2016 DBLP  BibTeX  RDF
1Oren Dean, Michael Krivelevich Client-Waiter Games on Complete and Random Graphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2016 DBLP  BibTeX  RDF
1Michael Krivelevich, Matthew Kwan, Benny Sudakov Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Malgorzata Bednarska-Bzdega, Dan Hefetz, Michael Krivelevich, Tomasz Luczak Manipulative Waiters with Probabilistic Intuition. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Dan Hefetz, Michael Krivelevich, Alon Naor, Milos Stojakovic On saturation games. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Lior Gishboliner, Michael Krivelevich, Gal Kronenberg On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Dan Hefetz, Michael Krivelevich, Wei En Tan Waiter-Client and Client-Waiter planarity, colorability and minor games. Search on Bibsonomy Discrete Mathematics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Choongbum Lee, Benny Sudakov Compatible Hamilton cycles in random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira 0003 Finding Hamilton cycles in random graphs with few queries. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Bojan Mohar Editorial. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Nina Kamcev, Michael Krivelevich, Benny Sudakov Some Remarks on Rainbow Connectivity. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Konstantinos Panagiotou, Mathew D. Penrose, Colin J. H. McDiarmid Random Graphs, Geometry and Asymptotic Structure. Search on Bibsonomy 2016   RDF
1Michael Krivelevich, Matthew Kwan, Benny Sudakov Cycles and matchings in randomly perturbed digraphs and hypergraphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Nina Kamcev, Michael Krivelevich, Benny Sudakov Some Remarks on Rainbow Connectivity. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Gal Kronenberg Random-Player Maker-Breaker games. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2015 DBLP  BibTeX  RDF
1Dániel Korándi, Michael Krivelevich, Benny Sudakov Decomposing Random Graphs into Few Cycles and Edges. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Florent Foucaud, Michael Krivelevich, Guillem Perarnau Large Subgraphs without Short Cycles. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Daniel Reichman 0001, Wojciech Samotij Smoothed Analysis on Connected Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Lisa Espig, Alan M. Frieze, Michael Krivelevich, Wesley Pegden Walker-Breaker Games. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Choongbum Lee, Benny Sudakov Long paths and cycles in random subgraphs of graphs with large minimum degree. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Roman Glebov, Michael Krivelevich, Alon Naor Biased games on random boards. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Michael Krivelevich, Humberto Naves Generating random graphs in biased Maker-Breaker games. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman 0001 Contagious Sets in Expanders. Search on Bibsonomy SODA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Wojciech Samotij Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-free Graphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2014 DBLP  BibTeX  RDF
1Deepak Bal, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh Packing Tree Factors in Random and Pseudo-random Graphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2014 DBLP  BibTeX  RDF
1Roman Glebov, Michael Krivelevich, Tibor Szabó On covering expander graphs by hamilton cycles. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Daniel Reichman 0001, Wojciech Samotij Smoothed Analysis on Connected Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Roman Glebov, Michael Krivelevich, Hong Liu 0010, Cory Palmer, Tomás Valla, Máté Vizer The Biased Odd Cycle Game. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2013 DBLP  BibTeX  RDF
1Alan M. Frieze, Michael Krivelevich On the Non-Planarity of a Random Subgraph. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Daniel Johannsen, Michael Krivelevich, Wojciech Samotij Expanders Are Universal for the Class of All Spanning Trees. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron Comparing the strength of query types in property testing: The case of k-colorability. Search on Bibsonomy Computational Complexity The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Roman Glebov, Michael Krivelevich On the Number of Hamilton Cycles in Sparse Random Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman 0001 Contagious Sets in Expanders. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Asaf Ferber, Michael Krivelevich, Alon Naor Avoider-Enforcer games played on edge disjoint hypergraphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Benny Sudakov The phase transition in random graphs: A simple proof. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Eyal Lubetzky, Benny Sudakov Longest cycles in sparse random digraphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich On the Number of Hamilton Cycles in Pseudo-Random Graphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2012 DBLP  BibTeX  RDF
1Dennis Clemens, Asaf Ferber, Michael Krivelevich, Anita Liebenau Fast Strategies In Maker-Breaker Games Played on Random Boards. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Michael Krivelevich, Ilan Newman, Eyal Rozenberg Hierarchy Theorems for Property Testing. Search on Bibsonomy Computational Complexity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Wojciech Samotij Optimal Packings of Hamilton Cycles in Sparse Random Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Reto Spöhel Creating Small Subgraphs in Achlioptas Processes With Growing Parameter. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Dan Hefetz, Michael Krivelevich Fast embedding of spanning trees in biased Maker-Breaker games. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov Biased orientation games. Search on Bibsonomy Discrete Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Dan Hefetz, Michael Krivelevich, Tibor Szabó Sharp threshold for the appearance of certain spanning trees in random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich Hitting time results for Maker-Breaker games. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alan M. Frieze, Michael Krivelevich Packing hamilton cycles in random and pseudo-random hypergraphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alan M. Frieze, Michael Krivelevich, Po-Shen Loh Packing tight Hamilton cycles in 3-uniform hypergraphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov The size Ramsey number of a directed path. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov Long cycles in subgraphs of (pseudo)random directed graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alan M. Frieze, Michael Krivelevich, Po-Shen Loh Variations on cops and robbers. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Daniel Johannsen, Michael Krivelevich, Wojciech Samotij Expanders are universal for the class of all spanning trees. Search on Bibsonomy SODA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Dan Hefetz, Asaf Ferber, Michael Krivelevich Fast embedding of spanning trees in biased Maker-Breaker games. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Noga Alon, Simi Haber, Michael Krivelevich The Number of f-Matchings in Almost Every Tree is a Zero Residue. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2011 DBLP  BibTeX  RDF
1Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov Local Resilience and Hamiltonicity Maker-Breaker Games in Random Regular Graphs. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó Global Maker-Breaker games on sparse graphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov Ramsey games with giants. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald Regular induced subgraphs of a random Graph. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich Hitting time results for Maker-Breaker games. Search on Bibsonomy SODA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alan M. Frieze, Michael Krivelevich, Po-Shen Loh Packing tight Hamilton cycles in 3-uniform hypergraphs. Search on Bibsonomy SODA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Noga Alon, Dan Hefetz, Michael Krivelevich Playing to Retain the Advantage. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Choongbum Lee, Benny Sudakov Resilient Pancyclicity of Random and Pseudorandom Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Colin Cooper, Alan M. Frieze, Michael Krivelevich Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich Embedding Spanning Trees in Random Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik Why Almost All k-Colorable Graphs Are Easy to Color. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich Hitting time results for Maker-Breaker games Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Michael Krivelevich, Eyal Lubetzky, Benny Sudakov Hamiltonicity thresholds in Achlioptas processes. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Reto Spöhel, Angelika Steger Offline thresholds for Ramsey-type games on random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó Avoider-Enforcer: The rules of the game. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael Krivelevich, Raphael Yuster The rainbow connection of a graph is (at most) reciprocal to its minimum degree. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Noga Alon, Sonny Ben-Shimon, Michael Krivelevich A note on regular Ramsey graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Michael Krivelevich, Ilan Newman, Eyal Rozenberg Hierarchy Theorems for Property Testing. Search on Bibsonomy Property Testing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability. Search on Bibsonomy Property Testing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó Avoider-Enforcer: The Rules of the Game. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dan Hefetz, Noga Alon, Michael Krivelevich Playing to retain the advantage. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ido Ben-Eliezer, Michael Krivelevich Perfectly Balanced Partitions of Smoothed Graphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2009 DBLP  BibTeX  RDF
1Michael Krivelevich, Benny Sudakov, Dan Vilenchik On the Random Satisfiable Process. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh 0001 Spanning Directed Trees with Many Leaves. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dan Hefetz, Michael Krivelevich, Tibor Szabó Hamilton cycles in highly connected and expanding graphs. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Sonny Ben-Shimon, Michael Krivelevich Vertex percolation on expander graphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó Fast Winning Strategies in Avoider-Enforcer Games. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 218 (100 per page; Change: )
Pages: [1][2][3][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license