The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

László A. Székely: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Bounds for Convex Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:487-495 [Conf]
  2. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Bounds and Methods for k-Planar Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:37-46 [Conf]
  3. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Crossing Numbers of Meshes. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:463-471 [Conf]
  4. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Bipartite Crossing Numbers of Meshes and Hypercubes. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:37-46 [Conf]
  5. Farhad Shahrokhi, László A. Székely, Imrich Vrto
    Crossing Numbers of Graphs, Lower Bound Techniques. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:131-142 [Conf]
  6. Ondrej Sýkora, László A. Székely, Imrich Vrto
    Fractional Lengths and Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:186-192 [Conf]
  7. Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy Warnow
    Constructing Big Trees from Short Sequences. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:827-837 [Conf]
  8. Péter L. Erdös, László A. Székely
    Algorithms and Min-max Theorems for Certain Multiway Cuts. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:334-345 [Conf]
  9. Farhad Shahrokhi, László A. Székely
    Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:102-113 [Conf]
  10. László A. Székely
    Progress on Crossing Number Problems. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:53-61 [Conf]
  11. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:55-68 [Conf]
  12. Farhad Shahrokhi, László A. Székely
    Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:327-337 [Conf]
  13. Farhad Shahrokhi, László A. Székely
    Integral Uniform Flows in Symmetric Networks. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:272-284 [Conf]
  14. Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto
    Improving Bounds for the Crossing Numbers on Surfaces of Genus g. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:388-395 [Conf]
  15. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Book Embeddings and Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:256-268 [Conf]
  16. Ondrej Sýkora, László A. Székely, Imrich Vrto
    Two Counterexamples in Graph Drawing. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:391-398 [Conf]
  17. Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto
    Drawings of Graphs on Surfaces with Few Crossings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:1, pp:118-131 [Journal]
  18. László A. Székely
    Counting rooted spanning forests in complete multipartite graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:73, n:, pp:- [Journal]
  19. Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy Warnow
    Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 1997, v:16, n:2, pp:- [Journal]
  20. Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely
    Sharpening the LYM inequality. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:3, pp:287-293 [Journal]
  21. 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. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:1, pp:27-45 [Journal]
  22. László A. Székely
    Measurable chromatic number of geometric graphs and sets without some distnaces in euclidean space. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:213-218 [Journal]
  23. László A. Székely
    On the number of homogeneous subgraphs of a graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:363-372 [Journal]
  24. Ralph Howard, Gyula Károlyi, László A. Székely
    Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  25. Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely
    Intersecting Systems. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:2, pp:127-137 [Journal]
  26. Péter L. Erdös, Ákos Seress, László A. Székely
    On Intersecting Chains in Boolean Algebras. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:57-62 [Journal]
  27. Farhad Shahrokhi, László A. Székely
    On Canonical Concurrent Flows, Crossing Number and Graph Expansion. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:523-543 [Journal]
  28. László A. Székely
    Crossing Numbers and Hard Erd[odblac]s Problems in Discrete Geometry. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:3, pp:353-358 [Journal]
  29. Curtis A. Barefoot, Roger C. Entringer, László A. Székely
    Extremal Values for Ratios of Distances in Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:80, n:1, pp:37-56 [Journal]
  30. Péter L. Erdös, András Frank, László A. Székely
    Minimum Multiway Cuts in Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:67-75 [Journal]
  31. Péter L. Erdös, László A. Székely
    Counting Bichromatic Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:47, n:1, pp:1-8 [Journal]
  32. Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, László A. Székely, Lutz Volkmann
    Wiener index versus maximum degree in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:122, n:1-3, pp:127-137 [Journal]
  33. Farhad Shahrokhi, László A. Székely
    Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:175-191 [Journal]
  34. László A. Székely, Hua Wang
    Binary trees with the largest number of subtrees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:3, pp:374-385 [Journal]
  35. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    On k-planar crossing numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:9, pp:1106-1115 [Journal]
  36. Farhad Shahrokhi, László A. Székely
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:447-448 [Journal]
  37. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Intersection of Curves and Crossing Number of Cm x Cn on Surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:2, pp:237-247 [Journal]
  38. László A. Székely
    A successful concept for measuring non-planarity of graphs: the crossing number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:331-352 [Journal]
  39. L. H. Clark, Farhad Shahrokhi, László A. Székely
    A Linear Time Algorithm for Graph Partition Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:19-24 [Journal]
  40. Ondrej Sýkora, László A. Székely, Imrich Vrto
    A note on Halton's conjecture. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2004, v:164, n:1-4, pp:61-64 [Journal]
  41. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:77, n:2, pp:268-278 [Journal]
  42. László A. Székely
    Common Origin of Cubic Binomial Identities; A Generalization of Surányi's Proof on Le Jen Shoo's Formula. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:40, n:1, pp:171-174 [Journal]
  43. Péter L. Erdös, László A. Székely
    On weighted multiway cuts in trees. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1994, v:65, n:, pp:93-105 [Journal]
  44. Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy Warnow
    A few logs suffice to build (almost) all trees (I). [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:14, n:2, pp:153-184 [Journal]
  45. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    On Bipartite Drawings and the Linear Arrangement Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:1773-1789 [Journal]
  46. M. Carter, Michael D. Hendy, David Penny, László A. Székely, Nicholas C. Wormald
    On the Distribution of Lengths of Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:1, pp:38-47 [Journal]
  47. Michael Anthony Steel, László A. Székely
    Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:4, pp:562-575 [Journal]
  48. Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy Warnow
    A Few Logs Suffice to Build (almost) All Trees: Part II. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:77-118 [Journal]
  49. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    A new lower bound for the bipartite crossing number with applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:245, n:2, pp:281-294 [Journal]
  50. László A. Székely, Nicholas C. Wormald
    Bounds on the measurable chromatic number of Rn. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:343-372 [Journal]
  51. László A. Székely, L. H. Clark, Roger C. Entringer
    An inequality for degree sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:3, pp:293-300 [Journal]
  52. Curtis A. Barefoot, L. H. Clark, Roger C. Entringer, T. D. Porter, László A. Székely, Zsolt Tuza
    Cycle-saturated graphs of minimum size. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:31-48 [Journal]
  53. Curtis A. Barefoot, L. H. Clark, A. J. Depew, Roger C. Entringer, László A. Székely
    Subdivision thresholds for two classes of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:15-30 [Journal]

  54. On the Existence of Armstrong Instances with Bounded Domains. [Citation Graph (, )][DBLP]


  55. An improved bound on the maximum agreement subtree problem. [Citation Graph (, )][DBLP]


  56. Using Lovász Local Lemma in the Space of Random Injections. [Citation Graph (, )][DBLP]


  57. Teasing Apart Two Trees. [Citation Graph (, )][DBLP]


  58. Threshold functions for local properties of graphs: triangles. [Citation Graph (, )][DBLP]


  59. The inverse problem for certain tree parameters. [Citation Graph (, )][DBLP]


  60. General Lower Bounds for the Minor Crossing Number of Graphs. [Citation Graph (, )][DBLP]


  61. Diameter of 4-colourable graphs. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002