2023
On graphs that contain exactly <i>k</i> copies of a subgraph, and a related problem in search theory.
Discret. Appl. Math., December, 2023
Colouring bottomless rectangles and arborescences.
Comput. Geom., December, 2023
Almost-Monochromatic Sets and the Chromatic Number of the Plane.
Discret. Comput. Geom., October, 2023
The Number of Tangencies Between Two Families of Curves.
Comb., October, 2023
Turán problems for edge-ordered graphs.
J. Comb. Theory, Ser. B, May, 2023
k-dimensional transversals for balls.
CoRR, 2023
Query complexity of Boolean functions on the middle slice of the cube.
CoRR, 2023
Note on polychromatic coloring of hereditary hypergraph families.
CoRR, 2023
Partitioned Matching Games for International Kidney Exchange.
CoRR, 2023
2022
Realizing an m-Uniform Four-Chromatic Hypergraph with Disks.
Comb., December, 2022
Exchange Properties of Finite Set-Systems.
SIAM J. Discret. Math., September, 2022
A Faster Algorithm for Finding Tarski Fixed Points.
ACM Trans. Algorithms, 2022
Radon Numbers Grow Linearly.
Discret. Comput. Geom., 2022
On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs.
Electron. J. Comb., 2022
Three-Chromatic Geometric Hypergraphs.
Proceedings of the 38th International Symposium on Computational Geometry, 2022
2021
On Communication Complexity of Fixed Point Computation.
ACM Trans. Economics and Comput., 2021
Induced and non-induced poset saturation problems.
J. Comb. Theory, Ser. A, 2021
Exponential Lower Bound for Berge-Ramsey Problems.
Graphs Comb., 2021
Adaptive majority problems for restricted query graphs and for weighted sets.
,
,
,
,
,
,
,
,
,
,
Discret. Appl. Math., 2021
Grid drawings of graphs with constant edge-vertex resolution.
Comput. Geom., 2021
Coloring Delaunay-edges and their generalizations.
Comput. Geom., 2021
At most 3.55<sup>n</sup> stable matchings.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
2020
Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs.
SIAM J. Discret. Math., 2020
The range of non-linear natural polynomials cannot be context-free.
Kybernetika, 2020
Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks.
J. Comput. Geom., 2020
Distribution of colors in Gallai colorings.
Eur. J. Comb., 2020
Unlabeled compression schemes exceeding the VC-dimension.
Discret. Appl. Math., 2020
At most 4.47<sup>n</sup> stable matchings.
CoRR, 2020
An improved constant factor for the unit distance problem.
CoRR, 2020
Realizing m-uniform four-chromatic hypergraphs with disks.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
2019
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes.
J. Comput. Geom., 2019
Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings.
Eur. J. Comb., 2019
Proper Coloring of Geometric Hypergraphs.
Discret. Comput. Geom., 2019
Generalized Matching Games for International Kidney Exchange.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019
2018
All or Nothing Caching Games with Bounded Queries.
IGTR, 2018
Weak embeddings of posets to the Boolean lattice.
Discret. Math. Theor. Comput. Sci., 2018
Plane drawings of the generalized Delaunay-graphs for pseudo-disks.
CoRR, 2018
Acyclic orientations with degree constraints.
CoRR, 2018
2017
Finding a non-minority ball with majority answers.
Discret. Appl. Math., 2017
Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems.
Comb. Probab. Comput., 2017
Complexity of Domination in Triangulated Plane Graphs.
CoRR, 2017
Unified Hanani-Tutte Theorem.
Electron. J. Comb., 2017
Regular families of forests, antichains and duality pairs of relational structures.
Comb., 2017
Search for the end of a path in the d-dimensional grid and in other graphs.
Ars Math. Contemp., 2017
2016
On the tree search problem with non-uniform costs.
Theor. Comput. Sci., 2016
Online and Quasi-online Colorings of Wedges and Intervals.
Order, 2016
Topological orderings of weighted directed acyclic graphs.
Inf. Process. Lett., 2016
2015
More on decomposing coverings by octants.
J. Comput. Geom., 2015
Finding a majority ball with majority answers.
Electron. Notes Discret. Math., 2015
Clustered Planarity Testing Revisited.
Electron. J. Comb., 2015
Unsplittable Coverings in the Plane.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015
2014
Advantage in the discrete Voronoi game.
J. Graph Algorithms Appl., 2014
Domination in transitive colorings of tournaments.
J. Comb. Theory, Ser. B, 2014
Convex Polygons are Self-Coverable.
Discret. Comput. Geom., 2014
Octants are cover-decomposable into many coverings.
Comput. Geom., 2014
2013
Bin Packing via Discrepancy of Permutations.
ACM Trans. Algorithms, 2013
Drawing Planar Graphs of Bounded Degree with Few Slopes.
SIAM J. Discret. Math., 2013
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs.
SIAM J. Discret. Math., 2013
Testing additive integrality gaps.
Math. Program., 2013
Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets.
Graphs Comb., 2013
Saturating Sperner Families.
Graphs Comb., 2013
Majority and plurality problems.
Discret. Appl. Math., 2013
Efficient c-planarity testing algebraically
CoRR, 2013
Indecomposable coverings with unit discs.
CoRR, 2013
Density-Based Group Testing.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013
2012
On Families of Weakly Cross-intersecting Set-pairs.
Fundam. Informaticae, 2012
Consistent Digital Line Segments.
Discret. Comput. Geom., 2012
Search for the end of a path in the d-dimensional grid and in other graphs
CoRR, 2012
On infinite-finite tree-duality pairs of relational structures
CoRR, 2012
Lower Bounds on the Obstacle Number of Graphs.
Electron. J. Comb., 2012
Monochromatic even cycles.
Contributions Discret. Math., 2012
2011
Octants are Cover Decomposable.
Electron. Notes Discret. Math., 2011
Digitalizing line segments.
Electron. Notes Discret. Math., 2011
Lower bounds for finding the maximum and minimum elements with k lies
CoRR, 2011
Drawing Cubic Graphs with the Four Basic Slopes.
Proceedings of the Graph Drawing - 19th International Symposium, 2011
2010
Cubic graphs have bounded slope parameter.
J. Graph Algorithms Appl., 2010
Permutations, hyperplanes and polynomials over finite fields.
Finite Fields Their Appl., 2010
Polychromatic colorings of arbitrary rectangular partitions.
Discret. Math., 2010
Convex Polygons are Cover-Decomposable.
Discret. Comput. Geom., 2010
Indecomposable Coverings with Concave Polygons.
Discret. Comput. Geom., 2010
Finding the maximum and minimum elements with one lie.
Discret. Appl. Math., 2010
Decomposition of Geometric Set Systems and Graphs
CoRR, 2010
Partitionability to two trees is NP-complete
CoRR, 2010
Asymptotically Optimal Pairing Strategy for Tic-Tac-Toe with Numerous Directions.
Electron. J. Comb., 2010
2009
Combinatorial Necklace Splitting.
Electron. J. Comb., 2009
2D-TUCKER Is PPAD-Complete.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009
2008
Drawing cubic graphs with at most five slopes.
Comput. Geom., 2008
2006
Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers.
Electron. J. Comb., 2006
