( en | de | ru )

 

Disambiguation of "Székely, László A."

Author of the publication

copydeleteadd this publication to your clipboard
Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule.

, , , and . Comput. Artif. Intell., 16 (2): 217-227 (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Paul Székely

Tamás Székely

József Székely

István Székely

Stefan Székely

 

Other publications of authors with the same name

Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry., and . IPCO, page 102-113. Carnegie Mellon University, (1992)Analogies between the crossing number and the tangle crossing number., , , , , , , , , and 1 other author(s). CoRR, (2017)Minimizing the number of episodes and Gallai's theorem on intervals, , and . CoRR, (2012)An improved bound on the maximum agreement subtree problem., and . Appl. Math. Lett., 22 (11): 1778-1780 (2009)On Canonical Concurrent Flows, Crossing Number and Graph Expansion., and . Comb. Probab. Comput., (1994)Intersecting Systems., , , , and . Comb. Probab. Comput., 6 (2): 127-137 (1997)A note on full transversals and mixed orthogonal arrays., , , , and . Australas. J Comb., (2010)Dominating Scale-Free Networks Using Generalized Probabilistic Methods., , , , , and . CoRR, (2014)On Bipartite Drawings and the Linear Arrangement Problem., , , and . SIAM J. Comput., 30 (6): 1773-1789 (2000)Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule., , , and . Comput. Artif. Intell., 16 (2): 217-227 (1997)