\documentclass[11pt]{article}

\usepackage{etaremune,enumerate}
\def\ELP{P.L. Erd\H os}
\def\Leslie{L.A. Sz\'ekely}
\def\JCTA{{\ksl J. Comb. Th.} ({\kbf A}) }
\def\DM{{\ksl 
Discrete Math. }}
\def\DMn{Discrete Math. }
\def\DAM{{\ksl Discrete Appl. Math. }}
\def\DAMn{Discrete Appl. Math. }
\def\GC{{\ksl Graphs and Combin.}}
\def\GCn{Graphs and Combin.}
\def\kbf{\small\bf}
\def\ksl{\small\it}
\font\bsl=cmbxsl10
\font\kbf=cmb10
\font\ksl=cmsl10
\newcommand{\compresslist}{
\setlength{\itemsep}{1pt}
\setlength{\parskip}{0pt}
\setlength{\parsep}{0pt}
}

%\newcount\osszeg
%\osszeg=0
%\newcounter{bean}
%\newenvironment{listlist}%
  %      {\footnotesize \begin{enumerate}
    %            \goodbreak\medskip\centerline{\kbf References}}%
    %     {\global\advance\osszeg by\value{enumi}
      %          \end{enumerate} \normalsize}%
\def\old#1{}
\textwidth 18cm 
\textheight 22cm
\setlength{\topmargin}{-0.5cm} 
\setlength{\oddsidemargin}{-0.7cm}
\begin{document}
\title{%\vspace*{0.1in}
List of publications of}
\author {L. A. Sz\'ekely}
\def\today{\space \ifcase\month\or
   January\or February\or March\or April\or May\or
    June\or July\or
   August\or September\or October\or November\or December\fi
   \space\number\day,\ \space\number\year }


\date{\today}
\maketitle

\centerline{\bf BOOKS}
\begin{etaremune}
\compresslist


\item {\it Graph Theory and Combinatorial Biology},  
L. Lov\'asz, A. Gy\'arf\'as, G.  Katona, A. Recski and L. Sz\'ekely, eds.,
 Bolyai Society Mathematical
  Studies {\bf 7}, J. Bolyai Mathematical Society, Budapest, 1999.

\item D. E. Knuth: A sz\'am{\'\i}t\'og\'ep-programoz\'as m\H uv\'eszete
(translation of
part of  {\it The Art of Computer Programming}, Vol. 1), 
M{\H{u}}szaki K{\"o}nyvkiad{\'o}, Budapest, 1988 (first edition);
 Budapest, 1994 (second edition).

\bigskip
\bigskip
\centerline{\bf PAPERS}
\bigskip
%NHMS402890 Moultonos cikk
{\bf \ \ 2026}\\
%\begin{etaremune}%
%\compresslist
\item \'E. Czabarka, A. Helm, L. A. Sz\'ekely, Crossing optimal drawings of infinite graphs,  in preparation.
%\item \'E. Czabarka, A. Helm, L. A. Sz\'ekely, Crossing criticality of infinite graphs,  in preparation.
 \item    Ann Clifton,  \'Eva Czabarka,  Kevin Liu, Sarah Loeb, Utku Okur, L\'aszl\'o Sz\'ekely, and Kristina Wicke,                 
Reconstruction of planar tanglegrams,   in preparation.
\item \'Eva Czabarka, L\'aszl\'o Sz\'ekely, and Kristina Wicke,  Sackin index of phylogenetic networks, in preparation.
\item \'E. Czabarka, A. Helm, L.A. Sz\'ekely, 2-crossing critical tanglegrams, in preparation.
\item \'E. Czabarka, A. Helm, L. A. Sz\'ekely, Tanglegrams with a unique $1$-crossing-critical subtanglegram have tangle crossing number $1$, submitted. arXiv:2505.00163 % J. Graph Theory
 \item    Ann Clifton,  \'Eva Czabarka,  Kevin Liu, Sarah Loeb, Utku Okur, L\'aszl\'o Sz\'ekely, and Kristina Wicke,                 
Reconstruction of caterpillar tanglegrams,   
 {\it  Discrete Appl. Math.} {\bf 378}(2026), 647--661. arXiv:2501.13670 %
\item \'Eva Czabarka, Steven Kelk, Vincent Moulton, and L\'aszl\'o Sz\'ekely,  
Coconvex characters on collections of phylogenetic trees,  {\it Adv. Appl. Math.} 
{\bf 172}(2026), https://doi.org/10.1016/j.aam.2025.102952       arXiv:2504.00635   (24 pages)


\bigskip \noindent
{\bf \ \ 2025}\\
 \item    Ann Clifton,  \'Eva Czabarka,  Audace A.V. Dossou-Olory, Kevin Liu, Sarah Loeb, Utku Okur, L\'aszl\'o Sz\'ekely, and Kristina Wicke,   
  Decks of rooted binary trees, 
                 {\it European J. Combinatorics} {\bf 124}(2025) 104076 (26 pages).
%\item \'E. Czabarka, I. Singgih,  L.A. Sz\'ekely, and Zhiyu Wang, Sylvester's constant
%\item S.J. Smith, Results on select Combinatorial Problems with an Extremal Nature, Ph.D. Dissertation, University of South Carolina, 2022.
%\item 'Eva Czabarka, Jan Kyn\v{c}l, L\'aszl\'o Sz\'ekely, Biplanar crossing numbers of dense graphs

\bigskip \noindent
{\bf \ \ 2024}\\

\item Sergio Cabello, \'Eva Czabarka, Ruy Fabila-Monroy, Yuga Higashikawa, Raimund Seidel, L\'aszl\'o Sz\'ekely, Josef Tkadlec, Alexandra Wesolek, A note on the 2-colored rectilinear crossing number of random point sets in the unit square, 
 {\it Acta Mathematica Hungarica}    {\bf 173}(2024),  214--226, 
Cite DOI 10.1007/s10474-024-01436-9
\item \'E. Czabarka, Junsheng Liu, L.A. Sz\'ekely, The largest  crossing number of tanglegrams,   {\it Electronic Journal of Combinatorics,}
{\bf 31}(1) (2024), \#P1.57 https://doi.org/10.37236/12194

\bigskip \noindent
{\bf \ \ 2023}\\

\item \'E. Czabarka, S.J. Smith, L.A. Sz\'ekely, Maximum diameter of 3 and 4-colorable graphs,  {\it J. Graph Theory}
 {\bf 102}(2023)(2) 262--270 https://doi.org/10.1002/jgt.22869
 
\bigskip \noindent
{\bf \ \ 2022}\\


\item \'E. Czabarka,   T. Olsen, S. Smith, L.A. Sz\'ekely, Minimum Wiener index of
triangulations and quadrangulations,      {\it Discrete Appl. Math.}  {\bf 322} (2022) 295--310.  arXiv 2003.03873 %UJ
\item \'Eva Czabarka, Peter Dankelmann, Trevor Olsen, L\'aszl\'o A. Sz\'ekely,
Proximity in triangulations and quadrangulations,  {\it Electr. J. Graph Theory and Appl.}   {\bf 10}(2022)(2),    425--446.                  % 2001.09012  UJ
\item \'Eva Czabarka, S.J. Smith, L.A. Sz\'ekely, An infinite antichain of planar tanglegrams, {\it Order} {\bf 39}(2022) (1), 45--54.
 https://doi.org/10.1007/s11083-021-09563-6



\bigskip \noindent
{\bf 2021}\\

\item \'E. Czabarka,  L. A. Sz\'ekely, Z. Toroczkai, S. Walker, An algebraic Monte-Carlo algorithm for the %Bipartite 
Partition Adjacency Matrix realization problem, {\it Algebraic Statistics}  
{\bf 12} (2021)(2), 115--124
DOI: 10.2140/astat.2021.12.115
arXiv:1708.08242 %UJ
 \item \'E.  Czabarka, Inne Singgih, L.A. Sz\'ekely, On the maximum diameter of $k$-colorable graphs, {\it Electronic Journal of Combinatorics,} {\bf 28}(2021), Issue 3, P3.52.
 \item \'E.  Czabarka, Inne Singgih, L.A. Sz\'ekely, Counterexamples to a conjecture of Erd\H os, Pach, Pollack and Tuza, {\it Journal of Combinatorial Theory}, B {\bf 151}(2021) 38--45. 
\item \'E. Czabarka, J. Reiswig, and L.A. Sz\'ekely, 
The Steiner distance problem for large vertex subsets in the
hypercube, {\it Bulletin of the ICA}, {\bf 93}(2021)  119--125.   %UJ  
\item \'E. Czabarka, P. Dankelmann,  T. Olsen, L.A. Sz\'ekely, Wiener index and remoteness of planar
triangulations and quadrangulations,
{\it Discrete Mathematics \& Theoretical Computer Science,} {\bf 23}(2021)(1) (30 pages).
 arXiv 1905.06753.%UJ
\item G. Cochran, \'E. Czabarka,  P. Dankelmann, L. A. Sz\'ekely, A size condition for diameter two orientable graphs,   {\it  Graphs and Combinatorics}  
 {\bf 37}(2021)(2), 527--544.    %UJ  arXiv:1808.08996.

\bigskip \noindent
{\bf 2020}\\
%{\thebean./}{\usecounter{bean}\setlength{\rightmargin}{\leftmargin}}
% Inne Singgih, Diameter of 3-colorable graphs and some remarks on the midrange crossing constant, Ph.D. Dissertation, University of South Carolina, 2020.
% Trevor Olsen, Distance related graph invariants in triangulations and quadrangulations of the sphere, Ph.D. Dissertation, University of South Carolina, 2020.
\item  \'E. Czabarka, A.A.V. Dossou-Olory, L. A. Sz\'ekely, S. Wagner, Inducibility of $d$-ary trees,  {\it Discrete Math.}  {\bf 343} (2)
(2020) 111671,
https://doi.org/10.1016/j.disc.2019.111671. arXiv:1802.03817  %UJ
\item \'E. Czabarka, I. Singgih,  L.A. Sz\'ekely, and Zhiyu Wang, Some remarks on the midrange crossing constant, 
{\it Studia Sci. Math. Hung.} {\bf 57}(2020)(2), 187--192.
arXiv:1907.00368       %UJ


\bigskip \noindent
{\bf 2019}\\
% Josiah Reiswig, A few problems on the Steiner distance and crossing number of graphs, Ph.D. Dissertation, University of South Carolina, 2019.
% Josiah Reiswig, The $k$-steiner radius and $k$-steiner diameter of connected graphs for $k\geq 5$
\item \'Eva Czabarka, Josiah Reiswig, L\'aszl\'o Sz\'ekely,  Zhiyu Wang, Midrange crosssing constants for graph classes,  {\it Indian J. Discrete Math.} 
 Vol. 5, No.1 (2019) pp. 1--13.
 	arXiv:1811.08071 %UJ
\item John Asplund,
Gregory Clark,
Garner Cochran, \'Eva Czabarka,
Arran Hamm,
Gwen Spencer,
L\'aszl\'o Sz\'ekely, 
Libby Taylor,
Zhiyu Wang, Using block designs in crossing number bounds,   {\it J. Combin. Designs} 
{\bf 27}
(2019)(10), 586--597. %DOI: 10.1002/jcd.21665, arXiv:1807.03430.    UJ
\item \'E. Czabarka,  L. A. Sz\'ekely, S. Wagner, A tanglegram Kuratowski theorem, {\it J. Graph Theory} 
{\bf 90}(2)(2019), 111--122. %DOI:10.1002/jgt.22370 arXiv:1708.00309
\item \'E. Czabarka, P. Dankelmann,  L. A. Sz\'ekely, A degree condition for diameter two orientability of graphs,     
 {\it Discrete Math.}  {\bf 342}(2019) (4), 1063--1065.         %arXiv:1807.00032       %UJ 
% G. Clark and G. Spencer. ``New bounds on the biplanar crossing number of low-dimensional hypercubes: How low can you go?" Bulletin of the Institute of Combinatorics and its Applications (BICA) 83(2018), 52-60. 
%\item  �. Czabarka, Zhiyu Wang, Erd\H os-Szekeres theorem for cyclic permutations,  Involve, a Journal of Mathematics 12-2 (2019), 351--360. DOI 10.2140/involve.2019.12.351  %UJ  arXiv:1804.02578

\bigskip \noindent
{\bf 2018}\\

\item Robin Anderson, Shuliang Bai, Fidel Barrera-Cruz, \'Eva Czabarka, Giordano Da Lozzo, Natalie L.F. Hobson,
Jephian C.-H. Lin, Austin Mohr, Heather C. Smith,  L\'aszl\'o A. Sz\'ekely,  Hays Whitlatch, 
Analogies between the crossing number and the tangle crossing number,   {\it Electronic J. Comb.} 
{\bf 25}(4) (2018)  \#P4.24 (15 pages) %UJ  arXiv:1709.08119
\item John Asplund, Thao Do, Arran Hamm,  L\'aszl\'o Sz\'ekely, Libby Taylor, Zhiyu Wang, 
$k$-planar crossing number of random graphs and random regular graphs, 
{\it Discrete Appl. Math.}  {\bf 247} (2018) 419--422.  %\\ https://doi.org/10.1016/j.dam.2018.04.007 arXiv:1709.08136
% Garner Cochran,  Quick trips: things that ensure small diameter, Ph.D. Dissertation, University of South Carolina, 2018
% Garner Cochran, Eva Czabarka, Peter Dankelmann, Oriented diameter and minimum degree
\item H. Smith, L.A. Sz\'ekely, Hua Wang, Shuai Yuan, On different ``middle parts" of  a tree,  {\it Electr. J. Comb.} 
{\bf 25}(3) (2018) \#P3.17 (32  pages)   %arXiv:1701.05215
\item J. Pach,  L.A. Sz\'ekely, Cs.D. T\'oth, G. T\'oth, Note on $k$-planar crossing numbers,  
{\it Computational Geometry: Theory and Applications} Special Issue in Memoriam Ferran Hurtado. 
{\bf 68}(2018), 2--6.  % https://doi.org/10.1016/j.comgeo.2017.06.015      arXiv:1611.05746
\item \'E. Czabarka,  L. A. Sz\'ekely, S. Wagner, On the number of non-isomorphic subtrees of a tree,   {\it J. Graph Theory} 
{\bf 87}(2018), 89--95. %DOI: 10.1002/jgt.22144,    arXiv:1601.00944 


\bigskip \noindent

{\bf 2017}\\

\item \'E. Czabarka,  J. Rauh, K. Sadeghi,  T. Short, L. A. Sz\'ekely, On the number of non-zero elements in a Joint Degree Vector, 
{\it Electronic J. Combinatorics} {\bf 24}(2017)(1) \#P1.55 (14 pages)
%submitted, arXiv:1511.01035.

\item \'E. Czabarka,  L. A. Sz\'ekely, S. Wagner, Inducibility in binary trees and crossings in tanglegrams,   {\it SIAM J. Discrete Math.}  
 {\bf  31}(3)(2017) 1732--1750.  % arXiv:1601.07149.
%T. Do\v slic, T. Short. "Enumerating some families of graphs with small saturation number," In preparation
%T. Do\v slic, T. Short. "Maximal matchings in polyspiro and benzenoid chains,"
%arXiv:1511.00590 [math.CO], Preparing to submit to MATCH Commun. Math.Comput. Chem.
%T. Short. "On some conjectures concerning critical independent sets of a
%graph," arXiv:1509.05057 [math.CO], submitted to the Electronic Journal of Combinatorics, 2015.
\item \'E. Czabarka,  L. A. Sz\'ekely, S. Wagner, Path vs. stars in the local profile of trees,  {\it Electronic J. Combinatorics}
{\bf 24}(1)(2017) \#P1.22 (12 pages)
%arxiv:1512.06526 %4e4k7





\bigskip \noindent
{\bf 2016}\\

\item 	H. Smith, L.A. Sz\'ekely, Hua Wang, Eccentricity sums in trees,   {\it Discrete Applied Math.}  {\bf 207}(2016),  120--131.  %arXiv:1408.5865
%I. Miklos, H. Smith, The computational complexity of calculating partition functions of optimal medians with Hamming distance, arXiv:1506.06107
%I. Miklos, H. Smith, Sampling and counting genome rearrangement scenarios, 13th RECOMB Satellite Conference on Comparative Genomics, RECOMB-CG 2015
%Frankfurt, Germany, October 4--7, 2015,  {\it BMC Bioinformatics}  {\bf 16}(Suppl 14) (2015) :S6
%\item L. Lu, A. Mohr, L.A. Sz\'ekely, Counting regular uniform hypergraphs using the    Lov\'asz Local Lemma, in preparation
\item L. A. Sz\'ekely, Tur\'an's Brick Factory Problem:   the Status of the  Conjectures of Zarankiewicz  and Hill,  Chapter 13 in Graph Theory---Favorite Conjectures and Open Problems -1, eds.  R. Gera, S. Hedetniemi, C. Larson,   Problem Books in Mathematics series, Springer-Verlag,   2016, 211--230.
\item L.A. Sz\'{e}kely, S. Wagner,  Hua Wang, Problems related to graph indices in trees, in:  Recent Trends in Combinatorics,
eds. A. Beveridge, J.R. Griggs, L. Hogben, G. Musiker, P. Tetali, The IMA Volumes in Mathematics and Applications {\bf 159},  Springer-Verlag, 2016, 3--31.  

\bigskip \noindent
{\bf 2015}\\

\item  \'E. Czabarka, A. Dutle, T. Johnston,  L. A. Sz\'ekely, Abelian groups yield many large families for the diamond problem,
 {\it Europ. J. Math.} {\bf 1}(2) (2015) 320--328.

\bigskip \noindent
{\bf 2014}\\
\item L. A. Sz\'ekely, Hua Wang, Extremal values of ratios: distance problems vs. subtree problems in trees II,   {\it Discrete Math.} {\bf 322}  (2014),  36--47.
\item 	H.C. Smith, L.A. Sz\'ekely, Some remarks on Baranyai's theorem,  {\it Congr. Num.}  {\bf 222} (2014), 43--55.
\item F. Moln\'ar Jr., N. Derzsy, \'E. Czabarka,  L. A. Sz\'ekely, B. K. Szymanski, G. Korniss, 
Dominating scale-free networks using generalized probabilistic methods,  {\it  Scientific Reports} (2014) 4:6308 DOI: 10.1038/srep06308

\bigskip \noindent
{\bf 2013}\\

\item Linyuan Lu, A. Mohr, L. A. Sz\'ekely, Connected balanced subgraphs in random regular multigraphs under the configuration model,   {\it J. Comb. Math.
Comb. Comput.} {\bf 86} (2013), 111--123.
\item L. A. Sz\'ekely, Hua Wang, Extremal values of ratios: distance problems vs. subtree problems in trees,  {\it Electronic J. Combinatorics} {\bf 20}(1)(2013) \#P67, pp. 1--20.
  \item  H. Aydinian, \'E. Czabarka,  L. A. Sz\'ekely, Mixed orthogonal arrays, $k$-dimensional $M$-part Sperner multi-familes 
 and full multi-transversals, %arXiv:1207.2646, 
 in: {\it Information Theory, Combinatorics, and Search Theory (in Memory of Rudolph Ahlswede)}, 
   eds. H. Aydinian, F. Cicalese, C. Deppe, Lecture Notes in Computer Science
 {\bf 7777}, 2013, Springer-Verlag,   371--401.
 \item  \'E. Czabarka, M. Marsili,  L. A. Sz\'ekely, Threshold functions for distinct parts: revisiting Erd\H os--Lehner,   in: {\it  Information Theory, Combinatorics, and Search Theory (in Memory of Rudolph Ahlswede)},   eds. H. Aydinian, F. Cicalese, C. Deppe, Lecture Notes in Computer Science  {\bf 7777}, 2013, Springer-Verlag,     463--471.
\item Linyuan Lu, A. Mohr, L. A. Sz\'ekely, Quest for negative dependency graphs,
 {\it Recent advances in harmonic
analysis and applications (in honor of Konstantin Oskolkov)} eds. D. Bilyk, L. de Carli, A.M. Stokolos, A. Pethukov, B.D. Wick, Springer Proceedings in Mathematics \& Statistics, Vol. 25,
2013, 243--258.


\bigskip \noindent
{\bf 2012}\\

\item Cs. B\'{i}r\'o, \'E. Czabarka, P. Dankelmann, L. A. Sz\'ekely, Two remarks on the
domination number of graphs,  {\it Bull. I.C.A.} {\bf 64} (2012), 73--82. 

\bigskip \noindent
{\bf 2011}\\

\item \'E. Czabarka, P. L. Erd\H os,  V. Johnson, A. Kupczok,  L. A. Sz\'ekely, Asymptotically normal distribution of some tree families relevant for phylogenetics and of partitions without singletons,  {\it Moscow J. Number Theory and Combinatorics} {\bf 1}(3)(2011) 12--24 [220--232].
\item H. Aydinian, \'E. Czabarka, P. L. Erd\H os,  L. A. Sz\'ekely,
A tour of $M$-part $L$-Sperner families,  {\it J. Comb Theory} Ser A.
{\bf 118} (2011) 702--725.
\item L. A. Sz\'ekely, Hua Wang, and Taoyang Wu,
The sum of distances between the leaves of a tree and the
'semi-regular' property, {\it Discrete Math.} {\bf 311} (2011), 1197--1203. %NIHMS213876

\bigskip
\noindent
{\bf 2010}\\

\item H. Aydinian, \'E. Czabarka, K. Engel, P. L. Erd\H os,  L. A. Sz\'ekely,
A note on full transversals and mixed orthogonal arrays, {\it Australasian J. Comb.}
{\bf 48}(2010), 133--141.
\item D. Bokal, E. Czabarka, L. A. Sz\'ekely, and I. Vr\v to,
General lower bounds for the minor crossing numbers of graphs,
  {\it Discrete and Computational Geometry} {\bf 44}(2010), 463--483.
%\item L. Lu, Yiting Yang,  A lower bound of transposition diameter,
 % SIAM J Discrete Math. 24  (2010) 1242--1249.
 %\item Wei-Tian Li, L. Lu, Yiting Yang,  Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes, SIAM J. Discrete %Math., 24(4), 1482�1494. (13 pages)
%Yiting Yang,Linyuan Lu The Randi? index and the diameter of graphs, Discrete Mathematics
%Volume 311, Issue 14, 28 July 2011, Pages 1333�1343
 
%\newpage
\bigskip
\noindent
{\bf 2009}\\

\item M. A. Steel and L. A. Sz\'ekely,  Inverting random functions III: 
discrete MLE revisited,  {\it Annals Comb.} {\bf 13} (2009) 373--390.
% (2009) DOI 10.1007/s00026-009-0023-z NIHMS ??????
\item M. A. Steel, L. A. Sz\'ekely, 
An improved bound on the Maximum Agreement Subtree problem,
  {\it Appl. Math. Letters} {\bf 22} (2009) 1778--1780. %NIHMS130229 PMID: 20161013
\item Hyunju Kim, Z. Toroczkai, I. Mikl\'os, P. L. Erd\H os, L. A. Sz\'ekely,
Degree based graph construction,
   {\it Phys. Lett. A   Math. Theor.} {\bf 42} (2009) 392001.
\item \'E. Czabarka,  L. A. Sz\'ekely, S. Wagner, The inverse problem for
certain tree parameters,  {\it Discrete Applied Math.}
{\bf 157}(15)(2009),  3314--3319. % NIHMS138279 PMID: 20161029
\item \'E. Czabarka, P. Dankelmann, L. A. Sz\'ekely, Diameter of 4-colorable
graphs,  {\it Europ. J. Comb.} {\bf 30} (2009) 1082--1089. 
\item M. A. Steel, L. A. Sz\'ekely, E. Mossel,
Phylogenetic information complexity: is testing a tree easier than finding it?
 {\it J. Theor. Biology} {\bf 25} (2009) 95--102.%PMID 19490881
\item  L. A. Sz\'ekely, Yiting Yang, On the expectation and variance 
of the reversal distance, {\it Acta Univ. Sapientiae, Mathematica} {\bf 1}
 (2009) (1) 5--20.%NIHMS147907 PMID: 20200597


\bigskip
{\bf 2008}\\


\item  \'E. Czabarka, O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to,
Biplanar crossing numbers II: comparing crossing numbers and biplanar 
crossing numbers  using the probabilistic method, 
{\it Random Structures and Algorithms} {\bf 33} (2008) 480--496. 
\item L. A. Sz\'ekely, An optimality criterion for 
the crossing number,  {\it Ars Mathematica Contemporena} {\bf 1}(2008),
32--37.
\item  A. Sali and L. A. Sz\'ekely, On the existence of Armstrong
instances with bounded domains,
	Foundations of Information and Knowledge Systems (FoIKS 2008),
Lecture Notes in Computer Science Vol. 4932, pp. 151--157, 2008, 
Springer-Verlag.
\item L. A. Sz\'ekely, Hua Wang, and Yong Zhang, Erratum to ``Some 
 non-existence 
results on Leech trees'',  {\it Bull. Inst. Comb. Appl.} {\bf 52} (2008) pp.6.


\bigskip
{\bf 2007}\\

\item  M. A. Steel and L. A. Sz\'ekely, Teasing apart two trees, 
 {\it Combinatorics, Probability, and Computing} {\bf 16} (2007) (6) 903--922.
\item Linyuan Lu and L. A. Sz\'ekely, Using Lov\'asz Local Lemma
in the space of random injections,  {\it Electronic J. Comb.} {\bf 14} (2007)
R63, pp. 13.
\item A. Sali and L. A. Sz\'ekely, $SPT(q,k,n)$-codes,  \\
{\it Electronic Notes in Discrete Mathematics} {\bf 29} 2007, 403--409.
\item F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and  I. Vr\v to,
 $k$-planar crossing numbers,
 {\it Discrete Appl. Math.} {\bf 155} (2007), 1106--1115.
\item D. Bokal, \'E. Czabarka, L. A. Sz\'ekely, and I. Vr\v to, Graph minors
and the crossing number of graphs, {\it Electronic Notes in Discrete Math.} 
{\bf 28} (2007) 169--175.

\bigskip
{\bf 2006}\\

\item L. A. Sz\'ekely and Hua Wang, Binary trees with the largest number of
subtrees,  {\it Discrete Appl. Math.}  {\bf 155} (3) 2006,  374--385. 
\item  M. A. Steel and L. A. Sz\'ekely, On the variational distance
of two trees,  {\it Annals Appl. Prob.} {\bf 16} (3) (2006), 1563--1575.
\item  \'E. Czabarka, O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to, 
Crossing numbers and biplanar crossing numbers I: a survey of problems 
and results,  {\it More Sets, Graphs and Numbers}, eds. E. Gy\H ori,
G. O. H. Katona, and L. Lov\'asz, Bolyai Society Mathematical Studies {\bf 15},
Springer Verlag, 2006, 57--77.
%\item   Hua Wang and Gang Yu, All but 49 numbers are Wiener indices of trees,
%{\it Acta Applicandae Mathematicae} {\bf 92} (2006), no. 1, 15--20. 

\bigskip
{\bf 2005}\\

\item L. A. Sz\'ekely and Hua Wang, Binary trees with the largest number of 
subtrees with at least one leaf,  
36th Southeastern International Conference on Combinatorics, 
Graph Theory, and Computing.  {\it Congr. Numer.}  {\bf 177}  (2005), 147--169.
\item L. A. Sz\'ekely and Hua Wang, On subtrees of trees, 
 {\it Adv. Appl. Math.} {\bf 34} (2005), 138--155.
\item L. A. Sz\'ekely, Progress on crossing number problems, 
{\it SOFSEM 2005: Theory
                     and Practice of Computer
                     Science: 31st Conference on
                     Current Trends in Theory and
                     Practice of Computer Science
                     Liptovsk\'y J\'an, Slovakia, January
                     22-28, 2005.} 
                     Editors:  P. Vojt\'as, M.
                     Bielikov\'a, B.
                     Charron-Bost, et al. 
 Lecture Notes in Computer Science Vol. 3381, 2005, Springer-Verlag, 53--61.
\item P. L. Erd\H os, \'A. Seress and L. A. Sz\'ekely,
Non-trivial $t$-intersection in the function lattice, 
{\it Annals of Combinatorics} {\bf 9} (2005), 177--187.
\item L. A. Sz\'ekely, Hua Wang, and Yong Zhang, Some non-existence 
results on Leech trees,  {\it Bull. Inst. Comb. Appl.} {\bf 44} (2005), 37--45.
{\bf 52} (2008).

\bigskip
{\bf 2004}\\

\item  L. A. Sz\'ekely, Short proof for a theorem of Pach, Spencer, and T\'oth,
 in: {\it Towards a Theory of Geometric Graphs}, 
ed. J. Pach, {\it Contemporary Mathematics} {\bf 342},
Amer. Math. Soc. 2004, 281--283.
\item F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and  I. Vr\v to,
The gap between the   crossing number and the convex  crossing number,
 in: {\it Towards a Theory of Geometric Graphs}, 
ed. J. Pach, {\it Contemporary Mathematics} {\bf 342},
Amer. Math. Soc. 2004, 249--258. 
\item F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and  I. Vr\v to,
Bounds and methods for $k$-planar crossing numbers,
 {\it Graph Drawing} 2004, Lecture Notes in Computer
 Science Vol. 2912,
 Springer Verlag,
Berlin, 2004, 37--46.
\item  O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to, A note on Halton's
conjecture,   {\it Information Sciences} {\bf 164} (2004) (1-4) 61--64.
\item L. A. Sz\'ekely, Counting rooted spanning forests in complete 
multipartite graphs,   {\it Ars Combinatoria} {\bf 73} (2004), 97--100.
\item  \'E. Czabarka, O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to,
Outerplanar Crossing Numbers, Circular Arrangement Problem, and 
Isoperimetric Functions,  {\it Electronic J. Combinatorics} {\bf 11} (1) (2004)
R81 (20 pages).
\item L. A. Sz\'ekely, A successful concept for measuring non-planarity
 of graphs: the crossing number,  {\it Discrete Math.} {\bf 276} (2004), 
1--3, 331--352.


\bigskip
{\bf 2003}\\

\item F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and  I. Vr\v to,
Bounds on convex crossing numbers,  {\it COCOON} 2003, The Ninth 
International Computing and
    Combinatorics Conference, Lecture Notes
in Computer Science vol. 2697, Springer Verlag, 2003
487--495.


\bigskip
{\bf 2002}\\

\item  M. Fischermann, A. Hoffmann, D. Rautenbach, L. Sz\'ekely and 
L. Volkmann,
Wiener index versus maximum degree in trees,  {\it Discrete Appl. Math.}
{\bf 122} (1-3) (2002) 127--137.
\item  O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to, Two counterexamples in 
graph drawing,   Proc. {\it 28th Intl. 
Workshop on Graph-Theoretic Concepts in
Computer Science}, ed. L. Kucera, Lecture Notes in Computer Science Vol. 2573,
 Springer Verlag,
Berlin, 2002, 389-396.
\item I. B. Rogozin, K. S. Makarova, Y. I. Wolf, J. Murvai, E. Czabarka,
  L. A. Szekely, R. L. Tatusov, and E. V. Koonin, 
  Connected gene neighborhoods in prokaryotic genomes,   {\sl
Nucleic Acids Res.} {\bf 30} (10) (2002), 2212--2223. %PMID115289
\item L. A. Sz\'ekely,  Erd\H os on unit distances and the Szemer\'edi-Trotter
theorems,  {\it Paul Erd\H os and his Mathematics II.},  eds.
G. Hal\'asz, L. Lov\'asz, M. Simonovits, and V. T. S\'os, Bolyai
Society Mathematical Studies {\bf 11},  J\'anos Bolyai Mathematical 
Society, Budapest, and Springer-Verlag, Berlin,   2002, 649--666.
\item O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to, Fractional length and 
crossing numbers, in: {\it Graph Drawing 2002},  Lecture Notes in Computer
 Science Vol. 2528,
 Springer Verlag,
Berlin, 2002, 186--192.
\item L. A. Sz\'ekely,  Zarankiewicz crossing number conjecture, article in: 
Kluwer Encyclopaedia of Mathematics, Supplement III 
Managing Editor: M. Hazewinkel
Kluwer Academic Publishers, 2002,  451--452.
\item M. A. Steel and L. A. Sz\'ekely, Inverting random functions II:
explicit bounds for discrete maximum likelihood estimation,
 with applications, {\it SIAM J. Discrete Math.} {\bf 15} (4) (2002), 
562--575. 

\bigskip
{\bf 2001}\\

\item F. Shahrokhi and L. A. Sz\'ekely,
Constructing integral uniform flows in symmetric  networks and application
to the forwarding index problem,   {\it Discrete Applied Math.}
{\bf 108} (2001), 175--191.
\item R. Howard, G. K\'arolyi, 
and L. A. Sz\'ekely,
Towards a Katona type proof for the 2-intersecting Erd\H os-Ko-Rado theorem,
 {\it Electronic J. Combinatorics}, {\bf 8} (1) (2001), R31 (8 pages).

\bigskip
{\bf 2000}\\

\item  L. A. Sz\'ekely, 
A successful concept for measuring non-planarity of graphs:
the crossing number, in: {\it Electronic Notes in Discrete Mathematics} Vol. 5
{\tt http://www.elsevier.nl/locate/endm} Elsevier, Amsterdam, 2000, 284--287.
\item
P. L. Erd\H os, and L. A. Sz\'ekely, Erd\H os-Ko-Rado theorems of higher
 order, in:  {\it  Numbers, Information and Complexity}, Ingo Alth\"ofer, 
Ning Cai, G\"unther Dueck, Levon Khachatrian,
Mark S. Pinsker, Andr\'as S\'ark\"ozy, Ingo Wegener and Zhen Zhang (eds.),
Kluwer Academic Publishers, 2000, 117--124.
\item  P. L. Erd\H os, \'A. Seress and L. A. Sz\'ekely,
 Erd\H os-Ko-Rado and Hilton-Milner type theorems for intersecting
chains in posets,  {\it Combinatorica} {\bf 20}(1) (2000) 27--45.
\item F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and  I. Vr\v to, A new  lower
bound for bipartite
crossing numbers  with 
 applications,   {\it 
Theor. Comp. Sci.} {\bf 245} (2) (2000), 281--294.
\item F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to,
On bipartite drawings and the linear 
arrangement problem, 
   {\it SIAM J. Computing} {\bf 30} (6) (2000), 1773--1789.

\bigskip
{\bf 1999}\\

\item M. A. Steel and L. A. Sz\'ekely, Inverting random functions, 
  {\it Annals of Combinatorics} {\bf 3}  (1999), 103--113.
\item P. L. Erd\H os,  M. A. Steel, L. A. Sz\'ekely, and T. J. Warnow,
A few logs suffice to build (almost) all trees  I,  
 {\it Random Structures
and Algorithms}     {\bf 14}(1999)(2)        153--184.   
\item P. L. Erd\H os,  M. A. Steel, L. A. Sz\'ekely, and T. J. Warnow,
A few logs suffice to build (almost) all trees  II, 
 {\it  Theor. Comp. Sci.} {\bf 221} (1-2)(1999), 77--118.

\bigskip
{\bf 1998}\\

 \item  F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to,
  Crossing numbers of  $C_m\times C_n$ and other families of curves,
  {\it Discrete and Comp. Geometry}  {\bf 19}(2)(1998), 237--248.
  \item  P. L. Erd\H os,  A. Frank, and L. A. Sz\'ekely,
Minimum multiway cuts in trees,   {\it Discrete Appl. Math.} {\bf 87} (1998),
67--75.
\item F. Shahrokhi and L. A. Sz\'ekely
Integral uniform flows in symmetric  networks, {\it Graph-Theoretic Concepts
in Computer Science (WG'98, Smolenice)},  J. Hromkovi\v c and O. S\'ykora eds.,
Lecture Notes in Computer Science  1517, Springer-Verlag, 1998, 272--284.
%\item \'Eva Czabarka and L. A. Sz\'ekely, An alternative shifting proof 
%to Hsieh's theorem,  {\it Congressus Numerantium} {\bf 134} (1998), 117--122. 


\bigskip
{\bf 1997}\\

\item  P. L. Erd\H os, \'A. Seress and L. A. Sz\'ekely,
  On intersecting chains in Boolean algebras,
{\it Combinatorics,
Geometry, and Probability. A tribute to Paul Erd\H os.  Papers from the 
Conference in Honor of Erd\H os' 80th Birthday held at Trinity College,
 Cambridge, March 1993. Eds. B. Bollob\'as
and A. Thomason, Partial reprinting of Combinatorics, 
Probability and Computing}, Cambridge University Press, 
Cambridge, 1997, 299--304. (reprint)
\item   R. Ahlswede,
 N. Alon, P. L. Erd\H os,  M. Ruszink\'o and L. A. Sz\'ekely,
 Intersecting systems,    {\it Combinatorics, 
Probability, and Computing} {\bf 6}(2)(1997), 127--137. 
\item L. A. Sz\'ekely,
 Crossing numbers and hard Erd\H os problems in discrete geometry,
 {\it Combinatorics, Probability, and Computing} {\bf 6}(3)(1997), 353--358.
\item D. de Caen and L. A. Sz\'ekely,
  On dense bipartite graphs of girth eight and upper bounds for certain
configurations in planar point-line systems,  
{\it J. Combin. Theory} Ser. A. {\bf 77}(1997), 268--278.
\item  F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to,
  Crossing numbers: bounds and applications, in:
  {\it Intuitive Geometry}, eds. I. B\'ar\'any and K. B\"or\"oczky, Bolyai
Society Mathematical Studies {\bf 6},  J\'anos Bolyai Mathematical 
Society, Budapest, 1997, 179--206.
\item
 P. L. Erd\H os,  M. A. Steel, L. A. Sz\'ekely, and T. J. Warnow,
Local quartet splits of a binary tree infer all quartet splits via one
dyadic inference rule,  {\it Computers and Artificial Intelligence}
{\bf 16}(2)(1997), 217--227.
\item  L. H. Clark, J. E. McCanna, L. A. Sz\'ekely,
 A survey of counting bicoloured trees,   {\it 
Bull. Inst. Comb. Appl.} {\bf 21}(1997), 33--45.
\item P. L. Erd\H os,  M. A. Steel, L. A. Sz\'ekely, and T. J. Warnow,
Constructing big trees from short sequences,
{\it ICALP'97,    24th International Colloquium on Automata,      
                     Languages, and Programming    (Silver Jubilee of EATCS), 
Bologna, Italy, July 7th--11th, 1997,} eds. P. Degano, R. Gorrieri, and
 A.  Marchetti-Spaccamela,
Lecture Notes in Computer Science Vol 1256, Springer-Verlag, 1997,  827--837.
\item F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to,
On bipartite crossings, largest biplanar subgraphs, and the linear 
arrangement problem, {\it 
 Workshop on Algorithms and Data 
Structures (WADS'97), August 6-8, 1997 Halifax, Nova Scotia, Canada},
 Lecture Notes in Computer Science Vol. 1272, Springer-Verlag, 1997, 55--68.
\item P. L. Erd\H os and L. A. Sz\'ekely,
 Pseudo-LYM inequalities and AZ identities,
 {\it Adv. Appl. Math.} {\bf 19} (1997), 431--443.
\item F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to, Bipartite
crossing numbers of meshes and hypercubes, {\it Graph Drawing (Rome 1997)},
 Lecture Notes in Computer Science Vol. 1353, Springer-Verlag,
  1997,  37--46.
\item C. A. Barefoot, R. C. Entringer, and L. A. Sz\'ekely,
 Extremal values for ratios of distances in trees,  
{\it Discrete Appl. Math.} {\bf 80}(1997), 37--56.

\bigskip
{\bf 1996}\\

 \item  F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to,
 The book crossing number of a graph,
 %Book embeddings and crossing numbers,
    {\it J. Graph Theory} {\bf 21}(1996)(4), 413--424. 
\item    D. J. Kleitman, R. C. Entringer and L. A. Sz\'ekely,
 A note on spanning trees with minimum
 average distance,   {\it  Bull. Inst. Comb. Appl.} {\bf 17}(1996), 71--78.
\item C. Barefoot,
L. H. Clark, R. C. Entringer, T. D. Porter, L. A. Sz\'ekely and Zs. Tuza,
Cycle saturated graphs of minimum size,
 Selected papers in honour of Paul Erd\H os
 on the occasion of
his 80th birthday (Keszthely, 1993). {\it Discrete Math.} {\bf 150}(1996),
31--48.
\item  F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to,
 The crossing number of a graph  on a 
compact 2-manifold,  {\it Adv.  Math.} {\bf 123}(1996), 105--119.
\item  F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to,
    Drawings of graphs on surfaces with few crossings, 
 {\it Algorithmica}  {\bf 16}(1996), 118--131.
\item  F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to,
 The crossing numbers of meshes, 
 {\it
 Graph Drawing (Passau 1995)}, ed. F. J. Brandenburg,
 Lecture Notes in Computer Science 1027,  Springer Verlag, Berlin,
 1996, 463--471.
\item F. Shahrokhi and L. A. Sz\'ekely,
 Uniform concurrent multicommodity flow in  product graphs, Proceedings of 
the Twenty-seventh Southeastern International Conference on
Combinatorics, Graph Theory and Computing (Baton Rouge, LA, 1996),
{\it  Congr. Numerantium}
 {\bf 122} (1996),
67--89. 

\bigskip
{\bf 1995}\\

\item F. Shahrokhi and L. A. Sz\'ekely,
 On group invariant flows and applications,  in: {\it
Graph Theory, Combinatorics, and Applications:
Proceedings of the  Seventh Quadrennial
International Conference on the Theory and Applications of Graphs,
Volume 2} eds. Y. Alavi and A. Schwenk, John Wiley and Sons,
 Inc., 1995, 1033--1042.
\item L. A. Sz\'ekely, Brouwer's fixed point theorem implies Gallai's theorem, 
{\it Acta Sci. Math. (Szeged)} {\bf 60}(1995), 681--684.
\item   
 F. Shahrokhi, L. A. Sz\'ekely  and I. Vr\v to,
   Crossing numbers of graphs, lower bound techniques and algorithms:
a survey, {\it Graph Drawing (Princeton, NJ, 1994)}
Lecture Notes in Computer Science Vol. 894, Springer Verlag, Berlin, 1995,
131--142.
\item  F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to,
 Book embeddings and crossing numbers,  
in: {\it Graph-Theoretic Concepts in Computer Science (Herrsching, 1994)},
  ed. J. van Leeuwen,
 Lecture Notes in Computer Science Vol. 903,
 Springer Verlag,
Berlin, 1995, 256--268

\bigskip
{\bf 1994}\\

\item F. Shahrokhi and L. A. Sz\'ekely,
 Concurrent flows and   packet routing in Cayley graphs,
in: {\it Graph-Theoretic Concepts in Computer Science (Utrecht, 1993)},
  ed. J. van Leeuwen,
 Lecture Notes in Computer Science Vol. 790,
 Springer Verlag,
Berlin, 1994, 327--338. 
\item F. Shahrokhi and L. A. Sz\'ekely,
 Integral uniform concurrent flows and  all pairs packet routing,
 {\it Congr. Num.} {\bf 97}(1993), 3--16.
\item  C. A. Barefoot, L. H. Clark, A. J. Depew, 
R. C. Entringer and L. A. Sz\'ekely,
  Subdivision thresholds for two classes of graphs,  
{\it Discrete Math.} {\bf 125}(1994), 15--30.
\item L. A. Sz\'ekely,  P. L. Erd\H os and M. A. Steel,
 The combinatorics of  reconstructing evolutionary trees, 
 {\it J. Comb. Math. Comb. Comput.} {\bf 3}(1994), 241--254.
\item P. L. Erd\H os and L. A. Sz\'ekely,
 On weighted multiway cuts in trees,
{\it Math. Programming} {\bf 65}(1994), 93--105.
\item F. Shahrokhi and L. A. Sz\'ekely,
 The complexity  of the bottleneck
 graph bipartition problem,  {\it J. Comb. Math. Comb. Comput.}
 {\bf 15}(1994), 221--226.
\item  P. L. Erd\H os, \'A. Seress and L. A. Sz\'ekely,
  On intersecting chains in Boolean algebras,
 {\it Combinatorics, Probability, and 
Computing},  {\bf 3}(1994), 57--62. 
%Reprinted in {\it Combinatorics,
%Geometry, and Probability. A tribute to Paul Erd\H os.  Papers from the 
%Conference in Honor of Erd\H os' 80th Birthday held at Trinity College,
% Cambridge, March 1993. Eds. B. Bollob\'as
%and A. Thomason, Partial reprinting of Combinatorics, 
%Probability and Computing}, Cambridge University Press, 
%Cambridge, 1997, 299--304.
\item  M. A. Steel, L. A. Sz\'ekely and  M. D. Hendy,
 Reconstructing trees when sequence sites evolve at variable rates,
 {\it J. Computational Biology} {\bf 1}(1994)(2),  153--163.
\item  N. Graham, R. C. Entringer and L. A. Sz\'ekely,
 New tricks for old trees: maps and the pigeonhole principle, 
 {\it  Amer. Math. Monthly} {\bf 101}(1994), 664--667.
\item  R. C. Entringer, A. Meir, J. W. Moon and L. A. Sz\'ekely,
  On the  Wiener index of trees from certain families,   {\it
Australasian J. Comb.}, {\bf 10}(1994), 211--224.
\item F. Shahrokhi and L. A. Sz\'ekely,
On canonical concurrent flows, crossing number and graph expansion,
   {\it Combinatorics,
 Probability, and Computing} {\bf 3} (1994), 523--543.
\item 
 F. Shahrokhi, O. S\'ykora, L. A. Sz\'ekely and I. Vr\v to,
 Improved bounds for the  crossing numbers   on surfaces of genus $g$,
in: {\it Graph-Theoretic Concepts in Computer Science (Utrecht 1993)},
  ed. J. van Leeuwen,
 Lecture Notes in Computer Science Vol. 790,
 Springer Verlag,
Berlin, 1994, 388--395.

\bigskip
{\bf 1993}\\

\item  L. H. Clark, R. C. Entringer, P. Erd{\H{o}}s, Hui Cheng Sun and 
L. A. Sz\'ekely,
 Extremal problems for the Bondy-Chvatal closure of a graph,  in:
 {\it "Graphs, Matrices, and Designs:  Festschrift in Honor of
 Norman J. Pullman"}, ed. R. S. Rees, Marcel Dekker, Inc., N. Y., 1993,
73--83.
\item  M. A. Steel, L. A. Sz\'ekely,
P. L. Erd\H os and P. Waddell,
 A complete family of phylogenetic invariants for any number of
taxa under the Kimura 3ST model,
  {\it New Zealand J. of Botany} {\bf 31}(1993), 289--296.
\item P. L. Erd\H os and L. A. Sz\'ekely,
 Counting bichromatic evolutionary trees,   {\it Discrete
Appl. Math.}   {\bf 47}(1993), 1--8.
\item D. de Caen and L. A. Sz\'ekely,
 On a problem of Erd{\H o}s and Lov\'asz,  
 {\it Ars Comb.} {\bf 35A}(1993), 187--192.
\item L. A. Sz\'ekely,  M. A. Steel, and  P. L. Erd{\H o}s,
 Fourier calculus on evolutionary trees, {\it Adv. Appl. Math.
 } {\bf 14}(1993), 200--216.
\item L. A. Sz\'ekely,  P. L. Erd{\H o}s,  M. A. Steel and D. Penny,
 A Fourier inversion formula for evolutionary trees,  
{\it Appl. Math. Letters} {\bf 6}(1993) (2), 13--17.

\bigskip
{\bf 1992}\\

\item  L. H. Clark, R. C. Entringer and L. A. Sz\'ekely,
  Threshold functions for local properties of graphs: Triangles,
 in: {\it Combinatorics and Theoretical Computer Science}
 Proceedings of the Capital City Conference, Washington, D.C., USA,
22--26 May 1989,
 ed. by R. Simion, Topics in
 Discrete Mathematics
{\bf 1}, North-Holland, 1992, 83--105. (reprint)
\item L. A. Sz\'ekely,  L. H. Clark and R. C. Entringer,
 An inequality for degree sequences,  {\it Discrete Math.} {\bf 103}(1992),
293--300.
\item P. L. Erd{\H{o}}s, P. Frankl, D. J. Kleitman, M. E. Saks
and L. A. Sz\'ekely,
 Sharpening the LYM inequality,  {\it Combinatorica} {\bf 12}(1992),
287--293. 
\item F. Shahrokhi and L. A. Sz\'ekely,
 Effective lower bounds for crossing number, bisection width and
balanced vertex separator in terms of symmetry,  in:  {\it Integer
Programming and Combinatorial Optimization, Proceedings of a Conference
held at Carnegie Mellon University, May 25-27, 1992, by the Mathematical
Programming Society}, eds. E. Balas, G. Cornu\'ejols, R. Kannan, 102--113,
CMU Press, 1992.
\item P. L. Erd\H os and L. A. Sz\'ekely,
 Algorithms and  min-max theorems on certain multiway cuts, 
 in:  {\it Integer
Programming and Combinatorial Optimization, Proceedings of a Conference
held at Carnegie Mellon University, May 25-27, 1992, by the Mathematical
Programming Society}, eds. E. Balas, G. Cornu\'ejols, R. Kannan, 334--345,
CMU Press, 1992.
\item  L. H. Clark, F. Shahrokhi and L. A. Sz\'ekely,
 A linear-time algorithm for graph partition problems,   {\it
Inform. Process. Letters} {\bf 42}(1992), 19--24.
\item D. de Caen and L. A. Sz\'ekely,
  The maximum size of 4- and 6-cycle free bipartite graphs on $m$,
 $n$ vertices, in:  {\it  Sets, Graphs,  and Numbers: a birthday salute to Vera T. S\'os and Andr\'as Hajnal},
% Proceedings of the Conference Dedicated to the $60\sp{th}$ Birthdays of A. Hajnal and Vera T. S\'os, ISBN
%  0444986812 or  9638022698
 Budapest, 1991, eds. G. Hal\'asz,
L. Lov\'asz, D. Mikl\'os, T. Sz\H onyi,
Coll. Math. Soc. J{\'a}nos Bolyai {\bf 60}(1992), 135--142.
%Sets, graphs and numbers : a birthday salute to Vera T. S�s and Andr�s Hajnal
\item  M. A. Steel, M. D. Hendy, L. A. Sz\'ekely and
P. L. Erd{\H o}s,
 Spectral analysis and a closest tree method for genetic sequences,
{\it Appl. Math. Letters}  {\bf 5}(1992)(6), 63--67.
\item L. A. Sz\'ekely,  P. L. Erd\H os and M. A. Steel,
 The combinatorics of evolutionary trees---a survey, in: {\it Actes du
S\'eminaire, S\'eminaire
Lotharingien de Combinatoire, 28$\sp e$ Session, 15--18 mars: 1992,
Saint-Nabor, Ottrott},
J. Zeng, \'ed., Publication de l'Institute de Recherche Math\'ematique
Avanc\'ee,  Universit\'e Louis
Pasteur, Strasbourg, 1992, 129--143.
%(An extended journal version was published as:
% The combinatorics of  reconstructing evolutionary trees, 
% {\it J. Comb. Math. Comb. Comput.}, {\bf 3}(1994), 241--254.)
\item P. L. Erd\H os and L. A. Sz\'ekely,
 Evolutionary trees: An integer multicommodity max-flow--min-cut theorem,
{\it Adv.  Appl. Math.} {\bf 13}(1992), 375--389.

\bigskip
{\bf 1991}\\

\item  L. H. Clark, J. E. McCanna, R. C. Entringer and L. A. Sz\'ekely,
 Extremal problems for local properties of graphs,  {\it
Australasian J.  Comb.} {\bf 4}(1991), 25--31.
\item  K. A. Johnson, R. Grassl, J. E. McCanna and L. A. Sz\'ekely,
 Pascalian rectangles modulo $m$,   {\it Quaest. Math.}
{\bf 14}(1991), 383--400.
\item  L. H. Clark, R. C. Entringer and L. A. Sz\'ekely,
 Threshold functions for local properties of graphs: Triangles, 
 {\it Discrete Appl. Math.} {\bf 34}(1991), 83--105. 

\bigskip
{\bf 1990}\\

\item  M. Carter, M. Hendy, D. Penny, L. A. Sz\'ekely and N. C. Wormald,
 On the distribution of length of evolutionary trees, {\it SIAM J. Discrete
Math.}
{\bf 3}(1990), 38--47.
\item T. D. Porter and L. A. Sz\'ekely,
 On a matrix discrepancy problem, {\it Congr. Num.} {\bf
73}(1990), 239--248.
\item  A. A. Kooshes, B. M. E. Moret and L. A. Sz\'ekely,
 Improved bounds on the prison yard problem,  {\it Congr.
Num.} {\bf 76}(1990), 145--149.

\bigskip
{\bf 1989}\\

%\item L. A. Sz\'ekely, A note on identities and cube partitions, in: {\it  Combinatorics}, Coll. Math. Soc. J{\'a}nos Bolyai {\bf 52}(1988), 481--488.
\item L. A. Sz\'ekely and N. C. Wormald,
 Bounds on the measurable chromatic number of $R\sp n$, {\it
 Discrete Math.}
{\bf 75}(1989),
343--372.
\item L. A. Sz\'ekely and N. C. Wormald,
 Bounds on the measurable chromatic number of $R\sp n$,
in: {\it Graph Theory and Combinatorics 1988, Proceedings of the
Cambridge Combinatorial Conference in Honour of Paul Erd{\H{o}}s}, ed. B.
Bollob\'as, Annals of Discrete Mathematics {\bf 43}, North-Holland, 
1989, 343--372.  (reprint)
\item P. L. Erd\H os and L. A. Sz\'ekely,
 Applications of antilexicographic order I: An enumerative theory of
trees, {\it Adv.  Appl. Math.} {\bf 10}(1989), 488--496.
\item T. D. Porter and L. A. Sz\'ekely,
 Generating functions for a problem of Riordan, {\it J. Comb. Math.
Comb. Comput.} {\bf 6}(1989),
195--198.

\bigskip
%\newpage
{\bf 1988}\\

\item L. A. Sz\'ekely,
 A note on identities and cube partitions, in: {\it  Combinatorics},
Coll. Math. Soc. J{\'a}nos Bolyai {\bf 52}(1988), 481--488. %ISBN 9638022434 or 0444703454

\bigskip
{\bf 1987} \\

\item L. A. Sz\'ekely,
 The analytic behaviour of the holiday numbers, {\it Acta Sci. Math.
(Szeged)} {\bf 51}(1987), 365--369.
\item P. Erd\H os, I. Jo\'o and L. A. Sz\'ekely,
 Remarks on infinite series, {\it Studia Sci. Math. Hung.} {\bf 22}(1987),
395--400.
\item L. A. Sz\'ekely,
 Inclusion-exclusion formulae without higher terms,  {\it Ars Comb.}
{\bf 23B}(1987), 7--20.

\bigskip
{\bf 1986}\\

\item L. A. Sz\'ekely,
  Reliable and unreliable intuition, {\it The New Zealand Math.
Magazine } {\bf 23} (1986) No.3, 11--14.
\item L. A. Sz\'ekely and N. C. Wormald,
 Generating functions for the Frobenius problem with 2 or 3 generators,
{\it Math. Chronicle} {\bf 15}
(1986), 49--57.

\bigskip
{\bf 1985}\\

\item L. A. Sz\'ekely,
   On two concepts of discrepancy in a class of combinatorial games, in:
{\it Finite and Infinite Sets}, Coll. Math. Soc. J\'anos
 Bolyai {\bf 37}(1985), 679--683.
\item L. A. Sz\'ekely,
   A note on common origin of cubic binomial identities, a generalisation of
Sur{\'a}nyi's proof on Le Jen Shoo's formula, {\it J. Comb. Theory }
 Ser. A {\bf 40}(1985), 171--174.
\item L. A. Sz\'ekely,
  Holiday numbers: sequences resembling the Stirling numbers of second kind,
{\it Acta Sci. Math. (Szeged)} {\bf 48}(1985), 459--467.
\item L. A. Sz\'ekely,
 On the use of espionage in a class of combinatorial games, {\it Annales
Univ. Sci. Bud. E{\"o}tv{\"o}s} {\bf 28}(1985), 199--201.
\item A. Bogm\'er and L. A. Sz\'ekely,
 Asymptotic formula for the number of solutions of a diophantic system,
{\it Annales Univ. Sci. Bud. E{\"o}tv{\"o}s} {\bf 28}(1985), 203--215.

\bigskip
{\bf 1984}\\

\item
L. A. Sz\'ekely,
  Measurable chromatic number of geometric graphs and sets without some
distances in Euclidean space, {\it Combinatorica} {\bf 4}(1984), 213--218.
\item
L. A. Sz\'ekely,
  On the number of homogeneous subgraphs of a graph, {\it Combinatorica}
{\bf 4}(1984), 363--372.
\item 
L. A. Sz\'ekely,
 A new combinatorial interpretation of binomial coefficients and its
applications, {\it Mat. Lapok} {\bf 32}(1984), 93--96 (in Hungarian).

\bigskip
{\bf 1983}\\
 
\item L. A. Sz\'ekely,
  Remarks on the chromatic number of geometric graphs, in: {\it Graphs and
Other Topics} (ed. M. Fiedler), Teubner-Texte zur Mathematik, Band {\bf 59},
Leipzig, l983, 312--315.




%\item G. Kubicki, J. Lehel, M. Morayne, S. Solecki, L. A. Sz{\'{e}}kely, 
%Subsets of Euclidean spaces of full unit-distance chromatic number,
%submitted to {\it Proc. Amer. Math. Soc.}
%43. Unavoidable subgraphs of sparse graphs, submitted to
% {\it Quaest. Math.}
%(with C. A. Barefoot, L. H. Clark, A. J. Depew, R. C. Entringer and
%A. A. Kooshesh).
%57. Unavoidable subgraphs of sparse graphs: survey and preliminaries
% (in preparation), (with L. H. Clark and R. C. Entringer).
%\item P. L. Erd\H os, K. Rice, M. A. Steel, L. A. Sz\'ekely, and T. J. Warnow
%The Short Quartet Method, to appear in
% {\it Math. Modelling and Sci. Computing},
%Special Issue of the papers presented at the
%Computational Biology sessions at the 11th ICMCM, March 31 - April 2,
%1997, Georgetown University Conference Center, Washington, D.C., USA. 
%Also to be published by Principia Scientia, St. Luis.
%\eject
\bigskip
\bigskip
\centerline{\bf OTHER PUBLICATIONS}
\smallskip
%\begin{etaremune}
%\compresslist
\item    Ann Clifton,  \'Eva Czabarka,  Kevin Liu, Sarah Loeb, Utku Okur, L\'aszl\'o Sz\'ekely, and Kristina Wicke,                 Universal rooted phylogenetic tree shapes and universal tanglegrams,  arXiv:2308.06580 (it turned out that most of the results of the paper were known)
\item Linyuan Lu and L.A. Sz\'ekely, A new asymptotic enumeration
technique: the Lov\'asz Local Lemma, arXiv:0905.3983 % submitted to   {\it J. Comb. Theory} Ser. A arXiv:0905.3983
\item \'E. Czabarka,  L.A. Sz\'ekely, T.J. Vision,
Minimizing the number of gene duplication episodes and Gallai's theorem on intervals, arXiv:1209.5699.
\item Variants of the crossing number problem {\it Oberwolfach Reports} {\bf 2}
(2) Report 17, in: Discrete Geometry 925--994, 2005.
\item Erd\H os on unit distances and the Szemer\'edi-Trotter
theorems, Paul Erd\H os and His Mathematics, Abstract of Invited Talks, Eds.
E. Gy\H ory and V. T. S\'os, J. Bolyai Math. Soc., Bp. 1999, 60--65.
\item  {\it The number
of nucleotide sites needed to accurately reconstruct large evolutionary
trees}, (with  M. A. Steel,  and P. L. Erd\H os), DIMACS Tech. Rep. No. 96-19.
\item {\it Trees and evolutionary trees}, Dissertation for the title
``Doctor of the Hungarian Academy of Sciences", Budapest, 1994.
\item {\it An algebraic approach to the uniform
 concurrent multicommodity flow
problem: theory and applications}, 
Technical Report CRPDC-91-4, Department of Computer Science,
University of North Texas, 1991 (with F. Shahrokhi).
\item {\it Eight lectures on graph theory}, Universita degli Studia di Napoli
Federico II, Naples, 1991 (mimeographed lecture notes).
\item {\it Analytic methods in combinatorics}, Thesis for the title Candidate
for Math. Sci., Budapest, 1985 (in Hungarian).
\item  {\it Combinatorial exercises}, JATE University, Szeged, l983
(mi\-meographed, in Hungarian).
\item {\it Geometric Graphs}, Ph.D. Thesis, E{\"o}tv{\"o}s University,
 Budapest, 1982 (in Hungarian).
%\end{etaremune}
\end{etaremune}




\end{document}
Problems and Solutions, 
E3349, The American Mathematical Monthly, Vol. 96, No. 9 (Nov., 1989), pp. 837

Roger Entringer is over 60.

Roger Entringer

Ars Comb. 35A, 3-10 (1993). 


23434755
23597031
1088306


Work in progress:
Publication:36225847
Publication:36225315
Publication: 36225723


-------------------------------
0384-9864 - Congressus numerantium
bulletin of the ICA. ISSN: 1183-1278
 ISSN 0271-4132 Contemporary Mathematics
  Information Sciences has the ISSN (International Standard Serial Number) 0020-0255
Ars Comb. 0381-7032
Acta Sci Math Szeged ISSN: 0001-6969


Duplum: 36083500 ceruza
36083507

work in progress not published:
36227027 (subtrees of trees)
36227184 (Wiener index)
36227302 (Barefoot) ?? 
36227346 (Advances)
36227403 (Barefoot)
36227428 (Inequality)


12051904  nincs cime a kozlemenynek. Helyesen: On a problem of Erdos and Lovasz

uj tarszerzok: 

Kelk, Steven
Moulton, Vincent
Helm, Alec 


