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

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 69

Top Venues

CoRR

Discret. Comput. Geom.

Discret. Appl. Math.

SoCG

Publications

János Barát, Andrzej Grzesik, Attila Jung, Zoltán Lóránt Nagy, Dömötör Pálvölgyi
The double Hall property and cycle covers in bipartite graphs. Discret. Math. 347 (9) (2024)
Peter Frankl, János Pach, Dömötör Pálvölgyi
Odd-sunflowers. J. Comb. Theory, Ser. A 206 (2024)
Balázs Keszegh, Dömötör Pálvölgyi
On dual-ABAB-free and related hypergraphs. CoRR (2024)
Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. CoRR (2024)
Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi
On tangencies among planar curves with an application to coloring L-shapes. Eur. J. Comb. 121 (2024)
Attila Jung, Dömötör Pálvölgyi
k-dimensional transversals for balls. CoRR (2023)
Dániel Gerbner, Balázs Keszegh, Dániel T. Nagy, Kartal Nagy, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener
Query complexity of Boolean functions on the middle slice of the cube. CoRR (2023)
Márton Benedek, Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma
Partitioned Matching Games for International Kidney Exchange. CoRR (2023)
Nóra Frankl, Tamás Hubai, Dömötör Pálvölgyi
Almost-Monochromatic Sets and the Chromatic Number of the Plane. Discret. Comput. Geom. 70 (3) (2023)
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. J. Comb. Theory, Ser. B 160 (2023)
Balázs Keszegh, Dömötör Pálvölgyi
The Number of Tangencies Between Two Families of Curves. Comb. 43 (5) (2023)
Jean Cardinal, Kolja Knauer, Piotr Micek, Dömötör Pálvölgyi, Torsten Ueckerdt, Narmada Varadarajan
Colouring bottomless rectangles and arborescences. Comput. Geom. 115 (2023)
Dömötör Pálvölgyi
Note on polychromatic coloring of hereditary hypergraph families. CoRR (2023)
Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341 (2023)
Dömötör Pálvölgyi
Radon Numbers Grow Linearly. Discret. Comput. Geom. 68 (1) (2022)
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. Electron. J. Comb. 29 (3) (2022)
Peter Frankl, János Pach, Dömötör Pálvölgyi
Exchange Properties of Finite Set-Systems. SIAM J. Discret. Math. 36 (3) (2022)
Gábor Damásdi, Dömötör Pálvölgyi
Realizing an m-Uniform Four-Chromatic Hypergraph with Disks. Comb. 42 (6) (2022)
John Fearnley, Dömötör Pálvölgyi, Rahul Savani
A Faster Algorithm for Finding Tarski Fixed Points. ACM Trans. Algorithms 18 (3) (2022)
Gábor Damásdi, Dömötör Pálvölgyi
Three-Chromatic Geometric Hypergraphs. SoCG (2022)
Cory Palmer, Dömötör Pálvölgyi
stable matchings. FOCS (2022)
Dömötör Pálvölgyi
Exponential Lower Bound for Berge-Ramsey Problems. Graphs Comb. 37 (4) (2021)
Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
Adaptive majority problems for restricted query graphs and for weighted sets. Discret. Appl. Math. 288 (2021)
Balázs Keszegh, Dömötör Pálvölgyi
The number of tangencies between two families of curves. CoRR (2021)
Anat Ganor, Karthik C. S., Dömötör Pálvölgyi
On Communication Complexity of Fixed Point Computation. ACM Trans. Economics and Comput. 9 (4) (2021)
Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi
Coloring Delaunay-edges and their generalizations. Comput. Geom. 96 (2021)
Gábor Damásdi, Dömötör Pálvölgyi
Three-chromatic geometric hypergraphs. CoRR (2021)
Cory Palmer, Dömötör Pálvölgyi
stable matchings. FOCS (2021)
Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Dömötör Pálvölgyi, Antonios Symvonis, Leonidas Theocharous
Grid drawings of graphs with constant edge-vertex resolution. Comput. Geom. 98 (2021)
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. J. Comb. Theory, Ser. A 184 (2021)
András Gyárfás, Dömötör Pálvölgyi, Balázs Patkós, Matthew Wales
Distribution of colors in Gallai colorings. Eur. J. Comb. 86 (2020)
Dömötör Pálvölgyi
The range of non-linear natural polynomials cannot be context-free. Kybernetika 56 (4) (2020)
Gábor Damásdi, Dömötör Pálvölgyi
Realizing an m-uniform four-chromatic hypergraph with disks. CoRR (2020)
Cory Palmer, Dömötör Pálvölgyi
stable matchings. CoRR (2020)
Dömötör Pálvölgyi, Gábor Tardos
Unlabeled compression schemes exceeding the VC-dimension. Discret. Appl. Math. 276 (2020)
Nóra Frankl, Tamás Hubai, Dömötör Pálvölgyi
Almost-Monochromatic Sets and the Chromatic Number of the Plane. SoCG (2020)
Péter Ágoston, Dömötör Pálvölgyi
An improved constant factor for the unit distance problem. CoRR (2020)
Gábor Damásdi, Dömötör Pálvölgyi
Realizing m-uniform four-chromatic hypergraphs with disks. CCCG (2020)
Dömötör Pálvölgyi
Radon Numbers Grow Linearly. SoCG (2020)
Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi
Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs. SIAM J. Discret. Math. 34 (4) (2020)
Balázs Keszegh, Dömötör Pálvölgyi
Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks. J. Comput. Geom. 11 (1) (2020)
Benjamin Gunby, Dömötör Pálvölgyi
Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings. Eur. J. Comb. 82 (2019)
Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. CoRR (2019)
Dömötör Pálvölgyi
The range of non-linear natural polynomials cannot be context-free. CoRR (2019)
Balázs Keszegh, Dömötör Pálvölgyi
An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes. J. Comput. Geom. 10 (1) (2019)
Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma
Generalized Matching Games for International Kidney Exchange. AAMAS (2019)
Nóra Frankl, Tamás Hubai, Dömötör Pálvölgyi
Almost-monochromatic sets and the chromatic number of the plane. CoRR (2019)
Balázs Keszegh, Dömötör Pálvölgyi
Proper Coloring of Geometric Hypergraphs. Discret. Comput. Geom. 62 (3) (2019)
Anat Ganor, Karthik C. S., Dömötör Pálvölgyi
On Communication Complexity of Fixed Point Computation. CoRR (2019)
Zoltán Király, Dömötör Pálvölgyi
Acyclic orientations with degree constraints. CoRR (2018)
Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi
Coloring Delaunay-Edges and their Generalizations. CoRR (2018)
Dömötör Pálvölgyi, Gábor Tardos
Unlabeled Compression Schemes Exceeding the VC-dimension. CoRR (2018)
Dömötör Pálvölgyi
Weak embeddings of posets to the Boolean lattice. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Dömötör Pálvölgyi
All or Nothing Caching Games with Bounded Queries. IGTR 20 (1) (2018)
Balázs Keszegh, Dömötör Pálvölgyi
Plane drawings of the generalized Delaunay-graphs for pseudo-disks. CoRR (2018)
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
Finding a non-minority ball with majority answers. Discret. Appl. Math. 219 (2017)
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Günter Rote, Gábor Wiener
Search for the end of a path in the d-dimensional grid and in other graphs. Ars Math. Contemp. 12 (2) (2017)
Balázs Keszegh, Dömötör Pálvölgyi
Proper Coloring of Geometric Hypergraphs. SoCG (2017)
Dömötör Pálvölgyi
Complexity of Domination in Triangulated Plane Graphs. CoRR (2017)
Dömötör Pálvölgyi
All or Nothing Caching Games with Bounded Queries. CoRR (2017)
Abhishek Methuku, Dömötör Pálvölgyi
Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems. Comb. Probab. Comput. 26 (4) (2017)
Radoslav Fulek, Jan Kyncl, Dömötör Pálvölgyi
Unified Hanani-Tutte Theorem. Electron. J. Comb. 24 (3) (2017)
Péter L. Erdös, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos
Regular families of forests, antichains and duality pairs of relational structures. Comb. 37 (4) (2017)
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla
On the tree search problem with non-uniform costs. Theor. Comput. Sci. 647 (2016)
Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi
Online and Quasi-online Colorings of Wedges and Intervals. Order 33 (3) (2016)
Balázs Keszegh, Dömötör Pálvölgyi
Proper Coloring of Geometric Hypergraphs. CoRR (2016)
Radoslav Fulek, Jan Kyncl, Dömötör Pálvölgyi
Unified Hanani-Tutte theorem. CoRR (2016)
Dániel Gerbner, Balázs Keszegh, Cory Palmer, Dömötör Pálvölgyi
Topological orderings of weighted directed acyclic graphs. Inf. Process. Lett. 116 (9) (2016)
Dömötör Pálvölgyi
Weak embeddings of posets to the Boolean lattice. CoRR (2016)
János Pach, Dömötör Pálvölgyi
Unsplittable Coverings in the Plane. WG (2015)
Máté Vizer, Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener
Finding a majority ball with majority answers. Electron. Notes Discret. Math. 49 (2015)
Balázs Keszegh, Dömötör Pálvölgyi
An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes. WG (2015)
Balázs Keszegh, Dömötör Pálvölgyi
More on decomposing coverings by octants. J. Comput. Geom. 6 (1) (2015)
Balázs Keszegh, Dömötör Pálvölgyi
More on Decomposing Coverings by Octants. CoRR (2015)
Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi
Clustered Planarity Testing Revisited. Electron. J. Comb. 22 (4) (2015)
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla
On the Tree Search Problem with Non-uniform Costs. WG (2015)
Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote
Advantage in the discrete Voronoi game. J. Graph Algorithms Appl. 18 (3) (2014)
Ferdinando Cicalese, Balázs Keszegh, Bernard Lidický, Dömötör Pálvölgyi, Tomás Valla
On the Tree Search Problem with Non-uniform Costs. CoRR (2014)
Balázs Keszegh, Dömötör Pálvölgyi
Octants are cover-decomposable into many coverings. Comput. Geom. 47 (5) (2014)
Balázs Keszegh, Dömötör Pálvölgyi
Convex Polygons are Self-Coverable. Discret. Comput. Geom. 51 (4) (2014)
Dömötör Pálvölgyi, András Gyárfás
Domination in transitive colorings of tournaments. J. Comb. Theory, Ser. B 107 (2014)
Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi
Clustered Planarity Testing Revisited. Graph Drawing (2014)
Radoslav Fulek, Jan Kyncl, Igor Malinovic, Dömötör Pálvölgyi
Efficient c-planarity testing algebraically CoRR (2013)
Friedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi, Gennady Shmonin
Testing additive integrality gaps. Math. Program. 141 (1-2) (2013)
Balázs Keszegh, Dömötör Pálvölgyi
Convex Polygons are Self-Coverable. CoRR (2013)
Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós
Majority and plurality problems. Discret. Appl. Math. 161 (6) (2013)
Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi
Online and Quasi-online Colorings of Wedges and Intervals. SOFSEM (2013)
Dömötör Pálvölgyi
Indecomposable coverings with unit discs. CoRR (2013)
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener
Density-Based Group Testing. Information Theory, Combinatorics, and Search Theory (2013)
Balázs Keszegh, János Pach, Dömötör Pálvölgyi
Drawing Planar Graphs of Bounded Degree with Few Slopes. SIAM J. Discret. Math. 27 (2) (2013)
Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote
Advantage in the discrete Voronoi game CoRR (2013)
Dömötör Pálvölgyi, András Gyárfás
Domination in transitive colorings of tournaments CoRR (2013)
Dániel Gerbner, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós, Vajk Szécsi
Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets. Graphs Comb. 29 (3) (2013)
Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs. SIAM J. Discret. Math. 27 (4) (2013)
Friedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß
Bin Packing via Discrepancy of Permutations. ACM Trans. Algorithms 9 (3) (2013)
Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós
Saturating Sperner Families. Graphs Comb. 29 (5) (2013)
Dániel Gerbner, Gyula O. H. Katona, Dömötör Pálvölgyi, Balázs Patkós
Majority and Plurality Problems CoRR (2012)
Kevin Buchin, Jirí Matousek, Robin A. Moser, Dömötör Pálvölgyi
Vectors in a box. Math. Program. 135 (1-2) (2012)
Péter L. Erdös, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos
On infinite-finite tree-duality pairs of relational structures CoRR (2012)
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener
Density-based group testing CoRR (2012)

Dömötör Pálvölgyi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

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