László A. Székely

ORCID

Publication Activity (10 Years)

Years Active: 1984-2023
Publications (10 Years): 20

Top Venues

Electron. J. Comb.

Discret. Math.

Information Theory, Combinatorics, and Search Theory

CoRR

Publications

Éva Czabarka, Stephen J. Smith, László A. Székely
Maximum diameter of 3- and 4-colorable graphs. J. Graph Theory 102 (2) (2023)
Éva Czabarka, Stephen J. Smith, László A. Székely
An Infinite Antichain of Planar Tanglegrams. Order 39 (1) (2022)
Éva Czabarka, Peter Dankelmann, Trevor Olsen, László A. Székely
Proximity in triangulations and quadrangulations. Electron. J. Graph Theory Appl. 10 (2) (2022)
Éva Czabarka, Trevor Olsen, Stephen J. Smith, László A. Székely
Minimum Wiener index of triangulations and quadrangulations. Discret. Appl. Math. 322 (2022)
Garner Cochran, Éva Czabarka, Peter Dankelmann, László A. Székely
A Size Condition for Diameter Two Orientable Graphs. Graphs Comb. 37 (2) (2021)
Éva Czabarka, Inne Singgih, László A. Székely
Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza. J. Comb. Theory, Ser. B 151 (2021)
Éva Czabarka, Peter Dankelmann, Trevor Olsen, László A. Székely
Wiener Index and Remoteness in Triangulations and Quadrangulations. Discret. Math. Theor. Comput. Sci. 23 (1) (2021)
Éva Czabarka, Inne Singgih, László A. Székely
On the Maximum Diameter of $k$-Colorable Graphs. Electron. J. Comb. 28 (3) (2021)
Éva Czabarka, Audace A. V. Dossou-Olory, László A. Székely, Stephan G. Wagner
Inducibility of d-ary trees. Discret. Math. 343 (2) (2020)
Éva Czabarka, László A. Székely, Stephan G. Wagner
A tanglegram Kuratowski theorem. J. Graph Theory 90 (2) (2019)
Éva Czabarka, Peter Dankelmann, László A. Székely
A degree condition for diameter two orientability of graphs. Discret. Math. 342 (4) (2019)
János Pach, László A. Székely, Csaba D. Tóth, Géza Tóth
Note on k-planar crossing numbers. Comput. Geom. 68 (2018)
Éva Czabarka, László A. Székely, Stephan G. Wagner
On the Number of Nonisomorphic Subtrees of a Tree. J. Graph Theory 87 (1) (2018)
Heather C. Smith, László A. Székely, Hua Wang, Shuai Yuan
On Different "Middle Parts" of a Tree. Electron. J. Comb. 25 (3) (2018)
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
Analogies between the Crossing Number and the Tangle Crossing Number. Electron. J. Comb. 25 (4) (2018)
Éva Czabarka, Johannes Rauh, Kayvan Sadeghi, Taylor Short, László A. Székely
On the Number of Non-Zero Elements of Joint Degree Vectors. Electron. J. Comb. 24 (1) (2017)
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
Analogies between the crossing number and the tangle crossing number. CoRR (2017)
Éva Czabarka, László A. Székely, Stephan G. Wagner
Paths vs. Stars in the Local Profile of Trees. Electron. J. Comb. 24 (1) (2017)
Éva Czabarka, László A. Székely, Stephan G. Wagner
Inducibility in Binary Trees and Crossings in Random Tanglegrams. SIAM J. Discret. Math. 31 (3) (2017)
Heather C. Smith, László A. Székely, Hua Wang
Eccentricity sums in trees. Discret. Appl. Math. 207 (2016)
F. Molnár Jr., Noemi Derzsy, Éva Czabarka, László A. Székely, Boleslaw K. Szymanski, György Korniss
Dominating Scale-Free Networks Using Generalized Probabilistic Methods. CoRR (2014)
László A. Székely, Hua Wang
Extremal values of ratios: Distance problems vs. subtree problems in trees II. Discret. Math. 322 (2014)
László A. Székely, Hua Wang
Extremal Values of Ratios: Distance Problems vs. Subtree Problems in Trees. Electron. J. Comb. 20 (1) (2013)
Harout K. Aydinian, Éva Czabarka, László A. Székely
Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals. Information Theory, Combinatorics, and Search Theory (2013)
Éva Czabarka, Matteo Marsili, László A. Székely
Threshold Functions for Distinct Parts: Revisiting Erdős-Lehner. Information Theory, Combinatorics, and Search Theory (2013)
Éva Czabarka, László A. Székely, Todd J. Vision
Minimizing the number of episodes and Gallai's theorem on intervals CoRR (2012)
László A. Székely, Hua Wang, Taoyang Wu
The sum of the distances between the leaves of a tree and the 'semi-regular' property. Discret. Math. 311 (13) (2011)
Harout K. Aydinian, Éva Czabarka, Péter L. Erdös, László A. Székely
A tour of M-part L-Sperner families. J. Comb. Theory, Ser. A 118 (2) (2011)
Harout K. Aydinian, Éva Czabarka, Konrad Engel, Péter L. Erdös, László A. Székely
A note on full transversals and mixed orthogonal arrays. Australas. J Comb. 48 (2010)
Drago Bokal, Éva Czabarka, László A. Székely, Imrich Vrt'o
General Lower Bounds for the Minor Crossing Number of Graphs. Discret. Comput. Geom. 44 (2) (2010)
Éva Czabarka, László A. Székely, Stephan G. Wagner
The inverse problem for certain tree parameters. Discret. Appl. Math. 157 (15) (2009)
Éva Czabarka, Peter Dankelmann, László A. Székely
Diameter of 4-colourable graphs. Eur. J. Comb. 30 (5) (2009)
Mike A. Steel, László A. Székely
An improved bound on the maximum agreement subtree problem. Appl. Math. Lett. 22 (11) (2009)
Attila Sali, László A. Székely
On the Existence of Armstrong Instances with Bounded Domains. FoIKS (2008)
Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrto
Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method. Random Struct. Algorithms 33 (4) (2008)
Linyuan Lu, László A. Székely
Using Lovász Local Lemma in the Space of Random Injections. Electron. J. Comb. 14 (1) (2007)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
On k-planar crossing numbers. Discret. Appl. Math. 155 (9) (2007)
Attila Sali, László A. Székely
SPT(q, k, n)-Codes. Electron. Notes Discret. Math. 29 (2007)
László A. Székely, Hua Wang
Binary trees with the largest number of subtrees. Discret. Appl. Math. 155 (3) (2007)
Mike A. Steel, László A. Székely
Teasing Apart Two Trees. Comb. Probab. Comput. 16 (6) (2007)
Drago Bokal, Éva Czabarka, László A. Székely, Imrich Vrto
Graph minors and the crossing number of graphs. Electron. Notes Discret. Math. 28 (2007)
László A. Székely
Progress on Crossing Number Problems. SOFSEM (2005)
László A. Székely, Hua Wang
On subtrees of trees. Adv. Appl. Math. 34 (1) (2005)
László A. Székely
Counting rooted spanning forests in complete multipartite graphs. Ars Comb. 73 (2004)
Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrt'o
Outerplanar Crossing Numbers, the Circular Arrangement Problem and Isoperimetric Functions. Electron. J. Comb. 11 (1) (2004)
Ondrej Sýkora, László A. Székely, Imrich Vrto
A note on Halton's conjecture. Inf. Sci. 164 (1-4) (2004)
László A. Székely
A successful concept for measuring non-planarity of graphs: the crossing number. Discret. Math. 276 (1-3) (2004)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Bounds and Methods for k-Planar Crossing Numbers. Graph Drawing (2003)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Bounds for Convex Crossing Numbers. COCOON (2003)
Ondrej Sýkora, László A. Székely, Imrich Vrto
Fractional Lengths and Crossing Numbers. Graph Drawing (2002)
Ondrej Sýkora, László A. Székely, Imrich Vrto
Two Counterexamples in Graph Drawing. WG (2002)
Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, László A. Székely, Lutz Volkmann
Wiener index versus maximum degree in trees. Discret. Appl. Math. 122 (1-3) (2002)
Michael Anthony Steel, László A. Székely
Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications. SIAM J. Discret. Math. 15 (4) (2002)
Farhad Shahrokhi, László A. Székely
Guest Editors' Foreword. Discret. Comput. Geom. 28 (4) (2002)
Farhad Shahrokhi, László A. Székely
Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem. Discret. Appl. Math. 108 (1-2) (2001)
Ralph Howard, Gyula Károlyi, László A. Székely
Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem. Electron. J. Comb. 8 (1) (2001)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
On Bipartite Drawings and the Linear Arrangement Problem. SIAM J. Comput. 30 (6) (2000)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
A new lower bound for the bipartite crossing number with applications. Theor. Comput. Sci. 245 (2) (2000)
László A. Székely
A successful concept for measuring non-planarity of graphs: the crossing number. Electron. Notes Discret. Math. 5 (2000)
Péter L. Erdös, Ákos Seress, László A. Székely
Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets. Comb. 20 (1) (2000)
Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy J. Warnow
A few logs suffice to build (almost) all trees (I). Random Struct. Algorithms 14 (2) (1999)
Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy J. Warnow
A Few Logs Suffice to Build (almost) All Trees: Part II. Theor. Comput. Sci. 221 (1-2) (1999)
Farhad Shahrokhi, László A. Székely
Integral Uniform Flows in Symmetric Networks. WG (1998)
Péter L. Erdös, András Frank, László A. Székely
Minimum Multiway Cuts in Trees. Discret. Appl. Math. 87 (1-3) (1998)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
on Surfaces. Discret. Comput. Geom. 19 (2) (1998)
László A. Székely
Crossing Numbers and Hard Erdös Problems in Discrete Geometry. Comb. Probab. Comput. 6 (3) (1997)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem. WADS (1997)
Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow
Constructing Big Trees from Short Sequences. ICALP (1997)
Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely
Intersecting Systems. Comb. Probab. Comput. 6 (2) (1997)
Curtis A. Barefoot, Roger C. Entringer, László A. Székely
Extremal Values for Ratios of Distances in Trees. Discret. Appl. Math. 80 (1) (1997)
D. de Caen, László A. Székely
On Dense Bipartite Graphs of Girth Eight and Upper Bounds for Certain Configurations in Planar Point-Line Systems. J. Comb. Theory, Ser. A 77 (2) (1997)
Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow
Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule. Comput. Artif. Intell. 16 (2) (1997)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Bipartite Crossing Numbers of Meshes and Hypercubes. Graph Drawing (1997)
Curtis A. Barefoot, Lane H. Clark, Roger C. Entringer, T. D. Porter, László A. Székely, Zsolt Tuza
Cycle-saturated graphs of minimum size. Discret. Math. 150 (1-3) (1996)
Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrt'o
The book crossing number of a graph. J. Graph Theory 21 (4) (1996)
Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto
Drawings of Graphs on Surfaces with Few Crossings. Algorithmica 16 (1) (1996)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Crossing Numbers of Meshes. Graph Drawing (1995)
Mike A. Steel, László A. Székely, Michael D. Hendy
Reconstructing Trees When Sequence Sites Evolve at Variable Rates. J. Comput. Biol. 1 (2) (1994)
Péter L. Erdös, László A. Székely
On weighted multiway cuts in trees. Math. Program. 65 (1994)
Farhad Shahrokhi, László A. Székely
On Canonical Concurrent Flows, Crossing Number and Graph Expansion. Comb. Probab. Comput. 3 (1994)
Péter L. Erdös, Ákos Seress, László A. Székely
On Intersecting Chains in Boolean Algebras. Comb. Probab. Comput. 3 (1994)
Roger C. Entringer, Amram Meir, John W. Moon, László A. Székely
On the Wiener index of trees from certain families. Australas. J Comb. 10 (1994)
Curtis A. Barefoot, Lane H. Clark, A. J. Depew, Roger C. Entringer, László A. Székely
Subdivision thresholds for two classes of graphs. Discret. Math. 125 (1-3) (1994)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Book Embeddings and Crossing Numbers. WG (1994)
Farhad Shahrokhi, László A. Székely, Imrich Vrto
Crossing Numbers of Graphs, Lower Bound Techniques. Graph Drawing (1994)
Farhad Shahrokhi, László A. Székely
Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version). WG (1993)
Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto
Improving Bounds for the Crossing Numbers on Surfaces of Genus g. WG (1993)
Péter L. Erdös, László A. Székely
Counting Bichromatic Evolutionary Trees. Discret. Appl. Math. 47 (1) (1993)
Péter L. Erdös, László A. Székely
Algorithms and Min-max Theorems for Certain Multiway Cuts. IPCO (1992)
Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely
Sharpening the LYM inequality. Comb. 12 (3) (1992)
Farhad Shahrokhi, László A. Székely
Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry. IPCO (1992)
Lane H. Clark, Farhad Shahrokhi, László A. Székely
A Linear Time Algorithm for Graph Partition Problems. Inf. Process. Lett. 42 (1) (1992)
László A. Székely, Lane H. Clark, Roger C. Entringer
An inequality for degree sequences. Discret. Math. 103 (3) (1992)
Lane H. Clark, Roger C. Entringer, Joseph E. McCanna, László A. Székely
Extremal problems for local properties of graphs. Australas. J Comb. 4 (1991)
Lane H. Clark, Roger C. Entringer, László A. Székely
Threshold functions for local properties of graphs: triangles. Discret. Appl. Math. 34 (1-3) (1991)
M. Carter, Michael D. Hendy, David Penny, László A. Székely, Nicholas C. Wormald
On the Distribution of Lengths of Evolutionary Trees. SIAM J. Discret. Math. 3 (1) (1990)
László A. Székely, Nicholas C. Wormald
. Discret. Math. 75 (1-3) (1989)
László A. Székely
Common Origin of Cubic Binomial Identities; A Generalization of Surányi's Proof on Le Jen Shoo's Formula. J. Comb. Theory, Ser. A 40 (1) (1985)
László A. Székely
Measurable chromatic number of geometric graphs and sets without some distnaces in euclidean space. Comb. 4 (2) (1984)
László A. Székely
On the number of homogeneous subgraphs of a graph. Comb. 4 (4) (1984)

László A. Székely.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

László A. Székely