SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Miklós Simonovits: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

János Komlós, Ali Shokoufandeh, Miklós Simonovits, Endre Szemerédi
The Regularity Lemma and Its Applications in Graph Theory. [Citation Graph (0, 0)][DBLP]
Theoretical Aspects of Computer Science, 2000, pp:84-112 [Conf]
Andreas Brieden, Peter Gritzmann, Ravi Kannan, Victor Klee, László Lovász, Miklós Simonovits
Approximation of Diameters: Randomization Doesn't Help. [Citation Graph (0, 0)][DBLP]
FOCS, 1998, pp:244-251 [Conf]
László Lovász, Miklós Simonovits
The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume [Citation Graph (0, 0)][DBLP]
FOCS, 1990, pp:346-354 [Conf]
László Lovász, Miklós Simonovits
On the Randomized Complexity of Volume and Diameter [Citation Graph (0, 0)][DBLP]
FOCS, 1992, pp:482-491 [Conf]
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. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1993, v:13, n:1, pp:31-56 [Journal]
Paul Erdös, Miklós Simonovits
Compactness results in extremal graph theory. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1982, v:2, n:3, pp:275-288 [Journal]
Paul Erdös, Miklós Simonovits
Supersaturated graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1983, v:3, n:2, pp:181-192 [Journal]
Ralph J. Faudree, Miklós Simonovits
On a class of degenerate extremal graph problems. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1983, v:3, n:1, pp:83-93 [Journal]
Miklós Simonovits, Vera T. Sós
On restricted colourings of K_n. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1984, v:4, n:1, pp:101-110 [Journal]
Miklós Simonovits, Vera T. Sós
Hereditarily Extended Properties, Quasi-Random Graphs and not Necessarily Induced Subgraphs. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1997, v:17, n:4, pp:577-596 [Journal]
Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits
The Tura'n Density of the Hypergraph {abc, ade, bde, cde}. [Citation Graph (0, 0)][DBLP]
Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
Turán-Ramsey Theorems and K^p-Independence Numbers. [Citation Graph (0, 0)][DBLP]
Combinatorics, Probability & Computing, 1994, v:3, n:, pp:297-325 [Journal]
Zoltán Füredi, Miklós Simonovits
Triple Systems Not Containing a Fano Configuration. [Citation Graph (0, 0)][DBLP]
Combinatorics, Probability & Computing, 2005, v:14, n:4, pp:467-484 [Journal]
Miklós Simonovits, Vera T. Sós
Hereditary Extended Properties, Quasi-Random Graphs And Induced Subgraphs. [Citation Graph (0, 0)][DBLP]
Combinatorics, Probability & Computing, 2003, v:12, n:3, pp:- [Journal]
Ravi Kannan, László Lovász, Miklós Simonovits
Isoperimetric Problems for Convex Bodies and a Localization Lemama. [Citation Graph (0, 0)][DBLP]
Discrete & Computational Geometry, 1995, v:13, n:, pp:541-559 [Journal]
Miklós Simonovits, Vera T. Sós
Ramsey-Turán theory. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2001, v:229, n:1-3, pp:293-340 [Journal]
Miklós Simonovits, Vera T. Sós
A hierarchy of randomness for graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2005, v:303, n:1-3, pp:209-233 [Journal]
József Balogh, Béla Bollobás, Miklós Simonovits
The number of graphs without forbidden subgraphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:1-24 [Journal]
Rainer Dietmann, Christian Elsholtz, Katalin Gyarmati, Miklós Simonovits
Shifted products that are coprime pure powers. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 2005, v:111, n:1, pp:24-36 [Journal]
R. L. Graham, Miklós Simonovits, Vera T. Sós
A Note on the Intersection Properties of Subsets of Integers. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1980, v:28, n:1, pp:106-110 [Journal]
Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan
The Ramsey number for hypergraph cycles I. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 2006, v:113, n:1, pp:67-83 [Journal]
Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits
4-Books of three pages. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 2006, v:113, n:5, pp:882-891 [Journal]
Ravi Kannan, László Lovász, Miklós Simonovits
Random walks and an O^*(n⁵) volume algorithm for convex bodies. [Citation Graph (0, 0)][DBLP]
Random Struct. Algorithms, 1997, v:11, n:1, pp:1-50 [Journal]
László Lovász, Miklós Simonovits
Random Walks in a Convex Body and an Improved Volume Algorithm. [Citation Graph (0, 0)][DBLP]
Random Struct. Algorithms, 1993, v:4, n:4, pp:359-412 [Journal]
Miklós Simonovits, Vera T. Sós
Szemerédi's Partition and Quasirandomness. [Citation Graph (0, 0)][DBLP]
Random Struct. Algorithms, 1991, v:2, n:1, pp:1-10 [Journal]
Dwight Duffus, Ivan Rival, Miklós Simonovits
Spanning retracts of a partially ordered set. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1980, v:32, n:1, pp:1-7 [Journal]
W. G. Brown, Miklós Simonovits
Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1984, v:48, n:2-3, pp:147-162 [Journal]
A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have? [Citation Graph (, )][DBLP]
On the minimum degree forcing F-free graphs to be (nearly) bipartite. [Citation Graph (, )][DBLP]

Search in 0.006secs, Finished in 0.008secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP