László A. Székely

Orcid: 0000-0002-9470-9111

According to our database1, László A. Székely authored at least 100 papers between 1984 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Maximum diameter of 3- and 4-colorable graphs.
J. Graph Theory, 2023

2022
An Infinite Antichain of Planar Tanglegrams.
Order, 2022

Proximity in triangulations and quadrangulations.
Electron. J. Graph Theory Appl., 2022

Minimum Wiener index of triangulations and quadrangulations.
Discret. Appl. Math., 2022

2021
Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza.
J. Comb. Theory B, 2021

A Size Condition for Diameter Two Orientable Graphs.
Graphs Comb., 2021

Wiener Index and Remoteness in Triangulations and Quadrangulations.
Discret. Math. Theor. Comput. Sci., 2021

On the Maximum Diameter of $k$-Colorable Graphs.
Electron. J. Comb., 2021

2020
Inducibility of d-ary trees.
Discret. Math., 2020

2019
A tanglegram Kuratowski theorem.
J. Graph Theory, 2019

A degree condition for diameter two orientability of graphs.
Discret. Math., 2019

2018
On the Number of Nonisomorphic Subtrees of a Tree.
J. Graph Theory, 2018

k-planar crossing number of random graphs and random regular graphs.
Discret. Appl. Math., 2018

Note on k-planar crossing numbers.
Comput. Geom., 2018

On Different "Middle Parts" of a Tree.
Electron. J. Comb., 2018

Analogies between the Crossing Number and the Tangle Crossing Number.
Electron. J. Comb., 2018

2017
Inducibility in Binary Trees and Crossings in Random Tanglegrams.
SIAM J. Discret. Math., 2017

Paths vs. Stars in the Local Profile of Trees.
Electron. J. Comb., 2017

On the Number of Non-Zero Elements of Joint Degree Vectors.
Electron. J. Comb., 2017

2016
Eccentricity sums in trees.
Discret. Appl. Math., 2016

2014
Extremal values of ratios: Distance problems vs. subtree problems in trees II.
Discret. Math., 2014

Dominating Scale-Free Networks Using Generalized Probabilistic Methods.
CoRR, 2014

2013
Extremal Values of Ratios: Distance Problems vs. Subtree Problems in Trees.
Electron. J. Comb., 2013

Threshold Functions for Distinct Parts: Revisiting Erdős-Lehner.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012
Minimizing the number of episodes and Gallai's theorem on intervals
CoRR, 2012

2011
A tour of M-part L-Sperner families.
J. Comb. Theory A, 2011

The sum of the distances between the leaves of a tree and the 'semi-regular' property.
Discret. Math., 2011

2010
General Lower Bounds for the Minor Crossing Number of Graphs.
Discret. Comput. Geom., 2010

A note on full transversals and mixed orthogonal arrays.
Australas. J Comb., 2010

2009
Diameter of 4-colourable graphs.
Eur. J. Comb., 2009

The inverse problem for certain tree parameters.
Discret. Appl. Math., 2009

An improved bound on the maximum agreement subtree problem.
Appl. Math. Lett., 2009

2008
Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method.
Random Struct. Algorithms, 2008

An optimality criterion for the crossing number.
Ars Math. Contemp., 2008

On the Existence of Armstrong Instances with Bounded Domains.
Proceedings of the Foundations of Information and Knowledge Systems, 2008

2007
SPT(q, k, n)-Codes.
Electron. Notes Discret. Math., 2007

Graph minors and the crossing number of graphs.
Electron. Notes Discret. Math., 2007

Binary trees with the largest number of subtrees.
Discret. Appl. Math., 2007

On k-planar crossing numbers.
Discret. Appl. Math., 2007

Teasing Apart Two Trees.
Comb. Probab. Comput., 2007

Using Lovász Local Lemma in the Space of Random Injections.
Electron. J. Comb., 2007

2005
On subtrees of trees.
Adv. Appl. Math., 2005

Progress on Crossing Number Problems.
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

2004
A note on Halton's conjecture.
Inf. Sci., 2004

Outerplanar Crossing Numbers, the Circular Arrangement Problem and Isoperimetric Functions.
Electron. J. Comb., 2004

Counting rooted spanning forests in complete multipartite graphs.
Ars Comb., 2004

2003
Bounds and Methods for k-Planar Crossing Numbers.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

Bounds for Convex Crossing Numbers.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications.
SIAM J. Discret. Math., 2002

Guest Editors' Foreword.
Discret. Comput. Geom., 2002

Wiener index versus maximum degree in trees.
Discret. Appl. Math., 2002

Two Counterexamples in Graph Drawing.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Fractional Lengths and Crossing Numbers.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

2001
Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem.
Discret. Appl. Math., 2001

Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem.
Electron. J. Comb., 2001

2000
A new lower bound for the bipartite crossing number with applications.
Theor. Comput. Sci., 2000

On Bipartite Drawings and the Linear Arrangement Problem.
SIAM J. Comput., 2000

A successful concept for measuring non-planarity of graphs: the crossing number.
Electron. Notes Discret. Math., 2000

Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets.
Comb., 2000

1999
A Few Logs Suffice to Build (almost) All Trees: Part II.
Theor. Comput. Sci., 1999

A few logs suffice to build (almost) all trees (I).
Random Struct. Algorithms, 1999

1998
Intersection of Curves and Crossing Number of C<sub>m</sub> x C<sub>n</sub> on Surfaces.
Discret. Comput. Geom., 1998

Minimum Multiway Cuts in Trees.
Discret. Appl. Math., 1998

Integral Uniform Flows in Symmetric Networks.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997
On Dense Bipartite Graphs of Girth Eight and Upper Bounds for Certain Configurations in Planar Point-Line Systems.
J. Comb. Theory A, 1997

Extremal Values for Ratios of Distances in Trees.
Discret. Appl. Math., 1997

Crossing Numbers and Hard Erdös Problems in Discrete Geometry.
Comb. Probab. Comput., 1997

Intersecting Systems.
Comb. Probab. Comput., 1997

Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule.
Comput. Artif. Intell., 1997

On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Constructing Big Trees from Short Sequences.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Bipartite Crossing Numbers of Meshes and Hypercubes.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996
The book crossing number of a graph.
J. Graph Theory, 1996

Cycle-saturated graphs of minimum size.
Discret. Math., 1996

Drawings of Graphs on Surfaces with Few Crossings.
Algorithmica, 1996

1995
Crossing Numbers of Meshes.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

1994
On weighted multiway cuts in trees.
Math. Program., 1994

Reconstructing Trees When Sequence Sites Evolve at Variable Rates.
J. Comput. Biol., 1994

Subdivision thresholds for two classes of graphs.
Discret. Math., 1994

On Canonical Concurrent Flows, Crossing Number and Graph Expansion.
Comb. Probab. Comput., 1994

On Intersecting Chains in Boolean Algebras.
Comb. Probab. Comput., 1994

On the Wiener index of trees from certain families.
Australas. J Comb., 1994

Book Embeddings and Crossing Numbers.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Crossing Numbers of Graphs, Lower Bound Techniques.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993
Counting Bichromatic Evolutionary Trees.
Discret. Appl. Math., 1993

Improving Bounds for the Crossing Numbers on Surfaces of Genus g.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992
A Linear Time Algorithm for Graph Partition Problems.
Inf. Process. Lett., 1992

An inequality for degree sequences.
Discret. Math., 1992

Sharpening the LYM inequality.
Comb., 1992

Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

Algorithms and Min-max Theorems for Certain Multiway Cuts.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991
Threshold functions for local properties of graphs: triangles.
Discret. Appl. Math., 1991

Extremal problems for local properties of graphs.
Australas. J Comb., 1991

1990
On the Distribution of Lengths of Evolutionary Trees.
SIAM J. Discret. Math., 1990

1989
Bounds on the measurable chromatic number of R<sup>n</sup>.
Discret. Math., 1989

1985
Common Origin of Cubic Binomial Identities; A Generalization of Surányi's Proof on Le Jen Shoo's Formula.
J. Comb. Theory A, 1985

1984
On the number of homogeneous subgraphs of a graph.
Comb., 1984

Measurable chromatic number of geometric graphs and sets without some distnaces in euclidean space.
Comb., 1984


  Loading...