| Publication | Date of Publication | Type |
|---|
Erdős-Szekeres maker-breaker games
Theoretical Computer Science | 2026-06-15 | Paper |
Orientation of good covers
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-06-04 | Paper |
Three-chromatic geometric hypergraphs
Journal of the European Mathematical Society (JEMS) | 2026-03-24 | Paper |
| Erdős-Szekeres maker-breaker games | 2026-01-28 | Paper |
Partitioned matching games for international kidney exchange
Mathematical Programming. Series A. Series B | 2025-12-11 | Paper |
| At most 3.55ⁿ stable matchings | 2025-08-13 | Paper |
Projective and external saturation problem for posets
Order | 2025-06-30 | Paper |
Realizing an m-uniform four-chromatic hypergraph with disks
Combinatorica | 2025-06-19 | Paper |
The complexity of recognizing ABAB-free hypergraphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2025-05-07 | Paper |
| Odd-sunflowers (extended abstract) | 2025-04-15 | Paper |
| Monochromatic configurations on a circle (extended abstract) | 2025-04-08 | Paper |
Piercing intersecting convex sets
Linear Algebra and its Applications | 2025-03-05 | Paper |
Orientation of convex sets
The Electronic Journal of Combinatorics | 2025-01-27 | Paper |
Query complexity of Boolean functions on the middle slice of the cube
Discrete Applied Mathematics | 2025-01-06 | Paper |
Note on polychromatic coloring of hereditary hypergraph families
Graphs and Combinatorics | 2024-12-09 | Paper |
Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Adaptive majority problems for restricted query graphs and for weighted sets
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Edge ordered Turán problems
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
On tangencies among planar curves with an application to coloring L-shapes
European Journal of Combinatorics | 2024-09-30 | Paper |
| On tangencies among planar curves with an application to coloring L-shapes | 2024-09-13 | Paper |
Odd-sunflowers
Journal of Combinatorial Theory. Series A | 2024-05-24 | Paper |
| 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
Discrete Applied Mathematics | 2023-11-13 | Paper |
| Almost-monochromatic sets and the chromatic number of the plane | 2023-11-02 | Paper |
A Faster Algorithm for Finding Tarski Fixed Points
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Almost-monochromatic sets and the chromatic number of the plane
Discrete & Computational Geometry | 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
Combinatorica | 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
Computational Geometry | 2023-07-31 | Paper |
| Projective and external saturation problem for posets | 2023-06-17 | Paper |
Turán problems for edge-ordered graphs
Journal of Combinatorial Theory. Series B | 2023-03-23 | Paper |
Exchange properties of finite set-systems
SIAM Journal on Discrete Mathematics | 2022-08-31 | Paper |
On the number of hyperedges in the hypergraph of lines and pseudo-discs
The Electronic Journal of Combinatorics | 2022-08-04 | Paper |
| Orientation of convex sets | 2022-06-03 | Paper |
| Orientation of good covers | 2022-06-03 | Paper |
Radon numbers grow linearly
Discrete & Computational Geometry | 2022-06-03 | Paper |
An improved constant factor for the unit distance problem
Studia Scientiarum Mathematicarum Hungarica | 2022-05-09 | Paper |
| Three-chromatic geometric hypergraphs | 2021-12-03 | Paper |
Query complexity and the polynomial Freiman-Ruzsa conjecture
Advances in Mathematics | 2021-10-27 | Paper |
Grid drawings of graphs with constant edge-vertex resolution
Computational Geometry | 2021-09-17 | Paper |
Coloring Delaunay-edges and their generalizations
Computational Geometry | 2021-09-16 | Paper |
Induced and non-induced poset saturation problems
Journal of Combinatorial Theory. Series A | 2021-08-25 | Paper |
Exponential lower bound for Berge-Ramsey problems
Graphs and Combinatorics | 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.
Kybernetika | 2020-12-15 | Paper |
Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
SIAM Journal on Discrete Mathematics | 2020-12-04 | Paper |
| At most 3.55ⁿ stable matchings | 2020-11-02 | Paper |
Adaptive majority problems for restricted query graphs and for weighted sets
Discrete Applied Mathematics | 2020-11-02 | Paper |
Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks
(available as arXiv preprint) | 2020-09-09 | Paper |
An improved constant factor for the unit distance problem
(available as arXiv preprint) | 2020-06-11 | Paper |
Complexity of domination in triangulated plane graphs
Acta Universitatis Sapientiae. Informatica | 2020-05-11 | Paper |
Distribution of colors in Gallai colorings
European Journal of Combinatorics | 2020-04-09 | Paper |
Distribution of colors in Gallai colorings
European Journal of Combinatorics | 2020-04-09 | Paper |
Unlabeled compression schemes exceeding the VC-dimension
Discrete Applied Mathematics | 2020-04-01 | Paper |
Query complexity and the polynomial Freiman-Ruzsa conjecture
(available as arXiv preprint) | 2020-03-10 | Paper |
Tur\'an problems for Edge-ordered graphs
(available as arXiv preprint) | 2020-01-03 | Paper |
Radon numbers grow linearly
(available as arXiv preprint) | 2019-12-04 | Paper |
Proper coloring of geometric hypergraphs
Discrete & Computational Geometry | 2019-09-11 | Paper |
Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings
European Journal of Combinatorics | 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
(available as arXiv preprint) | 2018-12-10 | Paper |
| Weak embeddings of posets to the Boolean lattice | 2018-12-10 | Paper |
Proper coloring of geometric hypergraphs
(available as arXiv preprint) | 2018-08-13 | Paper |
| Acyclic orientations with degree constraints | 2018-06-09 | Paper |
All or Nothing Caching Games with Bounded Queries
International Game Theory Review | 2018-03-28 | Paper |
Regular families of forests, antichains and duality pairs of relational structures
Combinatorica | 2018-02-12 | Paper |
Regular families of forests, antichains and duality pairs of relational structures
Combinatorica | 2018-02-12 | Paper |
Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
| Bin packing via discrepancy of permutations | 2017-09-29 | Paper |
Search for the end of a path in the \(\cdot\)-dimensional grid and in other graphs
Ars Mathematica Contemporanea | 2017-09-14 | Paper |
Unified Hanani-Tutte theorem
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Unified Hanani-Tutte theorem
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
More on decomposing coverings by octants
(available as arXiv preprint) | 2017-03-30 | Paper |
Finding a non-minority ball with majority answers
Discrete Applied Mathematics | 2017-01-23 | Paper |
Online and quasi-online colorings of wedges and intervals
Order | 2016-12-16 | Paper |
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
On the tree search problem with non-uniform costs
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Unsplittable coverings in the plane
Lecture Notes in Computer Science | 2016-10-21 | Paper |
| Finding a majority ball with majority answers | 2016-10-14 | Paper |
Finding a majority ball with majority answers
(available as arXiv preprint) | 2016-10-14 | Paper |
Unsplittable coverings in the plane
Advances in Mathematics | 2016-09-30 | Paper |
On the tree search problem with non-uniform costs
Theoretical Computer Science | 2016-09-01 | Paper |
Topological orderings of weighted directed acyclic graphs
Information Processing Letters | 2016-05-18 | Paper |
Topological orderings of weighted directed acyclic graphs
Information Processing Letters | 2016-05-18 | Paper |
Clustered planarity testing revisited
The Electronic Journal of Combinatorics | 2015-11-26 | Paper |
| Monochromatic even cycles | 2015-08-05 | Paper |
Survey on decomposition of multiple coverings
Bolyai Society Mathematical Studies | 2015-06-24 | Paper |
Partitioning to three matchings of given size is NP-complete for bipartite graphs
Acta Universitatis Sapientiae. Informatica | 2015-02-05 | Paper |
Clustered planarity testing revisited
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Bin packing via discrepancy of permutations
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Advantage in the discrete Voronoi game
Journal of Graph Algorithms and Applications | 2014-11-13 | Paper |
Online and quasi-online colorings of wedges and intervals
Lecture Notes in Computer Science | 2014-11-04 | Paper |
Online and quasi-online colorings of wedges and intervals
Lecture Notes in Computer Science | 2014-11-04 | Paper |
Convex polygons are self-coverable
Discrete & Computational Geometry | 2014-09-12 | Paper |
Domination in transitive colorings of tournaments
Journal of Combinatorial Theory. Series B | 2014-08-29 | Paper |
scientific article; zbMATH DE number 6315784 (Why is no real title available?)
(available as arXiv preprint) | 2014-07-09 | Paper |
| Majority and plurality problems | 2014-06-11 | Paper |
| Testing additive integrality gaps | 2014-05-22 | Paper |
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Octants are cover-decomposable into many coverings
Computational Geometry | 2014-04-09 | Paper |
Consistent digital line segments
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Testing additive integrality gaps
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
| Digitalizing line segments | 2013-11-01 | Paper |
| Octants are cover decomposable | 2013-11-01 | Paper |
Octants are cover decomposable
(available as arXiv preprint) | 2013-11-01 | Paper |
Saturating Sperner families
Graphs and Combinatorics | 2013-09-26 | Paper |
Drawing planar graphs of bounded degree with few slopes
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
Almost cross-intersecting and almost cross-Sperner pairs of families of sets
Graphs and Combinatorics | 2013-06-26 | Paper |
Majority and plurality problems
Discrete Applied Mathematics | 2013-04-18 | Paper |
Density-based group testing
Information Theory, Combinatorics, and Search Theory | 2013-04-09 | Paper |
Vectors in a box
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
On families of weakly cross-intersecting set-pairs
Fundamenta Informaticae | 2012-07-11 | Paper |
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Lower bounds on the obstacle number of graphs
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Lower bounds on the obstacle number of graphs
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Consistent digital line segments
Discrete & Computational Geometry | 2012-05-22 | Paper |
Octants are cover-decomposable
Discrete & Computational Geometry | 2012-04-04 | Paper |
Drawing Cubic Graphs with the Four Basic Slopes
Graph Drawing | 2012-03-09 | Paper |
| scientific article; zbMATH DE number 5990525 (Why is no real title available?) | 2011-12-19 | Paper |
Drawing planar graphs of bounded degree with few slopes
Lecture Notes in Computer Science | 2011-02-11 | Paper |
Asymptotically optimal pairing strategy for tic-tac-toe with numerous directions
The Electronic Journal of Combinatorics | 2010-12-16 | Paper |
Asymptotically optimal pairing strategy for tic-tac-toe with numerous directions
The Electronic Journal of Combinatorics | 2010-12-16 | Paper |
Asymptotically optimal pairing strategy for tic-tac-toe with numerous directions
The Electronic Journal of Combinatorics | 2010-12-16 | Paper |
Indecomposable coverings with concave polygons
Discrete & Computational Geometry | 2010-11-08 | Paper |
Permutations, hyperplanes and polynomials over finite fields
Finite Fields and their Applications | 2010-10-11 | Paper |
Finding the maximum and minimum elements with one lie
Discrete Applied Mathematics | 2010-10-11 | Paper |
| Decomposition of Geometric Set Systems and Graphs | 2010-09-23 | Paper |
Convex polygons are cover-decomposable
Discrete & Computational Geometry | 2010-04-12 | Paper |
Combinatorial necklace splitting
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Combinatorial necklace splitting
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Cubic graphs have bounded slope parameter
Journal of Graph Algorithms and Applications | 2010-02-04 | Paper |
Polychromatic colorings of arbitrary rectangular partitions
Discrete Mathematics | 2009-12-15 | Paper |
| Deciding soccer scores and partial orientations of graphs | 2009-06-02 | Paper |
Cubic Graphs Have Bounded Slope Parameter
Graph Drawing | 2009-03-03 | Paper |
Drawing cubic graphs with at most five slopes
Computational Geometry | 2008-04-28 | Paper |
Drawing Cubic Graphs with at Most Five Slopes
Graph Drawing | 2007-08-28 | Paper |
Bounded-degree graphs can have arbitrarily large slope numbers
The Electronic Journal of Combinatorics | 2006-01-17 | Paper |
Bounded-degree graphs can have arbitrarily large slope numbers
The Electronic Journal of Combinatorics | 2006-01-17 | Paper |
Partitioned Matching Games for International Kidney Exchange
(available as arXiv preprint) | N/A | Paper |
Odd-Sunflowers
(available as arXiv preprint) | N/A | Paper |
