Laszlo  A. Szekely
Title
Cited by
Cited by
Year
Crossing numbers and hard Erdős problems in discrete geometry
LA Székely
Combinatorics, Probability and Computing 6 (3), 353-358, 1997
3831997
A few logs suffice to build (almost) all trees: Part II
PL Erdös, MA Steel, LA Székely, TJ Warnow
Theoretical Computer Science 221 (1-2), 77-118, 1999
2621999
Connected gene neighborhoods in prokaryotic genomes
IB Rogozin, KS Makarova, J Murvai, E Czabarka, YI Wolf, RL Tatusov, ...
Nucleic acids research 30 (10), 2212-2223, 2002
2142002
Wiener index versus maximum degree in trees
M Fischermann, A Hoffmann, D Rautenbach, L Székely, L Volkmann
Discrete Applied Mathematics 122 (1-3), 127-137, 2002
1992002
A few logs suffice to build (almost) all trees (I)
PL Erdős, MA Steel, LA Székely, TJ Warnow
Random Structures & Algorithms 14 (2), 153-184, 1999
1911999
Erdős on unit distances and the Szemerédi-Trotter theorems
LA Székely
1642002
On subtrees of trees
LA Székely, H Wang
Advances in Applied Mathematics 34 (1), 138-155, 2005
1342005
Reconstructing trees when sequence sites evolve at variable rates
MA Steel, LA Székely, MD Hendy
Journal of Computational Biology 1 (2), 153-163, 1994
1181994
A successful concept for measuring non-planarity of graphs: the crossing number
LA Székely
Discrete Mathematics 276 (1-3), 331-352, 2004
992004
A successful concept for measuring non-planarity of graphs: the crossing number
LA Székely
Discrete Mathematics 276 (1-3), 331-352, 2004
992004
Fourier calculus on evolutionary trees
MA Steel, LA Székely, PL Erdős
Adv Appl Math 14, 200-216, 1993
901993
On bipartite drawings and the linear arrangement problem
F Shahrokhi, O Sýkora, LA Székely, I Vrto
SIAM Journal on Computing 30 (6), 1773-1789, 2001
852001
Degree-based graph construction
H Kim, Z Toroczkai, PL Erdős, I Miklós, LA Székely
Journal of Physics A: Mathematical and Theoretical 42 (39), 392001, 2009
822009
The book crossing number of a graph
F Shahrokhi, LA Székely, O Sýkora, I Vrt'o
Journal of Graph Theory 21 (4), 413-424, 1996
651996
Inverting random functions II: Explicit bounds for discrete maximum likelihood estimation, with applications
MA Steel, LA Székely
SIAM Journal on Discrete Mathematics 15 (4), 562-575, 2002
642002
Crossing numbers: bounds and applications
F Shahrokhi, O Sýkora, LA Székely, I Vrt’o
Intuitive geometry 6, 179-206, 1995
631995
Crossing numbers: bounds and applications
F Shahrokhi, O Sýkora, LA Székely, I Vrt’o
Intuitive geometry 6, 179-206, 1995
631995
Constructing big trees from short sequences
PL Erdös, MA Steel, LA Székely, TJ Warnow
International Colloquium on Automata, Languages, and Programming, 827-837, 1997
621997
On the Wiener index of trees from certain families
RC Entringer, A Meir, JW Moon, LA Székely
AUSTRALASIAN JOURNAL OF COMBINATORICS 10 (1994). 00.211-224, 1994
601994
On the distribution of lengths of evolutionary trees
M Carter, M Hendy, D Penny, LA Szekely, NC Wormald
SIAM Journal on Discrete Mathematics 3 (1), 38-47, 1990
591990
The system can't perform the operation now. Try again later.
Articles 1–20