List of Publications

Balázs Keszegh and Dömötör Pálvölgyi. Proper Coloring of Geometric Hypergraphs, Discrete and Computational Geometry, 62(3), 674-689, 2019 [journal]

Balázs Keszegh. Coloring intersection hypergraphs of pseudo-disks, SoCG 2018, 52:1-52:15 [proceedings]

Dömötör Pálvölgyi. Weak embeddings of posets to the Boolean lattice, Discrete Mathematics and Theoretical Computer Science, 20(1):1-10, 2018 [journal]

Benjamin Gunby and Dömötör Pálvölgyi. Asymptotics of Pattern Avoidance in the Klazar Set Partition and Permutation-Tuple Settings, European Journal of Combinatorics, 82:1-21, 2019 [journal]

Dömötör Pálvölgyi. Complexity of Domination in Triangulated Plane Graphs, Acta Univ. Sapientiae Informatica, 11(2):174-183, 2019 [journal]

Zoltán Király and Dömötör Pálvölgyi. Acyclic orientations with degree constraints [arxiv]

Eyal Ackerman, Balázs Keszegh and Dömötör Pálvölgyi. Coloring Delaunay-Edges and their Generalizations [arxiv]

Balázs Keszegh and Dömötör Pálvölgyi. Plane drawings of the generalized Delaunay-graphs for pseudo-disks [arxiv]

Eyal Ackerman, Balázs Keszegh and Dömötör Pálvölgyi. Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs [arxiv]

Dömötör Pálvölgyi and Gábor Tardos. Unlabeled Compression Schemes Exceeding the VC-dimension, Discrete Applied Mathematics, to appear [journal]

Balázs Keszegh and Dömötör Pálvölgyi. An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes, Journal of Computational Geometry, 10(1):1-26, 2019 [journal]

Dömötör Pálvölgyi. The range of non-linear natural polynomials cannot be context-free. [arxiv]

András Gyárfás, Dömötör Pálvölgyi, Patkós Balázs and Matthew Wales. Distribution of colors in Gallai colorings. [arxiv], to appear in European Journal of Combinatorics

Gábor Damásdi, Leonardo Martínez-Sandoval, Dániel T. Nagy, Zoltán Lóránt Nagy. Triangle areas determined by arrangements of planar lines. [arxiv]

Dömötör Pálvölgyi. Exponential lower bound for Berge-Ramsey problems. [arxiv]

Anat Ganor, Karthik C. S. and Dömötör Pálvölgyi. On Communication Complexity of Fixed Point Computation. [arxiv]

Dömötör Pálvölgyi. Radon numbers grow linearly [arxiv]

G. Damásdi, S. Felsner, A. Girão, B. Keszegh, D. Lewis, D. T. Nagy, T. Ueckerdt: On Covering Numbers, Young Diagrams, and the Local Dimension of Posets [arXiv]

D. Gerbner, B. Keszegh, A. Methuku, D. T. Nagy, B. Patkós, C. Tompkins, Ch. Xiao: Set systems related to a house allocation problem [arXiv]

B. Keszegh: Two-coloring triples such that in each color class every element is missed at least once [arXiv]

B. Keszegh, X. Zhu: A note about online nonrepetitive coloring k-trees [arXiv]

Balázs Keszegh, Nathan Lemons, Ryan R. Martin, Dömötör Pálvölgyi, Balázs Patkós: Induced and non-induced poset saturation problems [arXiv]

Dmitrii Zhelezov, Dömötör Pálvölgyi: Query complexity and the polynomial Freiman-Ruzsa conjecture [arXiv]

See also: