| Publication | Date of Publication | Type |
|---|
| On the extremal functions of acyclic forbidden 0-1 matrices | 2024-11-28 | Paper |
| Edge ordered Turán problems | 2024-10-18 | Paper |
| Disjointness graphs of short polygonal chains | 2024-05-14 | Paper |
| Where Have All the Grasshoppers Gone? | 2024-03-27 | Paper |
| Disjointness graphs of short polygonal chains | 2024-01-29 | Paper |
| A characterization of edge-ordered graphs with almost linear extremal functions | 2024-01-25 | Paper |
| On edge-ordered graphs with linear extremal functions | 2023-09-19 | Paper |
| Successive vertex orderings of fully regular graphs | 2023-07-06 | Paper |
| On the Extremal Functions of Acyclic Forbidden 0-1 Matrices | 2023-06-28 | Paper |
| Disjointness graphs of segments in the space | 2023-03-30 | Paper |
| Turán problems for edge-ordered graphs | 2023-03-23 | Paper |
| Convergence and limits of finite trees | 2023-01-23 | Paper |
| Crossings between non-homotopic edges | 2022-06-10 | Paper |
| Random necklaces require fewer cuts | 2021-12-29 | Paper |
| Crossings Between Non-homotopic Edges | 2021-12-01 | Paper |
| Planar point sets determine many pairwise crossing segments | 2021-07-05 | Paper |
| Partitioning transitive tournaments into isomorphic digraphs | 2021-06-24 | Paper |
| Extremal theory of vertex or edge ordered graphs | 2021-02-06 | Paper |
| On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges | 2021-01-25 | Paper |
| Two extensions of the Erdős-Szekeres problem | 2020-12-17 | Paper |
| EXTREMAL THEORY OF ORDERED GRAPHS | 2020-09-22 | Paper |
| Crossings between non-homotopic edges | 2020-06-26 | Paper |
| Unlabeled compression schemes exceeding the VC-dimension | 2020-04-01 | Paper |
| Planar point sets determine many pairwise crossing segments | 2020-01-30 | Paper |
| Tur\'an problems for Edge-ordered graphs | 2020-01-03 | Paper |
| Convergence and limits of finite trees | 2020-01-03 | Paper |
| Tiling the plane with equilateral triangles | 2019-09-19 | Paper |
| On the Turán number of ordered forests | 2019-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633842 | 2019-05-06 | Paper |
| CONTROLLING LIPSCHITZ FUNCTIONS | 2018-11-20 | Paper |
| Tilings with noncongruent triangles | 2018-08-24 | Paper |
| Disjointness graphs of segments | 2018-08-13 | Paper |
| The Local Lemma Is Asymptotically Tight for SAT | 2018-08-02 | Paper |
| Tilings of the plane with unit area triangles of bounded diameter | 2018-07-23 | Paper |
| Beyond the Richter-Thomassen Conjecture | 2018-07-16 | Paper |
| On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers | 2018-07-16 | Paper |
| Improved bounds on the Hadwiger-Debrunner numbers | 2018-07-03 | Paper |
| A crossing lemma for Jordan curves | 2018-06-26 | Paper |
| Regular families of forests, antichains and duality pairs of relational structures | 2018-02-12 | Paper |
| On the Turán number of ordered forests | 2018-01-18 | Paper |
| Forbidden patterns and unit distances | 2017-10-20 | Paper |
| On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves | 2017-10-10 | Paper |
| On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves | 2017-10-05 | Paper |
| An improved bound for k -sets in three dimensions | 2017-09-29 | Paper |
| Cutting glass | 2017-09-29 | Paper |
| Improving the crossing lemma by finding more crossings in sparse graphs | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365071 | 2017-09-29 | Paper |
| Optimal Information Rate of Secret Sharing Schemes on Trees | 2017-06-08 | Paper |
| Separation with restricted families of sets | 2016-08-18 | Paper |
| Improved bounds for the randomized decision tree Complexity of recursive majority | 2016-06-10 | Paper |
| Erdős-Pyber theorem for hypergraphs and secret sharing | 2015-09-24 | Paper |
| Cross-Intersecting Families of Vectors | 2015-09-14 | Paper |
| Relations between the Local Chromatic Number and Its Directed Version | 2015-07-23 | Paper |
| Cross-intersecting families of vectors | 2015-05-22 | Paper |
| On List Coloring and List Homomorphism of Permutation and Interval Graphs | 2015-04-17 | Paper |
| The range of a random walk on a comb | 2014-08-14 | Paper |
| Conflict-Free Colouring of Graphs | 2014-05-28 | Paper |
| Tight lower bounds for the size of epsilon-nets | 2014-03-24 | Paper |
| Local chromatic number of quadrangulations of surfaces | 2014-03-17 | Paper |
| Caterpillar Dualities and Regular Languages | 2014-01-21 | Paper |
| The visible perimeter of an arrangement of disks | 2014-01-08 | Paper |
| On infinite-finite duality pairs of directed graphs | 2013-11-22 | Paper |
| Construction of Locally Plane Graphs with Many Edges | 2013-09-25 | Paper |
| Remarks on a Ramsey theory for trees | 2013-08-06 | Paper |
| Tight lower bounds for the size of epsilon-nets | 2013-05-30 | Paper |
| The Visible Perimeter of an Arrangement of Disks | 2013-04-03 | Paper |
| Piercing quasi-rectangles-on a problem of Danzer and Rogers | 2012-08-01 | Paper |
| On-line secret sharing | 2012-03-01 | Paper |
| On directed local chromatic number, shift graphs, and Borsuk-like graphs | 2011-01-20 | Paper |
| Crossing numbers of imbalanced graphs | 2010-11-10 | Paper |
| Optimal probabilistic fingerprint codes | 2010-08-16 | Paper |
| Distinct distances in three and higher dimensions | 2010-08-16 | Paper |
| Coloring axis-parallel rectangles | 2010-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579465 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576663 | 2010-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576721 | 2010-07-30 | Paper |
| A constructive proof of the general lovász local lemma | 2010-07-14 | Paper |
| Conflict-Free Colourings of Graphs and Hypergraphs | 2010-04-22 | Paper |
| Indecomposable Coverings | 2009-10-15 | Paper |
| Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles | 2009-03-04 | Paper |
| Local chromatic number and distinguishing the strength of topological obstructions | 2009-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602878 | 2009-02-12 | Paper |
| Coloring Axis-Parallel Rectangles | 2009-01-13 | Paper |
| Optimal probabilistic fingerprint codes | 2008-12-21 | Paper |
| Graph coloring with no large monochromatic components | 2008-09-29 | Paper |
| Crossing Stars in Topological Graphs | 2008-08-13 | Paper |
| Graph coloring with no large monochromatic components | 2008-06-05 | Paper |
| Crossing Stars in Topological Graphs | 2008-03-18 | Paper |
| Forbidden paths and cycles in ordered graphs and matrices | 2008-02-22 | Paper |
| Multiple coverings of the plane with triangles | 2007-12-19 | Paper |
| Deterministic random walks on the integers | 2007-11-21 | Paper |
| Colorful subgraphs in Kneser-like graphs | 2007-11-21 | Paper |
| Indecomposable Coverings | 2007-08-28 | Paper |
| Local chromatic number, Ky Fan's theorem, and circular colorings | 2007-05-08 | Paper |
| On the maximum number of edges in quasi-planar graphs | 2007-05-04 | Paper |
| Extremal problems for transversals in graphs with bounded degree | 2007-01-02 | Paper |
| Partitioning multi-dimensional sets in a small number of ``uniform parts | 2006-12-07 | Paper |
| Improving the crossing lemma by finding more crossings in sparse graphs | 2006-12-06 | Paper |
| Waiting for a Bat to Fly By (in Polynomial Time) | 2006-12-05 | Paper |
| Intersection reverse sequences and geometric applications. | 2006-05-18 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| On 0-1 matrices and small excluded submatrices | 2005-09-28 | Paper |
| Covering lattice points by subspaces | 2005-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657584 | 2005-03-14 | Paper |
| Linear hash functions | 2005-01-25 | Paper |
| Geometric graphs with no self-intersecting path of length three | 2004-10-04 | Paper |
| Distinct Distances in Three and Higher Dimensions | 2004-09-24 | Paper |
| The longest segment in the complement of a packing | 2004-09-15 | Paper |
| Excluded permutation matrices and the Stanley-Wilf conjecture | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043713 | 2004-08-06 | Paper |
| On distinct sums and distinct distances. | 2004-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422289 | 2003-09-03 | Paper |
| A note on non-deterministic communication complexity with few witnesses | 2003-08-26 | Paper |
| Bounded size components -- partitions and transversals. | 2003-08-17 | Paper |
| Isosceles triangles determined by a planar point set | 2003-03-27 | Paper |
| Untangling a polygon | 2003-03-17 | Paper |
| The \(k\) most frequent distances in the plane | 2003-03-17 | Paper |
| Separating convex sets by straight lines | 2002-11-11 | Paper |
| On the knowledge complexity of \(\mathcal N\mathcal P\) | 2002-10-30 | Paper |
| On the Boundary Complexity of the Union of Fat Triangles | 2002-09-29 | Paper |
| A Multidimensional Generalization of the Erdős–Szekeres Lemma on Monotone Subsequences | 2002-09-17 | Paper |
| An improved bound for \(k\)-sets in three dimensions | 2002-07-10 | Paper |
| Ups and downs of first order sentences on random graphs | 2001-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527014 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527017 | 2001-02-28 | Paper |
| Arthur-Merlin games in Boolean decision trees | 2000-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258571 | 2000-10-17 | Paper |
| Cutting glass | 2000-09-14 | Paper |
| On roughly transitive amenable graphs and harmonic Dirichlet functions | 2000-05-22 | Paper |
| Lower Bounds for (MODp - MODm) Circuits | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936140 | 2000-01-25 | Paper |
| A lower bound on the MOD 6 degree of the OR function | 1999-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4208249 | 1998-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4352331 | 1998-03-02 | Paper |
| On a search problem in multidimensional grids | 1997-11-24 | Paper |
| On point covers of multiple intervals and axis-parallel rectangles | 1997-06-25 | Paper |
| Multi-prover encoding schemes and three-prover proof systems | 1997-05-11 | Paper |
| Towards the Hanna Neumann conjecture using Dicks' method | 1996-09-15 | Paper |
| Transversals of 2-intervals, a topological approach | 1995-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138905 | 1994-09-19 | Paper |
| On the intersection of subgroups of a free group | 1993-04-01 | Paper |
| Croftian sequences | 1992-06-25 | Paper |
| Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A? | 1989-01-01 | Paper |
| Finitely generated pseudosimple algebras | 1989-01-01 | Paper |
| Polynomial Bound for a Chip Firing Game on Graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4730211 | 1988-01-01 | Paper |
| A maximal clone of monotone operations which is not finitely generated | 1986-01-01 | Paper |
| On quasi-transitive amenable graphs | N/A | Paper |
