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, Discrete and Computational Geometry 64 (2020), 942-964; Proceedings of SoCG 2018, LIPIcs 99 (2018), 52:1-52:15. [journal]

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]

Nóra Frankl, Tamás Hubai and Dömötör Pálvölgyi. A sík kromatikus száma, Elektronikus Matematikai Lapok, 2018 szeptember. [Érintõ]

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, Computational Geometry: Theory and Applications 96 (2021), 101745 [arxiv]

Balázs Keszegh and Dömötör Pálvölgyi. Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks, Journal of Computational Geometry 11(1) (2020), 354-370. [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, SIAM J. on Discrete Math 34(4) (2020), 2250-2269.; Proceedings of EuroComb 2019, Acta Mathematica Universitatis Comenianae 88(3) (2019), 363-370. [arxiv]

Dömötör Pálvölgyi and Gábor Tardos. Unlabeled Compression Schemes Exceeding the VC-dimension, Discrete Applied Mathematics, 276:102-107, 2020. [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| Journal]

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

Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniel Paulusma. Generalized Matching Games for International Kidney Exchange. Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), 413-421, 2019. [conference]

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 Proceedings of SoCG 2020. [arxiv| conference]

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, SIAM J. on Discrete Math 35(2) (2021), 915-927. [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, Discrete Mathematics 343(7) (2020), 111886 [arXiv]

B. Keszegh: Two-coloring triples such that in each color class every element is missed at least once, Graphs and Combinatorics 36(6) (2020), 1783-1795. [arXiv]

B. Keszegh, X. Zhu: A note about online nonrepetitive coloring k-trees, Discrete Applied Mathematics 285 (2020), 108-112. [arXiv]

Dömötör Pálvölgyi, Narmada Varadarajan. Colouring bottomless rectangles and arborescences, Proceedings of EuroCG 2020. [arxiv| conference]

Nóra Frankl, Tamás Hubai and Dömötör Pálvölgyi. Almost-monochromatic sets and the chromatic number of the plane. Proceedings of SoCG 2020. [arxiv| conference]

Dániel Gerbner, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Gábor Tardos, Máté Vizer. Turán problems for Edge-ordered graphs. [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, Journal of Combinatorial Theory, Series A, 187 (2021), 105497 [arXiv]

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

Péter Ágoston, Dömötör Pálvölgyi. Improved constant factor for the unit distance problem, Proceedings of EuroCG 2020 [arxiv| conference]

G. Damásdi, D. Gerbner, G.O.H. Katona, B. Keszegh, D. Lenger, A. Methuku, D. T. Nagy, D. Pálvölgyi, B. Patkós, M. Vizer, G. Wiener: Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets, Discrete Applied Mathematics 288 (2021), 235-245., [arXiv| Journal]

E. Ackerman, B. Keszegh, G. Rote: An almost optimal bound on the number of intersections of two simple polygons, Proceedings of SoCG 2020, LIPIcs 164 (2020), 1:1--1:18. [arXiv]

G. Damásdi, B. Keszegh, D. Malec, C. Tompkins, Zh. Wang, O. Zamora: Saturation problems in the Ramsey theory of graphs, posets and point sets, European Journal of Combinatorics 95 (2021), 103321 [arXiv]

Grigory Ivanov, Márton Naszódi, Alexandr Polyanskii: Approximation of the average of some random matrices, Journal of Functional Analysis 279(7) (2020), 18 pp. [doi]

Péter Ágoston. A lower bound on the number of colours needed to nicely colour a sphere, Proceedings of CCCG 2020 [conference]

Gábor Damásdi, Dömötör Pálvölgyi. Realizing an m - uniform four - chromatic hypergraphs with disks, Proceedings of CCCG 2020 [conference]

Gábor Damásdi. Odd wheels are not odd-distance graphs, Proceedings of GD 2020 [conference]

Gábor Damásdi, Viktória Földvári, Márton Naszódi. Colorful helly-type theorems for ellipsoids. [arxiv]

Cory Palmer, Dömötör Pálvölgyi. At most 4.47^n stable matchings. [arxiv]

Rado Fulek, Balázs Keszegh. Saturation problems about forbidden 0-1 submatrices, SIAM J. on Discrete Math 35(3) (2021), 1964-1977. [arxiv]

Gábor Damásdi, Dömötör Pálvölgyi. Realizing an m-uniform four-chromatic hypergraph with disks. Proceedings of CCCG 2020. [arxiv| conference]

John Fearnley, Dömötör Pálvölgyi, Rahul Savani. A faster algorithm for finding Tarski fixed points. [arxiv]

Chaya Keller, Balázs Keszegh, Dömötör Pálvölgyi. On the number of hyperedges in the hypergraph of lines and pseudo-discs, Electronic Journal of Combinatorics, 29(3) (2022), P3.25 1-9. [arxiv]

Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi. On tangencies among planar curves with an application to coloring L-shapes, Proceedings of EuroComb 2021, Trends in Mathematics - Research Perspectives CRM Barcelona Vol.14 (2021), 123-128. [arxiv]

Peter Frankl, János Pach, Dömötör Pálvölgyi. Exchange properties of finite set-systems. [arxiv]

Ádám Fraknói, Dávid Márton, Dániel Simon, Dániel Lenger. On the Rényi-Ulam Game with Restricted Size Queries. [arxiv]

Balázs Keszegh. Discrete Helly-type theorems for pseudohalfplanes, European Journal of Combinatorics 101 (2022), 103469; Proceedings of EuroComb 2021, Trends in Mathematics - Research Perspectives CRM Barcelona Vol.14 (2021), 359-365. [arxiv]

B. Keszegh, D. Pálvölgyi. The number of tangencies between two families of curves [arxiv]

Balázs Keszegh. A new discrete theory of pseudoconvexity [arxiv]

Vladimir Bošković, Balázs Keszegh. Saturation of Ordered Graphs [arxiv]

Balázs Keszegh. Coloring directed hypergraphs. [arxiv]

P. Ágoston, G. Damásdi, B. Keszegh, D. Pálvölgyi. Orientation of convex sets. [arxiv]

P. Ágoston, G. Damásdi, B. Keszegh, D. Pálvölgyi. Orientation of good covers. [arxiv]

See also: mtmt.hu