Measurable chromatic number of geometric graphs and sets without some distnaces in euclidean space. - László A. Székely (Comb., 1984)

On the number of homogeneous subgraphs of a graph. - László A. Székely (Comb., 1984)

Common Origin of Cubic Binomial Identities; A Generalization of Surányi's Proof on Le Jen Shoo's Formula. - László A. Székely (J. Comb. Theory A, 1985)

Bounds on the measurable chromatic number of Rn. - László A. Székely; Nicholas C. Wormald (Discret. Math., 1989)

On the Distribution of Lengths of Evolutionary Trees. - M. Carter; Michael D. Hendy; David Penny; László A. Székely; Nicholas C. Wormald (SIAM J. Discret. Math., 1990)

Extremal problems for local properties of graphs. - Lane H. Clark; Roger C. Entringer; Joseph E. McCanna; László A. Székely (Australas. J Comb., 1991)

Threshold functions for local properties of graphs: triangles. - Lane H. Clark; Roger C. Entringer; László A. Székely (Discret. Appl. Math., 1991)

Algorithms and Min-max Theorems for Certain Multiway Cuts. - Péter L. Erdös; László A. Székely (IPCO, 1992)

Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry. - Farhad Shahrokhi; László A. Székely (IPCO, 1992)

Sharpening the LYM inequality. - Péter L. Erdös; Peter Frankl; Daniel J. Kleitman; Michael E. Saks; László A. Székely (Comb., 1992)

An inequality for degree sequences. - László A. Székely; Lane H. Clark; Roger C. Entringer (Discret. Math., 1992)

A Linear Time Algorithm for Graph Partition Problems. - Lane H. Clark; Farhad Shahrokhi; László A. Székely (Inf. Process. Lett., 1992)

Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version). - Farhad Shahrokhi; László A. Székely (WG, 1993)

Improving Bounds for the Crossing Numbers on Surfaces of Genus g. - Farhad Shahrokhi; László A. Székely; Ondrej Sýkora; Imrich Vrto (WG, 1993)

Counting Bichromatic Evolutionary Trees. - Péter L. Erdös; László A. Székely (Discret. Appl. Math., 1993)

Crossing Numbers of Graphs, Lower Bound Techniques. - Farhad Shahrokhi; László A. Székely; Imrich Vrto (GD, 1994)

Book Embeddings and Crossing Numbers. - Farhad Shahrokhi; Ondrej Sýkora; László A. Székely; Imrich Vrto (WG, 1994)

On the Wiener index of trees from certain families. - Roger C. Entringer; Amram Meir; John W. Moon; László A. Székely (Australas. J Comb., 1994)

On Intersecting Chains in Boolean Algebras. - Péter L. Erdös; Ákos Seress; László A. Székely (Comb. Probab. Comput., 1994)

On Canonical Concurrent Flows, Crossing Number and Graph Expansion. - Farhad Shahrokhi; László A. Székely (Comb. Probab. Comput., 1994)

Subdivision thresholds for two classes of graphs. - Curtis A. Barefoot; Lane H. Clark; A. J. Depew; Roger C. Entringer; László A. Székely (Discret. Math., 1994)

Reconstructing Trees When Sequence Sites Evolve at Variable Rates. - Mike A. Steel; László A. Székely; Michael D. Hendy (J. Comput. Biol., 1994)

On weighted multiway cuts in trees. - Péter L. Erdös; László A. Székely (Math. Program., 1994)

Crossing Numbers of Meshes. - Farhad Shahrokhi; Ondrej Sýkora; László A. Székely; Imrich Vrto (GD, 1995)

Drawings of Graphs on Surfaces with Few Crossings. - Farhad Shahrokhi; László A. Székely; Ondrej Sýkora; Imrich Vrto (Algorithmica, 1996)

Cycle-saturated graphs of minimum size. - Curtis A. Barefoot; Lane H. Clark; Roger C. Entringer; T. D. Porter; László A. Székely; Zsolt Tuza (Discret. Math., 1996)

