| Three-Chromatic Geometric Hypergraphs | 0 | 0.34 | 2022 |
| On Communication Complexity of Fixed Point Computation | 0 | 0.34 | 2021 |
| Grid drawings of graphs with constant edge-vertex resolution | 0 | 0.34 | 2021 |
| At most 3.55 n stable matchings | 0 | 0.34 | 2021 |
| Distribution of colors in Gallai colorings | 0 | 0.34 | 2020 |
| Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs. | 0 | 0.34 | 2020 |
| Unlabeled compression schemes exceeding the VC-dimension | 0 | 0.34 | 2020 |
| Generalized Matching Games for International Kidney Exchange | 0 | 0.34 | 2019 |
| Asymptotics of Pattern Avoidance in the Klazar Set Partition and Permutation-Tuple Settings | 0 | 0.34 | 2019 |
| Weak embeddings of posets to the Boolean lattice. | 0 | 0.34 | 2018 |
| Coloring Delaunay-edges and their generalizations | 0 | 0.34 | 2018 |
| All Or Nothing Caching Games With Bounded Queries | 0 | 0.34 | 2018 |
| Plane drawings of the generalized Delaunay-graphs for pseudo-disks. | 0 | 0.34 | 2018 |
| Acyclic orientations with degree constraints. | 0 | 0.34 | 2018 |
| Complexity of domination in triangulated plane graphs | 0 | 0.34 | 2017 |
| Proper Coloring of Geometric Hypergraphs. | 0 | 0.34 | 2017 |
| Unified Hanani-Tutte theorem. | 0 | 0.34 | 2017 |
| Finding a non-minority ball with majority answers. | 2 | 0.39 | 2017 |
| On the Tree Search Problem with Non-uniform Costs. | 1 | 0.35 | 2016 |
| Finding a majority ball with majority answers. | 0 | 0.34 | 2015 |
| Clustered Planarity Testing Revisited. | 0 | 0.34 | 2014 |
| Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets | 0 | 0.34 | 2013 |
| Bin Packing via Discrepancy of Permutations | 14 | 0.89 | 2013 |
| Unique-maximum and conflict-free coloring for hypergraphs and tree graphs | 1 | 0.36 | 2013 |
| Advantage in the discrete Voronoi game. | 0 | 0.34 | 2013 |
| Density-Based group testing | 1 | 0.36 | 2013 |
| Efficient c-planarity testing algebraically | 2 | 0.40 | 2013 |
| Online and quasi-online colorings of wedges and intervals | 1 | 0.37 | 2013 |
| Saturating Sperner Families | 2 | 0.52 | 2013 |
| Convex Polygons are Self-Coverable | 5 | 0.53 | 2013 |
| Indecomposable coverings with unit discs. | 6 | 0.56 | 2013 |
| Domination in transitive colorings of tournaments. | 4 | 0.56 | 2013 |
| Octants Are Cover-Decomposable | 10 | 0.67 | 2012 |
| On Families of Weakly Cross-intersecting Set-pairs | 1 | 0.39 | 2012 |
| Monochromatic even cycles. | 0 | 0.34 | 2012 |
| Majority and plurality problems | 0 | 0.34 | 2012 |
| Vectors in a box. | 2 | 0.41 | 2012 |
| Search for the end of a path in the d-dimensional grid and in other graphs | 0 | 0.34 | 2012 |
| On infinite-finite tree-duality pairs of relational structures | 1 | 0.40 | 2012 |
| Octants are cover-decomposable into many coverings | 7 | 0.62 | 2012 |
| Lower bounds on the obstacle number of graphs | 5 | 0.62 | 2011 |
| Lower bounds for finding the maximum and minimum elements with k lies | 0 | 0.34 | 2011 |
| Digitalizing line segments. | 0 | 0.34 | 2011 |
| Almost optimal pairing strategy for Tic-Tac-Toe with numerous directions | 0 | 0.34 | 2010 |
| Convex Polygons are Cover-Decomposable | 14 | 1.29 | 2010 |
| Communication Complexity | 0 | 0.34 | 2010 |
| Drawing planar graphs of bounded degree with few slopes | 23 | 0.91 | 2010 |
| Permutations, hyperplanes and polynomials over finite fields | 4 | 0.98 | 2010 |
| Cubic Graphs Have Bounded Slope Parameter | 3 | 0.42 | 2010 |
| Finding the maximum and minimum elements with one lie | 1 | 0.38 | 2010 |
