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
[2]
Hilfe
Suche: Author="Sz{\'e}kely, L.A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Two counterexamples in graph drawing
O. Sýkora
,
L.A. Székely
,
I. Vrt'o
Lecture Notes in Computer Science
2573
, 2002, pp. 391-398
A linear time algorithm for graph partition problems
L.H. Clark
,
F. Shahrokhi
,
L.A. Székely
Information Processing Letters
42
, 1992, pp. 19-24
Sharpening the LYM inequality
Péter L. Erdös
,
P. Frankl
,
D.J. Kleitman
,
M.E. Saks
,
L.A. Székely
Combinatorica
12
, 1992, pp. 287-293
Threshold functions for local properties of graphs: triangles
L.H. Clark
,
R.C. Entringer
,
L.A. Székely
Discrete Applied Mathematics
34
, 1991, pp. 83-105
On the distribution of lengths of evolutionary trees
M. Carter
,
M. Hendy
,
D. Penny
,
L.A. Székely
,
N.C. Wormald
SIAM Journal on Discrete Mathematics
3
(1), 1990, February, pp. 38-47
Common origin of cubic binomial identities; a generalization of Surányi's proof on Le Jen Shoo's formula
L.A. Székely
Journal of Combinatorial Theory Series A
40
, 1985, pp. 171-174
Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space
L.A. Székely
Combinatorica
4
, 1984, pp. 213-218
On the number of homogeneous subgraphs of a graph
L.A. Székely
Combinatorica
4
, 1984, pp. 363-372