Selected preprints:
-
A few logs suffice to build (almost) all trees (I)
ps pdf - A
few logs suffice to build (almost) all trees (II)
ps pdf - On
bipartite drawings and the linear arrangement problem
ps pdf -
Erdős-Ko-Rado and Hilton-Milner type theorems for intersecting chains in
posets
ps pdf -
Constructing integral uniform flows with application to the forwarding
index problem
ps pdf - A new lower bound for the
bipartite crossing number with applications
ps pdf
- Erdős on unit distances and the Szemerédi-Trotter theorems
ps pdf
- Katona type proof for the 2-intersecting Erdős-Ko-Rado theorem
ps pdf - Inverting random functions
ps pdf -
Inverting random functions II: explicit bounds for parametric and
non-parametric MLE, with applications
ps
pdf - A successful concept for
measuring non-planarity of graphs: the crossing number
ps pdf -
Wiener index versus maximum degree in trees
ps pdf
- Biplanar crossing numbers I: a survey of results and problems
ps pdf
- Short proof for a theorem of Pach, Spencer, and Tóth
ps pdf
- The gap between the crossing number and the convex crossing number,
ps pdf
- Non-trivial t-intersection in the function lattice
ps pdf
- Counting rooted spanning forests in complete
multipartite graphs
ps pdf
- Binary trees with the largest number of
subtrees
ps pdf
- On subtrees of trees
ps pdf
- Outerplanar crossing numbers, circular arrangement problem, and isoperimetric functions
ps pdf
- Some non-existence results on Leech trees
ps pdf
- On teasing apart two trees
ps pdf
- On the variational distance of two trees
ps pdf
- Biplanar crossing numbers II: comparing crossing numbers and
biplanar crossing numbers using the probabilistic method
ps pdf
- Inverting random functions III: discrete MLE revisited
ps pdf
- Phylogenetic information complexity: is testing a
tree easier than finding it?
ps pdf
- An optimality criterion for
the crossing number,
ps pdf
- On realizing all simple graphs with a given degree sequence
ps pdf
- Diameter of 4-colorable graphs,
ps pdf
- The inverse problem for certain tree parameters
ps pdf
- A new asymptotic enumeration
technique: the Lovász Local Lemma
ps pdf
- General lower bounds for the minor crossing numbers of graphs,
ps pdf
- More recent preprints are available at arXive