László A. Székely

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