default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Krivelevich
Person information
- affiliation: Tel Aviv University, School of Mathematical Sciences, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j207]Sahar Diskin, Joshua Erde, Mihyun Kang
, Michael Krivelevich:
Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs. Comb. 44(4): 741-784 (2024)- [j206]Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich:
Percolation on irregular high-dimensional product graphs. Comb. Probab. Comput. 33(3): 377-403 (2024) - [j205]Sahar Diskin, Ilay Hoshen, Michael Krivelevich, Maksim Zhukovskii:
On vertex Ramsey graphs with forbidden subgraphs. Discret. Math. 347(3): 113806 (2024) - [j204]Yahav Alon, Michael Krivelevich:
Hamilton completion and the path cover number of sparse random graphs. Eur. J. Comb. 118: 103934 (2024) - [j203]Michael Krivelevich, Tamás Mészáros, Peleg Michaeli, Clara Shikhelman:
Greedy maximal independent sets via local limits. Random Struct. Algorithms 64(4): 986-1015 (2024) - 2023
- [j202]Sahar Diskin, Michael Krivelevich:
Supercritical site percolation on the hypercube: small components are small. Comb. Probab. Comput. 32(3): 422-427 (2023) - [j201]Noga Alon, Michael Krivelevich, Wojciech Samotij:
Largest subgraph from a hereditary property in a random graph. Discret. Math. 346(9): 113480 (2023) - [j200]Michael Krivelevich, Bojan Mohar:
Robin Thomas (1962-2020). J. Comb. Theory B 158(Part): 1-2 (2023) - [j199]Noga Alon, Michael Krivelevich, Benny Sudakov:
Complete minors and average degree: A short proof. J. Graph Theory 103(3): 599-602 (2023) - [j198]Lior Gishboliner, Michael Krivelevich, Peleg Michaeli:
Oriented discrepancy of Hamilton cycles. J. Graph Theory 103(4): 780-792 (2023) - [j197]Asaf Ferber, Liam Hardiman, Michael Krivelevich:
On subgraphs with degrees of prescribed residues in the random graph. Random Struct. Algorithms 63(1): 192-214 (2023) - [j196]Sahar Diskin, Michael Krivelevich:
Site percolation on pseudo-random graphs. Random Struct. Algorithms 63(2): 406-441 (2023) - [j195]Elad Aigner-Horev, Dan Hefetz, Michael Krivelevich:
Cycle lengths in randomly perturbed graphs. Random Struct. Algorithms 63(4): 867-884 (2023) - 2022
- [j194]Rani Hod, Michael Krivelevich, Tobias Müller, Alon Naor, Nicholas C. Wormald:
Component Games on Random Graphs. Comb. 42(6): 1189-1229 (2022) - [j193]Sahar Diskin, Michael Krivelevich:
On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs. Electron. J. Comb. 29(3) (2022) - [j192]Nemanja Draganic, Stefan Glock, Michael Krivelevich:
Short proofs for long induced paths. Comb. Probab. Comput. 31(5): 870-878 (2022) - [j191]Lior Gishboliner, Michael Krivelevich, Peleg Michaeli:
Discrepancies of spanning trees and Hamilton cycles. J. Comb. Theory B 154: 262-291 (2022) - [j190]Lior Gishboliner, Michael Krivelevich, Peleg Michaeli:
Color-biased Hamilton cycles in random graphs. Random Struct. Algorithms 60(3): 289-307 (2022) - [j189]Yahav Alon, Michael Krivelevich, Eyal Lubetzky:
Cycle lengths in sparse random graphs. Random Struct. Algorithms 61(3): 444-461 (2022) - [j188]Nemanja Draganic, Stefan Glock, Michael Krivelevich:
The largest hole in sparse random graphs. Random Struct. Algorithms 61(4): 666-677 (2022) - [j187]Yahav Alon, Michael Krivelevich:
Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs. SIAM J. Discret. Math. 36(1): 728-754 (2022) - [j186]Yahav Alon, Michael Krivelevich, Peleg Michaeli:
Spanning Trees at the Connectivity Threshold. SIAM J. Discret. Math. 36(3): 1612-1626 (2022) - 2021
- [j185]Limor Friedman, Michael Krivelevich:
Cycle Lengths in Expanding Graphs. Comb. 41(1): 53-74 (2021) - [j184]Joshua Erde, Mihyun Kang, Michael Krivelevich:
Large complete minors in random subgraphs. Comb. Probab. Comput. 30(4): 619-630 (2021) - [j183]Noga Alon, Michael Krivelevich:
Divisible subdivisions. J. Graph Theory 98(4): 623-629 (2021) - [j182]Nemanja Draganic, Michael Krivelevich, Rajko Nenadov:
The size-Ramsey number of short subdivisions. Random Struct. Algorithms 59(1): 68-78 (2021) - [c34]Nemanja Draganic, Michael Krivelevich, Rajko Nenadov:
Rolling backwards can move you forward: on embedding problems in sparse expanders. SODA 2021: 123-134 - 2020
- [j181]Yahav Alon, Michael Krivelevich:
Random Graph's Hamiltonicity is Strongly Tied to its Minimum Degree. Electron. J. Comb. 27(1): 1 (2020) - [j180]Noga Alon, Dan Hefetz, Michael Krivelevich, Mykhaylo Tyomkyn:
Edge-statistics on large graphs. Comb. Probab. Comput. 29(2): 163-189 (2020) - [j179]Michael Krivelevich, Bojan Mohar:
Ron Graham (1935-2020). J. Comb. Theory B 145: 521-522 (2020) - [j178]Chris Dowden, Mihyun Kang, Michael Krivelevich:
The genus of the Erdős-Rényi random graph and the fragile genus property. Random Struct. Algorithms 56(1): 97-121 (2020) - [j177]Michael Krivelevich, Eyal Lubetzky, Benny Sudakov:
Asymptotics in percolation on high-girth expanders. Random Struct. Algorithms 56(4): 927-947 (2020) - [j176]Yahav Alon, Michael Krivelevich:
Finding a Hamilton cycle fast on average using rotations and extensions. Random Struct. Algorithms 57(1): 32-46 (2020) - [j175]Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich:
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. Random Struct. Algorithms 57(4): 892-919 (2020) - [j174]Nina Kamcev, Michael Krivelevich, Natasha Morrison, Benny Sudakov:
The Kőnig graph process. Random Struct. Algorithms 57(4): 1272-1302 (2020) - [c33]Michael Krivelevich, Tamás Mészáros, Peleg Michaeli, Clara Shikhelman:
Greedy Maximal Independent Sets via Local Limits. AofA 2020: 20:1-20:19 - [c32]Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich:
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. SODA 2020: 718-737
2010 – 2019
- 2019
- [j173]Nicole Balashov, Reuven Cohen, Avieli Haber, Michael Krivelevich, Simi Haber:
Optimal shattering of complex networks. Appl. Netw. Sci. 4(1): 99:1-99:9 (2019) - [j172]Michael Krivelevich:
Long Cycles in Locally Expanding Graphs, with Applications. Comb. 39(1): 135-151 (2019) - [j171]Penny Haxell, Michael Krivelevich, Gal Kronenberg:
Goldberg's conjecture is true for random multigraphs. J. Comb. Theory B 138: 314-349 (2019) - [c31]Michael Krivelevich:
Expanders - how to find them, and what to find in them. BCC 2019: 115-142 - [i14]Omri Ben-Eliezer, Lior Gishboliner, Dan Hefetz, Michael Krivelevich:
Very fast construction of bounded-degree spanning graphs via the semi-random graph process. CoRR abs/1907.08031 (2019) - [i13]Nicole Balashov, Reuven Cohen, Avieli Haber, Michael Krivelevich, Simi Haber:
Optimal shattering of complex networks. CoRR abs/1912.04044 (2019) - 2018
- [j170]Joseph Briggs, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh:
Packing Hamilton Cycles Online. Comb. Probab. Comput. 27(4): 475-495 (2018) - [j169]Malgorzata Bednarska-Bzdega, Michael Krivelevich, Viola Mészáros, Clément Requilé:
Proper colouring Painter-Builder game. Discret. Math. 341(3): 658-664 (2018) - [j168]Noga Alon, Michael Krivelevich:
Clique coloring of dense random graphs. J. Graph Theory 88(3): 428-433 (2018) - [j167]Lior Gishboliner, Michael Krivelevich, Gal Kronenberg:
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. Random Struct. Algorithms 52(4): 545-559 (2018) - [j166]Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov:
The random k-matching-free process. Random Struct. Algorithms 53(4): 692-716 (2018) - [j165]Michael Krivelevich:
Finding and Using Expanders in Locally Sparse Graphs. SIAM J. Discret. Math. 32(1): 611-623 (2018) - [j164]Lisa Espig, Alan M. Frieze, Michael Krivelevich:
Elegantly Colored Paths and Cycles in Edge Colored Random Graphs. SIAM J. Discret. Math. 32(3): 1585-1618 (2018) - [c30]Chris Dowden, Mihyun Kang, Michael Krivelevich:
The Genus of the Erdös-Rényi Random Graph and the Fragile Genus Property. AofA 2018: 17:1-17:13 - 2017
- [j163]Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Compatible Hamilton cycles in Dirac graphs. Comb. 37(4): 697-732 (2017) - [j162]Michael Krivelevich, Peleg Michaeli:
Small Subgraphs in the Trace of a Random Walk. Electron. J. Comb. 24(1): 1 (2017) - [j161]Dan Hefetz, Michael Krivelevich, Wei En Tan:
Waiter-Client and Client-Waiter Hamiltonicity games on random graphs. Eur. J. Comb. 63: 26-43 (2017) - [j160]Asaf Ferber, Michael Krivelevich, Benny Sudakov:
Counting and packing Hamilton cycles in dense graphs and oriented graphs. J. Comb. Theory B 122: 196-220 (2017) - [j159]Asaf Ferber, Michael Krivelevich, Gal Kronenberg:
Efficient Winning Strategies in Random-Turn Maker-Breaker Games. J. Graph Theory 85(2): 446-465 (2017) - [j158]Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira:
Finding paths in sparse random graphs requires many queries. Random Struct. Algorithms 50(1): 71-85 (2017) - [j157]Michael Krivelevich, Matthew Kwan, Benny Sudakov:
Bounded-Degree Spanning Trees in Randomly Perturbed Graphs. SIAM J. Discret. Math. 31(1): 155-171 (2017) - 2016
- [b1]Michael Krivelevich, Konstantinos Panagiotou, Mathew D. Penrose, Colin J. H. McDiarmid:
Random Graphs, Geometry and Asymptotic Structure. London Mathematical Society student texts 84, Cambridge University Press 2016, ISBN 978-1-316-50191-7, pp. 1-122 - [j156]Michael Krivelevich:
The Phase Transition in Site Percolation on Pseudo-Random Graphs. Electron. J. Comb. 23(1): 1 (2016) - [j155]Oren Dean, Michael Krivelevich:
Client-Waiter Games on Complete and Random Graphs. Electron. J. Comb. 23(4): 4 (2016) - [j154]Malgorzata Bednarska-Bzdega, Dan Hefetz, Michael Krivelevich, Tomasz Luczak:
Manipulative Waiters with Probabilistic Intuition. Comb. Probab. Comput. 25(6): 823-849 (2016) - [j153]Michael Krivelevich, Matthew Kwan, Benny Sudakov:
Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs. Comb. Probab. Comput. 25(6): 909-927 (2016) - [j152]Dan Hefetz, Michael Krivelevich, Wei En Tan:
Waiter-Client and Client-Waiter planarity, colorability and minor games. Discret. Math. 339(5): 1525-1536 (2016) - [j151]Dan Hefetz, Michael Krivelevich, Alon Naor, Milos Stojakovic:
On saturation games. Eur. J. Comb. 51: 315-335 (2016) - [j150]Michael Krivelevich, Bojan Mohar:
Editorial. J. Comb. Theory B 121: 1 (2016) - [j149]Nina Kamcev, Michael Krivelevich, Benny Sudakov:
Some Remarks on Rainbow Connectivity. J. Graph Theory 83(4): 372-383 (2016) - [j148]Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Compatible Hamilton cycles in random graphs. Random Struct. Algorithms 49(3): 533-557 (2016) - [j147]Asaf Ferber, Michael Krivelevich, Benny Sudakov, Pedro Vieira:
Finding Hamilton cycles in random graphs with few queries. Random Struct. Algorithms 49(4): 635-668 (2016) - [i12]Lior Gishboliner, Michael Krivelevich, Gal Kronenberg:
On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. CoRR abs/1603.04044 (2016) - 2015
- [j146]Michael Krivelevich, Gal Kronenberg:
Random-Player Maker-Breaker games. Electron. J. Comb. 22(4): 4 (2015) - [j145]Dániel Korándi, Michael Krivelevich, Benny Sudakov:
Decomposing Random Graphs into Few Cycles and Edges. Comb. Probab. Comput. 24(6): 857-872 (2015) - [j144]Nina Kamcev, Michael Krivelevich, Benny Sudakov:
Some Remarks on Rainbow Connectivity. Electron. Notes Discret. Math. 49: 123-131 (2015) - [j143]Michael Krivelevich, Matthew Kwan, Benny Sudakov:
Cycles and matchings in randomly perturbed digraphs and hypergraphs. Electron. Notes Discret. Math. 49: 181-187 (2015) - [j142]Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Long paths and cycles in random subgraphs of graphs with large minimum degree. Random Struct. Algorithms 46(2): 320-345 (2015) - [j141]Asaf Ferber, Roman Glebov, Michael Krivelevich, Alon Naor:
Biased games on random boards. Random Struct. Algorithms 46(4): 651-676 (2015) - [j140]Asaf Ferber, Michael Krivelevich, Humberto Naves:
Generating random graphs in biased Maker-Breaker games. Random Struct. Algorithms 47(4): 615-634 (2015) - [j139]Florent Foucaud, Michael Krivelevich, Guillem Perarnau:
Large Subgraphs without Short Cycles. SIAM J. Discret. Math. 29(1): 65-78 (2015) - [j138]Lisa Espig, Alan M. Frieze, Michael Krivelevich, Wesley Pegden:
Walker-Breaker Games. SIAM J. Discret. Math. 29(3): 1476-1485 (2015) - [j137]Michael Krivelevich, Daniel Reichman, Wojciech Samotij:
Smoothed Analysis on Connected Graphs. SIAM J. Discret. Math. 29(3): 1654-1669 (2015) - [c29]Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman:
Contagious Sets in Expanders. SODA 2015: 1953-1987 - 2014
- [j136]Michael Krivelevich, Wojciech Samotij:
Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-free Graphs. Electron. J. Comb. 21(1): 1 (2014) - [j135]Deepak Bal, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh:
Packing Tree Factors in Random and Pseudo-random Graphs. Electron. J. Comb. 21(2): 2 (2014) - [j134]Roman Glebov, Michael Krivelevich, Tibor Szabó:
On covering expander graphs by hamilton cycles. Random Struct. Algorithms 44(2): 183-200 (2014) - [c28]Michael Krivelevich, Daniel Reichman, Wojciech Samotij:
Smoothed Analysis on Connected Graphs. APPROX-RANDOM 2014: 810-825 - 2013
- [j133]Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron:
Comparing the strength of query types in property testing: The case of k-colorability. Comput. Complex. 22(1): 89-135 (2013) - [j132]Asaf Ferber, Roman Glebov, Michael Krivelevich, Hong Liu, Cory Palmer, Tomás Valla, Máté Vizer:
The Biased Odd Cycle Game. Electron. J. Comb. 20(2): 9 (2013) - [j131]Daniel Johannsen, Michael Krivelevich, Wojciech Samotij:
Expanders Are Universal for the Class of All Spanning Trees. Comb. Probab. Comput. 22(2): 253-281 (2013) - [j130]Alan M. Frieze, Michael Krivelevich:
On the Non-Planarity of a Random Subgraph. Comb. Probab. Comput. 22(5): 722-732 (2013) - [j129]Asaf Ferber, Michael Krivelevich, Alon Naor:
Avoider-Enforcer games played on edge disjoint hypergraphs. Discret. Math. 313(24): 2932-2941 (2013) - [j128]Michael Krivelevich, Eyal Lubetzky, Benny Sudakov:
Longest cycles in sparse random digraphs. Random Struct. Algorithms 43(1): 1-15 (2013) - [j127]Michael Krivelevich, Benny Sudakov:
The phase transition in random graphs: A simple proof. Random Struct. Algorithms 43(2): 131-138 (2013) - [j126]Roman Glebov, Michael Krivelevich:
On the Number of Hamilton Cycles in Sparse Random Graphs. SIAM J. Discret. Math. 27(1): 27-42 (2013) - [i11]Amin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman:
Contagious Sets in Expanders. CoRR abs/1306.2465 (2013) - 2012
- [j125]Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg:
Hierarchy Theorems for Property Testing. Comput. Complex. 21(1): 129-192 (2012) - [j124]Michael Krivelevich:
On the Number of Hamilton Cycles in Pseudo-Random Graphs. Electron. J. Comb. 19(1): 25 (2012) - [j123]Dennis Clemens, Asaf Ferber, Michael Krivelevich, Anita Liebenau:
Fast Strategies In Maker-Breaker Games Played on Random Boards. Comb. Probab. Comput. 21(6): 897-915 (2012) - [j122]Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov:
Biased orientation games. Discret. Math. 312(10): 1732-1742 (2012) - [j121]Asaf Ferber, Dan Hefetz, Michael Krivelevich:
Fast embedding of spanning trees in biased Maker-Breaker games. Eur. J. Comb. 33(6): 1086-1099 (2012) - [j120]Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov:
The size Ramsey number of a directed path. J. Comb. Theory B 102(3): 743-755 (2012) - [j119]Alan M. Frieze, Michael Krivelevich, Po-Shen Loh:
Variations on cops and robbers. J. Graph Theory 69(4): 383-402 (2012) - [j118]Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov:
Long cycles in subgraphs of (pseudo)random directed graphs. J. Graph Theory 70(3): 284-296 (2012) - [j117]Alan M. Frieze, Michael Krivelevich, Po-Shen Loh:
Packing tight Hamilton cycles in 3-uniform hypergraphs. Random Struct. Algorithms 40(3): 269-300 (2012) - [j116]Alan M. Frieze, Michael Krivelevich:
Packing hamilton cycles in random and pseudo-random hypergraphs. Random Struct. Algorithms 41(1): 1-22 (2012) - [j115]Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich:
Hitting time results for Maker-Breaker games. Random Struct. Algorithms 41(1): 23-46 (2012) - [j114]Dan Hefetz, Michael Krivelevich, Tibor Szabó:
Sharp threshold for the appearance of certain spanning trees in random graphs. Random Struct. Algorithms 41(4): 391-412 (2012) - [j113]Michael Krivelevich, Reto Spöhel:
Creating Small Subgraphs in Achlioptas Processes With Growing Parameter. SIAM J. Discret. Math. 26(2): 670-686 (2012) - [j112]Michael Krivelevich, Wojciech Samotij:
Optimal Packings of Hamilton Cycles in Sparse Random Graphs. SIAM J. Discret. Math. 26(3): 964-982 (2012) - [c27]Daniel Johannsen, Michael Krivelevich, Wojciech Samotij:
Expanders are universal for the class of all spanning trees. SODA 2012: 1539-1551 - 2011
- [j111]Noga Alon, Simi Haber, Michael Krivelevich:
The Number of f-Matchings in Almost Every Tree is a Zero Residue. Electron. J. Comb. 18(1) (2011) - [j110]Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov:
Local Resilience and Hamiltonicity Maker-Breaker Games in Random Regular Graphs. Comb. Probab. Comput. 20(2): 173-211 (2011) - [j109]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Global Maker-Breaker games on sparse graphs. Eur. J. Comb. 32(2): 162-177 (2011) - [j108]Dan Hefetz, Asaf Ferber, Michael Krivelevich:
Fast embedding of spanning trees in biased Maker-Breaker games. Electron. Notes Discret. Math. 38: 331-336 (2011) - [j107]Tom Bohman, Alan M. Frieze, Michael Krivelevich, Po-Shen Loh, Benny Sudakov:
Ramsey games with giants. Random Struct. Algorithms 38(1-2): 1-32 (2011) - [j106]Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald:
Regular induced subgraphs of a random Graph. Random Struct. Algorithms 38(3): 235-250 (2011) - [j105]Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov:
On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random Graphs. SIAM J. Discret. Math. 25(3): 1176-1193 (2011) - [c26]Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich:
Hitting time results for Maker-Breaker games. SODA 2011: 900-912 - [c25]Alan M. Frieze, Michael Krivelevich, Po-Shen Loh:
Packing tight Hamilton cycles in 3-uniform hypergraphs. SODA 2011: 913-932 - [i10]Sonny Ben-Shimon, Michael Krivelevich, Benny Sudakov:
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs. CoRR abs/1101.3099 (2011) - 2010
- [j104]Noga Alon, Dan Hefetz, Michael Krivelevich:
Playing to Retain the Advantage. Comb. Probab. Comput. 19(4): 481-491 (2010) - [j103]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Avoider-Enforcer: The rules of the game. J. Comb. Theory A 117(2): 152-163 (2010) - [j102]Michael Krivelevich, Raphael Yuster:
The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J. Graph Theory 63(3): 185-191 (2010) - [j101]Noga Alon, Sonny Ben-Shimon, Michael Krivelevich:
A note on regular Ramsey graphs. J. Graph Theory 64(3): 244-249 (2010) - [j100]Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik:
Why Almost All k-Colorable Graphs Are Easy to Color. Theory Comput. Syst. 46(3): 523-565 (2010) - [j99]Michael Krivelevich, Reto Spöhel, Angelika Steger:
Offline thresholds for Ramsey-type games on random graphs. Random Struct. Algorithms 36(1): 57-79 (2010) - [j98]Michael Krivelevich, Eyal Lubetzky, Benny Sudakov:
Hamiltonicity thresholds in Achlioptas processes. Random Struct. Algorithms 37(1): 1-24 (2010) - [j97]Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Resilient Pancyclicity of Random and Pseudorandom Graphs. SIAM J. Discret. Math. 24(1): 1-16 (2010) - [j96]Colin Cooper, Alan M. Frieze, Michael Krivelevich:
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. SIAM J. Discret. Math. 24(2): 558-569 (2010) - [j95]Michael Krivelevich:
Embedding Spanning Trees in Random Graphs. SIAM J. Discret. Math. 24(4): 1495-1500 (2010) - [p2]Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron:
Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability. Property Testing 2010: 253-259 - [p1]Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg:
Hierarchy Theorems for Property Testing. Property Testing 2010: 289-294 - [i9]Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich:
Hitting time results for Maker-Breaker games. CoRR abs/1008.1865 (2010)
2000 – 2009
- 2009
- [j94]Dan Hefetz, Michael Krivelevich, Tibor Szabó:
Hamilton cycles in highly connected and expanding graphs. Comb. 29(5): 547-568 (2009) - [j93]Ido Ben-Eliezer, Michael Krivelevich:
Perfectly Balanced Partitions of Smoothed Graphs. Electron. J. Comb. 16(1) (2009) - [j92]Michael Krivelevich, Benny Sudakov, Dan Vilenchik:
On the Random Satisfiable Process. Comb. Probab. Comput. 18(5): 775-801 (2009) - [j91]Sonny Ben-Shimon, Michael Krivelevich:
Random regular graphs of non-constant degree: Concentration of the chromatic number. Discret. Math. 309(12): 4149-4161 (2009) - [j90]Sonny Ben-Shimon, Michael Krivelevich:
Vertex percolation on expander graphs. Eur. J. Comb. 30(2): 339-350 (2009) - [j89]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Avoider-Enforcer: The Rules of the Game. Electron. Notes Discret. Math. 34: 261-265 (2009) - [j88]Dan Hefetz, Noga Alon, Michael Krivelevich:
Playing to retain the advantage. Electron. Notes Discret. Math. 34: 423-427 (2009) - [j87]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Fast Winning Strategies in Avoider-Enforcer Games. Graphs Comb. 25(4): 533-544 (2009) - [j86]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Fast winning strategies in Maker-Breaker games. J. Comb. Theory B 99(1): 39-47 (2009) - [j85]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
A sharp threshold for the Hamilton cycle Maker-Breaker game. Random Struct. Algorithms 34(1): 112-122 (2009) - [j84]Michael Krivelevich, Po-Shen Loh, Benny Sudakov:
Avoiding small subgraphs in Achlioptas processes. Random Struct. Algorithms 34(1): 165-195 (2009) - [j83]Michael Krivelevich, Balázs Patkós:
Equitable coloring of random graphs. Random Struct. Algorithms 35(1): 83-99 (2009) - [j82]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Spanning Directed Trees with Many Leaves. SIAM J. Discret. Math. 23(1): 466-476 (2009) - [c24]Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg:
Hierarchy Theorems for Property Testing. APPROX-RANDOM 2009: 504-519 - [c23]Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik:
On smoothed k-CNF formulas and the Walksat algorithm. SODA 2009: 451-460 - 2008
- [j81]Alan M. Frieze, Michael Krivelevich:
On Rainbow Trees and Cycles. Electron. J. Comb. 15(1) (2008) - [j80]Michael Krivelevich, Tibor Szabó:
Biased Positional Games and Small Hypergraphs with Large Covers. Electron. J. Comb. 15(1) (2008) - [j79]Ohad N. Feldheim, Michael Krivelevich:
Winning Fast in Sparse Graph Construction Games. Comb. Probab. Comput. 17(6): 781-791 (2008) - [j78]Itai Benjamini, Simi Haber, Michael Krivelevich, Eyal Lubetzky:
The isoperimetric constant of the random graph process. Random Struct. Algorithms 32(1): 101-114 (2008) - [j77]Simi Haber, Michael Krivelevich:
Corrigendum: On fractional K-factors of random graphs. Random Struct. Algorithms 33(4): 533-535 (2008) - [j76]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Planarity, Colorability, and Minor Games. SIAM J. Discret. Math. 22(1): 194-212 (2008) - [j75]Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron:
Testing Triangle-Freeness in General Graphs. SIAM J. Discret. Math. 22(2): 786-819 (2008) - [j74]Noga Alon, Michael Krivelevich, Benny Sudakov:
Large Nearly Regular Induced Subgraphs. SIAM J. Discret. Math. 22(4): 1325-1337 (2008) - [c22]Noga Alon, Ido Ben-Eliezer, Michael Krivelevich:
Small Sample Spaces Cannot Fool Low Degree Polynomials. APPROX-RANDOM 2008: 266-275 - [c21]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 - [i8]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Spanning directed trees with many leaves. CoRR abs/0803.0701 (2008) - [i7]Michael Krivelevich, Benny Sudakov, Dan Vilenchik:
On the random satisfiable process. CoRR abs/0807.4326 (2008) - [i6]Noga Alon, Sonny Ben-Shimon, Michael Krivelevich:
A note on regular Ramsey graphs. CoRR abs/0812.2386 (2008) - [i5]Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg:
Hierarchy Theorems for Property Testing. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j73]Noga Alon, Michael Krivelevich, Benny Sudakov:
Embedding nearly-spanning bounded degree trees. Comb. 27(6): 629-644 (2007) - [j72]Alan M. Frieze, Michael Krivelevich, Cliff Smyth:
On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. Comb. Probab. Comput. 16(5): 733-746 (2007) - [j71]Dan Hefetz, Michael Krivelevich, Tibor Szabó:
Bart-Moe games, JumbleG and discrepancy. Eur. J. Comb. 28(4): 1131-1143 (2007) - [j70]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Fast winning strategies in positional games. Electron. Notes Discret. Math. 29: 213-217 (2007) - [j69]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]. Inf. Comput. 205(7): 1114-1116 (2007) - [j68]Dan Hefetz, Michael Krivelevich, Tibor Szabó:
Avoider-Enforcer games. J. Comb. Theory A 114(5): 840-853 (2007) - [j67]Simi Haber, Michael Krivelevich:
On fractional K-factors of random graphs. Random Struct. Algorithms 30(4): 441-463 (2007) - [j66]Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraëte, Raphael Yuster:
Approximation algorithms and hardness results for cycle packing problems. ACM Trans. Algorithms 3(4): 48 (2007) - [c20]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Better Algorithms and Bounds for Directed Maximum Leaf Problems. FSTTCS 2007: 316-327 - [c19]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Parameterized Algorithms for Directed Maximum Leaf Problems. ICALP 2007: 352-362 - [c18]Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik:
Why Almost All k -Colorable Graphs Are Easy. STACS 2007: 121-132 - [i4]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Better Algorithms and Bounds for Directed Maximum Leaf Problems. CoRR abs/0707.1095 (2007) - [i3]Sonny Ben-Shimon, Michael Krivelevich:
Vertex Percolation on Expander Graphs. CoRR abs/0710.2296 (2007) - [i2]Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh:
Parameterized Algorithms for Directed Maximum Leaf Problems. CoRR abs/cs/0702049 (2007) - 2006
- [j65]Michael Krivelevich, Benny Sudakov:
Preface. Eur. J. Comb. 27(8): 1225-1226 (2006) - [j64]Nurit Gazit, Michael Krivelevich:
On the asymptotic value of the choice number of complete multi-partite graphs. J. Graph Theory 52(2): 123-134 (2006) - [j63]Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich:
On the random 2-stage minimum spanning tree. Random Struct. Algorithms 28(1): 24-36 (2006) - [j62]Alan M. Frieze, Michael Krivelevich:
Almost universal graphs. Random Struct. Algorithms 28(4): 499-510 (2006) - [j61]Michael Krivelevich, Benny Sudakov, Prasad Tetali:
On smoothed analysis in dense graphs and formulas. Random Struct. Algorithms 29(2): 180-193 (2006) - [j60]Michael Krivelevich, Asaf Nachmias:
Coloring complete bipartite graphs from random lists. Random Struct. Algorithms 29(4): 436-449 (2006) - [c17]Michael Krivelevich, Dan Vilenchik:
Semirandom Models as Benchmarks for Coloring Algorithms. ANALCO 2006: 211-221 - [c16]Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron:
Testing triangle-freeness in general graphs. SODA 2006: 279-288 - [c15]Michael Krivelevich, Dan Vilenchik:
Solving random satisfiable 3CNF formulas in expected polynomial time. SODA 2006: 454-463 - 2005
- [j59]Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó:
Discrepancy Games. Electron. J. Comb. 12 (2005) - [j58]Alan M. Frieze, Michael Krivelevich:
On packing Hamilton cycles in ?-regular graphs. J. Comb. Theory B 94(1): 159-172 (2005) - [j57]Joel Friedman, Andreas Goerdt, Michael Krivelevich:
Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. SIAM J. Comput. 35(2): 408-430 (2005) - [j56]Alan M. Frieze, Michael Krivelevich, Benny Sudakov:
The Strong Chromatic Index of Random Graphs. SIAM J. Discret. Math. 19(3): 719-727 (2005) - [j55]Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn:
Bounds on distance distributions in codes of known size. IEEE Trans. Inf. Theory 51(1): 250-258 (2005) - [j54]Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron:
Testing Reed-Muller codes. IEEE Trans. Inf. Theory 51(11): 4032-4039 (2005) - [c14]Michael Krivelevich, Zeev Nutov, Raphael Yuster:
Approximation algorithms for cycle packing problems. SODA 2005: 556-561 - [c13]Abraham D. Flaxman, Alan M. Frieze, Michael Krivelevich:
On the random 2-stage minimum spanning tree. SODA 2005: 919-926 - [i1]Sonny Ben-Shimon, Michael Krivelevich:
Random regular graphs of non-constant degree: Concentration of the chromatic number. CoRR abs/math/0511343 (2005) - 2004
- [j53]Michael Krivelevich, Benny Sudakov, Tibor Szabó:
Triangle Factors In Sparse Pseudo-Random Graphs. Comb. 24(3): 403-426 (2004) - [j52]Michael Krivelevich, Asaf Nachmias:
Colouring powers of cycles from random lists. Eur. J. Comb. 25(7): 961-968 (2004) - [j51]Noga Alon, Gregory Z. Gutin, Michael Krivelevich:
Algorithms with large domination ratio. J. Algorithms 50(1): 118-131 (2004) - [j50]Alan M. Frieze, Michael Krivelevich, Ryan R. Martin:
The emergence of a giant component in random subgraphs of pseudo-random graphs. Random Struct. Algorithms 24(1): 42-50 (2004) - [j49]Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan R. Martin:
Adding random edges to dense graphs. Random Struct. Algorithms 24(2): 105-117 (2004) - [j48]Tali Kaufman, Michael Krivelevich, Dana Ron:
Tight Bounds for Testing Bipartiteness in General Graphs. SIAM J. Comput. 33(6): 1441-1483 (2004) - [c12]Alexei Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn:
Bounds on distance distributions in codes of known size. ISIT 2004: 486 - 2003
- [j47]Michael Krivelevich, Benny Sudakov:
The Largest Eigenvalue Of Sparse Random Graphs. Comb. Probab. Comput. 12(1): 61-72 (2003) - [j46]Noga Alon, Michael Krivelevich, Benny Sudakov:
Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions. Comb. Probab. Comput. 12(5-6): 477-494 (2003) - [j45]Michael Krivelevich, Benny Sudakov:
Approximate coloring of uniform hypergraphs. J. Algorithms 49(1): 2-12 (2003) - [j44]Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov:
Maximum cuts and judicious partitions in graphs without short cycles. J. Comb. Theory B 88(2): 329-346 (2003) - [j43]Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn:
Generalized hashing and parent-identifying codes. J. Comb. Theory A 104(1): 207-215 (2003) - [j42]Michael Krivelevich, Benny Sudakov:
Sparse pseudo-random graphs are Hamiltonian. J. Graph Theory 42(1): 17-33 (2003) - [j41]Noga Alon, Michael Krivelevich, Benny Sudakov:
Induced subgraphs of prescribed size. J. Graph Theory 43(4): 239-251 (2003) - [j40]Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald:
On the probability of independent sets in random graphs. Random Struct. Algorithms 22(1): 1-14 (2003) - [j39]Michael Krivelevich, Benny Sudakov, Van H. Vu:
Covering codes with improved density. IEEE Trans. Inf. Theory 49(7): 1812-1815 (2003) - [c11]Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron:
Testing Low-Degree Polynomials over GF(2(. RANDOM-APPROX 2003: 188-199 - [c10]Tali Kaufman, Michael Krivelevich, Dana Ron:
Tight Bounds for Testing Bipartiteness in General Graphs. RANDOM-APPROX 2003: 341-353 - 2002
- [j38]Michael Krivelevich:
Sparse Graphs Usually Have Exponentially Many Optimal Colorings. Electron. J. Comb. 9(1) (2002) - [j37]Michael Krivelevich, Benny Sudakov, Van H. Vu:
A Sharp Threshold For Network Reliability. Comb. Probab. Comput. 11(5): 465-474 (2002) - [j36]Ron Aharoni, Ron Holzman, Michael Krivelevich, Roy Meshulam:
Fractional Planks. Discret. Comput. Geom. 27(4): 585-602 (2002) - [j35]Alan M. Frieze, Michael Krivelevich:
Hamilton cycles in random subgraphs of pseudo-random graphs. Discret. Math. 256(1-2): 137-150 (2002) - [j34]Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern:
Scalable Secure Storage When Half the System Is Faulty. Inf. Comput. 174(2): 203-213 (2002) - [j33]Michael Krivelevich:
Deciding k-colorability in expected polynomial time. Inf. Process. Lett. 81(1): 1-6 (2002) - [j32]Michael Krivelevich, Van H. Vu:
Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time. J. Comb. Optim. 6(2): 143-155 (2002) - [j31]Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali:
Two-coloring random hypergraphs. Random Struct. Algorithms 20(2): 249-259 (2002) - [j30]Noga Alon, Michael Krivelevich:
Testing k-colorability. SIAM J. Discret. Math. 15(2): 211-227 (2002) - [j29]David Burshtein, Michael Krivelevich, Simon Litsyn, Gadi Miller:
Upper bounds on the rate of LDPC Codes. IEEE Trans. Inf. Theory 48(9): 2437-2449 (2002) - 2001
- [j28]Michael Krivelevich, Ram Nathaniel, Benny Sudakov:
Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs. J. Algorithms 41(1): 99-113 (2001) - [j27]Michael Krivelevich, Van H. Vu:
Choosability in Random Hypergraphs. J. Comb. Theory B 83(2): 241-257 (2001) - [j26]Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald:
Random regular graphs of high degree. Random Struct. Algorithms 18(4): 346-363 (2001) - [c9]Michael Krivelevich, Ram Nathaniel, Benny Sudakov:
Approximating coloring and maximum independent sets in 3-uniform hypergraphs. SODA 2001: 327-328 - [c8]Andreas Goerdt, Michael Krivelevich:
Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods. STACS 2001: 294-304 - 2000
- [j25]Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy:
Efficient Testing of Large Graphs. Comb. 20(4): 451-476 (2000) - [j24]Michael Krivelevich:
The Choice Number Of Dense Random Graphs. Comb. Probab. Comput. 9(1): 19-26 (2000) - [j23]Noga Alon, Michael Krivelevich, Paul D. Seymour:
Long cycles in critical graphs. J. Graph Theory 35(3): 193-196 (2000) - [j22]Ehud Friedgut, Michael Krivelevich:
Sharp thresholds for certain Ramsey properties of random graphs. Random Struct. Algorithms 17(1): 1-19 (2000) - [j21]Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy:
Regular Languages are Testable with a Constant Number of Queries. SIAM J. Comput. 30(6): 1842-1862 (2000) - [c7]Michael Krivelevich, Van H. Vu:
Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time. ICALP 2000: 13-24 - [c6]Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali:
Two-coloring Random Hypergraphs. ICALP Satellite Workshops 2000: 85-96 - [c5]Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern:
Scalable Secure Storage when Half the System Is Faulty. ICALP 2000: 576-587
1990 – 1999
- 1999
- [j20]Noga Alon, Michael Krivelevich, Benny Sudakov:
List Coloring of Random and Pseudo-Random Graphs. Comb. 19(4): 453-472 (1999) - [j19]Noga Alon, Michael Krivelevich, Benny Sudakov:
Coloring Graphs with Sparse Neighborhoods. J. Comb. Theory B 77(1): 73-82 (1999) - [c4]Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy:
Regular Languages Are Testable with a Constant Number of Queries. FOCS 1999: 645-655 - [c3]Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy:
Efficient Testing of Large Graphs. FOCS 1999: 656-666 - 1998
- [j18]Michael Krivelevich:
An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs. Electron. J. Comb. 5 (1998) - [j17]Michael Krivelevich:
A lower bound for irredundant Ramsey numbers. Discret. Math. 183(1-3): 185-192 (1998) - [j16]Michael Krivelevich, Benny Sudakov:
Coloring Random Graphs. Inf. Process. Lett. 67(2): 71-74 (1998) - [j15]Michael Krivelevich, Benny Sudakov:
The chromatic numbers of random hypergraphs. Random Struct. Algorithms 12(4): 381-403 (1998) - [j14]Noga Alon, Michael Krivelevich, Benny Sudakov:
Finding a large hidden clique in a random graph. Random Struct. Algorithms 13(3-4): 457-466 (1998) - [c2]Michael Krivelevich, Benny Sudakov:
Approximate Coloring of Uniform Hypergraphs (Extended Abstract). ESA 1998: 477-489 - [c1]Noga Alon, Michael Krivelevich, Benny Sudakov:
Finding a Large Hidden Clique in a Random Graph. SODA 1998: 594-598 - 1997
- [j13]Noga Alon, Michael Krivelevich:
The Concentration of the Chromatic Number of Random Graphs. Comb. 17(3): 303-313 (1997) - [j12]Michael Krivelevich:
On the Minimal Number of Edges in Color-Critical Graphs. Comb. 17(3): 401-426 (1997) - [j11]Michael Krivelevich:
Triangle Factors in Random Graphs. Comb. Probab. Comput. 6(3): 337-347 (1997) - [j10]Michael Krivelevich:
Almost perfect matchings in random uniform hypergraphs. Discret. Math. 170(1-3): 259-263 (1997) - [j9]Noga Alon, Michael Krivelevich:
Constructive Bounds for a Ramsey-Type Problem. Graphs Comb. 13(3): 217-225 (1997) - [j8]Michael Krivelevich:
Approximate Set Covering in Uniform Hypergraphs. J. Algorithms 25(1): 118-143 (1997) - 1996
- [j7]Ron Aharoni, Ron Holzman, Michael Krivelevich:
On a Theorem of Lovász on Covers in tau-Partite Hypergraphs. Comb. 16(2): 149-174 (1996) - [j6]Noga Alon, Paul Erdös, Ron Holzman, Michael Krivelevich:
On k-saturated graphs with restrictions on the degrees. J. Graph Theory 23(1): 1-20 (1996) - [j5]Michael Krivelevich:
Perfect fractional matchings in random hypergraphs. Random Struct. Algorithms 9(3): 317-334 (1996) - 1995
- [j4]Michael Krivelevich:
On a conjecture of Tuza about packing and covering of triangles. Discret. Math. 142(1-3): 281-286 (1995) - [j3]Michael Krivelevich:
On the Edge Distribution in Triangle-free Graphs. J. Comb. Theory B 63(2): 245-260 (1995) - [j2]Michael Krivelevich:
Bounding Ramsey Numbers through Large Deviation Inequalities. Random Struct. Algorithms 7(2): 145-156 (1995) - 1994
- [j1]Michael Krivelevich:
Ks-Free Graphs Without Large Kr-Free Subgraphs. Comb. Probab. Comput. 3: 349-354 (1994)
Coauthor Index
[j199] [j177] [j174] [j166] [j163] [j160] [j158] [j157] [j153] [j149] [j148] [j147] [j145] [j144] [j143] [j142] [j128] [j127] [j122] [j120] [j118] [j110] [j107] [j106] [j105] [i10] [j98] [j97] [j92] [j84] [j74] [i7] [j73] [j65] [j61] [j56] [j53] [j47] [j46] [j45] [j44] [j42] [j41] [j40] [j39] [j37] [j28] [j26] [c9] [j20] [j19] [j16] [j15] [j14] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