The book crossing number of a graph. - Farhad Shahrokhi; László A. Székely; Ondrej Sýkora; Imrich Vrt'o (J. Graph Theory, 1996)

Bipartite Crossing Numbers of Meshes and Hypercubes. - Farhad Shahrokhi; Ondrej Sýkora; László A. Székely; Imrich Vrto (GD, 1997)

Constructing Big Trees from Short Sequences. - Péter L. Erdös; Mike A. Steel; László A. Székely; Tandy J. Warnow (ICALP, 1997)

On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem. - Farhad Shahrokhi; Ondrej Sýkora; László A. Székely; Imrich Vrto (WADS, 1997)

Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule. - Péter L. Erdös; Mike A. Steel; László A. Székely; Tandy J. Warnow (Comput. Artif. Intell., 1997)

Intersecting Systems. - Rudolf Ahlswede; Noga Alon; Péter L. Erdös; Miklós Ruszinkó; László A. Székely (Comb. Probab. Comput., 1997)

Crossing Numbers and Hard Erdös Problems in Discrete Geometry. - László A. Székely (Comb. Probab. Comput., 1997)

Extremal Values for Ratios of Distances in Trees. - Curtis A. Barefoot; Roger C. Entringer; László A. Székely (Discret. Appl. Math., 1997)

On Dense Bipartite Graphs of Girth Eight and Upper Bounds for Certain Configurations in Planar Point-Line Systems. - D. de Caen; László A. Székely (J. Comb. Theory A, 1997)

Integral Uniform Flows in Symmetric Networks. - Farhad Shahrokhi; László A. Székely (WG, 1998)

Minimum Multiway Cuts in Trees. - Péter L. Erdös; András Frank; László A. Székely (Discret. Appl. Math., 1998)

Intersection of Curves and Crossing Number of Cm x Cn on Surfaces. - Farhad Shahrokhi; Ondrej Sýkora; László A. Székely; Imrich Vrto (Discret. Comput. Geom., 1998)

A few logs suffice to build (almost) all trees (I). - Péter L. Erdös; Michael Anthony Steel; László A. Székely; Tandy J. Warnow (Random Struct. Algorithms, 1999)

A Few Logs Suffice to Build (almost) All Trees: Part II. - Péter L. Erdös; Michael Anthony Steel; László A. Székely; Tandy J. Warnow (Theor. Comput. Sci., 1999)

Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets. - Péter L. Erdös; Ákos Seress; László A. Székely (Comb., 2000)

A successful concept for measuring non-planarity of graphs: the crossing number. - László A. Székely (Electron. Notes Discret. Math., 2000)

On Bipartite Drawings and the Linear Arrangement Problem. - Farhad Shahrokhi; Ondrej Sýkora; László A. Székely; Imrich Vrto (SIAM J. Comput., 2000)

A new lower bound for the bipartite crossing number with applications. - Farhad Shahrokhi; Ondrej Sýkora; László A. Székely; Imrich Vrto (Theor. Comput. Sci., 2000)

Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem. - Ralph Howard; Gyula Károlyi; László A. Székely (Electron. J. Comb., 2001)

Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem. - Farhad Shahrokhi; László A. Székely (Discret. Appl. Math., 2001)

Fractional Lengths and Crossing Numbers. - Ondrej Sýkora; László A. Székely; Imrich Vrto (GD, 2002)

Two Counterexamples in Graph Drawing. - Ondrej Sýkora; László A. Székely; Imrich Vrto (WG, 2002)

Wiener index versus maximum degree in trees. - Miranca Fischermann; Arne Hoffmann; Dieter Rautenbach; László A. Székely; Lutz Volkmann (Discret. Appl. Math., 2002)

Guest Editors' Foreword. - Farhad Shahrokhi; László A. Székely (Discret. Comput. Geom., 2002)

Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications. - Michael Anthony Steel; László A. Székely (SIAM J. Discret. Math., 2002)

Bounds for Convex Crossing Numbers. - Farhad Shahrokhi; Ondrej Sýkora; László A. Székely; Imrich Vrto (COCOON, 2003)

