default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLászló A. Székely
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j80]Éva Czabarka
, Stephen J. Smith, László A. Székely:
Maximum diameter of 3- and 4-colorable graphs. J. Graph Theory 102(2): 262-270 (2023)- 2022
- [j79]Éva Czabarka, Trevor Olsen, Stephen J. Smith, László A. Székely:
Minimum Wiener index of triangulations and quadrangulations. Discret. Appl. Math. 322: 295-310 (2022) - [j78]Éva Czabarka, Peter Dankelmann, Trevor Olsen, László A. Székely:
Proximity in triangulations and quadrangulations. Electron. J. Graph Theory Appl. 10(2): 425-446 (2022) - [j77]Éva Czabarka, Stephen J. Smith, László A. Székely:
An Infinite Antichain of Planar Tanglegrams. Order 39(1): 45-54 (2022) - 2021
- [j76]Éva Czabarka, Inne Singgih, László A. Székely:
On the Maximum Diameter of $k$-Colorable Graphs. Electron. J. Comb. 28(3) (2021) - [j75]Éva Czabarka, Peter Dankelmann, Trevor Olsen, László A. Székely:
Wiener Index and Remoteness in Triangulations and Quadrangulations. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [j74]Garner Cochran, Éva Czabarka, Peter Dankelmann, László A. Székely:
A Size Condition for Diameter Two Orientable Graphs. Graphs Comb. 37(2): 527-544 (2021) - [j73]Éva Czabarka, Inne Singgih, László A. Székely:
Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza. J. Comb. Theory B 151: 38-45 (2021) - 2020
- [j72]Éva Czabarka, Audace A. V. Dossou-Olory, László A. Székely, Stephan G. Wagner:
Inducibility of d-ary trees. Discret. Math. 343(2): 111671 (2020)
2010 – 2019
- 2019
- [j71]Éva Czabarka, Peter Dankelmann, László A. Székely:
A degree condition for diameter two orientability of graphs. Discret. Math. 342(4): 1063-1065 (2019) - [j70]Éva Czabarka, László A. Székely, Stephan G. Wagner:
A tanglegram Kuratowski theorem. J. Graph Theory 90(2): 111-122 (2019) - 2018
- [j69]Heather C. Smith, László A. Székely, Hua Wang, Shuai Yuan:
On Different "Middle Parts" of a Tree. Electron. J. Comb. 25(3): 3 (2018) - [j68]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:
Analogies between the Crossing Number and the Tangle Crossing Number. Electron. J. Comb. 25(4): 4 (2018) - [j67]János Pach, László A. Székely, Csaba D. Tóth, Géza Tóth:
Note on k-planar crossing numbers. Comput. Geom. 68: 2-6 (2018) - [j66]John Asplund, Thao Do, Arran Hamm, László A. Székely, Libby Taylor, Zhiyu Wang:
k-planar crossing number of random graphs and random regular graphs. Discret. Appl. Math. 247: 419-422 (2018) - [j65]Éva Czabarka, László A. Székely, Stephan G. Wagner:
On the Number of Nonisomorphic Subtrees of a Tree. J. Graph Theory 87(1): 89-95 (2018) - 2017
- [j64]Éva Czabarka, Johannes Rauh, Kayvan Sadeghi, Taylor Short, László A. Székely:
On the Number of Non-Zero Elements of Joint Degree Vectors. Electron. J. Comb. 24(1): 1 (2017) - [j63]Éva Czabarka, László A. Székely, Stephan G. Wagner:
Paths vs. Stars in the Local Profile of Trees. Electron. J. Comb. 24(1): 1 (2017) - [j62]Éva Czabarka, László A. Székely, Stephan G. Wagner:
Inducibility in Binary Trees and Crossings in Random Tanglegrams. SIAM J. Discret. Math. 31(3): 1732-1750 (2017) - [i3]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:
Analogies between the crossing number and the tangle crossing number. CoRR abs/1709.08119 (2017) - 2016
- [j61]Heather C. Smith, László A. Székely, Hua Wang:
Eccentricity sums in trees. Discret. Appl. Math. 207: 120-131 (2016) - 2014
- [j60]László A. Székely, Hua Wang:
Extremal values of ratios: Distance problems vs. subtree problems in trees II. Discret. Math. 322: 36-47 (2014) - [i2]F. Molnár Jr., Noemi Derzsy, Éva Czabarka, László A. Székely, Boleslaw K. Szymanski, György Korniss:
Dominating Scale-Free Networks Using Generalized Probabilistic Methods. CoRR abs/1406.4851 (2014) - 2013
- [j59]László A. Székely, Hua Wang:
Extremal Values of Ratios: Distance Problems vs. Subtree Problems in Trees. Electron. J. Comb. 20(1): 67 (2013) - [c19]Harout K. Aydinian, Éva Czabarka, László A. Székely:
Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals. Information Theory, Combinatorics, and Search Theory 2013: 371-401 - [c18]Éva Czabarka, Matteo Marsili, László A. Székely:
Threshold Functions for Distinct Parts: Revisiting Erdős-Lehner. Information Theory, Combinatorics, and Search Theory 2013: 463-471 - 2012
- [i1]Éva Czabarka, László A. Székely, Todd J. Vision:
Minimizing the number of episodes and Gallai's theorem on intervals. CoRR abs/1209.5699 (2012) - 2011
- [j58]László A. Székely, Hua Wang, Taoyang Wu:
The sum of the distances between the leaves of a tree and the 'semi-regular' property. Discret. Math. 311(13): 1197-1203 (2011) - [j57]Harout K. Aydinian, Éva Czabarka, Péter L. Erdös, László A. Székely:
A tour of M-part L-Sperner families. J. Comb. Theory A 118(2): 702-725 (2011) - 2010
- [j56]Harout K. Aydinian, Éva Czabarka, Konrad Engel, Péter L. Erdös, László A. Székely:
A note on full transversals and mixed orthogonal arrays. Australas. J Comb. 48: 133-142 (2010) - [j55]Drago Bokal, Éva Czabarka, László A. Székely, Imrich Vrt'o:
General Lower Bounds for the Minor Crossing Number of Graphs. Discret. Comput. Geom. 44(2): 463-483 (2010)
2000 – 2009
- 2009
- [j54]Mike A. Steel, László A. Székely:
An improved bound on the maximum agreement subtree problem. Appl. Math. Lett. 22(11): 1778-1780 (2009) - [j53]Éva Czabarka, László A. Székely, Stephan G. Wagner:
The inverse problem for certain tree parameters. Discret. Appl. Math. 157(15): 3314-3319 (2009) - [j52]Éva Czabarka, Peter Dankelmann, László A. Székely:
Diameter of 4-colourable graphs. Eur. J. Comb. 30(5): 1082-1089 (2009) - 2008
- [j51]László A. Székely:
An optimality criterion for the crossing number. Ars Math. Contemp. 1(1): 32-37 (2008) - [j50]É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) - [c17]Attila Sali, László A. Székely:
On the Existence of Armstrong Instances with Bounded Domains. FoIKS 2008: 151-157 - 2007
- [j49]Linyuan Lu, László A. Székely:
Using Lovász Local Lemma in the Space of Random Injections. Electron. J. Comb. 14(1) (2007) - [j48]Mike A. Steel, László A. Székely:
Teasing Apart Two Trees. Comb. Probab. Comput. 16(6): 903-922 (2007) - [j47]László A. Székely, Hua Wang:
Binary trees with the largest number of subtrees. Discret. Appl. Math. 155(3): 374-385 (2007) - [j46]Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
On k-planar crossing numbers. Discret. Appl. Math. 155(9): 1106-1115 (2007) - [j45]Drago Bokal, Éva Czabarka, László A. Székely, Imrich Vrto:
Graph minors and the crossing number of graphs. Electron. Notes Discret. Math. 28: 169-175 (2007) - [j44]Attila Sali, László A. Székely:
SPT(q, k, n)-Codes. Electron. Notes Discret. Math. 29: 403-409 (2007) - 2005
- [j43]László A. Székely, Hua Wang:
On subtrees of trees. Adv. Appl. Math. 34(1): 138-155 (2005) - [c16]László A. Székely:
Progress on Crossing Number Problems. SOFSEM 2005: 53-61 - 2004
- [j42]László A. Székely:
Counting rooted spanning forests in complete multipartite graphs. Ars Comb. 73 (2004) - [j41]Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrt'o:
Outerplanar Crossing Numbers, the Circular Arrangement Problem and Isoperimetric Functions. Electron. J. Comb. 11(1) (2004) - [j40]László A. Székely:
A successful concept for measuring non-planarity of graphs: the crossing number. Discret. Math. 276(1-3): 331-352 (2004) - [j39]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
- [c15]Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Bounds for Convex Crossing Numbers. COCOON 2003: 487-495 - [c14]Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Bounds and Methods for k-Planar Crossing Numbers. GD 2003: 37-46 - 2002
- [j38]Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, László A. Székely, Lutz Volkmann:
Wiener index versus maximum degree in trees. Discret. Appl. Math. 122(1-3): 127-137 (2002) - [j37]Farhad Shahrokhi, László A. Székely:
Guest Editors' Foreword. Discret. Comput. Geom. 28(4): 447-448 (2002) - [j36]Michael Anthony Steel, László A. Székely:
Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications. SIAM J. Discret. Math. 15(4): 562-575 (2002) - [c13]Ondrej Sýkora, László A. Székely, Imrich Vrto:
Fractional Lengths and Crossing Numbers. GD 2002: 186-192 - [c12]Ondrej Sýkora, László A. Székely, Imrich Vrto:
Two Counterexamples in Graph Drawing. WG 2002: 391-398 - 2001
- [j35]Ralph Howard, Gyula Károlyi, László A. Székely:
Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem. Electron. J. Comb. 8(1) (2001) - [j34]Farhad Shahrokhi, László A. Székely:
Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem. Discret. Appl. Math. 108(1-2): 175-191 (2001) - 2000
- [j33]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. Comb. 20(1): 27-45 (2000) - [j32]László A. Székely:
A successful concept for measuring non-planarity of graphs: the crossing number. Electron. Notes Discret. Math. 5: 284-287 (2000) - [j31]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) - [j30]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)
1990 – 1999
- 1999
- [j29]Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy J. Warnow:
A few logs suffice to build (almost) all trees (I). Random Struct. Algorithms 14(2): 153-184 (1999) - [j28]Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy J. Warnow:
A Few Logs Suffice to Build (almost) All Trees: Part II. Theor. Comput. Sci. 221(1-2): 77-118 (1999) - 1998
- [j27]Péter L. Erdös, András Frank, László A. Székely:
Minimum Multiway Cuts in Trees. Discret. Appl. Math. 87(1-3): 67-75 (1998) - [j26]Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Intersection of Curves and Crossing Number of Cm x Cn on Surfaces. Discret. Comput. Geom. 19(2): 237-247 (1998) - [c11]Farhad Shahrokhi, László A. Székely:
Integral Uniform Flows in Symmetric Networks. WG 1998: 272-284 - 1997
- [j25]Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow:
Local Quartet Splits of a Binary Tree Infer All Quartet Splits Via One Dyadic Inference Rule. Comput. Artif. Intell. 16(2): 217-227 (1997) - [j24]Rudolf Ahlswede, Noga Alon, Péter L. Erdös, Miklós Ruszinkó, László A. Székely:
Intersecting Systems. Comb. Probab. Comput. 6(2): 127-137 (1997) - [j23]László A. Székely:
Crossing Numbers and Hard Erdös Problems in Discrete Geometry. Comb. Probab. Comput. 6(3): 353-358 (1997) - [j22]Curtis A. Barefoot, Roger C. Entringer, László A. Székely:
Extremal Values for Ratios of Distances in Trees. Discret. Appl. Math. 80(1): 37-56 (1997) - [j21]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 A 77(2): 268-278 (1997) - [c10]Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Bipartite Crossing Numbers of Meshes and Hypercubes. GD 1997: 37-46 - [c9]Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow:
Constructing Big Trees from Short Sequences. ICALP 1997: 827-837 - [c8]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 - 1996
- [j20]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) - [j19]Curtis A. Barefoot, Lane H. Clark, Roger C. Entringer, T. D. Porter, László A. Székely, Zsolt Tuza:
Cycle-saturated graphs of minimum size. Discret. Math. 150(1-3): 31-48 (1996) - [j18]Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrt'o:
The book crossing number of a graph. J. Graph Theory 21(4): 413-424 (1996) - 1995
- [c7]Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Crossing Numbers of Meshes. GD 1995: 463-471 - 1994
- [j17]Roger C. Entringer, Amram Meir, John W. Moon, László A. Székely:
On the Wiener index of trees from certain families. Australas. J Comb. 10: 211-224 (1994) - [j16]Péter L. Erdös, Ákos Seress, László A. Székely:
On Intersecting Chains in Boolean Algebras. Comb. Probab. Comput. 3: 57-62 (1994) - [j15]Farhad Shahrokhi, László A. Székely:
On Canonical Concurrent Flows, Crossing Number and Graph Expansion. Comb. Probab. Comput. 3: 523-543 (1994) - [j14]Curtis A. Barefoot, Lane H. Clark, A. J. Depew, Roger C. Entringer, László A. Székely:
Subdivision thresholds for two classes of graphs. Discret. Math. 125(1-3): 15-30 (1994) - [j13]Mike A. Steel, László A. Székely, Michael D. Hendy:
Reconstructing Trees When Sequence Sites Evolve at Variable Rates. J. Comput. Biol. 1(2): 153-163 (1994) - [j12]Péter L. Erdös, László A. Székely:
On weighted multiway cuts in trees. Math. Program. 65: 93-105 (1994) - [c6]Farhad Shahrokhi, László A. Székely, Imrich Vrto:
Crossing Numbers of Graphs, Lower Bound Techniques. GD 1994: 131-142 - [c5]Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Book Embeddings and Crossing Numbers. WG 1994: 256-268 - 1993
- [j11]Péter L. Erdös, László A. Székely:
Counting Bichromatic Evolutionary Trees. Discret. Appl. Math. 47(1): 1-8 (1993) - [c4]Farhad Shahrokhi, László A. Székely:
Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version). WG 1993: 327-337 - [c3]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 - 1992
- [j10]Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely:
Sharpening the LYM inequality. Comb. 12(3): 287-293 (1992) - [j9]László A. Székely, Lane H. Clark, Roger C. Entringer:
An inequality for degree sequences. Discret. Math. 103(3): 293-300 (1992) - [j8]Lane 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) - [c2]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 - [c1]Péter L. Erdös, László A. Székely:
Algorithms and Min-max Theorems for Certain Multiway Cuts. IPCO 1992: 334-345 - 1991
- [j7]Lane H. Clark, Roger C. Entringer, Joseph E. McCanna, László A. Székely:
Extremal problems for local properties of graphs. Australas. J Comb. 4: 25-32 (1991) - [j6]Lane H. Clark, Roger C. Entringer, László A. Székely:
Threshold functions for local properties of graphs: triangles. Discret. Appl. Math. 34(1-3): 83-105 (1991) - 1990
- [j5]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. Discret. Math. 3(1): 38-47 (1990)
1980 – 1989
- 1989
- [j4]László A. Székely, Nicholas C. Wormald:
Bounds on the measurable chromatic number of Rn. Discret. Math. 75(1-3): 343-372 (1989) - 1985
- [j3]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 A 40(1): 171-174 (1985) - 1984
- [j2]László A. Székely:
Measurable chromatic number of geometric graphs and sets without some distnaces in euclidean space. Comb. 4(2): 213-218 (1984) - [j1]László A. Székely:
On the number of homogeneous subgraphs of a graph. Comb. 4(4): 363-372 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
