Laszlo  A. Szekely
Laszlo A. Szekely
確認したメール アドレス: math.sc.edu - ホームページ
タイトル
引用先
引用先
Crossing numbers and hard Erdős problems in discrete geometry
LA Székely
Combinatorics, Probability and Computing 6 (3), 353-358, 1997
3721997
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
2122002
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
1972002
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
1871999
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
1721999
Erdős on unit distances and the Szemerédi-Trotter theorems
LA Székely
1612002
On subtrees of trees
LA Székely, H Wang
Advances in Applied Mathematics 34 (1), 138-155, 2005
1282005
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
1151994
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
1051999
A successful concept for measuring non-planarity of graphs: the crossing number
LA Székely
Discrete Mathematics 276 (1-3), 331-352, 2004
982004
A successful concept for measuring non-planarity of graphs: the crossing number
LA Székely
Discrete Mathematics 276 (1-3), 331-352, 2004
982004
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
872001
Fourier calculus on evolutionary trees
MA Steel, LA Székely, PL Erdős
Adv Appl Math 14, 200-216, 1993
871993
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
782009
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
611995
Crossing numbers: bounds and applications
F Shahrokhi, O Sýkora, LA Székely, I Vrt’o
Intuitive geometry 6, 179-206, 1995
611995
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
601997
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
601990
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
591996
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20