| Publication | Date of Publication | Type |
|---|
| Decks of rooted binary trees | 2024-12-27 | Paper |
| A note on the 2-colored rectilinear crossing number of random point sets in the unit square | 2024-09-19 | Paper |
| The largest crossing number of tanglegrams | 2024-03-19 | Paper |
| Concurrent flows and packet routing in Cayley graphs (Preliminary version) | 2024-01-05 | Paper |
| Book embeddings and crossing numbers | 2024-01-05 | Paper |
| Improved bounds for the crossing numbers on surfaces of genus g | 2024-01-05 | Paper |
| A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square | 2023-12-04 | Paper |
| Decks of rooted binary trees | 2023-11-03 | Paper |
| Maximum diameter of 3‐ and 4‐colorable graphs | 2023-10-06 | Paper |
| Universal rooted phylogenetic tree shapes and universal tanglegrams | 2023-08-12 | Paper |
| Proximity in triangulations and quadrangulations | 2022-11-29 | Paper |
| Minimum Wiener index of triangulations and quadrangulations | 2022-10-13 | Paper |
| On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem | 2022-08-19 | Paper |
| The effect of the needle exchange program on the spread of some sexually transmitted diseases | 2022-08-03 | Paper |
| An infinite antichain of planar tanglegrams | 2022-05-23 | Paper |
| The Steiner distance problem for large vertex subsets in the hypercube | 2022-02-16 | Paper |
| An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem | 2022-02-16 | Paper |
| On the maximum diameter of \(k\)-colorable graphs | 2021-09-28 | Paper |
| Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza | 2021-09-16 | Paper |
| A tanglegram Kuratowski theorem | 2021-06-25 | Paper |
| Wiener Index and Remoteness in Triangulations and Quadrangulations | 2021-05-03 | Paper |
| A size condition for diameter two orientable graphs | 2021-03-17 | Paper |
| Some remarks on the midrange crossing constant | 2021-01-25 | Paper |
| An infinite antichain of planar tanglegrams | 2020-07-12 | Paper |
| Inducibility of \(d\)-ary trees | 2019-12-17 | Paper |
| Using block designs in crossing number bounds | 2019-12-10 | Paper |
| A degree condition for diameter two orientability of graphs | 2019-02-20 | Paper |
| Analogies between the crossing number and the tangle crossing number | 2018-11-22 | Paper |
| Midrange crossing constants for graphs classes | 2018-11-19 | Paper |
| Phylogenetic information complexity: is testing a tree easier than finding it? | 2018-11-08 | Paper |
| \(k\)-planar crossing number of random graphs and random regular graphs | 2018-09-06 | Paper |
| Small solutions of the damped half-linear oscillator with step function coefficients | 2018-09-03 | Paper |
| On different ``middle parts of a tree | 2018-08-15 | Paper |
| Constructing big trees from short sequences | 2018-07-04 | Paper |
| On the Number of Nonisomorphic Subtrees of a Tree | 2018-02-23 | Paper |
| Note on \(k\)-planar crossing numbers | 2018-02-19 | Paper |
| Global dynamics of a mathematical model for the possible re-emergence of polio | 2017-11-17 | Paper |
| Inducibility in Binary Trees and Crossings in Random Tanglegrams | 2017-08-18 | Paper |
| On the number of non-zero elements of joint degree vectors | 2017-04-10 | Paper |
| Paths vs. stars in the local profile of trees | 2017-02-17 | Paper |
| Problems related to graph indices in trees | 2017-01-25 | Paper |
| Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill | 2016-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816138 | 2016-07-01 | Paper |
| Eccentricity sums in trees | 2016-06-01 | Paper |
| Asymptotic stability of two dimensional systems of linear difference equations and of second order half-linear differential equations with step function coefficients | 2016-01-08 | Paper |
| Abelian groups yield many large families for the diamond problem | 2015-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5251954 | 2015-05-21 | Paper |
| Extremal values of ratios: distance problems vs. subtree problems in trees. II | 2014-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2866563 | 2013-12-13 | Paper |
| Quest for Negative Dependency Graphs | 2013-07-23 | Paper |
| Extremal values of ratios: distance problems vs. subtree problems in trees | 2013-06-07 | Paper |
| Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals | 2013-04-09 | Paper |
| Threshold Functions for Distinct Parts: Revisiting Erdős–Lehner | 2013-04-09 | Paper |
| Minimizing the number of episodes and Gallai's theorem on intervals | 2012-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2910020 | 2012-09-07 | Paper |
| Asymptotically normal distribution of some tree families relevant for phylogenectics, and of partitions without singletons | 2012-09-05 | Paper |
| Inverting random functions. III: Discrete MLE revisited | 2012-01-24 | Paper |
| The sum of the distances between the leaves of a tree and the `semi-regular' property | 2011-05-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3001194 | 2011-05-31 | Paper |
| Bounds for Convex Crossing Numbers | 2011-03-18 | Paper |
| A tour of \(M\)-part \(L\)-Sperner families | 2011-01-14 | Paper |
| General lower bounds for the minor crossing number of graphs | 2010-09-22 | Paper |
| The inverse problem for certain tree parameters | 2010-04-28 | Paper |
| Degree-based graph construction | 2009-12-14 | Paper |
| An improved bound on the maximum agreement subtree problem | 2009-11-13 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Diameter of 4-colourable graphs | 2009-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3629755 | 2009-06-02 | Paper |
| A new asymptotic enumeration technique: the Lovasz Local Lemma | 2009-05-25 | Paper |
| Using Lovász local lemma in the space of random injections | 2009-04-07 | Paper |
| Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method | 2009-03-04 | Paper |
| An optimality criterion for the crossing number | 2008-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3514484 | 2008-07-21 | Paper |
| SPT(q, k, n)-Codes | 2008-06-05 | Paper |
| On the Existence of Armstrong Instances with Bounded Domains | 2008-03-04 | Paper |
| Teasing Apart Two Trees | 2007-11-22 | Paper |
| On \(k\)-planar crossing numbers | 2007-06-08 | Paper |
| Graph minors and the crossing number of graphs | 2007-05-29 | Paper |
| Binary trees with the largest number of subtrees | 2007-03-02 | Paper |
| On the variational distance of two trees | 2007-02-05 | Paper |
| On the existence of small solutions of linear systems of difference equations with varying coefficients | 2006-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5477811 | 2006-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3378357 | 2006-03-30 | Paper |
| Non-trivial \(t\)-intersection in the function lattice | 2005-12-13 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5463516 | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3023659 | 2005-07-05 | Paper |
| On subtrees of trees | 2005-05-04 | Paper |
| Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions | 2005-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657594 | 2005-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657598 | 2005-03-14 | Paper |
| A note on Halton's conjecture | 2005-02-09 | Paper |
| A successful concept for measuring non-planarity of graphs: The crossing number. | 2004-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422275 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414514 | 2003-07-25 | Paper |
| Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications | 2003-01-05 | Paper |
| Wiener index versus maximum degree in trees | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410025 | 2002-01-01 | Paper |
| The combinatorics of evolutionary trees---a survey | 2001-11-05 | Paper |
| Towards a Katona type proof for the \(2\)-intersecting Erdős-Ko-Rado theorem | 2001-10-16 | Paper |
| Inverting random functions | 2001-08-16 | Paper |
| Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem | 2001-07-03 | Paper |
| On Bipartite Drawings and the Linear Arrangement Problem | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945057 | 2000-11-19 | Paper |
| Erdős-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets | 2000-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489169 | 2000-10-23 | Paper |
| A few logs suffice to build (almost) all trees (I) | 2000-09-24 | Paper |
| A new lower bound for the bipartite crossing number with applications | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304355 | 2000-08-14 | Paper |
| A few logs suffice to build (almost) all trees. II | 2000-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232794 | 1999-06-15 | Paper |
| Minimum multiway cuts in trees | 1999-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4387700 | 1998-08-10 | Paper |
| Pseudo-LYM inequalities and AZ identities | 1998-07-13 | Paper |
| Intersection of curves and crossing number of \(C_m\times C_n\) on surfaces | 1998-04-19 | Paper |
| Extremal values for ratios of distances in trees | 1998-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4361560 | 1998-03-01 | Paper |
| Crossing Numbers and Hard Erdős Problems in Discrete Geometry | 1998-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4352316 | 1997-10-07 | Paper |
| Intersecting Systems | 1997-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347895 | 1997-08-11 | Paper |
| The crossing number of a graph on a compact 2-manifold | 1997-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4342904 | 1997-06-24 | Paper |
| On dense bipartite graphs of girth eigth and upper bounds for certain configurations in planar point-line systems | 1997-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5284003 | 1997-03-09 | Paper |
| The book crossing number of a graph | 1996-10-29 | Paper |
| Drawings of graphs on surfaces with few crossings | 1996-10-20 | Paper |
| Cycle-saturated graphs of minimum size | 1996-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4882555 | 1996-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871065 | 1996-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873685 | 1996-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4852307 | 1995-10-30 | Paper |
| On Canonical Concurrent Flows, Crossing Number and Graph Expansion | 1995-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4325295 | 1995-03-08 | Paper |
| On Intersecting Chains in Boolean Algebras | 1995-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304557 | 1994-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304358 | 1994-10-06 | Paper |
| On weighted multiway cuts in trees | 1994-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3137178 | 1994-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3136984 | 1994-08-25 | Paper |
| Counting bichromatic evolutionary trees | 1994-06-28 | Paper |
| Subdivision thresholds for two classes of graphs | 1994-05-05 | Paper |
| Evolutionary trees: An integer multicommodity max-flow -- min-cut theorem | 1993-10-18 | Paper |
| Fourier calculus on evolutionary trees | 1993-09-05 | Paper |
| A Fourier inversion formula for evolutionary trees | 1993-08-11 | Paper |
| Spectral analysis and a closest tree method for genetic sequences | 1993-04-01 | Paper |
| Sharpening the LYM inequality | 1993-01-17 | Paper |
| A linear time algorithm for graph partition problems | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4017167 | 1993-01-16 | Paper |
| An inequality for degree sequences | 1992-12-06 | Paper |
| Threshold functions for local properties of graphs: Triangles | 1992-06-28 | Paper |
| PASCALIAN RECTANGLES MODULOm | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3470485 | 1990-01-01 | Paper |
| Applications of antilexicographic order. I: An enumerative theory of trees | 1989-01-01 | Paper |
| Bounds on the measurable chromatic number of \({\mathbb{R}}\) | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4207898 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3470470 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4726260 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783303 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3793130 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3030607 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745912 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3818321 | 1986-01-01 | Paper |
| Common origin of cubic binomial identities: A generalization of Surányi's proof on Le Jen Shoo's formula | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3731608 | 1985-01-01 | Paper |
| On the number of homogeneous subgraphs of a graph | 1984-01-01 | Paper |
| Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686470 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3752386 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3320407 | 1983-01-01 | Paper |