Bounds and Methods for k-Planar Crossing Numbers. - Farhad Shahrokhi; Ondrej Sýkora; László A. Székely; Imrich Vrto (GD, 2003)

Counting rooted spanning forests in complete multipartite graphs. - László A. Székely (Ars Comb., 2004)

Outerplanar Crossing Numbers, the Circular Arrangement Problem and Isoperimetric Functions. - Éva Czabarka; Ondrej Sýkora; László A. Székely; Imrich Vrt'o (Electron. J. Comb., 2004)

A note on Halton's conjecture. - Ondrej Sýkora; László A. Székely; Imrich Vrto (Inf. Sci., 2004)

Progress on Crossing Number Problems. - László A. Székely (SOFSEM, 2005)

On subtrees of trees. - László A. Székely; Hua Wang (Adv. Appl. Math., 2005)

Using Lovász Local Lemma in the Space of Random Injections. - Linyuan Lu; László A. Székely (Electron. J. Comb., 2007)

Teasing Apart Two Trees. - Mike A. Steel; László A. Székely (Comb. Probab. Comput., 2007)

On k-planar crossing numbers. - Farhad Shahrokhi; Ondrej Sýkora; László A. Székely; Imrich Vrto (Discret. Appl. Math., 2007)

Binary trees with the largest number of subtrees. - László A. Székely; Hua Wang (Discret. Appl. Math., 2007)

Graph minors and the crossing number of graphs. - Drago Bokal; Éva Czabarka; László A. Székely; Imrich Vrto (Electron. Notes Discret. Math., 2007)

SPT(q, k, n)-Codes. - Attila Sali; László A. Székely (Electron. Notes Discret. Math., 2007)

On the Existence of Armstrong Instances with Bounded Domains. - Attila Sali; László A. Székely (FoIKS, 2008)

An optimality criterion for the crossing number. - László A. Székely (Ars Math. Contemp., 2008)

Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method. - Éva Czabarka; Ondrej Sýkora; László A. Székely; Imrich Vrto (Random Struct. Algorithms, 2008)

An improved bound on the maximum agreement subtree problem. - Mike A. Steel; László A. Székely (Appl. Math. Lett., 2009)

The inverse problem for certain tree parameters. - Éva Czabarka; László A. Székely; Stephan G. Wagner (Discret. Appl. Math., 2009)

Diameter of 4-colourable graphs. - Éva Czabarka; Peter Dankelmann; László A. Székely (Eur. J. Comb., 2009)

A note on full transversals and mixed orthogonal arrays. - Harout K. Aydinian; Éva Czabarka; Konrad Engel; Péter L. Erdös; László A. Székely (Australas. J Comb., 2010)

General Lower Bounds for the Minor Crossing Number of Graphs. - Drago Bokal; Éva Czabarka; László A. Székely; Imrich Vrt'o (Discret. Comput. Geom., 2010)

The sum of the distances between the leaves of a tree and the 'semi-regular' property. - László A. Székely; Hua Wang 003; Taoyang Wu (Discret. Math., 2011)

A tour of M-part L-Sperner families. - Harout K. Aydinian; Éva Czabarka; Péter L. Erdös; László A. Székely (J. Comb. Theory A, 2011)

Minimizing the number of episodes and Gallai's theorem on intervals - Éva Czabarka; László A. Székely; Todd J. Vision (CoRR, 2012)

Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals. - Harout K. Aydinian; Éva Czabarka; László A. Székely (Information Theory, Combinatorics, and Search Theory, 2013)

Threshold Functions for Distinct Parts: Revisiting Erdős-Lehner. - Éva Czabarka; Matteo Marsili; László A. Székely (Information Theory, Combinatorics, and Search Theory, 2013)

Extremal Values of Ratios: Distance Problems vs. Subtree Problems in Trees. - László A. Székely; Hua Wang (Electron. J. Comb., 2013)

Dominating Scale-Free Networks Using Generalized Probabilistic Methods. - F. Molnár Jr.; Noemi Derzsy; Éva Czabarka; László A. Székely; Boleslaw K. Szymanski; György Korniss (CoRR, 2014)

