Dömötör Pálvölgyi

From MaRDI portal
Person:284346

Available identifiers

zbMath Open palvolgyi.domotorWikidataQ102367505 ScholiaQ102367505MaRDI QIDQ284346

List of research outcomes





PublicationDate of PublicationType
Orientation of convex sets2025-01-27Paper
Query complexity of Boolean functions on the middle slice of the cube2025-01-06Paper
Note on polychromatic coloring of hereditary hypergraph families2024-12-09Paper
Coloring hypergraphs defined by stabbed pseudo-disks and \(ABAB\)-free hypergraphs2024-10-18Paper
Adaptive majority problems for restricted query graphs and for weighted sets2024-10-18Paper
Edge ordered Turán problems2024-10-18Paper
On tangencies among planar curves with an application to coloring L-shapes2024-09-30Paper
On tangencies among planar curves with an application to coloring L-shapes2024-09-13Paper
Odd-sunflowers2024-05-24Paper
k-dimensional transversals for balls2023-11-27Paper
On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory2023-11-13Paper
Almost-monochromatic sets and the chromatic number of the plane2023-11-02Paper
A Faster Algorithm for Finding Tarski Fixed Points2023-10-31Paper
Almost-monochromatic sets and the chromatic number of the plane2023-10-12Paper
The double Hall property and cycle covers in bipartite graphs2023-10-04Paper
The number of tangencies between two families of curves2023-10-04Paper
Query complexity of Boolean functions on the middle slice of the cube2023-09-24Paper
Note on polychromatic coloring of hereditary hypergraph families2023-09-08Paper
Colouring bottomless rectangles and arborescences2023-07-31Paper
Projective and external saturation problem for posets2023-06-17Paper
Turán problems for edge-ordered graphs2023-03-23Paper
Exchange properties of finite set-systems2022-08-31Paper
On the number of hyperedges in the hypergraph of lines and pseudo-discs2022-08-04Paper
Orientation of good covers2022-06-03Paper
Radon numbers grow linearly2022-06-03Paper
Orientation of convex sets2022-06-03Paper
An improved constant factor for the unit distance problem2022-05-09Paper
Three-chromatic geometric hypergraphs2021-12-03Paper
Query complexity and the polynomial Freiman-Ruzsa conjecture2021-10-27Paper
Grid drawings of graphs with constant edge-vertex resolution2021-09-17Paper
Coloring Delaunay-edges and their generalizations2021-09-16Paper
Induced and non-induced poset saturation problems2021-08-25Paper
Exponential lower bound for Berge-Ramsey problems2021-07-28Paper
On tangencies among planar curves with an application to coloring L-shapes2021-03-04Paper
The range of non-linear natural polynomials cannot be context-free.2020-12-15Paper
Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs2020-12-04Paper
Adaptive majority problems for restricted query graphs and for weighted sets2020-11-02Paper
At most $3.55^n$ stable matchings2020-11-02Paper
Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks2020-09-09Paper
An improved constant factor for the unit distance problem2020-06-11Paper
Complexity of domination in triangulated plane graphs2020-05-11Paper
Distribution of colors in Gallai colorings2020-04-09Paper
Unlabeled compression schemes exceeding the VC-dimension2020-04-01Paper
Query complexity and the polynomial Freiman-Ruzsa conjecture2020-03-10Paper
Tur\'an problems for Edge-ordered graphs2020-01-03Paper
Radon numbers grow linearly2019-12-04Paper
Proper coloring of geometric hypergraphs2019-09-11Paper
Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings2019-08-30Paper
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes2019-02-27Paper
Weak embeddings of posets to the Boolean lattice2018-12-10Paper
Proper coloring of geometric hypergraphs2018-08-13Paper
Acyclic orientations with degree constraints2018-06-09Paper
All or Nothing Caching Games with Bounded Queries2018-03-28Paper
Regular families of forests, antichains and duality pairs of relational structures2018-02-12Paper
Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems2017-10-10Paper
Bin packing via discrepancy of permutations2017-09-29Paper
Search for the end of a path in the \(\cdot\)-dimensional grid and in other graphs2017-09-14Paper
Unified Hanani-Tutte theorem2017-09-08Paper
More on decomposing coverings by octants2017-03-30Paper
Finding a non-minority ball with majority answers2017-01-23Paper
Online and quasi-online colorings of wedges and intervals2016-12-16Paper
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes2016-10-21Paper
Unsplittable coverings in the plane2016-10-21Paper
On the tree search problem with non-uniform costs2016-10-21Paper
Finding a majority ball with majority answers2016-10-14Paper
Unsplittable coverings in the plane2016-09-30Paper
On the tree search problem with non-uniform costs2016-09-01Paper
Topological orderings of weighted directed acyclic graphs2016-05-18Paper
Clustered planarity testing revisited2015-11-26Paper
Monochromatic even cycles2015-08-05Paper
Survey on decomposition of multiple coverings2015-06-24Paper
Partitioning to three matchings of given size is NP-complete for bipartite graphs2015-02-05Paper
Clustered planarity testing revisited2015-01-07Paper
Bin packing via discrepancy of permutations2014-12-05Paper
Advantage in the discrete Voronoi game2014-11-13Paper
Online and quasi-online colorings of wedges and intervals2014-11-04Paper
Convex polygons are self-coverable2014-09-12Paper
Domination in transitive colorings of tournaments2014-08-29Paper
https://portal.mardi4nfdi.de/entity/Q51674532014-07-09Paper
Majority and plurality problems2014-06-11Paper
Testing additive integrality gaps2014-05-22Paper
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs2014-04-10Paper
Octants are cover-decomposable into many coverings2014-04-09Paper
Consistent digital line segments2014-04-03Paper
Testing additive integrality gaps2013-11-11Paper
Digitalizing line segments2013-11-01Paper
Octants are cover decomposable2013-11-01Paper
Drawing planar graphs of bounded degree with few slopes2013-09-26Paper
Saturating Sperner families2013-09-26Paper
Almost cross-intersecting and almost cross-Sperner pairs of families of sets2013-06-26Paper
Majority and plurality problems2013-04-18Paper
Density-based group testing2013-04-09Paper
Vectors in a box2012-10-15Paper
On families of weakly cross-intersecting set-pairs2012-07-11Paper
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs2012-06-15Paper
Lower bounds on the obstacle number of graphs2012-06-12Paper
Consistent digital line segments2012-05-22Paper
Octants are cover-decomposable2012-04-04Paper
Drawing Cubic Graphs with the Four Basic Slopes2012-03-09Paper
https://portal.mardi4nfdi.de/entity/Q31060422011-12-19Paper
Drawing planar graphs of bounded degree with few slopes2011-02-11Paper
Asymptotically optimal pairing strategy for tic-tac-toe with numerous directions2010-12-16Paper
Indecomposable coverings with concave polygons2010-11-08Paper
Permutations, hyperplanes and polynomials over finite fields2010-10-11Paper
Finding the maximum and minimum elements with one lie2010-10-11Paper
Decomposition of Geometric Set Systems and Graphs2010-09-23Paper
Convex polygons are cover-decomposable2010-04-12Paper
Combinatorial necklace splitting2010-03-26Paper
Cubic graphs have bounded slope parameter2010-02-04Paper
Polychromatic colorings of arbitrary rectangular partitions2009-12-15Paper
Deciding soccer scores and partial orientations of graphs2009-06-02Paper
Cubic Graphs Have Bounded Slope Parameter2009-03-03Paper
Drawing cubic graphs with at most five slopes2008-04-28Paper
Drawing Cubic Graphs with at Most Five Slopes2007-08-28Paper
Bounded-degree graphs can have arbitrarily large slope numbers2006-01-17Paper
Partitioned Matching Games for International Kidney ExchangeN/APaper
Odd-SunflowersN/APaper

Research outcomes over time

This page was built for person: Dömötör Pálvölgyi