dblp.uni-trier.dewww.uni-trier.de

Miklós Simonovits

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
31EEJózsef Balogh, Béla Bollobás, Miklós Simonovits: The typical structure of graphs without given excluded subgraphs. Random Struct. Algorithms 34(3): 305-318 (2009)
2008
30EETomasz Luczak, Miklós Simonovits: On the minimum degree forcing F-free graphs to be (nearly) bipartite. Discrete Mathematics 308(17): 3998-4002 (2008)
2006
29EEPenny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan: The Ramsey number for hypergraph cycles I. J. Comb. Theory, Ser. A 113(1): 67-83 (2006)
28EEZoltán Füredi, Oleg Pikhurko, Miklós Simonovits: 4-Books of three pages. J. Comb. Theory, Ser. A 113(5): 882-891 (2006)
2005
27EEZoltán Füredi, Miklós Simonovits: Triple Systems Not Containing a Fano Configuration. Combinatorics, Probability & Computing 14(4): 467-484 (2005)
26EEMiklós Simonovits, Vera T. Sós: A hierarchy of randomness for graphs. Discrete Mathematics 303(1-3): 209-233 (2005)
25EEYoshiharu Kohayakawa, Miklós Simonovits, Jozef Skokan: The 3-colored Ramsey number of odd cycles. Electronic Notes in Discrete Mathematics 19: 397-402 (2005)
24EERainer Dietmann, Christian Elsholtz, Katalin Gyarmati, Miklós Simonovits: Shifted products that are coprime pure powers. J. Comb. Theory, Ser. A 111(1): 24-36 (2005)
2004
23EEJózsef Balogh, Béla Bollobás, Miklós Simonovits: The number of graphs without forbidden subgraphs. J. Comb. Theory, Ser. B 91(1): 1-24 (2004)
2003
22 Miklós Simonovits, Vera T. Sós: Hereditary Extended Properties, Quasi-Random Graphs And Induced Subgraphs. Combinatorics, Probability & Computing 12(3): (2003)
21EEZoltán Füredi, Oleg Pikhurko, Miklós Simonovits: The Tura'n Density of the Hypergraph {abc, ade, bde, cde}. Electr. J. Comb. 10: (2003)
20EEMiklós Simonovits, Vera T. Sós: Different levels of randomness in Random Ramsey theorems. Electronic Notes in Discrete Mathematics 15: 189-192 (2003)
2001
19EEMiklós Simonovits, Vera T. Sós: Ramsey-Turán theory. Discrete Mathematics 229(1-3): 293-340 (2001)
2000
18EEJános Komlós, Ali Shokoufandeh, Miklós Simonovits, Endre Szemerédi: The Regularity Lemma and Its Applications in Graph Theory. Theoretical Aspects of Computer Science 2000: 84-112
1998
17EEAndreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits: Approximation of Diameters: Randomization Doesn't Help. FOCS 1998: 244-251
1997
16 Miklós Simonovits, Vera T. Sós: Hereditarily Extended Properties, Quasi-Random Graphs and not Necessarily Induced Subgraphs. Combinatorica 17(4): 577-596 (1997)
15 Ravi Kannan, László Lovász, Miklós Simonovits: Random walks and an O*(n5) volume algorithm for convex bodies. Random Struct. Algorithms 11(1): 1-50 (1997)
1995
14 Ravi Kannan, László Lovász, Miklós Simonovits: Isoperimetric Problems for Convex Bodies and a Localization Lemama. Discrete & Computational Geometry 13: 541-559 (1995)
1994
13 Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi: Turán-Ramsey Theorems and Kp-Independence Numbers. Combinatorics, Probability & Computing 3: 297-325 (1994)
1993
12 Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi: Turán-Ramsey theorems and simple asymptotically extremal structures. Combinatorica 13(1): 31-56 (1993)
11 László Lovász, Miklós Simonovits: Random Walks in a Convex Body and an Improved Volume Algorithm. Random Struct. Algorithms 4(4): 359-412 (1993)
1992
10 László Lovász, Miklós Simonovits: On the Randomized Complexity of Volume and Diameter FOCS 1992: 482-491
1991
9 Miklós Simonovits, Vera T. Sós: Szemerédi's Partition and Quasirandomness. Random Struct. Algorithms 2(1): 1-10 (1991)
1990
8 László Lovász, Miklós Simonovits: The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume FOCS 1990: 346-354
1984
7 Miklós Simonovits, Vera T. Sós: On restricted colourings of Kn. Combinatorica 4(1): 101-110 (1984)
6EEW. G. Brown, Miklós Simonovits: Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures. Discrete Mathematics 48(2-3): 147-162 (1984)
1983
5 Ralph J. Faudree, Miklós Simonovits: On a class of degenerate extremal graph problems. Combinatorica 3(1): 83-93 (1983)
4 Paul Erdös, Miklós Simonovits: Supersaturated graphs and hypergraphs. Combinatorica 3(2): 181-192 (1983)
1982
3 Paul Erdös, Miklós Simonovits: Compactness results in extremal graph theory. Combinatorica 2(3): 275-288 (1982)
1980
2EEDwight Duffus, Ivan Rival, Miklós Simonovits: Spanning retracts of a partially ordered set. Discrete Mathematics 32(1): 1-7 (1980)
1 R. L. Graham, Miklós Simonovits, Vera T. Sós: A Note on the Intersection Properties of Subsets of Integers. J. Comb. Theory, Ser. A 28(1): 106-110 (1980)

Coauthor Index

1József Balogh [23] [31]
2Béla Bollobás [23] [31]
3Andreas Brieden [17]
4W. G. Brown [6]
5Rainer Dietmann [24]
6Dwight Duffus [2]
7Christian Elsholtz [24]
8Paul Erdös [3] [4] [12] [13]
9Ralph J. Faudree [5]
10Zoltán Füredi [21] [27] [28]
11R. L. Graham [1]
12Peter Gritzmann [17]
13Katalin Gyarmati [24]
14András Hajnal [12] [13]
15Penny E. Haxell [29]
16Ravi Kannan (Ravindran Kannan) [14] [15] [17]
17Victor Klee [17]
18Yoshiharu Kohayakawa [25]
19János Komlós [18]
20László Lovász [8] [10] [11] [14] [15] [17]
21Tomasz Luczak [29] [30]
22Yuejian Peng [29]
23Oleg Pikhurko [21] [28]
24Ivan Rival [2]
25Vojtech Rödl [29]
26Andrzej Rucinski [29]
27Ali Shokoufandeh [18]
28Jozef Skokan [25] [29]
29Vera T. Sós [1] [7] [9] [12] [13] [16] [19] [20] [22] [26]
30Endre Szemerédi [12] [13] [18]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)