| 2008 |
|---|
| 61 | EE | Attila Sali,
László A. Székely:
On the Existence of Armstrong Instances with Bounded Domains.
FoIKS 2008: 151-157 |
| 60 | EE | É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): 480-496 (2008) |
| 2007 |
|---|
| 59 | EE | Mike A. Steel,
László A. Székely:
Teasing Apart Two Trees.
Combinatorics, Probability & Computing 16(6): 903-922 (2007) |
| 58 | EE | László A. Székely,
Hua Wang:
Binary trees with the largest number of subtrees.
Discrete Applied Mathematics 155(3): 374-385 (2007) |
| 57 | EE | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
On k-planar crossing numbers.
Discrete Applied Mathematics 155(9): 1106-1115 (2007) |
| 56 | EE | Linyuan Lu,
László A. Székely:
Using Lovász Local Lemma in the Space of Random Injections.
Electr. J. Comb. 14(1): (2007) |
| 55 | EE | Drago Bokal,
Éva Czabarka,
László A. Székely,
Imrich Vrto:
Graph minors and the crossing number of graphs.
Electronic Notes in Discrete Mathematics 28: 169-175 (2007) |
| 54 | EE | Attila Sali,
László A. Székely:
SPT(q, k, n)-Codes.
Electronic Notes in Discrete Mathematics 29: 403-409 (2007) |
| 2005 |
|---|
| 53 | EE | László A. Székely:
Progress on Crossing Number Problems.
SOFSEM 2005: 53-61 |
| 2004 |
|---|
| 52 | | László A. Székely:
Counting rooted spanning forests in complete multipartite graphs.
Ars Comb. 73: (2004) |
| 51 | EE | László A. Székely:
A successful concept for measuring non-planarity of graphs: the crossing number.
Discrete Mathematics 276(1-3): 331-352 (2004) |
| 50 | EE | Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
A note on Halton's conjecture.
Inf. Sci. 164(1-4): 61-64 (2004) |
| 2003 |
|---|
| 49 | EE | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Bounds for Convex Crossing Numbers.
COCOON 2003: 487-495 |
| 48 | EE | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Bounds and Methods for k-Planar Crossing Numbers.
Graph Drawing 2003: 37-46 |
| 2002 |
|---|
| 47 | EE | Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Fractional Lengths and Crossing Numbers.
Graph Drawing 2002: 186-192 |
| 46 | EE | Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Two Counterexamples in Graph Drawing.
WG 2002: 391-398 |
| 45 | EE | Farhad Shahrokhi,
László A. Székely:
Guest Editors' Foreword.
Discrete & Computational Geometry 28(4): 447-448 (2002) |
| 44 | | Miranca Fischermann,
Arne Hoffmann,
Dieter Rautenbach,
László A. Székely,
Lutz Volkmann:
Wiener index versus maximum degree in trees.
Discrete Applied Mathematics 122(1-3): 127-137 (2002) |
| 43 | EE | Michael Anthony Steel,
László A. Székely:
Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications.
SIAM J. Discrete Math. 15(4): 562-575 (2002) |
| 2001 |
|---|
| 42 | | Farhad Shahrokhi,
László A. Székely:
Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem.
Discrete Applied Mathematics 108(1-2): 175-191 (2001) |
| 41 | EE | Ralph Howard,
Gyula Károlyi,
László A. Székely:
Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem.
Electr. J. Comb. 8(1): (2001) |
| 2000 |
|---|
| 40 | EE | 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.
Combinatorica 20(1): 27-45 (2000) |
| 39 | EE | László A. Székely:
A successful concept for measuring non-planarity of graphs: the crossing number.
Electronic Notes in Discrete Mathematics 5: 284-287 (2000) |
| 38 | EE | 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): 1773-1789 (2000) |
| 37 | EE | 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): 281-294 (2000) |
| 1999 |
|---|
| 36 | | 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).
Random Struct. Algorithms 14(2): 153-184 (1999) |
| 35 | EE | 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.
Theor. Comput. Sci. 221(1-2): 77-118 (1999) |
| 1998 |
|---|
| 34 | | Farhad Shahrokhi,
László A. Székely:
Integral Uniform Flows in Symmetric Networks.
WG 1998: 272-284 |
| 33 | EE | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Intersection of Curves and Crossing Number of Cm x Cn on Surfaces.
Discrete & Computational Geometry 19(2): 237-247 (1998) |
| 32 | EE | Péter L. Erdös,
András Frank,
László A. Székely:
Minimum Multiway Cuts in Trees.
Discrete Applied Mathematics 87(1-3): 67-75 (1998) |
| 1997 |
|---|
| 31 | | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Bipartite Crossing Numbers of Meshes and Hypercubes.
Graph Drawing 1997: 37-46 |
| 30 | | Péter L. Erdös,
Mike A. Steel,
László A. Székely,
Tandy Warnow:
Constructing Big Trees from Short Sequences.
ICALP 1997: 827-837 |
| 29 | | 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: 55-68 |
| 28 | | Rudolf Ahlswede,
Noga Alon,
Péter L. Erdös,
Miklós Ruszinkó,
László A. Székely:
Intersecting Systems.
Combinatorics, Probability & Computing 6(2): 127-137 (1997) |
| 27 | | László A. Székely:
Crossing Numbers and Hard Erd[odblac]s Problems in Discrete Geometry.
Combinatorics, Probability & Computing 6(3): 353-358 (1997) |
| 26 | | 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.
Computers and Artificial Intelligence 16(2): (1997) |
| 25 | EE | Curtis A. Barefoot,
Roger C. Entringer,
László A. Székely:
Extremal Values for Ratios of Distances in Trees.
Discrete Applied Mathematics 80(1): 37-56 (1997) |
| 24 | EE | 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): 268-278 (1997) |
| 1996 |
|---|
| 23 | | Farhad Shahrokhi,
László A. Székely,
Ondrej Sýkora,
Imrich Vrto:
Drawings of Graphs on Surfaces with Few Crossings.
Algorithmica 16(1): 118-131 (1996) |
| 22 | EE | 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.
Discrete Mathematics 150(1-3): 31-48 (1996) |
| 1995 |
|---|
| 21 | | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Crossing Numbers of Meshes.
Graph Drawing 1995: 463-471 |
| 1994 |
|---|
| 20 | | Farhad Shahrokhi,
László A. Székely,
Imrich Vrto:
Crossing Numbers of Graphs, Lower Bound Techniques.
Graph Drawing 1994: 131-142 |
| 19 | | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Book Embeddings and Crossing Numbers.
WG 1994: 256-268 |
| 18 | | Farhad Shahrokhi,
László A. Székely:
On Canonical Concurrent Flows, Crossing Number and Graph Expansion.
Combinatorics, Probability & Computing 3: 523-543 (1994) |
| 17 | | Péter L. Erdös,
Ákos Seress,
László A. Székely:
On Intersecting Chains in Boolean Algebras.
Combinatorics, Probability & Computing 3: 57-62 (1994) |
| 16 | EE | Curtis A. Barefoot,
L. H. Clark,
A. J. Depew,
Roger C. Entringer,
László A. Székely:
Subdivision thresholds for two classes of graphs.
Discrete Mathematics 125(1-3): 15-30 (1994) |
| 15 | | Péter L. Erdös,
László A. Székely:
On weighted multiway cuts in trees.
Math. Program. 65: 93-105 (1994) |
| 1993 |
|---|
| 14 | | Farhad Shahrokhi,
László A. Székely:
Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version).
WG 1993: 327-337 |
| 13 | | 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: 388-395 |
| 12 | EE | Péter L. Erdös,
László A. Székely:
Counting Bichromatic Evolutionary Trees.
Discrete Applied Mathematics 47(1): 1-8 (1993) |
| 1992 |
|---|
| 11 | | 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: 102-113 |
| 10 | | Péter L. Erdös,
László A. Székely:
Algorithms and Min-max Theorems for Certain Multiway Cuts.
IPCO 1992: 334-345 |
| 9 | | Péter L. Erdös,
Peter Frankl,
Daniel J. Kleitman,
Michael E. Saks,
László A. Székely:
Sharpening the LYM inequality.
Combinatorica 12(3): 287-293 (1992) |
| 8 | EE | László A. Székely,
L. H. Clark,
Roger C. Entringer:
An inequality for degree sequences.
Discrete Mathematics 103(3): 293-300 (1992) |
| 7 | | L. H. Clark,
Farhad Shahrokhi,
László A. Székely:
A Linear Time Algorithm for Graph Partition Problems.
Inf. Process. Lett. 42(1): 19-24 (1992) |
| 1991 |
|---|
| 6 | EE | L. H. Clark,
Roger C. Entringer,
László A. Székely:
Threshold functions for local properties of graphs: triangles.
Discrete Applied Mathematics 34(1-3): 83-105 (1991) |
| 1990 |
|---|
| 5 | | 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. Discrete Math. 3(1): 38-47 (1990) |
| 1989 |
|---|
| 4 | EE | László A. Székely,
Nicholas C. Wormald:
Bounds on the measurable chromatic number of Rn.
Discrete Mathematics 75(1-3): 343-372 (1989) |
| 1985 |
|---|
| 3 | | 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): 171-174 (1985) |
| 1984 |
|---|
| 2 | | László A. Székely:
Measurable chromatic number of geometric graphs and sets without some distnaces in euclidean space.
Combinatorica 4(2): 213-218 (1984) |
| 1 | | László A. Székely:
On the number of homogeneous subgraphs of a graph.
Combinatorica 4(4): 363-372 (1984) |
