Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Simonovits, Mikl{\'{o}}s"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation of diameters: Randomization doesn't help
Andreas Brieden
,
Peter Gritzmann
,
Ravi Kannan
,
Victor Klee
,
László Lovász
,
Miklós Simonovits
Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98 (Palo Alto, California, November 8-11, 1998)
, 1998, pp. 244-251
Extremal graphs with bounded densities of small subgraphs
Jerrold R. Griggs
,
Miklós Simonovits
,
George Rubin Thomas
Journal of Graph Theory
29
(3), 1998, pp. 185-207
Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
Miklós Simonovits
,
Vera T. Sós
Combinatorica
17
(4), 1997, pp. 577-596
On the maximal number of certain subgraphs in
K_r
-free graphs
Ervin Györi
,
János Pach
,
Miklós Simonovits
Graphs and Combinatorics
7
, 1991, pp. 31-37
Extremal subgraphs of random graphs
László Babai
,
Miklós Simonovits
,
Joel Spencer
Journal of Graph Theory
14
(5), 1990, pp. 599-622