| Publication | Date of Publication | Type |
|---|
| k-dimensional transversals for balls | 2023-11-27 | Paper |
| On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory | 2023-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059998 | 2023-11-02 | Paper |
| A Faster Algorithm for Finding Tarski Fixed Points | 2023-10-31 | Paper |
| Almost-monochromatic sets and the chromatic number of the plane | 2023-10-12 | Paper |
| The double Hall property and cycle covers in bipartite graphs | 2023-10-04 | Paper |
| The number of tangencies between two families of curves | 2023-10-04 | Paper |
| Query complexity of Boolean functions on the middle slice of the cube | 2023-09-24 | Paper |
| Note on polychromatic coloring of hereditary hypergraph families | 2023-09-08 | Paper |
| Colouring bottomless rectangles and arborescences | 2023-07-31 | Paper |
| Projective and external saturation problem for posets | 2023-06-17 | Paper |
| Turán problems for edge-ordered graphs | 2023-03-23 | Paper |
| Exchange Properties of Finite Set-Systems | 2022-08-31 | Paper |
| On the number of hyperedges in the hypergraph of lines and pseudo-discs | 2022-08-04 | Paper |
| Orientation of good covers | 2022-06-03 | Paper |
| Radon numbers grow linearly | 2022-06-03 | Paper |
| Orientation of convex sets | 2022-06-03 | Paper |
| An Improved Constant Factor for the Unit Distance Problem | 2022-05-09 | Paper |
| Three-chromatic geometric hypergraphs | 2021-12-03 | Paper |
| Query complexity and the polynomial Freiman-Ruzsa conjecture | 2021-10-27 | Paper |
| Grid drawings of graphs with constant edge-vertex resolution | 2021-09-17 | Paper |
| Coloring Delaunay-edges and their generalizations | 2021-09-16 | Paper |
| Induced and non-induced poset saturation problems | 2021-08-25 | Paper |
| Exponential lower bound for Berge-Ramsey problems | 2021-07-28 | Paper |
| On tangencies among planar curves with an application to coloring L-shapes | 2021-03-04 | Paper |
| The range of non-linear natural polynomials cannot be context-free | 2020-12-15 | Paper |
| Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs | 2020-12-04 | Paper |
| Adaptive majority problems for restricted query graphs and for weighted sets | 2020-11-02 | Paper |
| At most $3.55^n$ stable matchings | 2020-11-02 | Paper |
| Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks | 2020-09-09 | Paper |
| An improved constant factor for the unit distance problem | 2020-06-11 | Paper |
| Complexity of domination in triangulated plane graphs | 2020-05-11 | Paper |
| Distribution of colors in Gallai colorings | 2020-04-09 | Paper |
| Unlabeled compression schemes exceeding the VC-dimension | 2020-04-01 | Paper |
| Query complexity and the polynomial Freiman-Ruzsa conjecture | 2020-03-10 | Paper |
| Tur\'an problems for Edge-ordered graphs | 2020-01-03 | Paper |
| Radon numbers grow linearly | 2019-12-04 | Paper |
| Proper coloring of geometric hypergraphs | 2019-09-11 | Paper |
| Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings | 2019-08-30 | Paper |
| An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes | 2019-02-27 | Paper |
| Weak embeddings of posets to the Boolean lattice | 2018-12-10 | Paper |
| Proper Coloring of Geometric Hypergraphs | 2018-08-13 | Paper |
| Acyclic orientations with degree constraints | 2018-06-09 | Paper |
| All or Nothing Caching Games with Bounded Queries | 2018-03-28 | Paper |
| Regular families of forests, antichains and duality pairs of relational structures | 2018-02-12 | Paper |
| Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems | 2017-10-10 | Paper |
| Bin Packing via Discrepancy of Permutations | 2017-09-29 | Paper |
| Search for the end of a path in the d-dimensional grid and in other graphs | 2017-09-14 | Paper |
| Unified Hanani-Tutte theorem | 2017-09-08 | Paper |
| More on decomposing coverings by octants | 2017-03-30 | Paper |
| Finding a non-minority ball with majority answers | 2017-01-23 | Paper |
| Online and quasi-online colorings of wedges and intervals | 2016-12-16 | Paper |
| Unsplittable coverings in the plane | 2016-10-21 | Paper |
| On the Tree Search Problem with Non-uniform Costs | 2016-10-21 | Paper |
| An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes | 2016-10-21 | Paper |
| Finding a majority ball with majority answers | 2016-10-14 | Paper |
| Unsplittable coverings in the plane | 2016-09-30 | Paper |
| On the tree search problem with non-uniform costs | 2016-09-01 | Paper |
| Topological orderings of weighted directed acyclic graphs | 2016-05-18 | Paper |
| Clustered planarity testing revisited | 2015-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5499925 | 2015-08-05 | Paper |
| Survey on Decomposition of Multiple Coverings | 2015-06-24 | Paper |
| Partitioning to three matchings of given size is NP-complete for bipartite graphs | 2015-02-05 | Paper |
| Clustered Planarity Testing Revisited | 2015-01-07 | Paper |
| Bin Packing via Discrepancy of Permutations | 2014-12-05 | Paper |
| Advantage in the discrete Voronoi game | 2014-11-13 | Paper |
| Online and Quasi-online Colorings of Wedges and Intervals | 2014-11-04 | Paper |
| Convex polygons are self-coverable | 2014-09-12 | Paper |
| Domination in transitive colorings of tournaments | 2014-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5167453 | 2014-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5420022 | 2014-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417702 | 2014-05-22 | Paper |
| Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs | 2014-04-10 | Paper |
| Octants are cover-decomposable into many coverings | 2014-04-09 | Paper |
| Consistent digital line segments | 2014-04-03 | Paper |
| Testing additive integrality gaps | 2013-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857358 | 2013-11-01 | Paper |
| Octants are Cover Decomposable | 2013-11-01 | Paper |
| Saturating Sperner families | 2013-09-26 | Paper |
| Drawing Planar Graphs of Bounded Degree with Few Slopes | 2013-09-26 | Paper |
| Almost cross-intersecting and almost cross-Sperner pairs of families of sets | 2013-06-26 | Paper |
| Majority and plurality problems | 2013-04-18 | Paper |
| Density-Based Group Testing | 2013-04-09 | Paper |
| Vectors in a box | 2012-10-15 | Paper |
| On Families of Weakly Cross-intersecting Set-pairs | 2012-07-11 | Paper |
| Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs | 2012-06-15 | Paper |
| Lower bounds on the obstacle number of graphs | 2012-06-12 | Paper |
| Consistent digital line segments | 2012-05-22 | Paper |
| Octants are cover-decomposable | 2012-04-04 | Paper |
| Drawing Cubic Graphs with the Four Basic Slopes | 2012-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3106042 | 2011-12-19 | Paper |
| Drawing Planar Graphs of Bounded Degree with Few Slopes | 2011-02-11 | Paper |
| Asymptotically optimal pairing strategy for tic-tac-toe with numerous directions | 2010-12-16 | Paper |
| Indecomposable coverings with concave polygons | 2010-11-08 | Paper |
| Finding the maximum and minimum elements with one lie | 2010-10-11 | Paper |
| Permutations, hyperplanes and polynomials over finite fields | 2010-10-11 | Paper |
| Decomposition of Geometric Set Systems and Graphs | 2010-09-23 | Paper |
| Convex polygons are cover-decomposable | 2010-04-12 | Paper |
| Combinatorial necklace splitting | 2010-03-26 | Paper |
| Cubic graphs have bounded slope parameter | 2010-02-04 | Paper |
| Polychromatic colorings of arbitrary rectangular partitions | 2009-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3629757 | 2009-06-02 | Paper |
| Cubic Graphs Have Bounded Slope Parameter | 2009-03-03 | Paper |
| Drawing cubic graphs with at most five slopes | 2008-04-28 | Paper |
| Drawing Cubic Graphs with at Most Five Slopes | 2007-08-28 | Paper |
| Bounded-degree graphs can have arbitrarily large slope numbers | 2006-01-17 | Paper |