Extremal values of ratios: Distance problems vs. subtree problems in trees II. - László A. Székely; Hua Wang (Discret. Math., 2014)

Eccentricity sums in trees. - Heather C. Smith; László A. Székely; Hua Wang 003 (Discret. Appl. Math., 2016)

On the Number of Non-Zero Elements of Joint Degree Vectors. - Éva Czabarka; Johannes Rauh; Kayvan Sadeghi; Taylor Short; László A. Székely (Electron. J. Comb., 2017)

Paths vs. Stars in the Local Profile of Trees. - Éva Czabarka; László A. Székely; Stephan G. Wagner (Electron. J. Comb., 2017)

Inducibility in Binary Trees and Crossings in Random Tanglegrams. - Éva Czabarka; László A. Székely; Stephan G. Wagner (SIAM J. Discret. Math., 2017)

Analogies between the Crossing Number and the Tangle Crossing Number. - Robin Anderson; Shuliang Bai; Fidel Barrera-Cruz; Éva Czabarka; Giordano Da Lozzo; Natalie L. F. Hobson; Jephian C.-H. Lin; Austin Mohr; Heather C. Smith; László A. Székely; Hays Whitlatch (Electron. J. Comb., 2018)

On Different "Middle Parts" of a Tree. - Heather C. Smith; László A. Székely; Hua Wang 003; Shuai Yuan (Electron. J. Comb., 2018)

Note on k-planar crossing numbers. - János Pach; László A. Székely; Csaba D. Tóth; Géza Tóth 001 (Comput. Geom., 2018)

k-planar crossing number of random graphs and random regular graphs. - John Asplund; Thao Do; Arran Hamm; László A. Székely; Libby Taylor; Zhiyu Wang (Discret. Appl. Math., 2018)

On the Number of Nonisomorphic Subtrees of a Tree. - Éva Czabarka; László A. Székely; Stephan G. Wagner (J. Graph Theory, 2018)

A degree condition for diameter two orientability of graphs. - Éva Czabarka; Peter Dankelmann; László A. Székely (Discret. Math., 2019)

A tanglegram Kuratowski theorem. - Éva Czabarka; László A. Székely; Stephan G. Wagner (J. Graph Theory, 2019)

Inducibility of d-ary trees. - Éva Czabarka; Audace A. V. Dossou-Olory; László A. Székely; Stephan G. Wagner (Discret. Math., 2020)

On the Maximum Diameter of $k$-Colorable Graphs. - Éva Czabarka; Inne Singgih; László A. Székely (Electron. J. Comb., 2021)

Wiener Index and Remoteness in Triangulations and Quadrangulations. - Éva Czabarka; Peter Dankelmann; Trevor Olsen; László A. Székely (Discret. Math. Theor. Comput. Sci., 2021)

A Size Condition for Diameter Two Orientable Graphs. - Garner Cochran; Éva Czabarka; Peter Dankelmann; László A. Székely (Graphs Comb., 2021)

Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza. - Éva Czabarka; Inne Singgih; László A. Székely (J. Comb. Theory B, 2021)

Minimum Wiener index of triangulations and quadrangulations. - Éva Czabarka; Trevor Olsen; Stephen J. Smith; László A. Székely (Discret. Appl. Math., 2022)

Proximity in triangulations and quadrangulations. - Éva Czabarka; Peter Dankelmann; Trevor Olsen; László A. Székely (Electron. J. Graph Theory Appl., 2022)

An Infinite Antichain of Planar Tanglegrams. - Éva Czabarka; Stephen J. Smith; László A. Székely (Order, 2022)

Maximum diameter of 3- and 4-colorable graphs. - Éva Czabarka; Stephen J. Smith; László A. Székely (J. Graph Theory, 2023)

Coconvex characters on collections of phylogenetic trees. - Éva Czabarka; Steven Kelk; Vincent Moulton; László A. Székely (Adv. Appl. Math., 2026)